Lecture-8 127. Word Ladder | Graph Traversal | Graph Series | DSA | Hindi
HTML-код
- Опубликовано: 22 авг 2024
- Problem Name:
127. Word Ladder
Problem Statement:
A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord - s1 - s2 - ... - sk such that:
Every adjacent pair of words differs by a single letter.
Every si for 1 = i = k is in wordList. Note that beginWord does not need to be in wordList.
sk == endWord
Given two words, beginWord and endWord, and a dictionary wordList, return the number of words in the shortest transformation sequence from beginWord to endWord, or 0 if no such sequence exists.
Problem Link:
leetcode.com/p...
Graph Playlist:
• Graph Data Structure S...
Java Plus DSA Placement Course Playlist:
• Java and DSA Course Pl...
Java Plus DSA Sheet:
docs.google.co...
Notes:
github.com/Tiw...
Telegram Link:
shashwattiwari...
Ultimate Recursion Series Playlist:
• Recursion and Backtrac...
Instagram Handle: (@shashwat_tiwari_st)
shashwattiwari...
Samsung Interview Experience:
• I cracked Samsung | SR...
Company Tags:
Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung
Timestamp:
0:00 - Introduction
#ShashwatTiwari #coding #problemsolving
Great explain sir
Very nice sir
Sir ap itna acha parate ho islia apke channel future aur grow karega 🎉
Best explanation!
Thanks 😊
Good explain sir ❤
Sir please arrange playlist perfectly of DSA..Get confuse
Hey sir can you tell the approach from which video do I need to start with and how can we utilise your channel in beginners manner + from which video can we expect to solve leetcode problems
@@Aranya_-il5nr if you don't know Java, please watch from lecture 1 of Java dsa sheet, after lecture 15, you can start solving leetcode daily challenge videos in parallel, along with Java dsa lectures.
If you already know Java, basics then you can start watching from lecture 11 of Java dsa playlist and watch daily challenge problems in parallel.
@@shashwat_tiwari_st ok sir
Sir ye same questions kaa Trie Data Structure use krke optimize solution milega kya..??
tries se searching easily hoti hai, generation me help nhi krega tries.
@@shashwat_tiwari_st Sir to fir apan Trie mein jo possible words list mein available haii unhe trie mein insert krke search kr skte na.. If word found we will mark endOfWord false or remove it from trie.. Is it possible??
@@tejas2636 ha woh mai smjha, Tries se kr skte ho but optimization kaha hai,
Jaise word generate kra tmhe let's say "aman",
Hashset me constant time me pta lag jaega ki present hai ya nhi
Tries me string ki length tak traverse krke pta chalega..
So, Tries optimized toh nhi hua yaha pr...
@@shashwat_tiwari_st okok..