Skip to content

INDEX.md

Latest commit

 

History

History
242 lines (233 loc) · 62.6 KB

INDEX.md

File metadata and controls

242 lines (233 loc) · 62.6 KB
Raw

📑 Master LeetCode Problem Index

Comprehensive index of all solved LeetCode problems, categorized by topic, difficulty, and algorithmic complexities.

📊 Summary Statistics

Total Solved 🟢 Easy 🟡 Medium 🔴 Hard
204 3 1 200

🗂️ Problem Catalog

| # | Title | Difficulty | Primary Topic | Time Complexity | Space Complexity | Solution | Notes | | :---: | :--- | :---: | :--- | :---: | :---: | :--- | :---: | :--- |

| 0001 | Two Sum | Easy | Arrays & Hashing | $\mathcal{O}(N)$ | $\mathcal{O}(N)$ | C++ | Notes | | 0004 | Median of Two Sorted Arrays | Hard | Binary Search | $\mathcal{O}(\log(\min(M, N)))$ | $\mathcal{O}(1)$ | C++ | Notes | | 0010 | Regular Expression Matching | Hard | Dynamic Programming | $\mathcal{O}(M \cdot N)$ | $\mathcal{O}(M \cdot N)$ | C++ | Notes | | 0020 | Valid Parentheses | Easy | Stack & Queue | $\mathcal{O}(N)$ | $\mathcal{O}(N)$ | C++ | Notes | | 0023 | Merge k Sorted Lists | Hard | Linked List | $\mathcal{O}(N \log K)$ | $\mathcal{O}(K)$ | C++ | Notes | | 0025 | Reverse Nodes in k-Group | Hard | Linked List | $\mathcal{O}(N)$ | $\mathcal{O}(1)$ | C++ | Notes | | 0030 | Substring with Concatenation of All Words | Hard | Sliding Window | $\mathcal{O}(N \cdot L)$ | $\mathcal{O}(K \cdot L)$ | C++ | Notes | | 0032 | Longest Valid Parentheses | Hard | Stack & Queue | $\mathcal{O}(N)$ | $\mathcal{O}(N)$ | C++ | Notes | | 0037 | Sudoku Solver | Hard | Backtracking | $\mathcal{O}(9^M)$ (MRV pruned) | $\mathcal{O}(1)$ | C++ | Notes | | 0041 | First Missing Positive | Hard | Arrays & Hashing | $\mathcal{O}(N)$ | $\mathcal{O}(1)$ | C++ | Notes | | 0042 | Trapping Rain Water | Hard | Two Pointers | $\mathcal{O}(N)$ | $\mathcal{O}(1)$ | C++ | Notes | | 0044 | Wildcard Matching | Hard | Dynamic Programming | $\mathcal{O}(M \cdot N)$ worst / $\mathcal{O}(M + N)$ | $\mathcal{O}(1)$ | C++ | Notes | | 0051 | N-Queens | Hard | Backtracking | $\mathcal{O}(N!)$ | $\mathcal{O}(N^2)$ | C++ | Notes | | 0052 | N-Queens II | Hard | Backtracking | $\mathcal{O}(N!)$ | $\mathcal{O}(N)$ | C++ | Notes | | 0056 | Merge Intervals | Medium | Intervals | $\mathcal{O}(N \log N)$ | $\mathcal{O}(\log N)$ | C++ | Notes | | 0060 | Permutation Sequence | Hard | Math & Geometry | $\mathcal{O}(N^2)$ | $\mathcal{O}(N)$ | C++ | Notes | | 0065 | Valid Number | Hard | Math & Geometry | $\mathcal{O}(N)$ | $\mathcal{O}(1)$ | C++ | Notes | | 0068 | Text Justification | Hard | Greedy | $\mathcal{O}(N)$ | $\mathcal{O}(N)$ | C++ | Notes | | 0076 | Minimum Window Substring | Hard | Sliding Window | $\mathcal{O}(M + N)$ | $\mathcal{O}(1)$ | C++ | Notes | | 0084 | Largest Rectangle in Histogram | Hard | Stack & Queue | $\mathcal{O}(N)$ | $\mathcal{O}(N)$ | C++ | Notes | | 0085 | Maximal Rectangle | Hard | Stack & Queue | $\mathcal{O}(R \cdot C)$ | $\mathcal{O}(C)$ | C++ | Notes | | 0087 | Scramble String | Hard | Dynamic Programming | $\mathcal{O}(N^4)$ | $\mathcal{O}(N^3)$ | C++ | Notes | | 0115 | Distinct Subsequences | Hard | Dynamic Programming | $\mathcal{O}(M \cdot N)$ | $\mathcal{O}(N)$ | C++ | Notes | | 0123 | Best Time to Buy and Sell Stock III | Hard | Dynamic Programming | $\mathcal{O}(N)$ | $\mathcal{O}(1)$ | C++ | Notes | | 0124 | Binary Tree Maximum Path Sum | Hard | Trees & BST | $\mathcal{O}(N)$ | $\mathcal{O}(H)$ | C++ | Notes | | 0126 | Word Ladder II | Hard | Graphs | $\mathcal{O}(N \cdot L \cdot 26 + K \cdot L)$ | $\mathcal{O}(N \cdot L)$ | C++ | Notes | | 0127 | Word Ladder | Hard | Graphs | $\mathcal{O}(N \cdot L \cdot 26)$ | $\mathcal{O}(N \cdot L)$ | C++ | Notes | | 0132 | Palindrome Partitioning II | Hard | Dynamic Programming | $\mathcal{O}(N^2)$ | $\mathcal{O}(N)$ | C++ | Notes | | 0135 | Candy | Hard | Greedy | $\mathcal{O}(N)$ | $\mathcal{O}(N)$ | C++ | Notes | | 0140 | Word Break II | Hard | Backtracking | $\mathcal{O}(2^N + N^2 + W)$ | $\mathcal{O}(2^N \cdot N + W)$ | C++ | Notes | | 0149 | Max Points on a Line | Hard | Math & Geometry | $\mathcal{O}(N^2 \log(\max(\text{coord})))$ | $\mathcal{O}(N)$ | C++ | Notes | | 0154 | Find Minimum in Rotated Sorted Array II | Hard | Binary Search | $\mathcal{O}(\log N)$ avg / $\mathcal{O}(N)$ | $\mathcal{O}(1)$ | C++ | Notes | | 0174 | Dungeon Game | Hard | Dynamic Programming | $\mathcal{O}(M \cdot N)$ | $\mathcal{O}(N)$ | C++ | Notes | | 0185 | Department Top Three Salaries | Hard | Arrays & Hashing | $\mathcal{O}(N \log N)$ | $\mathcal{O}(N)$ | SQL / C++ | Notes | | 0188 | Best Time to Buy and Sell Stock IV | Hard | Dynamic Programming | $\mathcal{O}(N \cdot k)$ | $\mathcal{O}(k)$ | C++ | Notes | | 0212 | Word Search II | Hard | Backtracking | $\mathcal{O}(M \cdot N \cdot 3^L + W \cdot L)$ | $\mathcal{O}(W \cdot L)$ | C++ | Notes | | 0214 | Shortest Palindrome | Hard | Sliding Window | $\mathcal{O}(N)$ | $\mathcal{O}(N)$ | C++ | Notes | | 0218 | The Skyline Problem | Hard | Heaps & Priority Queues | $\mathcal{O}(N \log N)$ | $\mathcal{O}(N)$ | C++ | Notes | | 0220 | Contains Duplicate III | Hard | Sliding Window | $\mathcal{O}(N)$ | $\mathcal{O}(\min(N, K))$ | C++ | Notes | | 0224 | Basic Calculator | Hard | Stack & Queue | $\mathcal{O}(N)$ | $\mathcal{O}(N)$ | C++ | Notes | | 0233 | Number of Digit One | Hard | Math & Geometry | $\mathcal{O}(\log_{10} N)$ | $\mathcal{O}(1)$ | C++ | Notes | | 0239 | Sliding Window Maximum | Hard | Sliding Window | $\mathcal{O}(N)$ | $\mathcal{O}(K)$ | C++ | Notes | | 0262 | Trips and Users | Hard | Arrays & Hashing | $\mathcal{O}(T + U)$ | $\mathcal{O}(U + D)$ | SQL / C++ | Notes | | 0273 | Integer to English Words | Hard | Math & Geometry | $\mathcal{O}(1)$ | $\mathcal{O}(1)$ | C++ | Notes | | 0282 | Expression Add Operators | Hard | Backtracking | $\mathcal{O}(4^N)$ | $\mathcal{O}(N)$ | C++ | Notes | | 0295 | Find Median from Data Stream | Hard | Heaps & Priority Queues | $\mathcal{O}(\log N) \text{ add}, \mathcal{O}(1) \text{ query}$ | $\mathcal{O}(N)$ | C++ | Notes | | 0297 | Serialize and Deserialize Binary Tree | Hard | Trees & BST | $\mathcal{O}(N)$ | $\mathcal{O}(N)$ | C++ | Notes | | 0301 | Remove Invalid Parentheses | Hard | Backtracking | $\mathcal{O}(2^N)$ | $\mathcal{O}(N)$ | C++ | Notes | | 0312 | Burst Balloons | Hard | Dynamic Programming | $\mathcal{O}(N^3)$ | $\mathcal{O}(N^2)$ | C++ | Notes | | 0315 | Count of Smaller Numbers After Self | Hard | Binary Search | $\mathcal{O}(N \log N)$ | $\mathcal{O}(N)$ | C++ | Notes | | 0321 | Create Maximum Number | Hard | Stack & Queue | $\mathcal{O}(k(m + n + k^2))$ | $\mathcal{O}(k)$ | C++ | Notes | | 0327 | Count of Range Sum | Hard | Binary Search | $\mathcal{O}(N \log N)$ | $\mathcal{O}(N)$ | C++ | Notes | | 0329 | Longest Increasing Path in a Matrix | Hard | Dynamic Programming | $\mathcal{O}(M \cdot N)$ | $\mathcal{O}(M \cdot N)$ | C++ | Notes | | 0330 | Patching Array | Hard | Greedy | $\mathcal{O}(M + \log N)$ | $\mathcal{O}(1)$ | C++ | Notes | | 0332 | Reconstruct Itinerary | Hard | Graphs | $\mathcal{O}(E \log E)$ | $\mathcal{O}(V + E)$ | C++ | Notes | | 0335 | Self Crossing | Hard | Math & Geometry | $\mathcal{O}(N)$ | $\mathcal{O}(1)$ | C++ | Notes | | 0336 | Palindrome Pairs | Hard | Arrays & Hashing | $\mathcal{O}(\sum L_i^2)$ | $\mathcal{O}(N \cdot L)$ | C++ | Notes | | 0352 | Data Stream as Disjoint Intervals | Hard | Intervals | $\mathcal{O}(\log K) \text{ add}, \mathcal{O}(K) \text{ get}$ | $\mathcal{O}(K)$ | C++ | Notes | | 0354 | Russian Doll Envelopes | Hard | Dynamic Programming | $\mathcal{O}(N \log N)$ | $\mathcal{O}(N)$ | C++ | Notes | | 0363 | Max Sum of Rectangle No Larger Than K | Hard | Binary Search | $\mathcal{O}(\min(m,n)^2 \cdot \max(m,n) \cdot \log)$ | $\mathcal{O}(\max(m,n))$ | C++ | Notes | | 0381 | Insert Delete GetRandom O(1) - Duplicates allowed | Hard | Arrays & Hashing | $\mathcal{O}(1)$ avg | $\mathcal{O}(N)$ | C++ | Notes | | 0391 | Perfect Rectangle | Hard | Math & Geometry | $\mathcal{O}(N \log N)$ | $\mathcal{O}(N)$ | C++ | Notes | | 0403 | Frog Jump | Hard | Dynamic Programming | $\mathcal{O}(N^2)$ | $\mathcal{O}(N^2)$ | C++ | Notes | | 0407 | Trapping Rain Water II | Hard | Heaps / Priority Queue | $\mathcal{O}(M \cdot N \log(M \cdot N))$ | $\mathcal{O}(M \cdot N)$ | C++ | Notes | | 0410 | Split Array Largest Sum | Hard | Binary Search | $\mathcal{O}(N \log(\sum \text{nums}))$ | $\mathcal{O}(1)$ | C++ | Notes | | 0420 | Strong Password Checker | Hard | Greedy | $\mathcal{O}(N)$ | $\mathcal{O}(N)$ | C++ | Notes | | 0432 | [All Oone Data Structure](solutions/0432-all-oone-data-structure/README.md) | Hard| [Linked List](topics/linked-list.md) | $\mathcal{O}(1) \text{ all ops}$ | $\mathcal{O}(N)$ | [C++](solutions/0432-all-oone-data-structure/solution.cpp) | [Notes](topics/linked-list.md#solved-problems) | | 0440 | [K-th Smallest in Lexicographical Order](solutions/0440-k-th-smallest-in-lexicographical-order/README.md) |Hard| [Trees & BST](topics/trees.md) | $\mathcal{O}((\log_{10} N)^2)$ | $\mathcal{O}(1)$ | [C++](solutions/0440-k-th-smallest-in-lexicographical-order/solution.cpp) | [Notes](topics/trees.md#solved-problems) | | 0446 | [Arithmetic Slices II - Subsequence](solutions/0446-arithmetic-slices-ii-subsequence/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(N^2)$ | $\mathcal{O}(N^2)$ | [C++](solutions/0446-arithmetic-slices-ii-subsequence/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 0458 | [Poor Pigs](solutions/0458-poor-pigs/README.md) |Hard| [Math & Geometry](topics/math-and-geometry.md) | $\mathcal{O}(\log_{T+1} N)$ | $\mathcal{O}(1)$ | [C++](solutions/0458-poor-pigs/solution.cpp) | [Notes](topics/math-and-geometry.md#solved-problems) | | 0460 | [LFU Cache](solutions/0460-lfu-cache/README.md) |Hard| [Linked List](topics/linked-list.md) | $\mathcal{O}(1) \text{ all ops}$ | $\mathcal{O}(\text{capacity})$ | [C++](solutions/0460-lfu-cache/solution.cpp) | [Notes](topics/linked-list.md#solved-problems) | | 0466 | [Count The Repetitions](solutions/0466-count-the-repetitions/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(|s_1| \cdot |s_2|)$ | $\mathcal{O}(|s_2|)$ | [C++](solutions/0466-count-the-repetitions/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 0472 | [Concatenated Words](solutions/0472-concatenated-words/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(N \log N + N \cdot L^3)$ | $\mathcal{O}(\sum |W_i|)$ | [C++](solutions/0472-concatenated-words/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 0479 | [Largest Palindrome Product](solutions/0479-largest-palindrome-product/README.md) |Hard| [Math & Geometry](topics/math-and-geometry.md) | $\mathcal{O}(10^N)$ | $\mathcal{O}(1)$ | [C++](solutions/0479-largest-palindrome-product/solution.cpp) | [Notes](topics/math-and-geometry.md#solved-problems) | | 0480 | [Sliding Window Median](solutions/0480-sliding-window-median/README.md) |Hard| [Sliding Window](topics/sliding-window.md) | $\mathcal{O}(N \log k)$ | $\mathcal{O}(N)$ | [C++](solutions/0480-sliding-window-median/solution.cpp) | [Notes](topics/sliding-window.md#solved-problems) | | 0483 | [Smallest Good Base](solutions/0483-smallest-good-base/README.md) |Hard| [Math & Geometry](topics/math-and-geometry.md) | $\mathcal{O}((\log_2 N)^2)$ | $\mathcal{O}(1)$ | [C++](solutions/0483-smallest-good-base/solution.cpp) | [Notes](topics/math-and-geometry.md#solved-problems) | | 0488 | [Zuma Game](solutions/0488-zuma-game/README.md) |Hard| [Backtracking](topics/backtracking.md) | $\mathcal{O}(V \cdot B \cdot H)$ | $\mathcal{O}(V \cdot (B + H))$ | [C++](solutions/0488-zuma-game/solution.cpp) | [Notes](topics/backtracking.md#solved-problems) | | 0493 | [Reverse Pairs](solutions/0493-reverse-pairs/README.md) |Hard| [Binary Search](topics/binary-search.md) | $\mathcal{O}(N \log N)$ | $\mathcal{O}(N)$ | [C++](solutions/0493-reverse-pairs/solution.cpp) | [Notes](topics/binary-search.md#solved-problems) | | 0502 | [IPO](solutions/0502-ipo/README.md) |Hard| [Greedy](topics/greedy.md) | $\mathcal{O}(N \log N + k \log N)$ | $\mathcal{O}(N)$ | [C++](solutions/0502-ipo/solution.cpp) | [Notes](topics/greedy.md#solved-problems) | | 0514 | [Freedom Trail](solutions/0514-freedom-trail/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(K \cdot R^2)$ | $\mathcal{O}(R)$ | [C++](solutions/0514-freedom-trail/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 0517 | [Super Washing Machines](solutions/0517-super-washing-machines/README.md) |Hard| [Greedy](topics/greedy.md) | $\mathcal{O}(N)$ | $\mathcal{O}(1)$ | [C++](solutions/0517-super-washing-machines/solution.cpp) | [Notes](topics/greedy.md#solved-problems) | | 0546 | [Remove Boxes](solutions/0546-remove-boxes/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(N^4)$ | $\mathcal{O}(N^3)$ | [C++](solutions/0546-remove-boxes/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 0552 | [Student Attendance Record II](solutions/0552-student-attendance-record-ii/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(N)$ | $\mathcal{O}(1)$ | [C++](solutions/0552-student-attendance-record-ii/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 0564 | [Find the Closest Palindrome](solutions/0564-find-the-closest-palindrome/README.md) |Hard| [Math & Geometry](topics/math-and-geometry.md) | $\mathcal{O}(L)$ | $\mathcal{O}(L)$ | [C++](solutions/0564-find-the-closest-palindrome/solution.cpp) | [Notes](topics/math-and-geometry.md#solved-problems) | | 0587 | [Erect the Fence](solutions/0587-erect-the-fence/README.md) |Hard| [Math & Geometry](topics/math-and-geometry.md) | $\mathcal{O}(N \log N)$ | $\mathcal{O}(N)$ | [C++](solutions/0587-erect-the-fence/solution.cpp) | [Notes](topics/math-and-geometry.md#solved-problems) | | 0591 | [Tag Validator](solutions/0591-tag-validator/README.md) |Hard| [Stack & Queue](topics/stack-and-queue.md) | $\mathcal{O}(N)$ | $\mathcal{O}(N)$ | [C++](solutions/0591-tag-validator/solution.cpp) | [Notes](topics/stack-and-queue.md#solved-problems) | | 0600 | [Non-negative Integers without Consecutive Ones](solutions/0600-non-negative-integers-without-consecutive-ones/README.md) |Hard| [Bit Manipulation](topics/bit-manipulation.md) | $\mathcal{O}(\log N)$ | $\mathcal{O}(1)$ | [C++](solutions/0600-non-negative-integers-without-consecutive-ones/solution.cpp) | [Notes](topics/bit-manipulation.md#solved-problems) | | 0601 | [Human Traffic of Stadium](solutions/0601-human-traffic-of-stadium/README.md) |Hard| [Arrays & Hashing](topics/arrays-and-hashing.md) | $\mathcal{O}(N)$ | $\mathcal{O}(N)$ | [SQL / C++](solutions/0601-human-traffic-of-stadium/solution.sql) | [Notes](topics/arrays-and-hashing.md#solved-problems) | | 0629 | [K Inverse Pairs Array](solutions/0629-k-inverse-pairs-array/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(N \cdot K)$ | $\mathcal{O}(K)$ | [C++](solutions/0629-k-inverse-pairs-array/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 0630 | [Course Schedule III](solutions/0630-course-schedule-iii/README.md) |Hard| [Greedy](topics/greedy.md), [Heaps / Priority Queue](topics/heaps-and-priority-queues.md) | $\mathcal{O}(N \log N)$ | $\mathcal{O}(N)$ | [C++](solutions/0630-course-schedule-iii/solution.cpp) | [Notes](topics/greedy.md#solved-problems) | | 0632 | [Smallest Range Covering Elements from K Lists](solutions/0632-smallest-range-covering-elements-from-k-lists/README.md) |Hard| [Sliding Window](topics/sliding-window.md), [Heaps / Priority Queue](topics/heaps-and-priority-queues.md) | $\mathcal{O}(N \log K)$ | $\mathcal{O}(K)$ | [C++](solutions/0632-smallest-range-covering-elements-from-k-lists/solution.cpp) | [Notes](topics/sliding-window.md#solved-problems) | | 0639 | [Decode Ways II](solutions/0639-decode-ways-ii/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(N)$ | $\mathcal{O}(1)$ | [C++](solutions/0639-decode-ways-ii/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 0664 | [Strange Printer](solutions/0664-strange-printer/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(N^3)$ | $\mathcal{O}(N^2)$ | [C++](solutions/0664-strange-printer/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 0668 | [Kth Smallest Number in Multiplication Table](solutions/0668-kth-smallest-number-in-multiplication-table/README.md) |Hard| [Binary Search](topics/binary-search.md), [Math & Geometry](topics/math-and-geometry.md) | $\mathcal{O}(\min(M, N) \cdot \log(M \cdot N))$ | $\mathcal{O}(1)$ | [C++](solutions/0668-kth-smallest-number-in-multiplication-table/solution.cpp) | [Notes](topics/binary-search.md#solved-problems) | | 0675 | [Cut Off Trees for Golf Event](solutions/0675-cut-off-trees-for-golf-event/README.md) |Hard| [Graphs](topics/graphs.md) | $\mathcal{O}(M^2 \cdot N^2)$ | $\mathcal{O}(M \cdot N)$ | [C++](solutions/0675-cut-off-trees-for-golf-event/solution.cpp) | [Notes](topics/graphs.md#solved-problems) | | 0679 | [24 Game](solutions/0679-24-game/README.md) |Hard| [Backtracking](topics/backtracking.md), [Math & Geometry](topics/math-and-geometry.md) | $\mathcal{O}(1)$ bounded | $\mathcal{O}(1)$ | [C++](solutions/0679-24-game/solution.cpp) | [Notes](topics/backtracking.md#solved-problems) | | 0685 | [Redundant Connection II](solutions/0685-redundant-connection-ii/README.md) |Hard| [Graphs](topics/graphs.md), [Trees & BST](topics/trees.md) | $\mathcal{O}(N \cdot \alpha(N))$ | $\mathcal{O}(N)$ | [C++](solutions/0685-redundant-connection-ii/solution.cpp) | [Notes](topics/graphs.md#solved-problems) | | 0689 | [Maximum Sum of 3 Non-Overlapping Subarrays](solutions/0689-maximum-sum-of-3-non-overlapping-subarrays/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md), [Arrays & Hashing](topics/arrays-and-hashing.md) | $\mathcal{O}(N)$ | $\mathcal{O}(N)$ | [C++](solutions/0689-maximum-sum-of-3-non-overlapping-subarrays/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 0691 | [Stickers to Spell Word](solutions/0691-stickers-to-spell-word/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md), [Bit Manipulation](topics/bit-manipulation.md) | $\mathcal{O}(2^T \cdot N \cdot T)$ | $\mathcal{O}(2^T)$ | [C++](solutions/0691-stickers-to-spell-word/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 0699 | [Falling Squares](solutions/0699-falling-squares/README.md) |Hard| [Intervals](topics/intervals.md) | $\mathcal{O}(N^2)$ | $\mathcal{O}(N)$ | [C++](solutions/0699-falling-squares/solution.cpp) | [Notes](topics/intervals.md#solved-problems) | | 0710 | [Random Pick with Blacklist](solutions/0710-random-pick-with-blacklist/README.md) |Hard| [Arrays & Hashing](topics/arrays-and-hashing.md), [Math & Geometry](topics/math-and-geometry.md) | $\mathcal{O}(1)$ pick | $\mathcal{O}(B)$ | [C++](solutions/0710-random-pick-with-blacklist/solution.cpp) | [Notes](topics/arrays-and-hashing.md#solved-problems) | | 0715 | [Range Module](solutions/0715-range-module/README.md) |Hard| [Intervals](topics/intervals.md) | $\mathcal{O}(N)$ amortized | $\mathcal{O}(N)$ | [C++](solutions/0715-range-module/solution.cpp) | [Notes](topics/intervals.md#solved-problems) | | 0719 | [Find K-th Smallest Pair Distance](solutions/0719-find-k-th-smallest-pair-distance/README.md) |Hard| [Binary Search](topics/binary-search.md), [Two Pointers](topics/two-pointers.md) | $\mathcal{O}(N \log N + N \log W)$ | $\mathcal{O}(1)$ | [C++](solutions/0719-find-k-th-smallest-pair-distance/solution.cpp) | [Notes](topics/binary-search.md#solved-problems) | | 0726 | [Number of Atoms](solutions/0726-number-of-atoms/README.md) |Hard| [Stack & Queue](topics/stack-and-queue.md) | $\mathcal{O}(N + K \log K)$ | $\mathcal{O}(N)$ | [C++](solutions/0726-number-of-atoms/solution.cpp) | [Notes](topics/stack-and-queue.md#solved-problems) | | 0730 | [Count Different Palindromic Subsequences](solutions/0730-count-different-palindromic-subsequences/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(N^2)$ | $\mathcal{O}(N^2)$ | [C++](solutions/0730-count-different-palindromic-subsequences/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 0732 | [My Calendar III](solutions/0732-my-calendar-iii/README.md) |Hard| [Intervals](topics/intervals.md) | $\mathcal{O}(N)$ per call | $\mathcal{O}(N)$ | [C++](solutions/0732-my-calendar-iii/solution.cpp) | [Notes](topics/intervals.md#solved-problems) | | 0736 | [Parse Lisp Expression](solutions/0736-parse-lisp-expression/README.md) |Hard| [Stack & Queue](topics/stack-and-queue.md) | $\mathcal{O}(N^2)$ | $\mathcal{O}(N)$ | [C++](solutions/0736-parse-lisp-expression/solution.cpp) | [Notes](topics/stack-and-queue.md#solved-problems) | | 0741 | [Cherry Pickup](solutions/0741-cherry-pickup/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(N^3)$ | $\mathcal{O}(N^2)$ | [C++](solutions/0741-cherry-pickup/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 0745 | [Prefix and Suffix Search](solutions/0745-prefix-and-suffix-search/README.md) |Hard| [Trees & BST](topics/trees.md) | $\mathcal{O}(L)$ query | $\mathcal{O}(N \cdot L^2)$ | [C++](solutions/0745-prefix-and-suffix-search/solution.cpp) | [Notes](topics/trees.md#solved-problems) | | 0749 | [Contain Virus](solutions/0749-contain-virus/README.md) |Hard| [Graphs](topics/graphs.md) | $\mathcal{O}((M \cdot N)^2)$ | $\mathcal{O}(M \cdot N)$ | [C++](solutions/0749-contain-virus/solution.cpp) | [Notes](topics/graphs.md#solved-problems) | | 0753 | [Cracking the Safe](solutions/0753-cracking-the-safe/README.md) |Hard| [Graphs](topics/graphs.md) | $\mathcal{O}(k^n)$ | $\mathcal{O}(k^n)$ | [C++](solutions/0753-cracking-the-safe/solution.cpp) | [Notes](topics/graphs.md#solved-problems) | | 0757 | [Set Intersection Size At Least Two](solutions/0757-set-intersection-size-at-least-two/README.md) |Hard| [Intervals](topics/intervals.md) | $\mathcal{O}(N \log N)$ | $\mathcal{O}(1)$ | [C++](solutions/0757-set-intersection-size-at-least-two/solution.cpp) | [Notes](topics/intervals.md#solved-problems) | | 0761 | [Special Binary String](solutions/0761-special-binary-string/README.md) |Hard| [Stack & Queue](topics/stack-and-queue.md) | $\mathcal{O}(N^2)$ | $\mathcal{O}(N)$ | [C++](solutions/0761-special-binary-string/solution.cpp) | [Notes](topics/stack-and-queue.md#solved-problems) | | 0765 | [Couples Holding Hands](solutions/0765-couples-holding-hands/README.md) |Hard| [Graphs](topics/graphs.md) | $\mathcal{O}(N)$ | $\mathcal{O}(N)$ | [C++](solutions/0765-couples-holding-hands/solution.cpp) | [Notes](topics/graphs.md#solved-problems) | | 0768 | [Max Chunks To Make Sorted II](solutions/0768-max-chunks-to-make-sorted-ii/README.md) |Hard| [Arrays & Hashing](topics/arrays-and-hashing.md) | $\mathcal{O}(N)$ | $\mathcal{O}(N)$ | [C++](solutions/0768-max-chunks-to-make-sorted-ii/solution.cpp) | [Notes](topics/arrays-and-hashing.md#solved-problems) | | 0770 | [Basic Calculator IV](solutions/0770-basic-calculator-iv/README.md) |Hard| [Stack & Queue](topics/stack-and-queue.md) | $\mathcal{O}(2^N)$ | $\mathcal{O}(2^N)$ | [C++](solutions/0770-basic-calculator-iv/solution.cpp) | [Notes](topics/stack-and-queue.md#solved-problems) | | 0773 | [Sliding Puzzle](solutions/0773-sliding-puzzle/README.md) |Hard| [Graphs](topics/graphs.md) | $\mathcal{O}(1)$ | $\mathcal{O}(1)$ | [C++](solutions/0773-sliding-puzzle/solution.cpp) | [Notes](topics/graphs.md#solved-problems) | | 0778 | [Swim in Rising Water](solutions/0778-swim-in-rising-water/README.md) |Hard| [Heaps & Priority Queues](topics/heaps-and-priority-queues.md) | $\mathcal{O}(N^2 \log N)$ | $\mathcal{O}(N^2)$ | [C++](solutions/0778-swim-in-rising-water/solution.cpp) | [Notes](topics/heaps-and-priority-queues.md#solved-problems) | | 0780 | [Reaching Points](solutions/0780-reaching-points/README.md) |Hard| [Math & Geometry](topics/math-and-geometry.md) | $\mathcal{O}(\log(\max(tx, ty)))$ | $\mathcal{O}(1)$ | [C++](solutions/0780-reaching-points/solution.cpp) | [Notes](topics/math-and-geometry.md#solved-problems) | | 0782 | [Transform to Chessboard](solutions/0782-transform-to-chessboard/README.md) |Hard| [Math & Geometry](topics/math-and-geometry.md) | $\mathcal{O}(N^2)$ | $\mathcal{O}(1)$ | [C++](solutions/0782-transform-to-chessboard/solution.cpp) | [Notes](topics/math-and-geometry.md#solved-problems) | | 0793 | [Preimage Size of Factorial Zeroes Function](solutions/0793-preimage-size-of-factorial-zeroes-function/README.md) |Hard| [Binary Search](topics/binary-search.md) | $\mathcal{O}(\log^2 K)$ | $\mathcal{O}(1)$ | [C++](solutions/0793-preimage-size-of-factorial-zeroes-function/solution.cpp) | [Notes](topics/binary-search.md#solved-problems) | | 0798 | [Smallest Rotation with Highest Score](solutions/0798-smallest-rotation-with-highest-score/README.md) |Hard| [Arrays & Hashing](topics/arrays-and-hashing.md) | $\mathcal{O}(N)$ | $\mathcal{O}(N)$ | [C++](solutions/0798-smallest-rotation-with-highest-score/solution.cpp) | [Notes](topics/arrays-and-hashing.md#solved-problems) | | 0801 | [Minimum Swaps To Make Sequences Increasing](solutions/0801-minimum-swaps-to-make-sequences-increasing/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(N)$ | $\mathcal{O}(1)$ | [C++](solutions/0801-minimum-swaps-to-make-sequences-increasing/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 0803 | [Bricks Falling When Hit](solutions/0803-bricks-falling-when-hit/README.md) |Hard| [Graphs](topics/graphs.md) | $\mathcal{O}(MN + H\alpha(MN))$ | $\mathcal{O}(MN)$ | [C++](solutions/0803-bricks-falling-when-hit/solution.cpp) | [Notes](topics/graphs.md#solved-problems) | | 0805 | [Split Array With Same Average](solutions/0805-split-array-with-same-average/README.md) |Hard| [Arrays & Hashing](topics/arrays-and-hashing.md) | $\mathcal{O}(2^{N/2} \log(2^{N/2}))$ | $\mathcal{O}(2^{N/2})$ | [C++](solutions/0805-split-array-with-same-average/solution.cpp) | [Notes](topics/arrays-and-hashing.md#solved-problems) | | 0810 | [Chalkboard XOR Game](solutions/0810-chalkboard-xor-game/README.md) |Hard| [Bit Manipulation](topics/bit-manipulation.md) | $\mathcal{O}(N)$ | $\mathcal{O}(1)$ | [C++](solutions/0810-chalkboard-xor-game/solution.cpp) | [Notes](topics/bit-manipulation.md#solved-problems) | | 0815 | [Bus Routes](solutions/0815-bus-routes/README.md) |Hard| [Graphs](topics/graphs.md) | $\mathcal{O}(S)$ | $\mathcal{O}(S)$ | [C++](solutions/0815-bus-routes/solution.cpp) | [Notes](topics/graphs.md#solved-problems) | | 0818 | [Race Car](solutions/0818-race-car/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(T \log^2 T)$ | $\mathcal{O}(T)$ | [C++](solutions/0818-race-car/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 0827 | [Making A Large Island](solutions/0827-making-a-large-island/README.md) |Hard| [Graphs](topics/graphs.md) | $\mathcal{O}(N^2)$ | $\mathcal{O}(N^2)$ | [C++](solutions/0827-making-a-large-island/solution.cpp) | [Notes](topics/graphs.md#solved-problems) | | 0828 | [Count Unique Characters of All Substrings of a Given String](solutions/0828-count-unique-characters-of-all-substrings-of-a-given-string/README.md) |Hard| [Math & Geometry](topics/math-and-geometry.md) | $\mathcal{O}(N)$ | $\mathcal{O}(N)$ | [C++](solutions/0828-count-unique-characters-of-all-substrings-of-a-given-string/solution.cpp) | [Notes](topics/math-and-geometry.md#solved-problems) | | 0829 | [Consecutive Numbers Sum](solutions/0829-consecutive-numbers-sum/README.md) |Hard| [Math & Geometry](topics/math-and-geometry.md) | $\mathcal{O}(\sqrt{N})$ | $\mathcal{O}(1)$ | [C++](solutions/0829-consecutive-numbers-sum/solution.cpp) | [Notes](topics/math-and-geometry.md#solved-problems) | | 0834 | [Sum of Distances in Tree](solutions/0834-sum-of-distances-in-tree/README.md) |Hard| [Trees](topics/trees.md) | $\mathcal{O}(N)$ | $\mathcal{O}(N)$ | [C++](solutions/0834-sum-of-distances-in-tree/solution.cpp) | [Notes](topics/trees.md#solved-problems) | | 0839 | [Similar String Groups](solutions/0839-similar-string-groups/README.md) |Hard| [Graphs](topics/graphs.md) | $\mathcal{O}(N^2 \cdot L)$ | $\mathcal{O}(N)$ | [C++](solutions/0839-similar-string-groups/solution.cpp) | [Notes](topics/graphs.md#solved-problems) | | 0843 | [Guess the Word](solutions/0843-guess-the-word/README.md) |Hard| [Arrays & Hashing](topics/arrays-and-hashing.md) | $\mathcal{O}(N^2)$ | $\mathcal{O}(N)$ | [C++](solutions/0843-guess-the-word/solution.cpp) | [Notes](topics/arrays-and-hashing.md#solved-problems) | | 0847 | [Shortest Path Visiting All Nodes](solutions/0847-shortest-path-visiting-all-nodes/README.md) |Hard| [Graphs](topics/graphs.md) | $\mathcal{O}(N \cdot 2^N)$ | $\mathcal{O}(N \cdot 2^N)$ | [C++](solutions/0847-shortest-path-visiting-all-nodes/solution.cpp) | [Notes](topics/graphs.md#solved-problems) | | 0850 | [Rectangle Area II](solutions/0850-rectangle-area-ii/README.md) |Hard| [Math & Geometry](topics/math-and-geometry.md) | $\mathcal{O}(N^2 \log N)$ | $\mathcal{O}(N)$ | [C++](solutions/0850-rectangle-area-ii/solution.cpp) | [Notes](topics/math-and-geometry.md#solved-problems) | | 0854 | [K-Similar Strings](solutions/0854-k-similar-strings/README.md) |Hard| [Graphs](topics/graphs.md) | $\mathcal{O}(N \cdot 3^N)$ | $\mathcal{O}(3^N)$ | [C++](solutions/0854-k-similar-strings/solution.cpp) | [Notes](topics/graphs.md#solved-problems) | | 0857 | [Minimum Cost to Hire K Workers](solutions/0857-minimum-cost-to-hire-k-workers/README.md) |Hard| [Heaps & Priority Queues](topics/heaps-and-priority-queues.md) | $\mathcal{O}(N \log N)$ | $\mathcal{O}(N + K)$ | [C++](solutions/0857-minimum-cost-to-hire-k-workers/solution.cpp) | [Notes](topics/heaps-and-priority-queues.md#solved-problems) | | 0862 | [Shortest Subarray with Sum at Least K](solutions/0862-shortest-subarray-with-sum-at-least-k/README.md) |Hard| [Stack & Queue](topics/stack-and-queue.md) | $\mathcal{O}(N)$ | $\mathcal{O}(N)$ | [C++](solutions/0862-shortest-subarray-with-sum-at-least-k/solution.cpp) | [Notes](topics/stack-and-queue.md#solved-problems) | | 0864 | [Shortest Path to Get All Keys](solutions/0864-shortest-path-to-get-all-keys/README.md) |Hard| [Graphs](topics/graphs.md) | $\mathcal{O}(M \times N \times 2^K)$ | $\mathcal{O}(M \times N \times 2^K)$ | [C++](solutions/0864-shortest-path-to-get-all-keys/solution.cpp) | [Notes](topics/graphs.md#solved-problems) | | 0871 | [Minimum Number of Refueling Stops](solutions/0871-minimum-number-of-refueling-stops/README.md) |Hard| [Greedy](topics/greedy.md) | $\mathcal{O}(N \log N)$ | $\mathcal{O}(N)$ | [C++](solutions/0871-minimum-number-of-refueling-stops/solution.cpp) | [Notes](topics/greedy.md#solved-problems) | | 0878 | [Nth Magical Number](solutions/0878-nth-magical-number/README.md) |Hard| [Binary Search](topics/binary-search.md) | $\mathcal{O}(\log(N \cdot \min(A, B)))$ | $\mathcal{O}(1)$ | [C++](solutions/0878-nth-magical-number/solution.cpp) | [Notes](topics/binary-search.md#solved-problems) | | 0879 | [Profitable Schemes](solutions/0879-profitable-schemes/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(L \cdot N \cdot P)$ | $\mathcal{O}(N \cdot P)$ | [C++](solutions/0879-profitable-schemes/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 0882 | [Reachable Nodes In Subdivided Graph](solutions/0882-reachable-nodes-in-subdivided-graph/README.md) |Hard| [Graphs](topics/graphs.md) | $\mathcal{O}(E \log V)$ | $\mathcal{O}(E + V)$ | [C++](solutions/0882-reachable-nodes-in-subdivided-graph/solution.cpp) | [Notes](topics/graphs.md#solved-problems) | | 0887 | [Super Egg Drop](solutions/0887-super-egg-drop/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(K \cdot M)$ | $\mathcal{O}(K)$ | [C++](solutions/0887-super-egg-drop/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 0891 | [Sum of Subsequence Widths](solutions/0891-sum-of-subsequence-widths/README.md) |Hard| [Math](topics/math-and-geometry.md) | $\mathcal{O}(N \log N)$ | $\mathcal{O}(1)$ | [C++](solutions/0891-sum-of-subsequence-widths/solution.cpp) | [Notes](topics/math-and-geometry.md#solved-problems) | | 0895 | [Maximum Frequency Stack](solutions/0895-maximum-frequency-stack/README.md) |Hard| [Stack & Queue](topics/stack-and-queue.md) | $\mathcal{O}(1)$ | $\mathcal{O}(N)$ | [C++](solutions/0895-maximum-frequency-stack/solution.cpp) | [Notes](topics/stack-and-queue.md#solved-problems) | | 0899 | [Orderly Queue](solutions/0899-orderly-queue/README.md) |Hard| [Math](topics/math-and-geometry.md) | $\mathcal{O}(N \log N)$ | $\mathcal{O}(N)$ | [C++](solutions/0899-orderly-queue/solution.cpp) | [Notes](topics/math-and-geometry.md#solved-problems) | | 0902 | [Numbers At Most N Given Digit Set](solutions/0902-numbers-at-most-n-given-digit-set/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(\log N)$ | $\mathcal{O}(\log N)$ | [C++](solutions/0902-numbers-at-most-n-given-digit-set/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 0903 | [Valid Permutations for DI Sequence](solutions/0903-valid-permutations-for-di-sequence/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(N^2)$ | $\mathcal{O}(N)$ | [C++](solutions/0903-valid-permutations-for-di-sequence/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 0906 | [Super Palindromes](solutions/0906-super-palindromes/README.md) |Hard| [Math](topics/math-and-geometry.md) | $\mathcal{O}(W^{0.25} \log W)$ | $\mathcal{O}(\log W)$ | [C++](solutions/0906-super-palindromes/solution.cpp) | [Notes](topics/math-and-geometry.md#solved-problems) | | 0913 | [Cat and Mouse](solutions/0913-cat-and-mouse/README.md) |Hard| [Graphs](topics/graphs.md) | $\mathcal{O}(N^3)$ | $\mathcal{O}(N^2)$ | [C++](solutions/0913-cat-and-mouse/solution.cpp) | [Notes](topics/graphs.md#solved-problems) | | 0920 | [Number of Music Playlists](solutions/0920-number-of-music-playlists/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(N \cdot \text{goal})$ | $\mathcal{O}(N)$ | [C++](solutions/0920-number-of-music-playlists/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 0924 | [Minimize Malware Spread](solutions/0924-minimize-malware-spread/README.md) |Hard| [Graphs](topics/graphs.md) | $\mathcal{O}(N^2)$ | $\mathcal{O}(N)$ | [C++](solutions/0924-minimize-malware-spread/solution.cpp) | [Notes](topics/graphs.md#solved-problems) | | 0927 | [Three Equal Parts](solutions/0927-three-equal-parts/README.md) |Hard| [Math](topics/math-and-geometry.md) | $\mathcal{O}(N)$ | $\mathcal{O}(1)$ | [C++](solutions/0927-three-equal-parts/solution.cpp) | [Notes](topics/math-and-geometry.md#solved-problems) | | 0928 | [Minimize Malware Spread II](solutions/0928-minimize-malware-spread-ii/README.md) |Hard| [Graphs](topics/graphs.md) | $\mathcal{O}(N^2)$ | $\mathcal{O}(N)$ | [C++](solutions/0928-minimize-malware-spread-ii/solution.cpp) | [Notes](topics/graphs.md#solved-problems) | | 0936 | [Stamping The Sequence](solutions/0936-stamping-the-sequence/README.md) |Hard| [Greedy](topics/greedy.md) | $\mathcal{O}(N^2)$ | $\mathcal{O}(N)$ | [C++](solutions/0936-stamping-the-sequence/solution.cpp) | [Notes](topics/greedy.md#solved-problems) | | 0940 | [Distinct Subsequences II](solutions/0940-distinct-subsequences-ii/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(N)$ | $\mathcal{O}(1)$ | [C++](solutions/0940-distinct-subsequences-ii/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 0943 | [Find the Shortest Superstring](solutions/0943-find-the-shortest-superstring/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(N^2 \cdot 2^N)$ | $\mathcal{O}(N \cdot 2^N)$ | [C++](solutions/0943-find-the-shortest-superstring/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 0952 | [Largest Component Size by Common Factor](solutions/0952-largest-component-size-by-common-factor/README.md) |Hard| [Math](topics/math-and-geometry.md) | $\mathcal{O}(M \log \log M)$ | $\mathcal{O}(M)$ | [C++](solutions/0952-largest-component-size-by-common-factor/solution.cpp) | [Notes](topics/math-and-geometry.md#solved-problems) | | 0956 | [Tallest Billboard](solutions/0956-tallest-billboard/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(N \cdot S)$ | $\mathcal{O}(S)$ | [C++](solutions/0956-tallest-billboard/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 0960 | [Delete Columns to Make Sorted III](solutions/0960-delete-columns-to-make-sorted-iii/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(M^2 \cdot N)$ | $\mathcal{O}(M)$ | [C++](solutions/0960-delete-columns-to-make-sorted-iii/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 0964 | [Least Operators to Express Number](solutions/0964-least-operators-to-express-number/README.md) |Hard| [Math](topics/math-and-geometry.md) | $\mathcal{O}(\log_x(T))$ | $\mathcal{O}(\log_x(T))$ | [C++](solutions/0964-least-operators-to-express-number/solution.cpp) | [Notes](topics/math-and-geometry.md#solved-problems) | | 0968 | [Binary Tree Cameras](solutions/0968-binary-tree-cameras/README.md) |Hard| [Trees](topics/trees.md) | $\mathcal{O}(N)$ | $\mathcal{O}(H)$ | [C++](solutions/0968-binary-tree-cameras/solution.cpp) | [Notes](topics/trees.md#solved-problems) | | 0972 | [Equal Rational Numbers](solutions/0972-equal-rational-numbers/README.md) |Hard| [Math](topics/math-and-geometry.md) | $\mathcal{O}(L)$ | $\mathcal{O}(1)$ | [C++](solutions/0972-equal-rational-numbers/solution.cpp) | [Notes](topics/math-and-geometry.md#solved-problems) | | 0975 | [Odd Even Jump](solutions/0975-odd-even-jump/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(N \log N)$ | $\mathcal{O}(N)$ | [C++](solutions/0975-odd-even-jump/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 0980 | [Unique Paths III](solutions/0980-unique-paths-iii/README.md) |Hard| [Backtracking](topics/backtracking.md) | $\mathcal{O}(3^{MN})$ | $\mathcal{O}(MN)$ | [C++](solutions/0980-unique-paths-iii/solution.cpp) | [Notes](topics/backtracking.md#solved-problems) | | 0982 | [Triples with Bitwise AND Equal To Zero](solutions/0982-triples-with-bitwise-and-equal-to-zero/README.md) |Hard| [Bit Manipulation](topics/bit-manipulation.md) | $\mathcal{O}(N^2 + N \cdot 2^{16})$ | $\mathcal{O}(2^{16})$ | [C++](solutions/0982-triples-with-bitwise-and-equal-to-zero/solution.cpp) | [Notes](topics/bit-manipulation.md#solved-problems) | | 0987 | [Vertical Order Traversal of a Binary Tree](solutions/0987-vertical-order-traversal-of-a-binary-tree/README.md) |Hard| [Trees](topics/trees.md) | $\mathcal{O}(N \log N)$ | $\mathcal{O}(N)$ | [C++](solutions/0987-vertical-order-traversal-of-a-binary-tree/solution.cpp) | [Notes](topics/trees.md#solved-problems) | | 1301 | [Number of Paths with Max Score](solutions/1301-number-of-paths-with-max-score/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(N^2)$ | $\mathcal{O}(N^2)$ | [C++](solutions/1301-number-of-paths-with-max-score/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 1320 | [Minimum Distance to Type a Word Using Two Fingers](solutions/1320-minimum-distance-to-type-a-word-using-two-fingers/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(N \cdot \Sigma)$ | $\mathcal{O}(\Sigma)$ | [C++](solutions/1320-minimum-distance-to-type-a-word-using-two-fingers/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 1340 | [Jump Game V](solutions/1340-jump-game-v/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(N \cdot D)$ | $\mathcal{O}(N)$ | [C++](solutions/1340-jump-game-v/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 1345 | [Jump Game IV](solutions/1345-jump-game-iv/README.md) |Hard| [Graphs](topics/graphs.md) | $\mathcal{O}(N)$ | $\mathcal{O}(N)$ | [C++](solutions/1345-jump-game-iv/solution.cpp) | [Notes](topics/graphs.md#solved-problems) | | 1406 | [Stone Game III](solutions/1406-stone-game-iii/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(N)$ | $\mathcal{O}(1)$ | [C++](solutions/1406-stone-game-iii/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 1622 | [Fancy Sequence](solutions/1622-fancy-sequence/README.md) |Hard| [Math & Geometry](topics/math-and-geometry.md) | $\mathcal{O}(\log M) \text{ append}, \mathcal{O}(1) \text{ rest}$ | $\mathcal{O}(N)$ | [C++](solutions/1622-fancy-sequence/solution.cpp) | [Notes](topics/math-and-geometry.md#solved-problems) | | 1665 | [Minimum Initial Energy to Finish Tasks](solutions/1665-minimum-initial-energy-to-finish-tasks/README.md) |Hard| [Greedy](topics/greedy.md) | $\mathcal{O}(N \log N)$ | $\mathcal{O}(1)$ | [C++](solutions/1665-minimum-initial-energy-to-finish-tasks/solution.cpp) | [Notes](topics/greedy.md#solved-problems) | | 1840 | [Maximum Building Height](solutions/1840-maximum-building-height/README.md) |Hard| [Greedy](topics/greedy.md) | $\mathcal{O}(R \log R)$ | $\mathcal{O}(R)$ | [C++](solutions/1840-maximum-building-height/solution.cpp) | [Notes](topics/greedy.md#solved-problems) | | 1960 | [Maximum Product of the Length of Two Palindromic Substrings](solutions/1960-maximum-product-of-the-length-of-two-palindromic-substrings/README.md) |Hard| [Sliding Window](topics/sliding-window.md) | $\mathcal{O}(N)$ | $\mathcal{O}(N)$ | [C++](solutions/1960-maximum-product-of-the-length-of-two-palindromic-substrings/solution.cpp) | [Notes](topics/sliding-window.md#solved-problems) | | 2463 | [Minimum Total Distance Traveled](solutions/2463-minimum-total-distance-traveled/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(M \cdot N \cdot \min(N, \text{limit}))$ | $\mathcal{O}(N)$ | [C++](solutions/2463-minimum-total-distance-traveled/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 2573 | [Find the String with LCP](solutions/2573-find-the-string-with-lcp/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(N^2)$ | $\mathcal{O}(N^2)$ | [C++](solutions/2573-find-the-string-with-lcp/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 2751 | [Robot Collisions](solutions/2751-robot-collisions/README.md) |Hard| [Stack & Queue](topics/stack-and-queue.md) | $\mathcal{O}(N \log N)$ | $\mathcal{O}(N)$ | [C++](solutions/2751-robot-collisions/solution.cpp) | [Notes](topics/stack-and-queue.md#solved-problems) | | 2996 | [Smallest Missing Integer Greater Than Sequential Prefix Sum](solutions/2996-smallest-missing-integer-greater-than-sequential-prefix-sum/README.md) |Easy| [Arrays & Hashing](topics/arrays-and-hashing.md) | $\mathcal{O}(N)$ | $\mathcal{O}(N)$ | [C++](solutions/2996-smallest-missing-integer-greater-than-sequential-prefix-sum/solution.cpp) | [Notes](topics/arrays-and-hashing.md#solved-problems) | | 3093 | [Longest Common Suffix Queries](solutions/3093-longest-common-suffix-queries/README.md) |Hard| [Trees & BST](topics/trees.md) | $\mathcal{O}(\sum |W_c| + \sum |W_q|)$ | $\mathcal{O}(\sum |W_c| \cdot \Sigma)$ | [C++](solutions/3093-longest-common-suffix-queries/solution.cpp) | [Notes](topics/trees.md#solved-problems) | | 3161 | [Block Placement Queries](solutions/3161-block-placement-queries/README.md) |Hard| [Intervals](topics/intervals.md) | $\mathcal{O}(Q \log M)$ | $\mathcal{O}(M)$ | [C++](solutions/3161-block-placement-queries/solution.cpp) | [Notes](topics/intervals.md#solved-problems) | | 3225 | [Maximum Score From Grid Operations](solutions/3225-maximum-score-from-grid-operations/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(N^3)$ | $\mathcal{O}(N^2)$ | [C++](solutions/3225-maximum-score-from-grid-operations/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 3312 | [Sorted GCD Pair Queries](solutions/3312-sorted-gcd-pair-queries/README.md) |Hard| [Math & Geometry](topics/math-and-geometry.md) | $\mathcal{O}(N + M \log M + Q \log M)$ | $\mathcal{O}(M)$ | [C++](solutions/3312-sorted-gcd-pair-queries/solution.cpp) | [Notes](topics/math-and-geometry.md#solved-problems) | | 3336 | [Find the Number of Subsequences With Equal GCD](solutions/3336-find-the-number-of-subsequences-with-equal-gcd/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(N \cdot M^2)$ | $\mathcal{O}(M^2)$ | [C++](solutions/3336-find-the-number-of-subsequences-with-equal-gcd/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 3348 | [Smallest Divisible Digit Product II](solutions/3348-smallest-divisible-digit-product-ii/README.md) |Hard| [Greedy](topics/greedy.md) | $\mathcal{O}(N)$ | $\mathcal{O}(N)$ | [C++](solutions/3348-smallest-divisible-digit-product-ii/solution.cpp) | [Notes](topics/greedy.md#solved-problems) | | 3464 | [Maximize the Distance Between Points on a Square](solutions/3464-maximize-the-distance-between-points-on-a-square/README.md) |Hard| [Binary Search](topics/binary-search.md) | $\mathcal{O}(N \log N \log(\text{side}))$ | $\mathcal{O}(N)$ | [C++](solutions/3464-maximize-the-distance-between-points-on-a-square/solution.cpp) | [Notes](topics/binary-search.md#solved-problems) | | 3474 | [Lexicographically Smallest Generated String](solutions/3474-lexicographically-smallest-generated-string/README.md) |Hard| [Greedy](topics/greedy.md) | $\mathcal{O}(N \cdot M)$ | $\mathcal{O}(N + M)$ | [C++](solutions/3474-lexicographically-smallest-generated-string/solution.cpp) | [Notes](topics/greedy.md#solved-problems) | | 3501 | [Maximize Active Section with Trade II](solutions/3501-maximize-active-section-with-trade-ii/README.md) |Hard| [Binary Search](topics/binary-search.md) | $\mathcal{O}(N \log N + Q \log N)$ | $\mathcal{O}(N \log N)$ | [C++](solutions/3501-maximize-active-section-with-trade-ii/solution.cpp) | [Notes](topics/binary-search.md#solved-problems) | | 3518 | [Smallest Palindromic Rearrangement II](solutions/3518-smallest-palindromic-rearrangement-ii/README.md) |Hard| [Math & Geometry](topics/math-and-geometry.md) | $\mathcal{O}(N \log K)$ | $\mathcal{O}(N)$ | [C++](solutions/3518-smallest-palindromic-rearrangement-ii/solution.cpp) | [Notes](topics/math-and-geometry.md#solved-problems) | | 3534 | [Path Existence Queries in a Graph II](solutions/3534-path-existence-queries-in-a-graph-ii/README.md) |Hard| [Graphs](topics/graphs.md) | $\mathcal{O}(N \log N + Q \log N)$ | $\mathcal{O}(N \log N)$ | [C++](solutions/3534-path-existence-queries-in-a-graph-ii/solution.cpp) | [Notes](topics/graphs.md#solved-problems) | | 3548 | [Equal Sum Grid Partition II](solutions/3548-equal-sum-grid-partition-ii/README.md) |Hard| [Arrays & Hashing](topics/arrays-and-hashing.md) | $\mathcal{O}(M \cdot N)$ | $\mathcal{O}(M \cdot N)$ | [C++](solutions/3548-equal-sum-grid-partition-ii/solution.cpp) | [Notes](topics/arrays-and-hashing.md#solved-problems) | | 3559 | [Number of Ways to Assign Edge Weights II](solutions/3559-number-of-ways-to-assign-edge-weights-ii/README.md) |Hard| [Trees & BST](topics/trees.md) | $\mathcal{O}((N + Q) \log N)$ | $\mathcal{O}(N \log N)$ | [C++](solutions/3559-number-of-ways-to-assign-edge-weights-ii/solution.cpp) | [Notes](topics/trees.md#solved-problems) | | 3614 | [Process String with Special Operations II](solutions/3614-process-string-with-special-operations-ii/README.md) |Hard| [Stack & Queue](topics/stack-and-queue.md) | $\mathcal{O}(N)$ | $\mathcal{O}(N)$ | [C++](solutions/3614-process-string-with-special-operations-ii/solution.cpp) | [Notes](topics/stack-and-queue.md#solved-problems) | | 3620 | [Network Recovery Pathways](solutions/3620-network-recovery-pathways/README.md) |Hard| [Graphs](topics/graphs.md) | $\mathcal{O}((N + M) \log N \log M)$ | $\mathcal{O}(N + M)$ | [C++](solutions/3620-network-recovery-pathways/solution.cpp) | [Notes](topics/graphs.md#solved-problems) | | 3655 | [XOR After Range Multiplication Queries II](solutions/3655-xor-after-range-multiplication-queries-ii/README.md) |Hard| [Arrays & Hashing](topics/arrays-and-hashing.md) | $\mathcal{O}((N + Q)\sqrt{N})$ | $\mathcal{O}(N + Q)$ | [C++](solutions/3655-xor-after-range-multiplication-queries-ii/solution.cpp) | [Notes](topics/arrays-and-hashing.md#solved-problems) | | 3661 | [Maximum Walls Destroyed by Robots](solutions/3661-maximum-walls-destroyed-by-robots/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}((N + M) \log M + N \log N)$ | $\mathcal{O}(N)$ | [C++](solutions/3661-maximum-walls-destroyed-by-robots/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 3691 | [Maximum Total Subarray Value II](solutions/3691-maximum-total-subarray-value-ii/README.md) |Hard| [Heaps / Priority Queue](topics/heaps-and-priority-queues.md) | $\mathcal{O}((N + K) \log N)$ | $\mathcal{O}(N \log N)$ | [C++](solutions/3691-maximum-total-subarray-value-ii/solution.cpp) | [Notes](topics/heaps-and-priority-queues.md#solved-problems) | | 3699 | [Number of ZigZag Arrays I](solutions/3699-number-of-zigzag-arrays-i/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}(N \cdot M)$ | $\mathcal{O}(M)$ | [C++](solutions/3699-number-of-zigzag-arrays-i/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 3700 | [Number of ZigZag Arrays II](solutions/3700-number-of-zigzag-arrays-ii/README.md) |Hard| [Dynamic Programming](topics/dynamic-programming.md) | $\mathcal{O}((2M)^3 \log N)$ | $\mathcal{O}((2M)^2)$ | [C++](solutions/3700-number-of-zigzag-arrays-ii/solution.cpp) | [Notes](topics/dynamic-programming.md#solved-problems) | | 3739 | [Count Subarrays With Majority Element II](solutions/3739-count-subarrays-with-majority-element-ii/README.md) |Hard| [Arrays & Hashing](topics/arrays-and-hashing.md) | $\mathcal{O}(N)$ | $\mathcal{O}(N)$ | [C++](solutions/3739-count-subarrays-with-majority-element-ii/solution.cpp) | [Notes](topics/arrays-and-hashing.md#solved-problems) | | 3753 | [Total Waviness of Numbers in Range II](solutions/3753-total-waviness-of-numbers-in-range-ii/README.md) |Hard` | Dynamic Programming | $\mathcal{O}(D^3 \log_{10}(num_2))$ | $\mathcal{O}(D^2 \log_{10}(num_2))$ | C++ | Notes |

🎯 Topic Quick Links