Word Search II | DFS + Map | DFS + TRIE | Leetcode

Описание: This video explains an important programming interview problem which is the word break 2 problem which is an extension of word break 1 problem and very similar to the BOGGLE problem.In this problem,we are given a dictionary of words and a 2D board which is nothing but a character matrix and we need to return all those words which are present in dictionary as well as can be formed on our given board following certain constraints.I have explained 2 methods for this problem.The first method is based on depth first search (DFS) and hashmap optimization.The second approach is based on DFS and TRIE.I have explained the entire problem step by step by using proper examples and intuition for each step.I have dry run the algorithm and have also explained the code walk through at the end of the video.CODE LINK is present below as usual. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

========================================================================

INSTAGRAM :
  / surya.pratap.k  

SUPPORT OUR WORK:
  / techdose  

LinkedIn:
  / surya-pratap-kahar-47bb01168  

WEBSITE:
https://techdose.co.in/
=======================================================================

CODE LINK: https://gist.github.com/SuryaPratapK/...
USEFUL VIDEOS:-
Basics of trie:    • Basics of trie  
Trie insertion and search:    • Trie insertion and search  

Trie deletion and search:    • Trie deletion and search  
Implement TRIE:    • Implement TRIE | Leetcode #208  
BOGGLE Problem:    • Boggle | Find all possible words in a boar...