LeetcodeBinary Search
Binary Search: Visualizing Why O(log n) Feels Like Magic
Visualize why O(log n) feels like magic. Watch binary search rip through a phonebook while linear search flips page by page.
December 5, 20248 min read
Loading...
Back to all posts
Category
Leetcode
Leetcode problems and solutions
5 posts
LeetcodeTrees
The Queue is a Gravity Well: Why Level Order Traversal Beats the Snake
Visualize Level Order Traversal through physics. Watch BFS spread like a sound wave while DFS dives like a snake.
December 5, 20247 min read
LeetcodeDynamic Programming
The Amnesia Cure: Visualizing Why Recursion Burns Your CPU
Visualize why naive recursion explodes exponentially. Watch memoization turn chaos into order with an interactive Fibonacci simulator.
December 5, 20249 min read
LeetcodeArrays
Sliding Window Algorithm: Visualizing Why O(n²) is Just Bad Memory
Visualize why O(n²) is inefficient through a heat map simulator. Watch brute force burn CPU cycles while sliding window glides smoothly.
December 5, 20248 min read
LeetcodeRecursion
The Time Traveler's Stack: Visualizing Backtracking vs. Infinite Chaos
Visualize backtracking through an interactive lock picker simulator. Watch how state reversibility saves memory while brute force creates infinite universes.
December 5, 20248 min read