dsa3 min read
All Nodes Distance K in Binary Tree
Find all nodes at distance K from a target node by building parent pointers then doing BFS.
Read →
All Posts
1276 articles
dsa2 min read
Sum Root to Leaf Numbers
Compute the total sum of all root-to-leaf numbers formed by concatenating digits along each path.
Read →
dsa3 min read
Maximum Width of Binary Tree
Find the maximum width of a binary tree where width is measured from leftmost to rightmost non-null node per level.
Read →
dsa2 min read
Count Good Nodes in Binary Tree
Count nodes where no node on the root-to-node path has a value greater than the node itself.
Read →
dsa2 min read
Convert BST to Greater Tree
Replace each node value with the sum of all values greater than or equal to it using reverse in-order traversal.
Read →
Page 102 of 256