Support us on Patreon: / geekific
GitHub Repository: github.com/geekific-official/...
Stay updated on our videos by subscribing to the channel and hitting the like button!
In this video, we tackle a Priority Queue interview problem and attempt to explain it in detail, and implement it in Java.
LeetCode Problems solved in this video:
- leetcode.com/problems/kth-lar...
- leetcode.com/problems/kth-lar...
Timestamps:
00:00 Introduction
00:07 Kth Largest Element Problem Definition
01:03 Minimum Heap Solution
02:07 Maximum Heap Solution
02:25 K Largest Element in a Stream
04:10 Thanks for Watching!
If you found this video helpful, check other Geekific uploads:
- Object-Oriented Programming Fundamentals: • What is Object-Oriente...
- SOLID Principles and Best Practices: • SOLID Design Principle...
- Recursion Made Simple, Recursive Methods: • What is Recursion? | R...
- Use-Case and Sequence Diagrams: • UML Use-Case and Seque...
- Introduction to Dynamic Programming: • What Is Dynamic Progra...
- What is the Two-Pointers Technique and how to use it?: • What is the Two-Pointe...
- Trees Compared and Visualized, BST vs AVL vs RedBlack vs Splay vs Heaps: • Trees Compared and Vis...
- Generics and Wildcards in Java, Invariance vs Covariance vs Contravariance: • Generics and Wildcards...
- Two Sum Problem, from Brute Force to Optimal: • Two Sum Problem | From...
- What is a Thread? (Process, Program, Parallelism, Scheduler Explained): • What is a Thread? | Th...
- Domain-Driven Design Made Simple: • Domain-Driven Design M...
- Search In Rotated Sorted Array: • Search In Rotated Sort...
- Coin Change Problem, Minimum Number of Coins: • Coin Change Problem | ...
- Coin Change Problem II, Number of Ways to Produce Amount: • Coin Change Problem II...
#Geekific #Heap #PriorityQueue #CodingInteview #LeetCode #Java #Google #Amazon #Meta #Microsoft #Apple #Netflix