โ† Groww questions

Missing/Duplicate Elements and Shortest Path in BST

Filed under Groww

The question

Given a list with elements in range [0, x) where x is the size, find missing elements and duplicate elements separately in O(N) time and O(1) space. Also, given a BST with only number of nodes, source, and destination (no root given), find the minimum number of steps to reach from source to destination.

No write-up yet. Related questions below have one.

Related Groww questions

Collected from public candidate posts and coding forums. Updated Nov 2026.