update solutions

Author: Kai

warmup/birthday-cake-candles.py

@@ -0,0 +1,29 @@
+#!/bin/python3
+
+import os
+import sys
+
+#
+# Complete the birthdayCakeCandles function below.
+#
+def birthdayCakeCandles(n, ar):
+ max_height = max(ar)
+ nb_max_height = 0
+ for val in ar:
+ if max_height == val:
+ nb_max_height += 1
+ return nb_max_height
+
+
+if __name__ == '__main__':
+ f = open(os.environ['OUTPUT_PATH'], 'w')
+
+ n = int(input())
+
+ ar = list(map(int, input().rstrip().split()))
+
+ result = birthdayCakeCandles(n, ar)
+
+ f.write(str(result) + '\n')
+
+ f.close()

warmup/diagonal-difference.py

@@ -0,0 +1,36 @@
+#https://www.hackerrank.com/challenges/diagonal-difference/problem
+
+#!/bin/python3
+
+import os
+import sys
+
+#
+# Complete the diagonalDifference function below.
+#
+def diagonalDifference(a):
+ length = len(a[0])
+ sum1 = 0
+ for i in range(length):
+ sum1 += a[i][i]
+ sum2 = 0
+ for i in range(length):
+ sum2 += a[i][length - i - 1]
+
+ return abs(sum1 - sum2)
+
+if __name__ == '__main__':
+ f = open(os.environ['OUTPUT_PATH'], 'w')
+
+ n = int(input())
+
+ a = []
+
+ for _ in range(n):
+ a.append(list(map(int, input().rstrip().split())))
+
+ result = diagonalDifference(a)
+
+ f.write(str(result) + '\n')
+
+ f.close()

warmup/mini-max-sum.py

@@ -0,0 +1,22 @@
+#https://www.hackerrank.com/challenges/mini-max-sum/problem
+
+#!/bin/python3
+
+import os
+import sys
+
+#
+# Complete the miniMaxSum function below.
+#
+def miniMaxSum(arr):
+ ar_total = []
+ for i in range(len(arr)):
+ ar = [arr[j] for j in range(len(arr)) if i != j]
+ ar_total.append(sum(ar))
+ print('{} {}'.format(min(ar_total), max(ar_total)))
+
+
+if __name__ == '__main__':
+ arr = list(map(int, input().rstrip().split()))
+
+ miniMaxSum(arr)

warmup/plus-minus.py

@@ -0,0 +1,32 @@
+#https://www.hackerrank.com/challenges/plus-minus/problem
+
+#!/bin/python3
+
+import os
+import sys
+
+#
+# Complete the plusMinus function below.
+#
+def plusMinus(arr):
+ nb_pos = 0
+ nb_neg = 0
+ nb_zero = 0
+ for val in arr:
+ if val > 0:
+ nb_pos += 1
+ elif val < 0:
+ nb_neg += 1
+ else:
+ nb_zero += 1
+
+ print('{}'.format(round(nb_pos/len(arr), 6)))
+ print('{}'.format(round(nb_neg / len(arr), 6)))
+ print('{}'.format(round(nb_zero / len(arr), 6)))
+
+if __name__ == '__main__':
+ n = int(input())
+
+ arr = list(map(int, input().rstrip().split()))
+
+ plusMinus(arr)

warmup/staurcase.py

@@ -0,0 +1,19 @@
+#https://www.hackerrank.com/challenges/staircase/problem
+
+#!/bin/python3
+
+import os
+import sys
+
+#
+# Complete the staircase function below.
+#
+def staircase(n):
+ for i in range(n):
+ str = ' '*(n-i-1) + '#'*(i+1)
+ print(str)
+
+if __name__ == '__main__':
+ n = int(input())
+
+ staircase(n)

warmup/time-conversion.py

@@ -0,0 +1,35 @@
+#https://www.hackerrank.com/challenges/time-conversion/problem
+
+#!/bin/python3
+
+import os
+import sys
+
+#
+# Complete the timeConversion function below.
+#
+def timeConversion(s):
+ arr = s.split(':')
+ hour = arr[0]
+ minute = arr[1]
+ seconds = arr[2][:-2]
+ if 'PM' in arr[2] or 'pm' in arr[2]:
+ if int(hour) != 12:
+ hour = int(hour) + 12
+ elif 'AM' in arr[2] or 'am' in arr[2]:
+ if int(hour) == 12:
+ hour = '00'
+
+ return str(hour) + ':' + str(minute) + ':' + str(seconds)
+
+
+if __name__ == '__main__':
+ f = open(os.environ['OUTPUT_PATH'], 'w')
+
+ s = input()
+
+ result = timeConversion(s)
+
+ f.write(result + '\n')
+
+ f.close()