# array problem or interval

- [163. Missing Ranges](/cracking-leetcode/array_problem/163.-missing-ranges.md)
- [1441. Build an Array With Stack Operations](/cracking-leetcode/array_problem/1441.-build-an-array-with-stack-operations.md)
- [12. Integer to Roman](/cracking-leetcode/array_problem/12.-integer-to-roman.md)
- [2373. Largest Local Values in a Matrix](/cracking-leetcode/array_problem/2373.-largest-local-values-in-a-matrix.md)
- [54. Spiral Matrix](/cracking-leetcode/array_problem/54.-spiral-matrix.md)
- [59. Spiral Matrix II](/cracking-leetcode/array_problem/59.-spiral-matrix-ii.md)
- [2326. Spiral Matrix IV](/cracking-leetcode/array_problem/2326.-spiral-matrix-iv.md)
- [498. Diagonal Traverse](/cracking-leetcode/array_problem/498.-diagonal-traverse.md)
- [56. Merge Intervals](/cracking-leetcode/array_problem/56.-merge-intervals.md)
- [57. Insert Interval](/cracking-leetcode/array_problem/57.-insert-interval.md)
- [31. Next Permutation](/cracking-leetcode/array_problem/31.-next-permutation.md)
- [556. Next Greater Element III](/cracking-leetcode/array_problem/556.-next-greater-element-iii.md)
- [121. Best Time to Buy and Sell Stock](/cracking-leetcode/array_problem/121.-best-time-to-buy-and-sell-stock.md)
- [217. Contains Duplicate](/cracking-leetcode/array_problem/217.-contains-duplicate.md)
- [219. Contains Duplicate II](/cracking-leetcode/array_problem/219.-contains-duplicate-ii.md)
- [253. Meeting Rooms II](/cracking-leetcode/array_problem/253.-meeting-rooms-ii.md)
- [(similar to 253 )2406. Divide Intervals Into Minimum Number of Groups](/cracking-leetcode/array_problem/similar-to-253-2406.-divide-intervals-into-minimum-number-of-groups.md)
- [lintcode - 1897 · Meeting Room III](/cracking-leetcode/array_problem/lintcode-1897-meeting-room-iii.md)
- [2402. Meeting Rooms III](/cracking-leetcode/array_problem/2402.-meeting-rooms-iii.md)
- [436. Find Right Interval](/cracking-leetcode/array_problem/436.-find-right-interval.md)
- [1272. Remove Interval](/cracking-leetcode/array_problem/1272.-remove-interval.md)
- [1288. Remove Covered Intervals](/cracking-leetcode/array_problem/1288.-remove-covered-intervals.md)
- [729. My Calendar I](/cracking-leetcode/array_problem/729.-my-calendar-i.md)
- [(sort by end)find Max Non-overlapping interval](/cracking-leetcode/array_problem/sort-by-end-find-max-non-overlapping-interval.md)
- [435. Non-overlapping Intervals](/cracking-leetcode/array_problem/sort-by-end-find-max-non-overlapping-interval/435.-non-overlapping-intervals.md)
- [422. Valid Word Square](/cracking-leetcode/array_problem/422.-valid-word-square.md)
- [900. RLE Iterator](/cracking-leetcode/array_problem/900.-rle-iterator.md)
- [sweep line](/cracking-leetcode/array_problem/sweep-line.md)
- [3355. Zero Array Transformation I](/cracking-leetcode/array_problem/sweep-line/3355.-zero-array-transformation-i.md)
- [3356. Zero Array Transformation II](/cracking-leetcode/array_problem/sweep-line/3356.-zero-array-transformation-ii.md)
- [3346. Maximum Frequency of an Element After Performing Operations I & II](/cracking-leetcode/array_problem/sweep-line/3346.-maximum-frequency-of-an-element-after-performing-operations-i-and-ii.md)
- [759. Employee Free Time](/cracking-leetcode/array_problem/sweep-line/759.-employee-free-time.md)
- [253. Meeting Rooms II](/cracking-leetcode/array_problem/sweep-line/253.-meeting-rooms-ii.md)
- [1094. Car Pooling](/cracking-leetcode/array_problem/sweep-line/1094.-car-pooling.md)
- [56. Merge Interval](/cracking-leetcode/array_problem/sweep-line/56.-merge-interval.md)
- [729. My Calendar I](/cracking-leetcode/array_problem/sweep-line/729.-my-calendar-i.md)
- [731. My Calendar II](/cracking-leetcode/array_problem/sweep-line/731.-my-calendar-ii.md)
- [732. My Calendar III](/cracking-leetcode/array_problem/sweep-line/732.-my-calendar-iii.md)
- [2018. Check if Word Can Be Placed In Crossword](/cracking-leetcode/array_problem/2018.-check-if-word-can-be-placed-in-crossword.md)
- [2158. Amount of New Area Painted Each Day](/cracking-leetcode/array_problem/2158.-amount-of-new-area-painted-each-day.md)
- [2345. Finding the Number of Visible Mountains](/cracking-leetcode/array_problem/2345.-finding-the-number-of-visible-mountains.md)