LeetCode Problem 973: K Closest Points to Origin in Java - FAANG Coding Interview - Blind 75

Pubblicato il: 16 aprile 2023
sul canale di: KeyStrokes

1,154

LeetCode Problem 973: K Closest Points to Origin is a medium difficulty Blind 75 problem. We discuss 3 different solutions to the problem - Array Sorting, Priority Queue and Optimized Priority Queue solutions. We need to find K closest points to origin from a given list of points.

We will use Java as the programming language to solve this problem. It is a very good Priority Queue 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 973: 01 Matrix
https://leetcode.com/problems/k-close...

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

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

LeetCode Discussion:
https://leetcode.com/problems/k-close...

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:
Facebook
Amazon
Microsoft
Asana
Google
LinkedIn
Sumologic

Timestamps:
00:00 Introduction
00:34 Problem Statement
01:39 Required Conceptual Knowledge
02:00 Array Sorting - Brainstorming
03:18 Array Sorting - Pseudocode
03:40 Array Sorting - Coding
05:22 Array Sorting - Submitting to LeetCode
05:40 Priority Queue - Brainstorming
07:16 Priority Queue - Pseudocode
08:28 Priority Queue - Coding
11:18 Priority Queue - Submitting to LeetCode
11:34 Priority Queue - Optimization - Brainstorming
13:08 Priority Queue - Optimization - Pseudocode
14:40 Priority Queue - Optimization - Coding
16:41 Priority Queue - Optimization - Submitting to LeetCode
17:00 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 #KClosestPointsToOrigin #priorityqueue #array #arrays #sorting #LeetCode973 #leetcodequestionandanswers #leetcodequestions #leetcodesolution

In questa pagina del sito puoi guardare il video online LeetCode Problem 973: K Closest Points to Origin in Java - FAANG Coding Interview - Blind 75 della durata di ore minuti seconda in buona qualità , che l'utente ha caricato KeyStrokes 16 aprile 2023, condividi il link con amici e conoscenti, su youtube questo video è già stato visto 1,154 volte e gli è piaciuto 39 spettatori. Buona visione!

260