[24]7 Innovation Labs Interview Experience | Set 4 (Off-Campus)

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 ( https://www.geeksforgeeks.org/find-the-row-with-maximum-number-1s/ )
• n  =2 output ()(), (()) For given n print total valid parenthesis( https://www.geeksforgeeks.org/print-all-combinations-of-balanced-parentheses/ )

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

My Personal Notes arrow_drop_up

Save