# Source Map — 08 Heap / Priority Queue

এই folder-এর প্রতিটা idea, link, আর problem reference — তার উৎস আর copying status সহ। এই repo-র problem description গুলো সবসময় আমাদের নিজেদের ভাষায় নতুন করে লেখা; link গুলো official statement-এ নিয়ে যায়।

| Concept / Problem | Source Type | Source Name | Link | How it is used | Copying status |
| --- | --- | --- | --- | --- | --- |
| Hospital triage analogy | Original | This repo | — | concept.md-এর opening analogy | original explanation |
| Heap property and array index math (2i+1 / 2i+2 / (i-1)//2) | Textbook-common knowledge | Standard CS curriculum; see also Open Data Structures | [উৎস খুলুন](https://opendatastructures.org/) | concept.md-এর memory picture | original explanation |
| heapq module behavior | Official docs | Python standard library `heapq` | [উৎস খুলুন](https://docs.python.org/3/library/heapq.html) | concept.md আর implementation.py-র snippets | original explanation |
| O(n) heapify argument | Textbook-common knowledge | Standard analysis; friendly write-up in Hello Algo | [উৎস খুলুন](https://www.hello-algo.com/en/) | concept.md-এর complexity note | original explanation |
| Sift-up / sift-down frame diagrams | Original | This repo | — | visual-explanation.md-এর সব frame | original explanation |
| Interactive heap animation | Visualizer | VisuAlgo (Binary Heap module) | [উৎস খুলুন](https://visualgo.net/en) | README.md আর visual-explanation.md-এ recommend করা | official link only |
| Top-K "club bouncer" framing | Original | This repo | — | patterns.md-এর Pattern 1 | original explanation |
| Kth Largest Element in an Array | Online judge | LeetCode 215 | [উৎস খুলুন](https://leetcode.com/problems/kth-largest-element-in-an-array/) | Practice list + patterns.md-এর example | rewritten problem |
| Top K Frequent Elements | Online judge | LeetCode 347 | [উৎস খুলুন](https://leetcode.com/problems/top-k-frequent-elements/) | Practice list + patterns.md | rewritten problem |
| K Closest Points to Origin | Online judge | LeetCode 973 | [উৎস খুলুন](https://leetcode.com/problems/k-closest-points-to-origin/) | Practice list | rewritten problem |
| Kth Largest Element in a Stream | Online judge | LeetCode 703 | [উৎস খুলুন](https://leetcode.com/problems/kth-largest-element-in-a-stream/) | Practice list | rewritten problem |
| Merge k Sorted Lists | Online judge | LeetCode 23 | [উৎস খুলুন](https://leetcode.com/problems/merge-k-sorted-lists/) | Practice list + k-way merge pattern | rewritten problem |
| Kth Smallest Element in a Sorted Matrix | Online judge | LeetCode 378 | [উৎস খুলুন](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/) | Practice list | rewritten problem |
| Smallest Range Covering Elements from K Lists | Online judge | LeetCode 632 | [উৎস খুলুন](https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists/) | Practice list | rewritten problem |
| Find Median from Data Stream | Online judge | LeetCode 295 | [উৎস খুলুন](https://leetcode.com/problems/find-median-from-data-stream/) | Two-heaps pattern + MedianFinder code | rewritten problem |
| Sliding Window Median | Online judge | LeetCode 480 | [উৎস খুলুন](https://leetcode.com/problems/sliding-window-median/) | Practice list + lazy deletion pattern | rewritten problem |
| Sliding Window Maximum | Online judge | LeetCode 239 | [উৎস খুলুন](https://leetcode.com/problems/sliding-window-maximum/) | patterns.md-এর lazy-deletion example | rewritten problem |
| Last Stone Weight | Online judge | LeetCode 1046 | [উৎস খুলুন](https://leetcode.com/problems/last-stone-weight/) | Practice list + greedy pattern example | rewritten problem |
| Meeting Rooms II | Online judge | LeetCode 253 | [উৎস খুলুন](https://leetcode.com/problems/meeting-rooms-ii/) | Scheduling pattern example | rewritten problem |
| Task Scheduler | Online judge | LeetCode 621 | [উৎস খুলুন](https://leetcode.com/problems/task-scheduler/) | Practice list | rewritten problem |
| Reorganize String | Online judge | LeetCode 767 | [উৎস খুলুন](https://leetcode.com/problems/reorganize-string/) | Practice list | rewritten problem |
| Single-Threaded CPU | Online judge | LeetCode 1834 | [উৎস খুলুন](https://leetcode.com/problems/single-threaded-cpu/) | Practice list | rewritten problem |
| Furthest Building You Can Reach | Online judge | LeetCode 1642 | [উৎস খুলুন](https://leetcode.com/problems/furthest-building-you-can-reach/) | Practice list | rewritten problem |
| IPO | Online judge | LeetCode 502 | [উৎস খুলুন](https://leetcode.com/problems/ipo/) | Practice list | rewritten problem |
| Relative Ranks | Online judge | LeetCode 506 | [উৎস খুলুন](https://leetcode.com/problems/relative-ranks/) | Practice list | rewritten problem |
| Car Pooling | Online judge | LeetCode 1094 | [উৎস খুলুন](https://leetcode.com/problems/car-pooling/) | Scheduling pattern-এ উল্লেখ করা | rewritten problem |
| Trapping Rain Water II | Online judge | LeetCode 407 | [উৎস খুলুন](https://leetcode.com/problems/trapping-rain-water-ii/) | Practice list (hard) | rewritten problem |
| Network Delay Time | Online judge | LeetCode 743 | [উৎস খুলুন](https://leetcode.com/problems/network-delay-time/) | patterns.md-এ Dijkstra-র দিকে bridge | rewritten problem |
| Ferris Wheel | Online judge | CSES 1090 | [মূল প্রশ্ন](https://cses.fi/problemset/task/1090) | অধ্যায়ের অনুশীলন ও ধারণার reference | official link only |
| Concert Tickets | Online judge | CSES 1091 | [মূল প্রশ্ন](https://cses.fi/problemset/task/1091) | অধ্যায়ের অনুশীলন ও ধারণার reference | official link only |
| Codeforces multiset-style problems | Online judge | Codeforces problemset (browse by tag) | [উৎস খুলুন](https://codeforces.com/problemset/) | Lazy-deletion pattern-এর pointer | official link only |
| Heaps in competitive programming context | Reference | USACO Guide | [উৎস খুলুন](https://usaco.guide/) | Background reading suggestion | official link only |
| Dijkstra as heap + greedy | Cross-reference | This repo, [../09-graphs/shortest-path.md](../09-graphs/shortest-path.md) | — | patterns.md আর concept.md-এর bridge | original explanation |