Data structures and algorithms
0 of 49 solved
49 questions
- What a binary tree looks like from the rightTreesMediumCoding
- Check whether a binary tree is a valid search treeTreesMediumCoding
- Count pairs whose sum is at most KTwo pointersMediumCoding
- All distinct trios that balance to zeroTwo pointersMediumCoding
- Median after every new readingHeapsHardCoding
- Smallest stretch containing every required letterSliding windowHardCoding
- Longest well-formed bracket stretchStacksHardCoding
- Largest path sum in a binary treeTreesHardCoding
- Rainwater trapped between wallsTwo pointersHardCoding