All Posts

1575 articles

dsa2 min read

Verify a binary tree is complete using BFS: once a null child is seen, no more non-null nodes should follow.

March 19, 2026Read →

dsa2 min read

Find and swap the two misplaced nodes in a BST using in-order traversal to detect the violations.

March 19, 2026Read →

dsa2 min read

Maximize robbery from a tree-structured neighborhood where adjacent (parent-child) nodes cannot both be robbed.

March 19, 2026Read →

dsa2 min read

Find minimum cameras to monitor all nodes using greedy bottom-up: prefer placing cameras at parents of uncovered leaves.

March 19, 2026Read →

dsa2 min read

Count minimum moves to distribute coins evenly by tracking excess/deficit coins flowing through each edge.

March 19, 2026Read →

Page 164 of 315