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.neveropen.co.uk/find-the-row-with-maximum-number-1s/ )
- n =2 output ()(), (()) For given n print total valid parenthesis( https://www.neveropen.co.uk/print-all-combinations-of-balanced-parentheses/ )
If you like neveropen and would like to contribute, you can also write an article and mail your article to review-team@neveropen.co.uk. See your article appearing on the neveropen main page and help other Geeks.
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
