https://github.com/shlmt/leetcode
Solutions for code challenges of leetcode.com
https://github.com/shlmt/leetcode
algorithms-and-data-structures leetcode-solutions
Last synced: 7 months ago
JSON representation
Solutions for code challenges of leetcode.com
- Host: GitHub
- URL: https://github.com/shlmt/leetcode
- Owner: shlmt
- Created: 2024-11-05T12:52:45.000Z (11 months ago)
- Default Branch: main
- Last Pushed: 2024-12-21T18:25:35.000Z (10 months ago)
- Last Synced: 2025-01-30T17:38:13.786Z (8 months ago)
- Topics: algorithms-and-data-structures, leetcode-solutions
- Language: C++
- Homepage: https://leetcode.com
- Size: 236 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
A collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)
# LeetCode Topics
## Array
| |
| ------- |
| [0001-two-sum](https://github.com/shlmt/leetCode/tree/master/0001-two-sum) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/shlmt/leetCode/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0066-plus-one](https://github.com/shlmt/leetCode/tree/master/0066-plus-one) |
| [0238-product-of-array-except-self](https://github.com/shlmt/leetCode/tree/master/0238-product-of-array-except-self) |
| [0268-missing-number](https://github.com/shlmt/leetCode/tree/master/0268-missing-number) |
| [0792-binary-search](https://github.com/shlmt/leetCode/tree/master/0792-binary-search) |
| [0890-lemonade-change](https://github.com/shlmt/leetCode/tree/master/0890-lemonade-change) |
| [1217-relative-sort-array](https://github.com/shlmt/leetCode/tree/master/1217-relative-sort-array) |
| [1580-shuffle-the-array](https://github.com/shlmt/leetCode/tree/master/1580-shuffle-the-array) |
| [1584-average-salary-excluding-the-minimum-and-maximum-salary](https://github.com/shlmt/leetCode/tree/master/1584-average-salary-excluding-the-minimum-and-maximum-salary) |
| [1677-matrix-diagonal-sum](https://github.com/shlmt/leetCode/tree/master/1677-matrix-diagonal-sum) |
| [1798-max-number-of-k-sum-pairs](https://github.com/shlmt/leetCode/tree/master/1798-max-number-of-k-sum-pairs) |
| [1950-sign-of-the-product-of-an-array](https://github.com/shlmt/leetCode/tree/master/1950-sign-of-the-product-of-an-array) |
| [2058-concatenation-of-array](https://github.com/shlmt/leetCode/tree/master/2058-concatenation-of-array) |
| [2616-maximal-score-after-applying-k-operations](https://github.com/shlmt/leetCode/tree/master/2616-maximal-score-after-applying-k-operations) |
| [2624-difference-between-element-sum-and-digit-sum-of-an-array](https://github.com/shlmt/leetCode/tree/master/2624-difference-between-element-sum-and-digit-sum-of-an-array) |
| [2794-maximum-number-of-moves-in-a-grid](https://github.com/shlmt/leetCode/tree/master/2794-maximum-number-of-moves-in-a-grid) |
| [3194-find-words-containing-character](https://github.com/shlmt/leetCode/tree/master/3194-find-words-containing-character) |
| [3522-find-the-power-of-k-size-subarrays-i](https://github.com/shlmt/leetCode/tree/master/3522-find-the-power-of-k-size-subarrays-i) |
## Hash Table
| |
| ------- |
| [0001-two-sum](https://github.com/shlmt/leetCode/tree/master/0001-two-sum) |
| [0242-valid-anagram](https://github.com/shlmt/leetCode/tree/master/0242-valid-anagram) |
| [0268-missing-number](https://github.com/shlmt/leetCode/tree/master/0268-missing-number) |
| [1217-relative-sort-array](https://github.com/shlmt/leetCode/tree/master/1217-relative-sort-array) |
| [1798-max-number-of-k-sum-pairs](https://github.com/shlmt/leetCode/tree/master/1798-max-number-of-k-sum-pairs) |
## Math
| |
| ------- |
| [0009-palindrome-number](https://github.com/shlmt/leetCode/tree/master/0009-palindrome-number) |
| [0066-plus-one](https://github.com/shlmt/leetCode/tree/master/0066-plus-one) |
| [0070-climbing-stairs](https://github.com/shlmt/leetCode/tree/master/0070-climbing-stairs) |
| [0258-add-digits](https://github.com/shlmt/leetCode/tree/master/0258-add-digits) |
| [0268-missing-number](https://github.com/shlmt/leetCode/tree/master/0268-missing-number) |
| [0319-bulb-switcher](https://github.com/shlmt/leetCode/tree/master/0319-bulb-switcher) |
| [1013-fibonacci-number](https://github.com/shlmt/leetCode/tree/master/1013-fibonacci-number) |
| [1406-subtract-the-product-and-sum-of-digits-of-an-integer](https://github.com/shlmt/leetCode/tree/master/1406-subtract-the-product-and-sum-of-digits-of-an-integer) |
| [1444-number-of-steps-to-reduce-a-number-to-zero](https://github.com/shlmt/leetCode/tree/master/1444-number-of-steps-to-reduce-a-number-to-zero) |
| [1630-count-odd-numbers-in-an-interval-range](https://github.com/shlmt/leetCode/tree/master/1630-count-odd-numbers-in-an-interval-range) |
| [1950-sign-of-the-product-of-an-array](https://github.com/shlmt/leetCode/tree/master/1950-sign-of-the-product-of-an-array) |
| [2383-add-two-integers](https://github.com/shlmt/leetCode/tree/master/2383-add-two-integers) |
| [2491-smallest-even-multiple](https://github.com/shlmt/leetCode/tree/master/2491-smallest-even-multiple) |
| [2556-convert-the-temperature](https://github.com/shlmt/leetCode/tree/master/2556-convert-the-temperature) |
| [2608-count-the-digits-that-divide-a-number](https://github.com/shlmt/leetCode/tree/master/2608-count-the-digits-that-divide-a-number) |
| [2624-difference-between-element-sum-and-digit-sum-of-an-array](https://github.com/shlmt/leetCode/tree/master/2624-difference-between-element-sum-and-digit-sum-of-an-array) |
| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/shlmt/leetCode/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |
## String
| |
| ------- |
| [0014-longest-common-prefix](https://github.com/shlmt/leetCode/tree/master/0014-longest-common-prefix) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/shlmt/leetCode/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0058-length-of-last-word](https://github.com/shlmt/leetCode/tree/master/0058-length-of-last-word) |
| [0242-valid-anagram](https://github.com/shlmt/leetCode/tree/master/0242-valid-anagram) |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/shlmt/leetCode/tree/master/0957-minimum-add-to-make-parentheses-valid) |
| [1205-defanging-an-ip-address](https://github.com/shlmt/leetCode/tree/master/1205-defanging-an-ip-address) |
| [1807-partitioning-into-minimum-number-of-deci-binary-numbers](https://github.com/shlmt/leetCode/tree/master/1807-partitioning-into-minimum-number-of-deci-binary-numbers) |
| [1894-merge-strings-alternately](https://github.com/shlmt/leetCode/tree/master/1894-merge-strings-alternately) |
| [3194-find-words-containing-character](https://github.com/shlmt/leetCode/tree/master/3194-find-words-containing-character) |
| [3195-separate-black-and-white-balls](https://github.com/shlmt/leetCode/tree/master/3195-separate-black-and-white-balls) |
| [3379-score-of-a-string](https://github.com/shlmt/leetCode/tree/master/3379-score-of-a-string) |
| [3451-string-compression-iii](https://github.com/shlmt/leetCode/tree/master/3451-string-compression-iii) |
## Trie
| |
| ------- |
| [0014-longest-common-prefix](https://github.com/shlmt/leetCode/tree/master/0014-longest-common-prefix) |
## Linked List
| |
| ------- |
| [0021-merge-two-sorted-lists](https://github.com/shlmt/leetCode/tree/master/0021-merge-two-sorted-lists) |
| [0083-remove-duplicates-from-sorted-list](https://github.com/shlmt/leetCode/tree/master/0083-remove-duplicates-from-sorted-list) |
| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/shlmt/leetCode/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |
## Recursion
| |
| ------- |
| [0021-merge-two-sorted-lists](https://github.com/shlmt/leetCode/tree/master/0021-merge-two-sorted-lists) |
| [1013-fibonacci-number](https://github.com/shlmt/leetCode/tree/master/1013-fibonacci-number) |
## Two Pointers
| |
| ------- |
| [0026-remove-duplicates-from-sorted-array](https://github.com/shlmt/leetCode/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/shlmt/leetCode/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [1798-max-number-of-k-sum-pairs](https://github.com/shlmt/leetCode/tree/master/1798-max-number-of-k-sum-pairs) |
| [1894-merge-strings-alternately](https://github.com/shlmt/leetCode/tree/master/1894-merge-strings-alternately) |
| [3195-separate-black-and-white-balls](https://github.com/shlmt/leetCode/tree/master/3195-separate-black-and-white-balls) |
## String Matching
| |
| ------- |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/shlmt/leetCode/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
## Simulation
| |
| ------- |
| [0258-add-digits](https://github.com/shlmt/leetCode/tree/master/0258-add-digits) |
| [2058-concatenation-of-array](https://github.com/shlmt/leetCode/tree/master/2058-concatenation-of-array) |
## Number Theory
| |
| ------- |
| [0258-add-digits](https://github.com/shlmt/leetCode/tree/master/0258-add-digits) |
| [2491-smallest-even-multiple](https://github.com/shlmt/leetCode/tree/master/2491-smallest-even-multiple) |
| [2903-insert-greatest-common-divisors-in-linked-list](https://github.com/shlmt/leetCode/tree/master/2903-insert-greatest-common-divisors-in-linked-list) |
## Brainteaser
| |
| ------- |
| [0319-bulb-switcher](https://github.com/shlmt/leetCode/tree/master/0319-bulb-switcher) |
## Binary Search
| |
| ------- |
| [0268-missing-number](https://github.com/shlmt/leetCode/tree/master/0268-missing-number) |
| [0792-binary-search](https://github.com/shlmt/leetCode/tree/master/0792-binary-search) |
## Bit Manipulation
| |
| ------- |
| [0268-missing-number](https://github.com/shlmt/leetCode/tree/master/0268-missing-number) |
| [1444-number-of-steps-to-reduce-a-number-to-zero](https://github.com/shlmt/leetCode/tree/master/1444-number-of-steps-to-reduce-a-number-to-zero) |
## Sorting
| |
| ------- |
| [0242-valid-anagram](https://github.com/shlmt/leetCode/tree/master/0242-valid-anagram) |
| [0268-missing-number](https://github.com/shlmt/leetCode/tree/master/0268-missing-number) |
| [1217-relative-sort-array](https://github.com/shlmt/leetCode/tree/master/1217-relative-sort-array) |
| [1584-average-salary-excluding-the-minimum-and-maximum-salary](https://github.com/shlmt/leetCode/tree/master/1584-average-salary-excluding-the-minimum-and-maximum-salary) |
| [1798-max-number-of-k-sum-pairs](https://github.com/shlmt/leetCode/tree/master/1798-max-number-of-k-sum-pairs) |
## Greedy
| |
| ------- |
| [0890-lemonade-change](https://github.com/shlmt/leetCode/tree/master/0890-lemonade-change) |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/shlmt/leetCode/tree/master/0957-minimum-add-to-make-parentheses-valid) |
| [1807-partitioning-into-minimum-number-of-deci-binary-numbers](https://github.com/shlmt/leetCode/tree/master/1807-partitioning-into-minimum-number-of-deci-binary-numbers) |
| [2616-maximal-score-after-applying-k-operations](https://github.com/shlmt/leetCode/tree/master/2616-maximal-score-after-applying-k-operations) |
| [3195-separate-black-and-white-balls](https://github.com/shlmt/leetCode/tree/master/3195-separate-black-and-white-balls) |
## Heap (Priority Queue)
| |
| ------- |
| [2616-maximal-score-after-applying-k-operations](https://github.com/shlmt/leetCode/tree/master/2616-maximal-score-after-applying-k-operations) |
## Dynamic Programming
| |
| ------- |
| [0070-climbing-stairs](https://github.com/shlmt/leetCode/tree/master/0070-climbing-stairs) |
| [1013-fibonacci-number](https://github.com/shlmt/leetCode/tree/master/1013-fibonacci-number) |
| [2794-maximum-number-of-moves-in-a-grid](https://github.com/shlmt/leetCode/tree/master/2794-maximum-number-of-moves-in-a-grid) |
## Matrix
| |
| ------- |
| [1677-matrix-diagonal-sum](https://github.com/shlmt/leetCode/tree/master/1677-matrix-diagonal-sum) |
| [2794-maximum-number-of-moves-in-a-grid](https://github.com/shlmt/leetCode/tree/master/2794-maximum-number-of-moves-in-a-grid) |
## Database
| |
| ------- |
| [0175-combine-two-tables](https://github.com/shlmt/leetCode/tree/master/0175-combine-two-tables) |
| [0620-not-boring-movies](https://github.com/shlmt/leetCode/tree/master/0620-not-boring-movies) |
## Stack
| |
| ------- |
| [0155-min-stack](https://github.com/shlmt/leetCode/tree/master/0155-min-stack) |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/shlmt/leetCode/tree/master/0957-minimum-add-to-make-parentheses-valid) |
## Memoization
| |
| ------- |
| [0070-climbing-stairs](https://github.com/shlmt/leetCode/tree/master/0070-climbing-stairs) |
| [1013-fibonacci-number](https://github.com/shlmt/leetCode/tree/master/1013-fibonacci-number) |
## Sliding Window
| |
| ------- |
| [3522-find-the-power-of-k-size-subarrays-i](https://github.com/shlmt/leetCode/tree/master/3522-find-the-power-of-k-size-subarrays-i) |
## Counting Sort
| |
| ------- |
| [1217-relative-sort-array](https://github.com/shlmt/leetCode/tree/master/1217-relative-sort-array) |
## Prefix Sum
| |
| ------- |
| [0238-product-of-array-except-self](https://github.com/shlmt/leetCode/tree/master/0238-product-of-array-except-self) |
## Design
| |
| ------- |
| [0155-min-stack](https://github.com/shlmt/leetCode/tree/master/0155-min-stack) |
full leetCode-profile