I received the below list of questions by BYJU's recruiter.
I got question from this list(coin change) and also saw many past candidates getting questions from this list.
list
- subarray with sum k
- sort array with 0s and 1s
- minimum distant pair
- sum of all nodes in BST
- 2nd largest in Array
- Middle of LL
- Given tree BST or not
- Minimum value in stack
- Inorder traversal without recursion
- Inorder traversal without recursion & stack (morris traversal)
- Biggest rectangle in histogram
- Reverse LL without space
- Binary matrix (setting row and columns as 0 if element is 0)
- Coin change problem
- BST Zigzag, left view, diameter
- Check valid/duplicate parenthesis
- Common element in three array
- Kth largest in BST
- Search in sorted matrix
Upvote if it was helpful.