Written Round 1: Coding test on hacker rank. There were 4 problems to be solved in 2h. Q1. Max Sum Path: You are given a 2D array and an initial position in first row. You have to travel down to last row with max sum. Max. sum is calculated by adding current cell value in… Read More »
Recently I am interviewed for Carwale SDE-1 position in Navi Mumbai. Written Round 1: (coding test on Hacker Rank) There were 4 problems to be solved in 2h.