BFS vs DFS in Coding Interviews | Shortest Path to Target | Geekific
Discord Community: / discord
GitHub Repository: https://github.com/geekific-official/
In the previous video of this series, we tackled matrices traversal, and saw how by traversing the cells of a given matrix in a DFS manner we can count the number of components in that matrix. But why did we use DFS? Why not BFS for example? In this video we attempt to answer these questions with the help of an example.
LeetCode Problems solved in this video:
https://leetcode.com/problems/shortes...
Timestamps:
00:00 Introduction
00:09 BFS vs DFS in Coding Interview Questions
01:17 Shortest Path in Binary Matrix
03:12 Implementation with Java
05:14 Thanks for Watching!
If you found this video helpful, check other Geekific uploads:
Object-Oriented Programming Fundamentals: • What is Object-Oriented Programming? ...
SOLID Principles and Best Practices: • SOLID Design Principles with Java Exa...
Recursion Made Simple, Recursive Methods: • What is Recursion? | Recursion Made S...
Use-Case and Sequence Diagrams: • UML Use-Case and Sequence Diagrams Ma...
Introduction to Dynamic Programming: • What Is Dynamic Programming and How T...
What is the Two-Pointers Technique and how to use it?: • What is the Two-Pointers Technique & ...
Trees Compared and Visualized, BST vs AVL vs RedBlack vs Splay vs Heaps: • Trees Compared and Visualized | BST v...
Generics and Wildcards in Java, Invariance vs Covariance vs Contravariance: • Generics and Wildcards in Java | Part...
Two Sum Problem, from Brute Force to Optimal: • Two Sum Problem | From Brute Force to...
What is a Thread? (Process, Program, Parallelism, Scheduler Explained): • What is a Thread? | Threads, Process,...
Domain-Driven Design Made Simple: • Domain-Driven Design Made Simple | Wh...
Search In Rotated Sorted Array: • Search In Rotated Sorted Array | Opti...
Coin Change Problem, Minimum Number of Coins: • Coin Change Problem | Minimum Number ...
Coin Change Problem II, Number of Ways to Produce Amount: • Coin Change Problem II | Number of Wa...
Introduction to Monotonic Stacks, Daily Temperatures LeetCode in Java: • Introduction to Monotonic Stacks | Da...
#Geekific #ShortestPathToTarget #CodingInteview #LeetCode #Java #Google #Amazon #Meta #Microsoft #Apple #Netflix
Watch video BFS vs DFS in Coding Interviews | Shortest Path to Target | Geekific online without registration, duration hours minute second in high quality. This video was added by user Geekific 17 February 2024, don't forget to share it with your friends and acquaintances, it has been viewed on our site 74 once and liked it 2 people.