Added Hackerrank Python Programs

python/Array_Manipulation.py

@@ -0,0 +1,26 @@
+#
+# Complete the 'arrayManipulation' function below.
+#
+# The function is expected to return a LONG_INTEGER.
+# The function accepts following parameters:
+#  1. INTEGER n
+#  2. 2D_INTEGER_ARRAY queries
+#
+
+def arrayManipulation(n, queries):
+    arr = [0]*(n+1)
+    max_value = 0
+    total_sum = 0
+
+    for query in queries:
+        l = query[0]
+        h = query[1]
+        val = query[2]
+        arr[l-1] = arr[l-1] + val
+        arr[h] = arr[h]-val
+
+    for value in arr:
+        total_sum = total_sum + value
+        max_value = max(max_value, total_sum)
+
+    return max_value

python/Jewels_and_stones.py

@@ -0,0 +1,4 @@
+test = int(input())
+for _ in range(test):
+    x,y = input().split()
+    print(sum([x.count(i)  for i in y]))

python/Pairs.py

@@ -0,0 +1,16 @@
+#
+# Complete the 'pairs' function below.
+#
+# The function is expected to return an INTEGER.
+# The function accepts following parameters:
+#  1. INTEGER k
+#  2. INTEGER_ARRAY arr
+#
+
+def pairs(k, arr):
+    counter = 0
+    set_arr = set(arr)
+    for val in arr:
+        if val + k in set_arr:
+            counter += 1
+    return counter

python/Sherlock_and_Array.py

@@ -0,0 +1,18 @@
+#
+# Complete the 'balancedSums' function below.
+#
+# The function is expected to return a STRING.
+# The function accepts INTEGER_ARRAY arr as parameter.
+#
+
+def balancedSums(arr):
+    sum_arr = sum(arr)
+    l = len(arr)
+    lefty = 0
+    for i in range(len(arr)):
+        current = arr[i]
+        sum_arr -= current
+        if lefty == sum_arr:
+            return 'YES'
+        lefty += current
+    return 'NO'