InterviewDB Question

LinkedIn SWE Phone - Word Transformation / Word Ladder

Question Details

Problem Transform one word to another by changing one letter at a time, with each intermediate word valid in a dictionary; find the shortest path using BFS. Likely LeetCode equivalent LC 127 - Word Ladder (>80% confident) Tags graph, bfs, strings

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Coding Onsite Phone