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/