solved problems
| Problem Name | Difficulty |
|---|---|
| 0011-container-with-most-water | Medium |
| 0019-remove-nth-node-from-end-of-list | Medium |
| 0026-remove-duplicates-from-sorted-array | Easy |
| 0028-find-the-index-of-the-first-occurrence-in-a-string | Easy |
| 0075-sort-colors | Medium |
| 0088-merge-sorted-array | Easy |
| 0189-rotate-array | Medium |
| 0202-happy-number | Easy |
| 0344-reverse-string | Easy |
| 0680-valid-palindrome-ii | Easy |
| 0876-middle-of-the-linked-list | Easy |
| 0905-sort-array-by-parity | Easy |
| 0977-squares-of-a-sorted-array | Easy |
| 2472-maximum-number-of-non-overlapping-palindrome-substrings | Hard |
| Problem Name | Difficulty |
|---|---|
| 0028-find-the-index-of-the-first-occurrence-in-a-string | Easy |
| 0459-repeated-substring-pattern | Easy |
| Problem Name | Difficulty |
|---|---|
| 0028-find-the-index-of-the-first-occurrence-in-a-string | Easy |
| 0459-repeated-substring-pattern | Easy |
| Problem Name | Difficulty |
|---|---|
| 0028-find-the-index-of-the-first-occurrence-in-a-string | Easy |
| 0459-repeated-substring-pattern | Easy |
| Problem Name | Difficulty |
|---|---|
| 0028-find-the-index-of-the-first-occurrence-in-a-string | Easy |
| Problem Name | Difficulty |
|---|---|
| 0043-multiply-strings | Medium |
| 0258-add-digits | Easy |
| 1929-concatenation-of-array | Easy |
| 2390-removing-stars-from-a-string | Medium |
| 3498-reverse-degree-of-a-string | Easy |
| Problem Name | Difficulty |
|---|---|
| 0202-happy-number | Easy |
| Problem Name | Difficulty |
|---|---|
| 0022-generate-parentheses | Medium |
| 0051-n-queens | Hard |
| 0301-remove-invalid-parentheses | Hard |
| 1096-brace-expansion-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 0051-n-queens | Hard |
| Problem Name | Difficulty |
|---|---|
| 0085-maximal-rectangle | Hard |
| 0678-valid-parenthesis-string | Medium |
| 0856-score-of-parentheses | Medium |
| 0921-minimum-add-to-make-parentheses-valid | Medium |
| 1021-remove-outermost-parentheses | Easy |
| 1096-brace-expansion-ii | Hard |
| 1190-reverse-substrings-between-each-pair-of-parentheses | Medium |
| 1541-minimum-insertions-to-balance-a-parentheses-string | Medium |
| 2390-removing-stars-from-a-string | Medium |
| Problem Name | Difficulty |
|---|---|
| 0085-maximal-rectangle | Hard |
| 0835-image-overlap | Medium |
| 1254-number-of-closed-islands | Medium |
| 3619-count-islands-with-total-value-divisible-by-k | Medium |
| 3665-twisted-mirror-path-count | Medium |
| 3882-minimum-xor-path-in-a-grid | Medium |
| Problem Name | Difficulty |
|---|---|
| 0085-maximal-rectangle | Hard |
| Problem Name | Difficulty |
|---|---|
| 0268-missing-number | Easy |
| 0367-valid-perfect-square | Easy |
| 1477-find-two-non-overlapping-sub-arrays-each-with-target-sum | Medium |
| 2089-find-target-indices-after-sorting-array | Easy |
| 2333-minimum-sum-of-squared-difference | Medium |
| 3414-maximum-score-of-non-overlapping-intervals | Hard |
| Problem Name | Difficulty |
|---|---|
| 0231-power-of-two | Easy |
| 0268-missing-number | Easy |
| 0342-power-of-four | Easy |
| 2897-apply-operations-on-array-to-maximize-sum-of-squares | Hard |
| 3644-maximum-k-to-sort-a-permutation | Medium |
| 3841-palindromic-path-queries-in-a-tree | Hard |
| 3882-minimum-xor-path-in-a-grid | Medium |
| Problem Name | Difficulty |
|---|---|
| 0203-remove-linked-list-elements | Easy |
| 0231-power-of-two | Easy |
| 0326-power-of-three | Easy |
| 0342-power-of-four | Easy |
| 3483-unique-3-digit-even-numbers | Easy |
| Problem Name | Difficulty |
|---|---|
| 0019-remove-nth-node-from-end-of-list | Medium |
| 0083-remove-duplicates-from-sorted-list | Easy |
| 0203-remove-linked-list-elements | Easy |
| 0237-delete-node-in-a-linked-list | Medium |
| 0328-odd-even-linked-list | Medium |
| 0705-design-hashset | Easy |
| 0876-middle-of-the-linked-list | Easy |
| Problem Name | Difficulty |
|---|---|
| 0705-design-hashset | Easy |
| Problem Name | Difficulty |
|---|---|
| 0705-design-hashset | Easy |
| Problem Name | Difficulty |
|---|---|
| 1464-maximum-product-of-two-elements-in-an-array | Easy |
| 2333-minimum-sum-of-squared-difference | Medium |
| 3970-shortest-path-with-at-most-k-consecutive-identical-characters | Medium |
| Problem Name | Difficulty |
|---|---|
| 1621-number-of-sets-of-k-non-overlapping-line-segments | Medium |
| 3904-smallest-stable-index-ii | Medium |
| Problem Name | Difficulty |
|---|---|
| 1569-number-of-ways-to-reorder-array-to-get-same-bst | Hard |
| 2265-count-nodes-equal-to-average-of-subtree | Medium |
| 3841-palindromic-path-queries-in-a-tree | Hard |
| Problem Name | Difficulty |
|---|---|
| 1254-number-of-closed-islands | Medium |
| 2265-count-nodes-equal-to-average-of-subtree | Medium |
| 3619-count-islands-with-total-value-divisible-by-k | Medium |
| 3841-palindromic-path-queries-in-a-tree | Hard |
| Problem Name | Difficulty |
|---|---|
| 1569-number-of-ways-to-reorder-array-to-get-same-bst | Hard |
| 2265-count-nodes-equal-to-average-of-subtree | Medium |
| Problem Name | Difficulty |
|---|---|
| 2778-sum-of-squares-of-special-elements | Easy |
| 3483-unique-3-digit-even-numbers | Easy |
| 3886-sum-of-sortable-integers | Hard |
| Problem Name | Difficulty |
|---|---|
| 0836-rectangle-overlap | Easy |
| 1401-circle-and-rectangle-overlapping | Medium |
| Problem Name | Difficulty |
|---|---|
| 1569-number-of-ways-to-reorder-array-to-get-same-bst | Hard |
| 1621-number-of-sets-of-k-non-overlapping-line-segments | Medium |
| Problem Name | Difficulty |
|---|---|
| 1343-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold | Medium |
| 1477-find-two-non-overlapping-sub-arrays-each-with-target-sum | Medium |
| Problem Name | Difficulty |
|---|---|
| 2913-subarrays-distinct-element-sum-of-squares-i | Easy |
| 2916-subarrays-distinct-element-sum-of-squares-ii | Hard |
| 3525-find-x-value-of-array-ii | Hard |
| 3841-palindromic-path-queries-in-a-tree | Hard |
| Problem Name | Difficulty |
|---|---|
| 0022-generate-parentheses | Medium |
| 0678-valid-parenthesis-string | Medium |
| 0856-score-of-parentheses | Medium |
| 0921-minimum-add-to-make-parentheses-valid | Medium |
| 1021-remove-outermost-parentheses | Easy |
| 1190-reverse-substrings-between-each-pair-of-parentheses | Medium |
| 1541-minimum-insertions-to-balance-a-parentheses-string | Medium |
| Problem Name | Difficulty |
|---|---|
| 0301-remove-invalid-parentheses | Hard |
| 1096-brace-expansion-ii | Hard |
| 1254-number-of-closed-islands | Medium |
| 3619-count-islands-with-total-value-divisible-by-k | Medium |
| Problem Name | Difficulty |
|---|---|
| 0175-combine-two-tables | Easy |
| 0181-employees-earning-more-than-their-managers | Easy |
| 0196-delete-duplicate-emails | Easy |
| 0596-classes-with-at-least-5-students | Easy |
| Problem Name | Difficulty |
|---|---|
| 0193-valid-phone-numbers | Easy |
| Problem Name | Difficulty |
|---|---|
| 2913-subarrays-distinct-element-sum-of-squares-i | Easy |
| 2916-subarrays-distinct-element-sum-of-squares-ii | Hard |
| 3841-palindromic-path-queries-in-a-tree | Hard |
| Problem Name | Difficulty |
|---|---|
| 0075-sort-colors | Medium |
| Problem Name | Difficulty |
|---|---|
| 0075-sort-colors | Medium |
| Problem Name | Difficulty |
|---|---|
| 1569-number-of-ways-to-reorder-array-to-get-same-bst | Hard |
| 3841-palindromic-path-queries-in-a-tree | Hard |
| Problem Name | Difficulty |
|---|---|
| 1254-number-of-closed-islands | Medium |
| 1569-number-of-ways-to-reorder-array-to-get-same-bst | Hard |
| 3619-count-islands-with-total-value-divisible-by-k | Medium |
| Problem Name | Difficulty |
|---|---|
| 1569-number-of-ways-to-reorder-array-to-get-same-bst | Hard |
| Problem Name | Difficulty |
|---|---|
| 0070-climbing-stairs | Easy |
| 1569-number-of-ways-to-reorder-array-to-get-same-bst | Hard |
| Problem Name | Difficulty |
|---|---|
| 1569-number-of-ways-to-reorder-array-to-get-same-bst | Hard |
| Problem Name | Difficulty |
|---|---|
| 0258-add-digits | Easy |
| Problem Name | Difficulty |
|---|---|
| 3970-shortest-path-with-at-most-k-consecutive-identical-characters | Medium |
| Problem Name | Difficulty |
|---|---|
| 3970-shortest-path-with-at-most-k-consecutive-identical-characters | Medium |