Hackerrank program leap year

Author: PTHARRISH

Notes/1.Basic/file_path

@@ -1,15 +1,32 @@
 def lonelyinteger(a):
-    b=sorted(a)
-    if len(b)==1:
+    b = sorted(a)
+    if len(b) == 1:
         return b[0]
     else:
-        for i in range(len(b)): 
-            count=0
+        for i in range(len(b)):
+            count = 0
             for j in range(len(b)):
-                if b[i]==b[j]:
-                    count+=1
-            if count==1:
+                if b[i] == b[j]:
+                    count += 1
+            if count == 1:
                 return b[i]
-          
-a=list(map(int,input().split()))
-print(lonelyinteger(a))
+
+
+def lonelyinteger(a):
+    b = sorted(a)
+    data = {}
+    if len(b) == 1:
+        return b[0]
+    else:
+        for i in b:
+            if i in data:
+                data[i] += 1
+            else:
+                data[i] = 1
+        for key, value in data.items():
+            if value == 1:
+                return key
+
+
+a = list(map(int, input().split()))
+print(lonelyinteger(a))

Notes/1.Basic/filename.txt

@@ -1,13 +1,14 @@
 def diagonalDifference(arr):
     # Write your code here
-    c=0
-    d=0
-    n=len(arr)
+    c = 0
+    d = 0
+    n = len(arr)
     for i in range(n):
-        c+=arr[i][i]
-        d+=arr[i][n-i-1]
+        c += arr[i][i]
+        d += arr[i][n - i - 1]
         # a=c-d
-    return abs(c-d)
+    return abs(c - d)
+
 
 n = int(input().strip())
 
@@ -23,7 +24,7 @@ def diagonalDifference(arr):
 # For example, the square matrix arr is shown below:
 # 1 2 3
 # 4 5 6
-# 9 8 9  
-# The left-to-right diagonal = 1+5+9 = 15. 
-# The right to left diagonal = 3+5+9=17. 
+# 9 8 9
+# The left-to-right diagonal = 1+5+9 = 15.
+# The right to left diagonal = 3+5+9=17.
 # Their absolute difference is |15-17| = 2.

Notes/function_overloading.py renamed to Notes/oops/function_overloading.py

@@ -1,19 +1,19 @@
 # Find the Percentage of the student name
-if __name__ == '__main__':
+if __name__ == "__main__":
     n = int(input())
     student_marks = {}
     for _ in range(n):
         name, *line = input().split()
         scores = list(map(float, line))
         student_marks[name] = scores
-    query_name = input()# student name search average
-    i=0
-    d=student_marks[query_name]
-    i=sum(d)/3
+    query_name = input()  # student name search average
+    i = 0
+    d = student_marks[query_name]
+    i = sum(d) / 3
 
-    print("%.2f"%i)
+    print("%.2f" % i)
 
-    # using for loop enumerate function 
+    # using for loop enumerate function
     # for j,k in enumerate(d):
     #     i+=k
     # i=i/3

hackerrank/alonelyinteger.py

@@ -1,4 +1,4 @@
-if __name__ == '__main__':
+if __name__ == "__main__":
     n = int(input())
-    arr =map(int, input().split())
+    arr = map(int, input().split())
     print(sorted(list(set(arr)))[-2])

hackerrank/diagonaldifference.py

@@ -2,4 +2,6 @@ def hash_tup():
     n = int(input())
     integer_list = map(int, input().split())
     print(hash(tuple(integer_list)))
-hash_tup()
+
+
+hash_tup()

hackerrank/findthepercentage.py

@@ -0,0 +1,9 @@
+def is_leap(year):
+    leap = False
+    if year % 4 == 0 and (year % 100 != 0 or year % 400 == 0):
+        leap = True
+    return leap
+
+
+year = int(input())
+print(is_leap(year))