Larry Explains.. Monoqueues Part 2

Показать описание

Larry goes over monoqueue/min-queue, a data structure that's recently popular, explaining where and how it can be used, particularly in competitive programming.

#leetcode #coding #python #programming

Рекомендации по теме

Комментарии

Best monotonic queue explanation. Thank you so much.

jaideepkukkadapu

Send to your enemy was very very funny he he heeee. The explanation was great !

srivaishnav

Really appreciate your explanation on monotonic queue! It made much more sense than the LeetCode discussion code.

NkwAxhXLaegHZfcVTF

hey larry, I'm confused with for the O(nlogn) solution, how the dequeue methods ensure the min element remains in the queue, unless it was at the head of the queue ie: self.queue[0][0]. For example, if we have the queue [5, 6, 1, 10], a minheap for this queue, then if we call dequeue previous index would be 0 since we haven't popped anything from the queue yet. But since 0 is the smallest index in the queue, wouldn't while previousIndex<=self.pq[0][1] never break then we would run into a key error since there would be no more elements in self.pg?

hakankanplay

Useful video, Larry! Seen you in leetcode contests.

How to use/apply monotonic queues has been hard. Is there any academic literature/textbook that covers it? Couldn't find it using google.
Why is this data-struct not in books and not described or taught in university courses? Is it something only specific to competitive programming, if so, why?

Your video helps a bit in understanding it, but i'm really unsure why there is so dearth of resources to understand and, more importantly, APPLY monoqueue to programming problems.

Specifically: When we look at a problem, we know we need BST or heap if we need to find the search for a value quickly or find the min/max in constant time using heap, but how do we know exactly when to THINK about monoqueue?
what thought process to articulate to begin considering monotonic queues? once one knows or sees a solution use of monoqueue makes sense but that's hindsight 20/20. how to figure it out just by looking at a problem not solution?
how do we realize instantly looking at a problem to device a monoqueue that would solve it? particularly in interview conditions?

jmka

Larry Explains.. Monoqueues Part 2

Larry Explains.. Monoqueues Part 2

Larry Explains.. Monoqueues Part 1

Larry Explains.. Prefix Sums Part 1

Why does LC hate python! Leetcode Weekly Contest 314 (python) with commentary

SERVER DOWN?! Leetcode Weekly Contest 195 (Disaster Part 2) with explanation and commentary

16. 3Sum Closest - Day 8/31 Leetcode October Challenge

1776. Car Fleet II (Leetcode Hard)

441. Arranging Coins - Day 5/30 Leetcode November Challenge

Leetcode Biweekly Contest 14 (Rank 36) with Commentary

906. Super Palindromes - Day 8/31 Leetcode May Challenge

2121. Intervals Between Identical Elements (Leetcode Medium)

700. Search in a Binary Search Tree - Day 14/30 Leetcode April Challenge

704. Binary Search - Day 8/31 Leetcode October Challenge

556. Next Greater Element III - Day 23/31 Leetcode December Challenge

785. Is Graph Bipartite? - Day 14/28 Leetcode February Challenge

1856. Maximum Subarray Min-Product (Leetcode Medium)

1328. Break a Palindrome - Day 10/31 Leetcode October Challenge

Implement a Queue with MAX API. #MAANG coding interview question and solution

Sliding Window Maximum - Monotonic Queue - Leetcode 239

450. Delete Node in a BST - Day 31/31 Leetcode August Challenge

Binary Search Explanation and Implementation

1332. Remove Palindromic Subsequences - Day 8/30 Leetcode June Challenge

923. 3Sum With Multiplicity - Day 23/31 Leetcode March Challenge

11. Container With Most Water - Day 5/30 Leetcode April Challenge