Merge branch 'Achal-Hingrajiya:main' into main

Author: jinal-sojitra

1345_Jump Game IV_(15th Jan 2022)/JumpGameIV.py

@@ -0,0 +1,32 @@
+class Solution:
+ def minJumps(self, arr: List[int]) -> int:
+ if len(arr) == 1: 
+ return 0 
+ 
+ adj = defaultdict(list)
+ for i, n in enumerate(arr):
+ adj[n].append(i)
+
+ ans = [0] * len(arr) 
+ dq = deque([len(arr) - 1]) 
+
+ while dq:
+ i = dq.popleft()
+
+ if (i < len(arr) - 1) and (ans[i + 1] == 0) and (i + 1 < len(arr) - 1):
+ ans[i + 1] = ans[i] + 1
+ dq.append(i + 1)
+
+ if (i > 0) and (ans[i - 1] == 0):
+ ans[i - 1] = ans[i] + 1
+ if i - 1 == 0: 
+ return ans[0]
+ dq.append(i - 1)
+
+ for j in adj[arr[i]]:
+ if (ans[j] == 0) and (j < len(arr) - 1):
+ ans[j] = ans[i] + 1
+ if j == 0: 
+ return ans[0]
+ dq.append(j)
+ adj.pop(arr[i]) 

290_Word Pattern_(17th Jan 2022)/WordPattern.py

@@ -0,0 +1,19 @@
+class Solution:
+ def wordPattern(self, pattern: str, s: str) -> bool:
+ arr = s.split()
+ if len(arr) != len(pattern):
+ return False
+ 
+ d = dict()
+ 
+ for i in range(len(pattern)):
+ item = d.get(pattern[i])
+ if not item:
+ if arr[i] in d.values():
+ return False
+ d[pattern[i]] = arr[i]
+ else:
+ if item != arr[i]:
+ return False
+ 
+ return True

849_Maximize Distance to Closest Person_(16th Jan 2022)/MaximizeDistanceToClosestPerson.py

@@ -0,0 +1,33 @@
+class Solution:
+ def maxDistToClosest(self, arr: List[int]) -> int:
+
+ n = len(arr)
+ 
+ def closest_left(index):
+ for i in range(index-1, -1, -1):
+ if arr[i] == 1:
+ return i
+ return -1
+
+ def closest_right(index):
+ for i in range(index + 1, n):
+ if arr[i] == 1:
+ return i
+ return -1
+ 
+ pos = -float("inf")
+ for i in range(n):
+ if not arr[i]:
+ left = closest_left(i)
+ right = closest_right(i)
+ d_right = float("inf")
+ d_left = float("inf")
+ if left != -1:
+ d_left = i - left
+ if right != -1:
+ d_right = right - i
+
+ distance = min(d_left, d_right)
+ pos = max(pos, distance)
+ 
+ return pos

8_String to Integer (atoi)_(14th Jan 2022)/README.md

@@ -0,0 +1,2 @@
+# 8. String to Integer (atoi)
+#### Problem link: https://leetcode.com/problems/string-to-integer-atoi/

README.md

@@ -7,3 +7,7 @@ This repo contains solutions of programming problems of January Challenge
 | 11th Jan, 2022 | [1022. Sum of Root To Leaf Binary Numbers](https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/) | [Here](https://github.com/Achal-Hingrajiya/Leetcode_January_Challenge/tree/main/1022_Sum%20of%20Root%20To%20Leaf%20Binary%20Numbers_(11th%20Jan%202022)) |
 | 12th Jan, 2022 | [701. Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree/) | [Here](701_Insert%20into%20a%20Binary%20Search%20Tree_(12th%20Jan%202022)) |
 | 13th Jan, 2022 | [452. Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/) | [Here](452_Minimum%20Number%20of%20Arrows%20to%20Burst%20Balloons_(13th%20Jan%2C%202022)) |
+| 14th Jan, 2022 | [8. String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/) | [Here](8_String%20to%20Integer%20(atoi)_(14th%20Jan%202022)) |
+| 15th Jan, 2022 | [1345. Jump Game IV](https://leetcode.com/problems/jump-game-iv/) | [Here](1345_Jump%20Game%20IV_(15th%20Jan%202022)) |
+| 16th Jan, 2022 | [849. Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person/) | [Here](849_Maximize%20Distance%20to%20Closest%20Person_(16th%20Jan%202022)) |
+| 17th Jan, 2022 | [290. Word Pattern](https://leetcode.com/problems/word-pattern/) | [Here](290_Word%20Pattern_(17th%20Jan%202022)) |