new questions

prabhupant · prabhupant · commit 9f13203c5f9a · 2019-07-31T08:14:58.000+05:30
diff --git a/data_structures/array/duplicate.py b/data_structures/array/duplicate.py
@@ -0,0 +1,17 @@
+def duplicate(arr):
+    tortoise = arr[0]
+    hare = arr[0]
+
+    while True:
+        tortoise = arr[tortoise]
+        hare = arr[arr[hare]]
+        if tortoise == hare:
+            break
+
+    ptr1 = nums[0]
+    ptr2 = tortoise
+    while ptr1 != ptr2:
+        ptr1 = nums[ptr1]
+        ptr2 = nums[ptr2]
+
+    return ptr1
diff --git a/data_structures/array/duplicates.py b/data_structures/array/duplicates.py
@@ -0,0 +1,8 @@
+def duplicate(arr):
+    res = []
+    for x in arr:
+        if arr[abs(x) - 1] < 0:
+            res.append(abs(x))
+        else:
+            nums[abs(x) - 1] *= -1
+    return res
diff --git a/data_structures/array/find_sum.py b/data_structures/array/find_sum.py
@@ -0,0 +1,11 @@
+def find(arr, target):
+    i = 0
+    j = len(arr) - 1
+    while i < j:
+        if arr[i] + arr[j] == target:
+            return [i+1, j+1]
+        elif arr[i] + arr[j] > target:
+            j -= 1
+        else:
+            i += 1
+    return []
diff --git a/data_structures/array/majority_element.py b/data_structures/array/majority_element.py
@@ -0,0 +1,13 @@
+def majority(arr):
+    maj_index = 0
+    count = 1
+    for i in range(1, len(arr)):
+        if arr[i] == arr[maj_index]:
+            count += 1
+        else:
+            count -= 1
+        if count == 0:
+            maj_index = i
+            count = 1
+
+    return arr[maj_index]
diff --git a/data_structures/array/max_consecutive_ones.py b/data_structures/array/max_consecutive_ones.py
@@ -0,0 +1,11 @@
+def max_ones(arr):
+    max = 0
+    count = 0
+    for i in arr:
+        if i == 1:
+            count += 1
+        if count > max:
+            max = count
+        if i == 0:
+            count = 0
+    return max
diff --git a/data_structures/array/moves_zeros_to_end.py b/data_structures/array/moves_zeros_to_end.py
@@ -0,0 +1,9 @@
+def move(arr):
+    count = 0
+    for a in arr:
+        if not a == 0:
+            arr[count] = a
+            count += 1
+    while count < len(nums):
+        nums[count] = 0
+        count += 1
diff --git a/data_structures/array/partition_three_parts_equal_sum.py b/data_structures/array/partition_three_parts_equal_sum.py
@@ -0,0 +1,16 @@
+def partition(arr):
+    s = sum(arr)
+    if not s % 3 == 0:
+        return False
+    s = s / 3
+    targets = [2*s, s]
+    acc = 0
+
+    for a in arr:
+        acc += a
+        if acc == targets[-1]:
+            targets.pop()
+        if not targets:
+            return True
+    
+    return False
diff --git a/data_structures/array/pivot_index.py b/data_structures/array/pivot_index.py
@@ -0,0 +1,10 @@
+def pivot(arr):
+    s = sum(arr)
+    left_sum = 0
+    for i, x in enumerate(arr):
+        if left_sum = (s - x - left_sum):
+            return i
+        left_sum += x
+    return -1
+
+
diff --git a/data_structures/array/sort_by_parity.py b/data_structures/array/sort_by_parity.py
@@ -0,0 +1,15 @@
+def sort_parity(arr):
+    i = 0
+    j = len(arr) - 1
+    while i < j:
+        if arr[i] % 2 > arr[j] % 2:
+            arr[i], arr[j] = arr[j], arr[i]
+        if arr[i] % 2 == 0:
+            i += 1
+        if arr[j] % 2 == 1:
+            j -= 1
+
+arr = [5,6,4,3,2,4,5,6,7,8,9,8,7,4]
+
+sort_parity(arr)
+print(arr)
diff --git a/data_structures/array/square_of_sorted_array.py b/data_structures/array/square_of_sorted_array.py
@@ -0,0 +1,2 @@
+def square(arr):
+
