Initial Commit

Author: gloatoriginal

Design Parking System/Problem.txt

@@ -0,0 +1,23 @@
+Design a parking system for a parking lot. The parking lot has three kinds of parking spaces: big, medium, and small, with a fixed number of slots for each size.
+
+Implement the ParkingSystem class:
+
+ParkingSystem(int big, int medium, int small) Initializes object of the ParkingSystem class. The number of slots for each parking space are given as part of the constructor.
+bool addCar(int carType) Checks whether there is a parking space of carType for the car that wants to get into the parking lot. carType can be of three kinds: big, medium, or small, which are represented by 1, 2, and 3 respectively. A car can only park in a parking space of its carType. If there is no space available, return false, else park the car in that size space and return true.
+
+ 
+
+Example 1:
+
+Input
+["ParkingSystem", "addCar", "addCar", "addCar", "addCar"]
+[[1, 1, 0], [1], [2], [3], [1]]
+Output
+[null, true, true, false, false]
+
+Explanation
+ParkingSystem parkingSystem = new ParkingSystem(1, 1, 0);
+parkingSystem.addCar(1); // return true because there is 1 available slot for a big car
+parkingSystem.addCar(2); // return true because there is 1 available slot for a medium car
+parkingSystem.addCar(3); // return false because there is no available slot for a small car
+parkingSystem.addCar(1); // return false because there is no available slot for a big car. It is already occupied.

Design Parking System/main.php

@@ -0,0 +1,47 @@
+class ParkingSystem {
+    /**
+     * @param Integer $big
+     * @param Integer $medium
+     * @param Integer $small
+     */
+    function __construct($big, $medium, $small) {
+        $this->big_slots = $big;
+        $this->med_slots = $medium;
+        $this->sma_slots = $small;
+        return null;
+    }
+  
+    /**
+     * @param Integer $carType
+     * @return Boolean
+     */
+    function addCar($carType) {
+        switch($carType){
+            case 1:
+                if($this->big_slots<1){ return false; }
+                else{ 
+                    $this->big_slots-=1;
+                    return true;
+                }
+            case 2:
+                if($this->med_slots<1){ return false; }
+                else{ 
+                    $this->med_slots-=1;
+                    return true;
+                }
+            case 3:
+                if($this->sma_slots<1){ return false; }
+                else{ 
+                    $this->sma_slots-=1;
+                    return true;
+                }
+                
+        }
+    }
+}
+
+/**
+ * Your ParkingSystem object will be instantiated and called as such:
+ * $obj = ParkingSystem($big, $medium, $small);
+ * $ret_1 = $obj->addCar($carType);
+ */

How Many Numbers are Smaller than current Number/Problem.txt

@@ -0,0 +1,28 @@
+Given the array nums, for each nums[i] find out how many numbers in the array are smaller than it. That is, for each nums[i] you have to count the number of valid j's such that j != i and nums[j] < nums[i].
+
+Return the answer in an array.
+
+ Example 1:
+
+Input: nums = [8,1,2,2,3]
+Output: [4,0,1,1,3]
+Explanation: 
+For nums[0]=8 there exist four smaller numbers than it (1, 2, 2 and 3). 
+For nums[1]=1 does not exist any smaller number than it.
+For nums[2]=2 there exist one smaller number than it (1). 
+For nums[3]=2 there exist one smaller number than it (1). 
+For nums[4]=3 there exist three smaller numbers than it (1, 2 and 2).
+Example 2:
+
+Input: nums = [6,5,4,8]
+Output: [2,1,0,3]
+Example 3:
+
+Input: nums = [7,7,7,7]
+Output: [0,0,0,0]
+ 
+
+Constraints:
+
+2 <= nums.length <= 500
+0 <= nums[i] <= 100

How Many Numbers are Smaller than current Number/main.php

@@ -0,0 +1,18 @@
+class Solution {
+
+    /**
+     * @param Integer[] $nums
+     * @return Integer[]
+     */
+    function smallerNumbersThanCurrent($nums) {
+        $_arr = array();
+        foreach($nums as &$num){
+            $count = 0;
+            for($i=0; $i<count($nums);$i+=1){
+                if($num > $nums[$i]) { $count+=1; }
+            }
+            $_arr[] = $count;
+        }
+        return $_arr;
+    }
+}

Jewels and Stones/Problem.txt

@@ -0,0 +1,13 @@
+You're given strings jewels representing the types of stones that are jewels, and stones representing the stones you have. Each character in stones is a type of stone you have. You want to know how many of the stones you have are also jewels.
+
+Letters are case sensitive, so "a" is considered a different type of stone from "A".
+
+ Example 1:
+
+Input: jewels = "aA", stones = "aAAbbbb"
+Output: 3
+Example 2:
+
+Input: jewels = "z", stones = "ZZ"
+Output: 0
+ 

