https://github.com/labwhatever/leetcode
Collection of LeetCode questions to ace the coding interview!
https://github.com/labwhatever/leetcode
data data-structures-and-algorithms dsa leetcode-cpp leetcode-solutions structure structure-learning
Last synced: 3 months ago
JSON representation
Collection of LeetCode questions to ace the coding interview!
- Host: GitHub
- URL: https://github.com/labwhatever/leetcode
- Owner: labwhatever
- Created: 2024-04-19T13:44:23.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2025-04-24T07:23:15.000Z (7 months ago)
- Last Synced: 2025-08-09T14:41:58.416Z (3 months ago)
- Topics: data, data-structures-and-algorithms, dsa, leetcode-cpp, leetcode-solutions, structure, structure-learning
- Language: C++
- Homepage: https://smartcraze.online
- Size: 240 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# LeetCode Topics
## Linked List
| |
| ------- |
| [0002-add-two-numbers](https://github.com/smartcraze/Leetcode/tree/master/0002-add-two-numbers) |
| [0237-delete-node-in-a-linked-list](https://github.com/smartcraze/Leetcode/tree/master/0237-delete-node-in-a-linked-list) |
| [0908-middle-of-the-linked-list](https://github.com/smartcraze/Leetcode/tree/master/0908-middle-of-the-linked-list) |
| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/smartcraze/Leetcode/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |
## String
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/smartcraze/Leetcode/tree/master/0003-longest-substring-without-repeating-characters) |
| [0014-longest-common-prefix](https://github.com/smartcraze/Leetcode/tree/master/0014-longest-common-prefix) |
| [0242-valid-anagram](https://github.com/smartcraze/Leetcode/tree/master/0242-valid-anagram) |
| [0412-fizz-buzz](https://github.com/smartcraze/Leetcode/tree/master/0412-fizz-buzz) |
| [0686-repeated-string-match](https://github.com/smartcraze/Leetcode/tree/master/0686-repeated-string-match) |
| [1460-number-of-substrings-containing-all-three-characters](https://github.com/smartcraze/Leetcode/tree/master/1460-number-of-substrings-containing-all-three-characters) |
| [1651-shuffle-string](https://github.com/smartcraze/Leetcode/tree/master/1651-shuffle-string) |
| [1797-goal-parser-interpretation](https://github.com/smartcraze/Leetcode/tree/master/1797-goal-parser-interpretation) |
## Trie
| |
| ------- |
| [0014-longest-common-prefix](https://github.com/smartcraze/Leetcode/tree/master/0014-longest-common-prefix) |
## Array
| |
| ------- |
| [0066-plus-one](https://github.com/smartcraze/Leetcode/tree/master/0066-plus-one) |
| [0169-majority-element](https://github.com/smartcraze/Leetcode/tree/master/0169-majority-element) |
| [0217-contains-duplicate](https://github.com/smartcraze/Leetcode/tree/master/0217-contains-duplicate) |
| [0643-maximum-average-subarray-i](https://github.com/smartcraze/Leetcode/tree/master/0643-maximum-average-subarray-i) |
| [1329-minimum-cost-to-move-chips-to-the-same-position](https://github.com/smartcraze/Leetcode/tree/master/1329-minimum-cost-to-move-chips-to-the-same-position) |
| [1528-kids-with-the-greatest-number-of-candies](https://github.com/smartcraze/Leetcode/tree/master/1528-kids-with-the-greatest-number-of-candies) |
| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/smartcraze/Leetcode/tree/master/1631-number-of-sub-arrays-with-odd-sum) |
| [1651-shuffle-string](https://github.com/smartcraze/Leetcode/tree/master/1651-shuffle-string) |
| [1849-maximum-absolute-sum-of-any-subarray](https://github.com/smartcraze/Leetcode/tree/master/1849-maximum-absolute-sum-of-any-subarray) |
| [2265-partition-array-according-to-given-pivot](https://github.com/smartcraze/Leetcode/tree/master/2265-partition-array-according-to-given-pivot) |
| [2614-maximum-count-of-positive-integer-and-negative-integer](https://github.com/smartcraze/Leetcode/tree/master/2614-maximum-count-of-positive-integer-and-negative-integer) |
| [3227-find-missing-and-repeated-values](https://github.com/smartcraze/Leetcode/tree/master/3227-find-missing-and-repeated-values) |
## String Matching
| |
| ------- |
| [0686-repeated-string-match](https://github.com/smartcraze/Leetcode/tree/master/0686-repeated-string-match) |
## Math
| |
| ------- |
| [0002-add-two-numbers](https://github.com/smartcraze/Leetcode/tree/master/0002-add-two-numbers) |
| [0066-plus-one](https://github.com/smartcraze/Leetcode/tree/master/0066-plus-one) |
| [0231-power-of-two](https://github.com/smartcraze/Leetcode/tree/master/0231-power-of-two) |
| [0412-fizz-buzz](https://github.com/smartcraze/Leetcode/tree/master/0412-fizz-buzz) |
| [1329-minimum-cost-to-move-chips-to-the-same-position](https://github.com/smartcraze/Leetcode/tree/master/1329-minimum-cost-to-move-chips-to-the-same-position) |
| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/smartcraze/Leetcode/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |
| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/smartcraze/Leetcode/tree/master/1631-number-of-sub-arrays-with-odd-sum) |
| [1889-check-if-number-is-a-sum-of-powers-of-three](https://github.com/smartcraze/Leetcode/tree/master/1889-check-if-number-is-a-sum-of-powers-of-three) |
| [2610-closest-prime-numbers-in-range](https://github.com/smartcraze/Leetcode/tree/master/2610-closest-prime-numbers-in-range) |
| [2649-count-total-number-of-colored-cells](https://github.com/smartcraze/Leetcode/tree/master/2649-count-total-number-of-colored-cells) |
| [3227-find-missing-and-repeated-values](https://github.com/smartcraze/Leetcode/tree/master/3227-find-missing-and-repeated-values) |
## Dynamic Programming
| |
| ------- |
| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/smartcraze/Leetcode/tree/master/1631-number-of-sub-arrays-with-odd-sum) |
| [1849-maximum-absolute-sum-of-any-subarray](https://github.com/smartcraze/Leetcode/tree/master/1849-maximum-absolute-sum-of-any-subarray) |
## Prefix Sum
| |
| ------- |
| [1631-number-of-sub-arrays-with-odd-sum](https://github.com/smartcraze/Leetcode/tree/master/1631-number-of-sub-arrays-with-odd-sum) |
## Two Pointers
| |
| ------- |
| [0908-middle-of-the-linked-list](https://github.com/smartcraze/Leetcode/tree/master/0908-middle-of-the-linked-list) |
| [2265-partition-array-according-to-given-pivot](https://github.com/smartcraze/Leetcode/tree/master/2265-partition-array-according-to-given-pivot) |
## Simulation
| |
| ------- |
| [0412-fizz-buzz](https://github.com/smartcraze/Leetcode/tree/master/0412-fizz-buzz) |
| [2265-partition-array-according-to-given-pivot](https://github.com/smartcraze/Leetcode/tree/master/2265-partition-array-according-to-given-pivot) |
## Recursion
| |
| ------- |
| [0002-add-two-numbers](https://github.com/smartcraze/Leetcode/tree/master/0002-add-two-numbers) |
| [0231-power-of-two](https://github.com/smartcraze/Leetcode/tree/master/0231-power-of-two) |
## Hash Table
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/smartcraze/Leetcode/tree/master/0003-longest-substring-without-repeating-characters) |
| [0169-majority-element](https://github.com/smartcraze/Leetcode/tree/master/0169-majority-element) |
| [0217-contains-duplicate](https://github.com/smartcraze/Leetcode/tree/master/0217-contains-duplicate) |
| [0242-valid-anagram](https://github.com/smartcraze/Leetcode/tree/master/0242-valid-anagram) |
| [1460-number-of-substrings-containing-all-three-characters](https://github.com/smartcraze/Leetcode/tree/master/1460-number-of-substrings-containing-all-three-characters) |
| [3227-find-missing-and-repeated-values](https://github.com/smartcraze/Leetcode/tree/master/3227-find-missing-and-repeated-values) |
## Matrix
| |
| ------- |
| [3227-find-missing-and-repeated-values](https://github.com/smartcraze/Leetcode/tree/master/3227-find-missing-and-repeated-values) |
## Sorting
| |
| ------- |
| [0169-majority-element](https://github.com/smartcraze/Leetcode/tree/master/0169-majority-element) |
| [0217-contains-duplicate](https://github.com/smartcraze/Leetcode/tree/master/0217-contains-duplicate) |
| [0242-valid-anagram](https://github.com/smartcraze/Leetcode/tree/master/0242-valid-anagram) |
## Number Theory
| |
| ------- |
| [2610-closest-prime-numbers-in-range](https://github.com/smartcraze/Leetcode/tree/master/2610-closest-prime-numbers-in-range) |
## Sliding Window
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/smartcraze/Leetcode/tree/master/0003-longest-substring-without-repeating-characters) |
| [0643-maximum-average-subarray-i](https://github.com/smartcraze/Leetcode/tree/master/0643-maximum-average-subarray-i) |
| [1460-number-of-substrings-containing-all-three-characters](https://github.com/smartcraze/Leetcode/tree/master/1460-number-of-substrings-containing-all-three-characters) |
## Bit Manipulation
| |
| ------- |
| [0231-power-of-two](https://github.com/smartcraze/Leetcode/tree/master/0231-power-of-two) |
## Binary Search
| |
| ------- |
| [2614-maximum-count-of-positive-integer-and-negative-integer](https://github.com/smartcraze/Leetcode/tree/master/2614-maximum-count-of-positive-integer-and-negative-integer) |
## Counting
| |
| ------- |
| [0169-majority-element](https://github.com/smartcraze/Leetcode/tree/master/0169-majority-element) |
| [2614-maximum-count-of-positive-integer-and-negative-integer](https://github.com/smartcraze/Leetcode/tree/master/2614-maximum-count-of-positive-integer-and-negative-integer) |
## Greedy
| |
| ------- |
| [1329-minimum-cost-to-move-chips-to-the-same-position](https://github.com/smartcraze/Leetcode/tree/master/1329-minimum-cost-to-move-chips-to-the-same-position) |
## Divide and Conquer
| |
| ------- |
| [0169-majority-element](https://github.com/smartcraze/Leetcode/tree/master/0169-majority-element) |