Visualise Problems

Interactive Algorithm Visualizations

Step through complex algorithms with beautiful, interactive visualizations. Learn Data Structures and Algorithms through hands-on exploration.

💧

Container With Most Water

Find the container that can hold the most water using two pointers. Optimize by moving the pointer with the smaller height.

Medium Two Pointers

Divide Two Integers

Divide two integers without using multiplication, division, or mod operator. Use bit shifting techniques for efficiency.

Medium Bit Manipulation
✏️

Edit Distance (Levenshtein Distance)

Calculate the minimum number of operations to transform one string into another using dynamic programming.

Medium Dynamic Programming
🎩

Number of Ways to Wear Different Hats

Count the number of ways people can wear different hats using dynamic programming with bitmask optimization.

Hard DP + Bitmask
🔄

Longest Palindromic Substring

Find the longest palindromic substring in a given string using dynamic programming approach with 2D table.

Medium Dynamic Programming
🎯

Manacher's Algorithm

Find the longest palindromic substring in linear time using Manacher's algorithm with center expansion technique.

Hard String Algorithm
🔗

Maximum Length of Pair Chain

Find the longest chain of pairs where each pair's first element is greater than the previous pair's second element.

Medium Greedy