Jewels and Stones/main.php

@@ -0,0 +1,21 @@
+class Solution {
+
+    /**
+     * @param String $jewels
+     * @param String $stones
+     * @return Integer
+     */
+    function numJewelsInStones($jewels, $stones) {
+        $count = 0;
+        $jewels = str_split($jewels);
+        $stones = str_split($stones);
+        for($i=0;$i<=count($jewels);$i+=1){
+            for($j=0;$j<count($stones);$j+=1){
+                if($jewels[$i] == $stones[$j]){
+                    $count+=1;
+                }
+            }
+        }
+        return $count;
+    }
+}

Latest Time by Replacing Hidden Digits/Problem.txt

@@ -0,0 +1,20 @@
+You are given a string time in the form of hh:mm, where some of the digits in the string are hidden (represented by ?).
+
+The valid times are those inclusively between 00:00 and 23:59.
+
+Return the latest valid time you can get from time by replacing the hidden digits.
+
+
+Example 1:
+
+Input: time = "2?:?0"
+Output: "23:50"
+Explanation: The latest hour beginning with the digit '2' is 23 and the latest minute ending with the digit '0' is 50.
+Example 2:
+
+Input: time = "0?:3?"
+Output: "09:39"
+Example 3:
+
+Input: time = "1?:22"
+Output: "19:22"

Latest Time by Replacing Hidden Digits/main.php

@@ -0,0 +1,32 @@
+class Solution {
+
+    /**
+     * @param String $time
+     * @return String
+     */
+    function maximumTime($time) {
+        $time=str_split($time);
+        for($i=0; $i<count($time); $i++){
+            if($time[$i] == '?'){
+                echo $i;
+                switch($i){
+                    case 0:
+                        $time[$i] = ($time[$i+1] >= 4) ? 1 : 2;
+                        break;              
+                    case 1:
+                        $time[$i] = ($time[$i-1] == 2) ? 3 : 9;
+                        break;
+                    case 3:
+                        $time[$i] = 5;
+                        break;
+                    case 4:
+                        $time[$i] = 9;
+                        break;
+                }
+
+            }
+            
+        }
+        return implode($time);
+    }
+}

Number of Good Pairs/Problem.txt

@@ -0,0 +1,21 @@
+Given an array of integers nums.
+
+A pair (i,j) is called good if nums[i] == nums[j] and i < j.
+
+Return the number of good pairs.
+
+ Example 1:
+
+Input: nums = [1,2,3,1,1,3]
+Output: 4
+Explanation: There are 4 good pairs (0,3), (0,4), (3,4), (2,5) 0-indexed.
+Example 2:
+
+Input: nums = [1,1,1,1]
+Output: 6
+Explanation: Each pair in the array are good.
+Example 3:
+
+Input: nums = [1,2,3]
+Output: 0
+ 

Number of Good Pairs/main.php

@@ -0,0 +1,19 @@
+class Solution {
+
+    /**
+     * @param Integer[] $nums
+     * @return Integer
+     */
+    function numIdenticalPairs($nums) {
+        $count = 0;
+        for($i = 0; $i < count($nums); $i+=1){
+            for($j=$i+1; $j <= count($nums); $j+=1){
+                if($nums[$j] == $nums[$i]){
+                    $count+=1;
+                }
+            }
+        }
+        //echo $count;
+        return $count;
+    }
+}

Shuffle String/Problem.txt

@@ -0,0 +1,27 @@
+Given a string s and an integer array indices of the same length.
+
+The string s will be shuffled such that the character at the ith position moves to indices[i] in the shuffled string.
+
+Return the shuffled string.
+
+ Input: s = "codeleet", indices = [4,5,6,7,0,2,1,3]
+Output: "leetcode"
+Explanation: As shown, "codeleet" becomes "leetcode" after shuffling.
+Example 2:
+
+Input: s = "abc", indices = [0,1,2]
+Output: "abc"
+Explanation: After shuffling, each character remains in its position.
+Example 3:
+
+Input: s = "aiohn", indices = [3,1,4,2,0]
+Output: "nihao"
+Example 4:
+
+Input: s = "aaiougrt", indices = [4,0,2,6,7,3,1,5]
+Output: "arigatou"
+Example 5:
+
+Input: s = "art", indices = [1,0,2]
+Output: "rat"
+ 

Shuffle String/main.php

@@ -0,0 +1,13 @@
+class Solution{
+    function restoreString($s, $indices) {
+        $s = str_split($s);
+        $str_arr = [];
+        for($i=0; $i<count($indices);$i+=1){
+            $str_arr[$indices[$i]] = $s[$i];
+        }
+        //$str_arr = leetcdoe
+        //why not $str_arr = leetcode?
+        ksort($str_arr);
+        return implode($str_arr);
+    }
+}