LeetCode Problem 542: 01 Matrix in Java - FAANG Coding Interview - Blind 75 Question

Veröffentlicht am: 10 April 2023
auf dem Kanal: KeyStrokes

469

LeetCode Problem 542: 01 Matrix is a medium difficulty Blind 75 problem. We discuss 3 different solutions to the problem - DP, BFS and Brute Force. We need to find the distance of the closest "0" for every matrix element.

We will use Java as the programming language to solve this problem. It is a very good Dynamic Programming (DP) question to begin with, and is a common coding interview question asked by many companies - Amazon, Google, Facebook, etc, and is great question for FAANG interview preparation. Find more LeetCode solutions on KeyStrokes!

LeetCode hosts amazing questions that you can practice for interviews, and to sharpen your algorithmic skills!

At KeyStrokes, we will cover anything and everything about Computer Science. So make sure you subscribe to learn more! If you have any specific requests, please post them in comments.

🚨🚨🚨🚨🚨🚨 1:1's with KeyStrokes 🚨🚨🚨🚨🚨🚨
💜 🤝 Fill out this form and get in touch with me! 🤝 💜
👉 https://forms.gle/PpkytH1DHVj333Bx9

👉 💜☕️ You can show your support by buying me coffee ☕️💜👈
https://www.buymeacoffee.com/keystrokes

👉💜🫡 Or through Patreon 🫡💜👈
  / keystrokes

LeetCode Problem 542: 01 Matrix
https://leetcode.com/problems/01-matrix/

All LeetCode Solutions:
https://github.com/doingthisalright/L...

Code from the video:
https://github.com/doingthisalright/L...

LeetCode Discussion:
https://leetcode.com/problems/01-matr...

Follow on Twitter for more tips!   / key__strokes
Contact for Business Enquiries:
https://forms.gle/u79MaojDvstGc77f6
Email: doingthisalright@gmail.com
Discord: KeyStrokes(Hashtag)0040

Companies that have asked this question:
Google
Amazon
Facebook
Adobe

Timestamps:
00:00 Introduction
00:29 Problem Statement
01:40 Required Conceptual Knowledge
01:56 Brute Force - Brainstorming
06:55 Brute Force - Pseudocode
08:02 Brute Force - Coding
10:55 Brute Force - Submitting to LeetCode
11:17 Breadth First Search (BFS) - Brainstorming
21:11 BFS - Pseudocode
23:32 BFS - Coding
29:29 BFS - Submitting to LeetCode
29:48 Dynamic Programming (DP) - Brainstorming
36:32 DP - Pseudocode
39:01 DP - Coding
44:21 DP - Submitting to LeetCode
44:41 Outro/Conclusion

---

Music Credits:
🎶 Music Credits 🎶
Music from WHATFUNK:   / no-smoke

Image Credits
Subscribe icons created by Freepik - Flaticon: https://www.flaticon.com/free-icons/s...
Youtube icons created by Freepik - Flaticon: https://www.flaticon.com/free-icons/y...
Developer icons created by Flat Icons - Flaticon - https://www.flaticon.com/free-icons/d...
Algorithm icons created by Flat Icons - Flaticon - https://www.flaticon.com/free-icons/a...
Goal icons created by Freepik - Flaticon - https://www.flaticon.com/free-icons/goal

---
Disclaimer: All opinions expressed in this video are those of the creator of this video. Using any information provided in this video is at your own risk, and the creator hold no responsibility and cannot be held liable if it causes any loss. Please do your own research and experiment well enough before using any content provided here.

#KeyStrokes #LeetCode #Blind75 #Algorithms #DataStructures #Coding #Programming #Java #Interview #TechInterview #BinaryTreeLevelOrderTraversal #BinaryTree #LevelOrderTraversal #LeetCode102

Auf dieser Seite können Sie das Online-Video LeetCode Problem 542: 01 Matrix in Java - FAANG Coding Interview - Blind 75 Question mit der Dauer stunde minuten sekunde in guter Qualität ansehen, das der Benutzer KeyStrokes 10 April 2023 hochgeladen hat, den Link mit Freunden und Bekannten teilen, dieses Video wurde auf Youtube bereits 469 Mal angesehen und es wurde von 8 den Zuschauern gefallen. Viel Spaß beim Betrachtenden Zuschauern gefallen!

485

114