carefree-ladka

class MinMaxPriorityQueue {

  #heap = []
  #compare;

  constructor(compare = (a, b) => a - b) {
    this.#compare = compare; // Default to Min-Heap if no compare function is provided
  }

  // Add a new element to the priority queue

underscoDe

Grind 169 Leetcode questions

An updated version of Blind 75

Filters:

• View All Questions
• Order by Difficulty
• Group by Topics

Array

tykurtz

GROKKING NOTES

I liked the way Grokking the coding interview organized problems into learnable patterns. However, the course is expensive and the majority of the time the problems are copy-pasted from leetcode. As the explanations on leetcode are usually just as good, the course really boils down to being a glorified curated list of leetcode problems.

So below I made a list of leetcode problems that are as close to grokking problems as possible.

Pattern: Sliding Window

• https://leetcode.com/problems/maximum-subarray/ # Close enough
• https://leetcode.com/problems/minimum-size-subarray-sum/