Collection of LeetCode questions to ace the coding interview! - Created using LeetHub
0330-patching-array |
0502-ipo |
0330-patching-array |
0502-ipo |
0502-ipo |
0023-merge-k-sorted-lists |
0502-ipo |
0002-add-two-numbers |
0002-add-two-numbers |
0021-merge-two-sorted-lists |
0024-swap-nodes-in-pairs |
0019-remove-nth-node-from-end-of-list |
0061-rotate-list |
0082-remove-duplicates-from-sorted-list-ii |
0023-merge-k-sorted-lists |
0023-merge-k-sorted-lists |
0206-reverse-linked-list |
1951-find-the-winner-of-the-circular-game |
1951-find-the-winner-of-the-circular-game |
2232-adding-spaces-to-a-string |
2265-partition-array-according-to-given-pivot |
2551-apply-operations-to-an-array |
2585-delete-greatest-value-in-each-row |
0207-course-schedule |
1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid |
2472-build-a-matrix-with-conditions |
2793-count-the-number-of-complete-components |
0207-course-schedule |
2472-build-a-matrix-with-conditions |
1307-ugly-number-iii |
1993-sum-of-all-subset-xor-totals |
1307-ugly-number-iii |
2610-closest-prime-numbers-in-range |
3269-number-of-subarrays-that-match-a-pattern-i |
3309-count-prefix-and-suffix-pairs-i |
0812-rotate-string |
1524-string-matching-in-an-array |
2292-counting-words-with-a-given-prefix |
3269-number-of-subarrays-that-match-a-pattern-i |
3309-count-prefix-and-suffix-pairs-i |
3269-number-of-subarrays-that-match-a-pattern-i |
3309-count-prefix-and-suffix-pairs-i |
0225-implement-stack-using-queues |
0789-kth-largest-element-in-a-stream |
0931-maximum-frequency-stack |
1955-seat-reservation-manager |
0095-unique-binary-search-trees-ii |
0789-kth-largest-element-in-a-stream |
0789-kth-largest-element-in-a-stream |
0596-classes-more-than-5-students |
0931-maximum-frequency-stack |
1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit |
2868-continuous-subarrays |
1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit |
2868-continuous-subarrays |
0503-next-greater-element-ii |
1679-shortest-subarray-to-be-removed-to-make-array-sorted |
0095-unique-binary-search-trees-ii |
0494-target-sum |
1993-sum-of-all-subset-xor-totals |
2456-construct-smallest-number-from-di-string |
0023-merge-k-sorted-lists |
0215-kth-largest-element-in-an-array |
0215-kth-largest-element-in-an-array |
0023-merge-k-sorted-lists |
0206-reverse-linked-list |
0023-merge-k-sorted-lists |
3193-maximum-strong-pair-xor-i |
3309-count-prefix-and-suffix-pairs-i |
2533-bitwise-xor-of-all-pairings |
1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid |
2793-count-the-number-of-complete-components |
1993-sum-of-all-subset-xor-totals |