heap.md

Heap LeetCode Problems

A collection of LeetCode problems solved using Heap pattern techniques, explanations, and complexity analysis.

Problems

Easy

#	Problem	Language	Time	Space	Explanation
1523	Count Odd Numbers in an Interval Range	Python	O(n)	O(n)	Explanation

| 2725 | Interval Cancellation | TypeScript | O(n) | O(n) | Explanation |

Medium

#	Problem	Language	Time	Space	Explanation
12	Integer to Roman	JavaScript	O(n)	O(n)	Explanation

| 56 | Merge Intervals | Python | O(n) | O(n) | Explanation |

| 57 | Insert Interval | Python | O(n) | O(n) | Explanation |

| 435 | Non-overlapping Intervals | JavaScript | O(n) | O(n) | Explanation |

| 436 | Find Right Interval | JavaScript | O(n) | O(n) | Explanation |

| 986 | Interval List Intersections | Python | O(n) | O(n) | Explanation |

Hard

#	Problem	Language	Time	Space	Explanation
68	Text Justification	Python	O(n)	O(n)	Explanation

| 352 | Data Stream as Disjoint Intervals | Python | O(n) | O(n) | Explanation |

| 1520 | Maximum Number of Non-Overlapping Substrings | JavaScript | O(n) | O(n) | Explanation |

| 1851 | Minimum Interval to Include Each Query | Python | O(n) | O(n) | Explanation |

| 3414 | Maximum Score of Non-overlapping Intervals | JavaScript | O(n) | O(n) | Explanation |