1st Round Hackerrank test - 2 hackerrank questions (Find sum of all the Beautiful numbers in given range and other was a DP question) 2nd Round problem solving - Was asked 2 coding question on is to find a row with max 1's in an 2D Array which is row sorted and has only 0's and 1's. int arr[] []= {{0,0,0,1,1,1}, {0,0,1,1,1,1},{0,0,0,0,0,1},{0,1,1,1,1,1,1}} Ans = 3rd row Told the logic but was not able to successfully run the code