Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript. Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods.

Solutions and notes from Poridhi.io Backend Engineering (Modules 1–11). Covers basic programming, math, arrays, hashing, linked lists, recursion, trees, graphs, DP ...