Collection of LeetCode questions to ace the coding interview! - Created using LeetHub v3
| Problem Name | Difficulty |
|---|---|
| 1582-special-positions-in-a-binary-matrix | Easy |
| 1594-maximum-non-negative-product-in-a-matrix | Medium |
| 1727-largest-submatrix-with-rearrangements | Medium |
| 2906-construct-product-matrix | Medium |
| 3070-count-submatrices-with-top-left-element-and-sum-less-than-k | Medium |
| 3546-equal-sum-grid-partition-i | Medium |
| 3548-equal-sum-grid-partition-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 0139-word-break | Medium |
| 0518-coin-change-ii | Medium |
| 0646-maximum-length-of-pair-chain | Medium |
| 1143-longest-common-subsequence | Medium |
| 1420-build-array-where-you-can-find-the-maximum-exactly-k-comparisons | Hard |
| 1524-number-of-sub-arrays-with-odd-sum | Medium |
| 1594-maximum-non-negative-product-in-a-matrix | Medium |
| 1888-minimum-number-of-flips-to-make-the-binary-string-alternating | Medium |
| 2811-check-if-it-is-possible-to-split-array | Medium |
| 3592-inverse-coin-change | Medium |
| Problem Name | Difficulty |
|---|---|
| 1888-minimum-number-of-flips-to-make-the-binary-string-alternating | Medium |
| 2760-longest-even-odd-subarray-with-threshold | Easy |
| Problem Name | Difficulty |
|---|---|
| 1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n | Medium |
| 1980-find-unique-binary-string | Medium |
| Problem Name | Difficulty |
|---|---|
| 0559-maximum-depth-of-n-ary-tree | Easy |
| 0662-maximum-width-of-binary-tree | Medium |
| 0938-range-sum-of-bst | Easy |
| Problem Name | Difficulty |
|---|---|
| 0559-maximum-depth-of-n-ary-tree | Easy |
| 0662-maximum-width-of-binary-tree | Medium |
| 0938-range-sum-of-bst | Easy |
| 0947-most-stones-removed-with-same-row-or-column | Medium |
| 3419-minimize-the-maximum-edge-weight-of-graph | Medium |
| Problem Name | Difficulty |
|---|---|
| 0559-maximum-depth-of-n-ary-tree | Easy |
| 0662-maximum-width-of-binary-tree | Medium |
| 3419-minimize-the-maximum-edge-weight-of-graph | Medium |
| Problem Name | Difficulty |
|---|---|
| 0938-range-sum-of-bst | Easy |
| 3296-minimum-number-of-seconds-to-make-mountain-height-zero | Medium |
| 3419-minimize-the-maximum-edge-weight-of-graph | Medium |
| Problem Name | Difficulty |
|---|---|
| 0662-maximum-width-of-binary-tree | Medium |
| 0938-range-sum-of-bst | Easy |
| Problem Name | Difficulty |
|---|---|
| 1524-number-of-sub-arrays-with-odd-sum | Medium |
| 3296-minimum-number-of-seconds-to-make-mountain-height-zero | Medium |
| Problem Name | Difficulty |
|---|---|
| 3296-minimum-number-of-seconds-to-make-mountain-height-zero | Medium |
| Problem Name | Difficulty |
|---|---|
| 0139-word-break | Medium |
| Problem Name | Difficulty |
|---|---|
| 0139-word-break | Medium |
| Problem Name | Difficulty |
|---|---|
| 0947-most-stones-removed-with-same-row-or-column | Medium |
| 2374-node-with-highest-edge-score | Medium |
| 3419-minimize-the-maximum-edge-weight-of-graph | Medium |
| Problem Name | Difficulty |
|---|---|
| 3419-minimize-the-maximum-edge-weight-of-graph | Medium |
| Problem Name | Difficulty |
|---|---|
| 2434-using-a-robot-to-print-the-lexicographically-smallest-string | Medium |
| Problem Name | Difficulty |
|---|---|
| 0645-set-mismatch | Easy |
| 0646-maximum-length-of-pair-chain | Medium |
| 1365-how-many-numbers-are-smaller-than-the-current-number | Easy |
| 1727-largest-submatrix-with-rearrangements | Medium |
| 2171-removing-minimum-number-of-magic-beans | Medium |
| 3301-maximize-the-total-height-of-unique-towers | Medium |
| Problem Name | Difficulty |
|---|---|
| 1929-concatenation-of-array | Easy |
| 2149-rearrange-array-elements-by-sign | Medium |
| Problem Name | Difficulty |
|---|---|
| 0128-longest-consecutive-sequence | Medium |
| 0947-most-stones-removed-with-same-row-or-column | Medium |
| Problem Name | Difficulty |
|---|---|
| 0031-next-permutation | Medium |
| 2149-rearrange-array-elements-by-sign | Medium |
| Problem Name | Difficulty |
|---|---|
| 0645-set-mismatch | Easy |
| Problem Name | Difficulty |
|---|---|
| 1365-how-many-numbers-are-smaller-than-the-current-number | Easy |
| Problem Name | Difficulty |
|---|---|
| 2171-removing-minimum-number-of-magic-beans | Medium |
| 3546-equal-sum-grid-partition-i | Medium |
| 3548-equal-sum-grid-partition-ii | Hard |