A collection of LeetCode questions to ace the coding interview! - Created using LeetHub v2
| 1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence |
| 1468-check-if-n-and-its-double-exist |
| 3622-maximum-frequency-of-an-element-after-performing-operations-i |
| 3640-maximum-frequency-of-an-element-after-performing-operations-ii |
| 0920-uncommon-words-from-two-sentences |
| 1786-count-the-number-of-consistent-strings |
| 2174-next-greater-numerically-balanced-number |
| 2654-count-the-number-of-vowel-strings-in-range |
| 1786-count-the-number-of-consistent-strings |
| 3676-smallest-number-with-all-set-bits |
| 1387-find-elements-in-a-contaminated-binary-tree |
| 1747-lexicographically-smallest-string-after-applying-operations |
| 3863-power-grid-maintenance |
| 1387-find-elements-in-a-contaminated-binary-tree |
| 1747-lexicographically-smallest-string-after-applying-operations |
| 3863-power-grid-maintenance |
| 1747-lexicographically-smallest-string-after-applying-operations |
| 2174-next-greater-numerically-balanced-number |
| 1387-find-elements-in-a-contaminated-binary-tree |
| 1387-find-elements-in-a-contaminated-binary-tree |
| 2169-simple-bank-system |
| 1387-find-elements-in-a-contaminated-binary-tree |
| 3768-check-if-digits-are-equal-in-string-after-operations-i |
| 3768-check-if-digits-are-equal-in-string-after-operations-i |
| 2174-next-greater-numerically-balanced-number |
| 1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array |
| 1700-minimum-time-to-make-rope-colorful |
| 1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array |
| 1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array |
| 3501-delete-nodes-from-linked-list-present-in-array |
| 3592-find-x-sum-of-all-k-long-subarrays-ii |
| 3610-find-x-sum-of-all-k-long-subarrays-i |
| 3863-power-grid-maintenance |
| 3863-power-grid-maintenance |
| 3863-power-grid-maintenance |
| 3863-power-grid-maintenance |
| 2618-maximize-the-minimum-powered-city |