Word Ladder | Leetcode 127 | Live coding session

preview_player
Показать описание
1) 0:00 Explaining the problem out loud
2) 1:28 Algorithm walkthrough
3) 10:00 Coding it up
4) 22:00 Time complexity

// TC : O(n2)
// SC : O(n2), where n are the no of words in the dictionary

Code Link

Рекомендации по теме
Комментарии
Автор

How can we implement double sided BFS in this question? I've checked the discussion for this question but i could not understand the double sided BFS approach.

trevorPhillips
visit shbcf.ru