qwertyboss

Consider cases
1. No Child elements then delete the node
2. If one child element replace the current node with a child
3. If two children then either pick the largest in left subtree or smallest in right sub tree.

https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/

https://leetcode.com/problems/hamming-distance/

https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/

https://leetcode.com/problems/unique-paths

Thanks for motivating me to do this

https://leetcode.com/problems/kth-smallest-number-in-multiplication-table/

https://leetcode.com/problems/largest-divisible-subset/

https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum/

https://leetcode.com/problems/number-of-valid-words-for-each-puzzle/
- Bit masking
- Trie data structure

https://leetcode.com/problems/unique-binary-search-trees/
https://www.youtube.com/watch?v=Ox0TenN3Zpg