My Program Archives

  Alice and Bob each created one problem for HackerRank. A reviewer rates the two challenges, awarding points on a scale from   1   to   100   for three categories:   problem clarity ,   originality , and   difficulty . The rating for Alice's challenge is the triplet  a = (a[0], a[1], a[2]) , and the rating for Bob's challenge is the triplet  b = (b[0], b[1], b[2]) . The task is to find their  comparison points  by comparing  a[0]  with  b[0] ,  a[1]  with  b[1] , and  a[2]  with  b[2] . If  a[i] > b[i] , then Alice is awarded  1  point. If  a[i] < b[i] , then Bob is awarded  1  point. If  a[i] = b[i] , then neither person receives a point. Comparison points is the total points a person earned. Given  a  and  b , determine their respective comparison points. Example a = [1, 2, 3] b = [3, 2, 1] For elements *0*, Bob is awarded a point because  a[0] . For the equal elements  a[1]  and  b[1] , no points are earned. Finally, for elements  2 ,  a[2] > b[2]  so Alice receive

  Given an array of integers, find the sum of its elements. For example, if the array a = [1,2,3,4,5] then return 1+2+3+4+5 i.e 15 This is a problem from hackerrank problem solving section and i have solved it. HERE IS THE CODE: # MyProgramArchives # Made by Aditya Shrivastava # Please Solve on your own and try less to search on internet #Initilizing function def simpleArraySum (ar): # sum is set to 0 num = 0 # iterating over the array for i in range( 0 , len(ar)): # here is the main part. As num was set to 0 # we can start adding the values from the list # if you analyze the code you will find a chain of numbers adding # over each iteration num = num + ar[i] #returnimg the value of num as it will have or final sum return num I also faced problem, solving this question but at last you get success. THANK YOU. VISIT AGAIN !!!! *PLEASE USE FOR EDUCATIONAL PURPOSE ONLY Aditya Shrivastava | MyProgramArchives