Word Search LeetCode | Backtracking | Blind 75 #50 | DFS Grid | Coding Interview
In this video, we solve LeetCode 79 - Word Search, problem #50 of the
Blind 75 list! We use Backtracking + DFS to search every cell in the grid
— and I'll make it SO simple you can code it in any interview confidently.
🔗 Source Code + Full Explanation:
https://github.com/yannigoyal/Blind75/tree/main/50_Word_Search
📌 Prerequisite Problems (Do These First!):
→ Number of Islands (Grid + Graph both approaches) - https://youtu.be/zcbo8jRtLbk?si=eXa8gtgk1EHbzPIC
→ Pacific Atlantic Water Flow - https://youtu.be/e9AXpDHQ1iM?si=8dnYK07VzB8AeWzM
⏱️ Timestamps:
00:00 - Problem Understanding
00:49 - Drawing Explanation
04:15 - Code Walk-through
10:00 - Complexity Analysis
💡 What You'll Learn:
✅ How Backtracking works on a 2D grid
✅ How to mark cells visited without extra space
✅ Why DFS is the perfect fit for Word Search
✅ Time & Space complexity explained clearly
🔥 This exact pattern appears in:
- FAANG coding interviews
- Google, Amazon, Microsoft OAs
- LeetCode Medium/Hard graph problems
📚 Full Blind 75 Playlist: [LINK]
🔔 Subscribe for daily DSA problems — new video every day!
------------------------------------------
#WordSearch #LeetCode #Blind75 #Backtracking
#CodingInterview #DSA #DFS #LeetCode79
------------------------------------------
