leetccode - google phone mock 6

Author: Partho Biswas

README.md

@@ -172,6 +172,9 @@ I have solved quite a number of problems from several topics. See the below tabl
 |61| [731. My Calendar II](https://tinyurl.com/sde6smv) | [Python](https://tinyurl.com/wu6rdaw/731_My_Calendar_II.py), [Swift](https://tinyurl.com/wuja3c4/731_My_Calendar_II.swift) |  | Medium | Merge interval |
 |62| [59. Spiral Matrix II](https://tinyurl.com/pqfjvm7) | [Python](https://tinyurl.com/wu6rdaw/59_Spiral_Matrix_II.py), [Swift](https://tinyurl.com/wuja3c4/59_Spiral_Matrix_II.swift) |  | Medium | loved it |
 |63| **[525. Contiguous Array](https://tinyurl.com/txbs9wh)** | [Python](https://tinyurl.com/wu6rdaw/525_Contiguous_Array.py), [Swift](https://tinyurl.com/wuja3c4/525_Contiguous_Array.swift) | [Art 1](https://tinyurl.com/qmbd2vl) | Medium | loved it. Check again |
+|64| **[379. Design Phone Directory](https://tinyurl.com/ybs3848v)** | [Python](https://tinyurl.com/wu6rdaw/379_Design_Phone_Directory.py), [Swift](https://tinyurl.com/wuja3c4/379_Design_Phone_Directory.swift) |  | Medium |  |
+|65| **[280. Wiggle Sort](https://tinyurl.com/ybnjn6fs)** | [Python](https://tinyurl.com/wu6rdaw/280_Wiggle_Sort.py), [Swift](https://tinyurl.com/wuja3c4/280_Wiggle_Sort.swift) |  | Medium |  |
+|66| [246. Strobogrammatic Number](https://tinyurl.com/ycqwsozh) | [Python](https://tinyurl.com/wu6rdaw/246_Strobogrammatic_Number.py), [Swift](https://tinyurl.com/wuja3c4/246_Strobogrammatic_Number.swift) |  | Easy |  |
 
 
 </p>
@@ -516,7 +519,7 @@ BFS, DFS, Dijkstra, Floyd–Warshall, Bellman-Ford, Kruskal, Prim's, Minimum Spa
 |27| **[489. Robot Room Cleaner](https://tinyurl.com/yxpwjn7r)** | [Python](https://tinyurl.com/wu6rdaw/489_Robot_Room_Cleaner.py), [Swift](https://tinyurl.com/wuja3c4/489_Robot_Room_Cleaner.swift) | **[Vid 1](https://tinyurl.com/vahalvm)**, **[Vid 2](https://tinyurl.com/qpumkro)**, **[Art 1](https://tinyurl.com/rnu8679)** | Hard |📌 **TODO: CHECK again. Very important  and interesting problem. I fucking loved it** |
 |28| **[1136. Parallel Courses](https://tinyurl.com/yxpwjn7r)** | [Python](https://tinyurl.com/wu6rdaw/11136_Parallel_Courses.py), [Swift](https://tinyurl.com/wuja3c4/11136_Parallel_Courses.swift) | --- | Hard |📌 Topological sort. |
 |29| **[947. Most Stones Removed with Same Row or Column](https://tinyurl.com/rrm6w2a)** | [Python](https://tinyurl.com/wu6rdaw/947_Most_Stones_Removed_with_Same_Row_or_Column.py), [Swift](https://tinyurl.com/wuja3c4/947_Most_Stones_Removed_with_Same_Row_or_Column.swift) | [Vid 1](https://tinyurl.com/sc2g6eg), [Art 1](https://tinyurl.com/sxyzxkr), [Vid 2](https://tinyurl.com/wocnrhn), [Art 2](https://tinyurl.com/sogsj74), [Art 3](https://tinyurl.com/w4pk463) | Medium |📌 DFS and Union FInd |
-|29| [1042. Flower Planting With No Adjacent](https://tinyurl.com/unwlzyy) | [Python](https://tinyurl.com/wu6rdaw/1042_Flower_Planting_With_No_Adjacent.py), [Swift](https://tinyurl.com/wuja3c4/1042_Flower_Planting_With_No_Adjacent.swift) | --- | Easy |📌 Could be done using DFS, BFS |
+|30| [1042. Flower Planting With No Adjacent](https://tinyurl.com/unwlzyy) | [Python](https://tinyurl.com/wu6rdaw/1042_Flower_Planting_With_No_Adjacent.py), [Swift](https://tinyurl.com/wuja3c4/1042_Flower_Planting_With_No_Adjacent.swift) | --- | Easy |📌 Could be done using DFS, BFS |
 
 
 </p>

algoexpert.io/python/Subarray_Sort.py

@@ -1,29 +1,27 @@
+import math
 
-# O(n) time | O(1) space
 def subarraySort(array):
-    minOutOfOrder = float('inf')
-    maxOutOfOrder = float('-inf')
+    minOutOfOrder = math.inf
+    maxOutOfOrder = -math.inf
     for i in range(len(array)):
         num = array[i]
         if isOutOfOrder(i, num, array):
-            minOutOfOrder = min(num, minOutOfOrder)
-            maxOutOfOrder = max(num, maxOutOfOrder)
-    if minOutOfOrder == float('inf'):
+            minOutOfOrder = min(minOutOfOrder, num)
+            maxOutOfOrder = max(maxOutOfOrder, num)
+    if minOutOfOrder == math.inf:
         return [-1, -1]
     subArrayLeftIdx = 0
-    subArrayRightIdx = len(array) - 1
-    while minOutOfOrder >= array[subArrayLeftIdx]:
+    while array[subArrayLeftIdx] <= minOutOfOrder:
         subArrayLeftIdx += 1
+    subArrayRightIdx = len(array) - 1
     while maxOutOfOrder <= array[subArrayRightIdx]:
         subArrayRightIdx -= 1
     return [subArrayLeftIdx, subArrayRightIdx]
 
 
-
-
 def isOutOfOrder(i, num, array):
     if i == 0:
         return num > array[i + 1]
     if i == len(array) - 1:
         return num < array[i - 1]
-    return num > array[i + 1] or num < array[i - 1]
+    return num < array[i - 1] or num > array[i + 1]

leetcode.com/python/246_Strobogrammatic_Number.py

@@ -0,0 +1,16 @@
+class Solution(object):
+    def isStrobogrammatic(self, num):
+        """
+        :type num: str
+        :rtype: bool
+        """
+        nsg = ["2", "3", "4", "5", "7"]
+        sg = {"0": "0", "1": "1", "6": "9", "8": "8", "9": "6"}
+        newNum = ""
+        for n in num:
+            if n in nsg:
+                return False
+            else:
+                newNum += sg[n]
+        newNum = newNum[::-1]
+        return num == newNum

leetcode.com/python/280_Wiggle_Sort.py

@@ -0,0 +1,20 @@
+class Solution(object):
+    def wiggleSort(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: None Do not return anything, modify nums in-place instead.
+        """
+        nLen = len(nums) - 1
+        nums.sort()
+        fidx = nLen // 2
+        sidx = nLen // 2 + 1
+
+        swapIdx = 0
+        while swapIdx < nLen - 1:
+            nums[swapIdx], nums[fidx] = nums[fidx], nums[swapIdx]
+            swapIdx += 1
+            fidx += 1
+
+            nums[swapIdx], nums[sidx] = nums[sidx], nums[swapIdx]
+            swapIdx += 1
+            sidx += 1

leetcode.com/python/379_Design_Phone_Directory.py

@@ -0,0 +1,56 @@
+import heapq
+
+
+class PhoneDirectory(object):
+
+    def __init__(self, maxNumbers):
+        """
+        Initialize your data structure here
+        @param maxNumbers - The maximum numbers that can be stored in the phone directory.
+        :type maxNumbers: int
+        """
+        self.phoneDictSts = {}
+        self.availableNums = []
+        for i in range(maxNumbers):
+            self.phoneDictSts[i] = True
+            heapq.heappush(self.availableNums, i)
+
+    def get(self):
+        """
+        Provide a number which is not assigned to anyone.
+        @return - Return an available number. Return -1 if none is available.
+        :rtype: int
+        """
+        if len(self.availableNums) > 0:
+            num = heapq.heappop(self.availableNums)
+            self.phoneDictSts[num] = False
+            return num
+        else:
+            return -1
+
+    def check(self, number):
+        """
+        Check if a number is available or not.
+        :type number: int
+        :rtype: bool
+        """
+        if self.phoneDictSts[number] == True:
+            return True
+        else:
+            return False
+
+    def release(self, number):
+        """
+        Recycle or release a number.
+        :type number: int
+        :rtype: None
+        """
+        if self.phoneDictSts[number] == False:
+            self.phoneDictSts[number] = True
+            heapq.heappush(self.availableNums, number)
+
+# Your PhoneDirectory object will be instantiated and called as such:
+# obj = PhoneDirectory(maxNumbers)
+# param_1 = obj.get()
+# param_2 = obj.check(number)
+# obj.release(number)