Word Ladder (BFS shortest path)

← Courses›Interview PrepModule 5 · System Design & Behavioral›Word Ladder (BFS shortest path)write68 / 100

Task

📝 **Task:** Implement `ladder_length(begin, end, words)`.

📋 Implement the function above. Test cases run automatically.

💡 **Hint:** Re-read the theory if you get stuck — the pattern is right there.

Keep going

🎯write

Median from a data stream (two heaps)

🎯writeFREE

Two pointers: pair sum

🎯write

Two pointers: palindrome check

🤖predictFREE

Prerequisites — what you should know before this track

⚡predictFREE

Prerequisites — what you should know before this track

✏️ Write your code here

🐍

Loading Python...

First visit only — ~5-10s. Stays cached afterward.

📊 Result

Press Run to see result...

Keep going

💬 Discussion