Round 1(Telephonic) Explained about company JD Snake and Ladder game (matrix, array, linked list) Find the row with maximum 1s where every row of sorted 0s and 1s ( http://www.geeksforgeeks.org/find-the-row-with-maximum-number-1s/ ) n =2 output ()(), (()) For given n print total valid parenthesis( http://www.geeksforgeeks.org/print-all-combinations-of-balanced-parentheses/ ) If you like GeeksforGeeks and would like to contribute,… Read More »
Round 1 : (Duration:1 hr) Written test consisting of MCQs in aptitude, data structures and analytical thinking. 3 coding questions were also asked of us, from 5 problems. Scope covered: The 3 traversals of binary tree, reversing SLL efficiently, reversing string with no predefined method, explanation of insertion sort, in full. Initially, we were asked… Read More »
Telephonic Discussion: 1) Basic Java Questions about Strings.
I had an interview with 24*7 innovation labs. Their process is telephonic followed by 3 f2f interviews.