100 Must attempt Problems for Coding Interview: Checklist
Powered by OpenGenus IQ because we want you ❤️ to succeed. (How to use this?) Bookmark this page now (press CTRL + D) to easily use this masterpiece tomorrow
Only Problems that you need to practice to get prepared for your Coding Interview. Nothing more, Nothing less.
Move Negative elements to front
Move Negative elements to front is a simple problem that tests your knowledge of how to move elements across an array. These involve partition algorithms like Lomuto and Hoare Partition Scheme and has direct application in algorithms like QuickSort.
Finding the Diameter and Height of a Binary Tree is a simple yet core problem that everyone should be fluent in. Every few students know that the average height of a random Binary Tree is O(N^0.5) (see how?).
No NULL implementation
Implementing Binary Tree with no NULLs is an approach that sets you apart from other candidates. Avoiding NULLs is Industry standard.
Largest Independent Set
Finding the Largest Independent Set in Binary Tree is a problem that requires the application of Dynamic Programming. This is an important interview problem.