Merge pull request #178 from Mayur-Pagote/main

Added GFG solutions

Geeks For Geeks/Alternates in an Array.py

@@ -0,0 +1,7 @@
+class Solution:
+    def getAlternates(self, arr):
+        l = []
+        for i in range(len(arr)):
+            if i%2==0:
+                l.append(arr[i])
+        return l

Geeks For Geeks/Array Duplicates.py

@@ -0,0 +1,13 @@
+class Solution:
+    def findDuplicates(self, arr):
+
+        seen = set()
+        duplicates = []
+
+        for num in arr:
+            if num in seen:
+                duplicates.append(num)
+            else:
+                seen.add(num)
+
+        return duplicates

Geeks For Geeks/Array Search.py

@@ -0,0 +1,5 @@
+class Solution:
+    def search(self,arr, x):
+        if x in arr:
+            return arr.index(x)
+        return -1

Geeks For Geeks/Array Subset.py

@@ -0,0 +1,8 @@
+class Solution:
+    def isSubset(self, a, b):
+        set_a = set(a)
+
+        for element in b:
+            if element not in set_a:
+                return False
+        return True

Geeks For Geeks/At least two greater elements.py

@@ -0,0 +1,8 @@
+class Solution:
+    def findElements(self,arr):
+        for i in range(2):
+            val1 = max(arr)
+            arr.remove(val1)
+
+        arr.sort()
+        return arr

Geeks For Geeks/Balanced Array.py

@@ -0,0 +1,7 @@
+class Solution:
+    def min_value_to_balance(self, arr):
+        x = int(len(arr) / 2)
+        left = arr[:x]
+        right = arr[x:]
+        res = sum(left) - sum(right)
+        return abs(res)

Geeks For Geeks/Check Equal Arrays.py

@@ -0,0 +1,5 @@
+class Solution:
+    def check(self, arr1, arr2) -> bool:
+        arr1.sort()
+        arr2.sort()
+        return arr1==arr2