├── README.md
└── Warmup
    ├── 01.Solve Me First.py
    ├── 02.Simple Array Sum.py
    ├── 03.Compare the Triplets.py
    ├── 04.A Very Big Sum.py
    ├── 05.Diagonal Difference.py
    ├── 06.Staircase.py
    ├── 07.Mini-Max Sum.py
    ├── 08.Birthday Cake Candles.py
    ├── 09.Plus Minus.py
    └── 10.Time Conversion.py


/README.md:
--------------------------------------------------------------------------------
1 | # Problem-Solving-Hackerrank
2 | Here you can find all "Problem Solving" portion related solutions.
3 | 


--------------------------------------------------------------------------------
/Warmup/01.Solve Me First.py:
--------------------------------------------------------------------------------
 1 | def solveMeFirst(a,b):
 2 | 	# Hint: Type return a+b below
 3 |     return a+b
 4 | 
 5 | 
 6 | num1 = int(input())
 7 | num2 = int(input())
 8 | res = solveMeFirst(num1,num2)
 9 | print(res)
10 | 


--------------------------------------------------------------------------------
/Warmup/02.Simple Array Sum.py:
--------------------------------------------------------------------------------
 1 | #!/bin/python3
 2 | 
 3 | import os
 4 | import sys
 5 | 
 6 | 
 7 | # Complete the simpleArraySum function below.
 8 | #
 9 | def simpleArraySum(ar):
10 |     #
11 |     # Write your code here.
12 |     return sum(ar)    
13 |     #
14 | 
15 | if __name__ == '__main__':
16 |     fptr = open(os.environ['OUTPUT_PATH'], 'w')
17 | 
18 |     ar_count = int(input())
19 | 
20 |     ar = list(map(int, input().rstrip().split()))
21 | 
22 |     result = simpleArraySum(ar)
23 | 
24 |     fptr.write(str(result) + '\n')
25 | 
26 |     fptr.close()
27 | 


--------------------------------------------------------------------------------
/Warmup/03.Compare the Triplets.py:
--------------------------------------------------------------------------------
 1 | x = list(map(int, input().split()))
 2 | y = list(map(int, input().split()))
 3 | score=score1=0
 4 | for i in range(len(y)):
 5 |     if x[i]>y[i]:
 6 |         score+=1
 7 |     elif x[i]<y[i]:
 8 |         score1+=1  
 9 | print(score,score1)
10 | 


--------------------------------------------------------------------------------
/Warmup/04.A Very Big Sum.py:
--------------------------------------------------------------------------------
 1 | sum=0
 2 | x=int(input())
 3 | 
 4 | y=list(map(int,input().split()))
 5 | 
 6 | for i in y:
 7 |     sum=sum+i
 8 | print(sum)
 9 |     
10 |     
11 | 


--------------------------------------------------------------------------------
/Warmup/05.Diagonal Difference.py:
--------------------------------------------------------------------------------
 1 | 
 2 | n = int(input())
 3 | 
 4 | arr = []
 5 | primary_diagonal=[]
 6 | secondary_diagonal=[]
 7 | counter=0
 8 | counter1=len(arr)-1
 9 | for _ in range(n):
10 |     arr.append(list(map(int, input().rstrip().split())))
11 | for _ in range(len(arr)):
12 |     
13 |     primary_diagonal.append(arr[counter][counter])
14 |     counter+=1
15 | counter=0     
16 | #print(primary_diagonal)
17 | 
18 | 
19 | for _ in range(len(arr)):
20 |     
21 |     secondary_diagonal.append(arr[counter][counter1])
22 |     counter+=1
23 |     counter1-=1 
24 | #print(secondary_diagonal)
25 | print(abs(sum(primary_diagonal)-sum(secondary_diagonal)))
26 | 
27 |                    
28 | 


--------------------------------------------------------------------------------
/Warmup/06.Staircase.py:
--------------------------------------------------------------------------------
 1 | #!/bin/python3
 2 | 
 3 | import math
 4 | import os
 5 | import random
 6 | import re
 7 | import sys
 8 | 
 9 | # Complete the staircase function below.
10 | def staircase(n):
11 |     for j in range(1,n+1):
12 |         print(str('#' * j).rjust(n))
13 |     print()    
14 | 
15 | if __name__ == '__main__':
16 |     n = int(input())
17 | 
18 |     staircase(n)
19 | 


--------------------------------------------------------------------------------
/Warmup/07.Mini-Max Sum.py:
--------------------------------------------------------------------------------
 1 | #!/bin/python3
 2 | 
 3 | import math
 4 | import os
 5 | import random
 6 | import re
 7 | import sys
 8 | 
 9 | # Complete the miniMaxSum function below.
10 | def miniMaxSum(arr):
11 |     M=sorted(arr,reverse=True)
12 |     m=sorted(arr)
13 |     total_sum=0
14 |     total=0
15 |     for i in range(len(M)-1):
16 |         total_sum+=M[i]
17 |     for k in range(len(m)-1):
18 |         total+=m[k]
19 |     print(total,total_sum)        
20 | 
21 | if __name__ == '__main__':
22 |     arr = list(map(int, input().rstrip().split()))
23 | 
24 |     miniMaxSum(arr)
25 | 


--------------------------------------------------------------------------------
/Warmup/08.Birthday Cake Candles.py:
--------------------------------------------------------------------------------
 1 | n=int(input())
 2 | arr=list(map(int,input().split()))
 3 | x=max(arr)
 4 | counter=0
 5 | for i in arr:
 6 |     if i==x:
 7 |         counter+=1  
 8 | 
 9 | print(counter) 
10 | 


--------------------------------------------------------------------------------
/Warmup/09.Plus Minus.py:
--------------------------------------------------------------------------------
 1 | n=int(input())
 2 | arr=list(map(int,input().split()))
 3 | pos=[]
 4 | neg=[]
 5 | zero=[]
 6 | for i in arr:
 7 |     if i>0:
 8 |         pos.append(i)
 9 |     elif i<0:
10 |         neg.append(i)
11 |     elif i==0:
12 |         zero.append(i)
13 | print("%.6f"%(len(pos)/len(arr)))  
14 | print("%.6f"%(len(neg)/len(arr))) 
15 | print("%.6f"%(len(zero)/len(arr)))      
16 |              
17 | 


--------------------------------------------------------------------------------
/Warmup/10.Time Conversion.py:
--------------------------------------------------------------------------------
 1 | s=input()
 2 | def timeconversion(s):
 3 |     if (s[-2:]=="AM" and s[:2]=='12' ):
 4 |         return "00"+s[2:8]
 5 |     elif (s[-2:]=="AM"):
 6 |         return s[0:8]
 7 |     elif(s[-2:]=="PM" and s[:2]=='12'):
 8 |         return s[0:8]
 9 |     else:
10 |         return str(int(s[:2])+12)+s[2:8]
11 | k=timeconversion(s)
12 | print(k)
13 | 
14 | 
15 | 


--------------------------------------------------------------------------------