dsa4 min read
Increasing Order Search Tree — LeetCode 897 Inorder Rewire in O(n)
LeetCode 897 (Easy). Rebuild a BST into a strictly right-skewed list using a single inorder traversal that rewires left and right pointers in place.
Read →
All Posts
1582 articles
dsa5 min read
Count Nodes Equal to Average of Subtree — LeetCode 2265 Postorder DFS
LeetCode 2265 (Medium). Count every node whose value equals the floor average of its own subtree using a single postorder DFS that returns sum and count to the parent.
Read →
dsa6 min read
Trees Master Recap — 9 Patterns Cheatsheet for Coding Interviews
Complete recap of the Trees DSA section covering 9 reusable patterns, complexity tables, and a problem index mapped to LeetCode favorites at FAANG interviews.
Read →
dsa8 min read
Tries (Prefix Trees) — Complete Interview Guide for FAANG Engineers
Master Tries for FAANG interviews: insert, search, prefix operations, Word Search II, autocomplete, XOR binary trie for max XOR, and 5-language implementations with full problem index.
Read →
dsa8 min read
Implement Trie (Prefix Tree) — Insert, Search, StartsWith
Design a Trie with insert, search, and startsWith operations. This is the foundational data structure behind autocomplete, spell checkers, and IP routing tables.
Read →
Page 173 of 317