feat(algs): add two easy hackerrank alg solns

Author: jessicayung

programming-problems/hackerrank-algorithms/5_breaking_the_records.py

@@ -0,0 +1,27 @@
+#!/bin/python3
+
+import sys
+
+def breakingRecords(score):
+    # Complete this function
+    min = score[0]
+    max = score[0]
+    broke_min = 0
+    broke_max = 0
+    for s in score[1:]:
+        if s < min:
+            broke_min += 1
+            min = s
+        elif s > max:
+            broke_max += 1
+            max = s
+    return broke_max, broke_min
+        
+
+if __name__ == "__main__":
+    n = int(input().strip())
+    score = list(map(int, input().strip().split(' ')))
+    result = breakingRecords(score)
+    print (" ".join(map(str, result)))
+
+

programming-problems/hackerrank-algorithms/6_birthday_chocolate.py

@@ -0,0 +1,25 @@
+#!/bin/python3
+
+import sys
+
+def solve(n, s, d, m):
+    breaks = 0
+    # first m consecutive
+    current_sum = 0
+    for j in range(m):
+        current_sum += s[j]
+    if current_sum == d:
+        breaks += 1
+    for i in range(1,n-(m-1)):
+        current_sum += (s[i+m-1] - s[i-1])
+        if current_sum == d:
+            breaks += 1
+    return breaks
+            
+
+n = int(input().strip())
+s = list(map(int, input().strip().split(' ')))
+d, m = input().strip().split(' ')
+d, m = [int(d), int(m)]
+result = solve(n, s, d, m)
+print(result)