2307. Check for Contradictions in Equations
Detect contradictions in a system of equations using graph representation and Breadth-First Search (BFS).
2459. Sort Array by Moving Items to Empty Space
Sort a permutation by swapping elements only with the empty space (0). Visualize cycle breaks and greedy placement.
2355. Maximum Number of Books You Can Take
Find the maximum books you can take using a monotonic stack to optimize the DP transitions in a non-decreasing sequence.
2484. Count Palindromic Subsequences
Count length-5 palindromic subsequences using a specialized DP state tracking. Visualize the one-pass optimization.
2297. Jump Game VIII
Visualize Jump Game VIII algorithm. Find jump paths using monotonic stacks and calculate minimum cost using Dynamic Programming.
96. Unique Binary Search Trees
Generate and animate all structurally unique Binary Search Trees for N nodes using Catalan number computations.
44. Wildcard Matching
Visualize wildcard string matching using 2D DP. Understand how '*' and '?' characters drive transition states.
Morris Traversal
Visualize O(1) space tree traversal using threaded binary trees. Watch how threads are created and removed dynamically.