Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/beki78/leetcode
My leetcode solutions
https://github.com/beki78/leetcode
Last synced: 9 days ago
JSON representation
My leetcode solutions
- Host: GitHub
- URL: https://github.com/beki78/leetcode
- Owner: Beki78
- Created: 2024-07-01T05:17:08.000Z (5 months ago)
- Default Branch: main
- Last Pushed: 2024-11-04T16:37:00.000Z (13 days ago)
- Last Synced: 2024-11-04T17:34:50.064Z (13 days ago)
- Language: Python
- Homepage:
- Size: 112 KB
- Stars: 0
- 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
| |
| ------- |
| [0026-remove-duplicates-from-sorted-array](https://github.com/Beki78/LeetCode/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/Beki78/LeetCode/tree/master/0027-remove-element) |
| [0035-search-insert-position](https://github.com/Beki78/LeetCode/tree/master/0035-search-insert-position) |
| [0066-plus-one](https://github.com/Beki78/LeetCode/tree/master/0066-plus-one) |
| [0078-subsets](https://github.com/Beki78/LeetCode/tree/master/0078-subsets) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/Beki78/LeetCode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/Beki78/LeetCode/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0169-majority-element](https://github.com/Beki78/LeetCode/tree/master/0169-majority-element) |
| [0228-summary-ranges](https://github.com/Beki78/LeetCode/tree/master/0228-summary-ranges) |
| [0643-maximum-average-subarray-i](https://github.com/Beki78/LeetCode/tree/master/0643-maximum-average-subarray-i) |
| [0682-baseball-game](https://github.com/Beki78/LeetCode/tree/master/0682-baseball-game) |
| [0739-daily-temperatures](https://github.com/Beki78/LeetCode/tree/master/0739-daily-temperatures) |
| [1019-squares-of-a-sorted-array](https://github.com/Beki78/LeetCode/tree/master/1019-squares-of-a-sorted-array) |
| [1044-find-common-characters](https://github.com/Beki78/LeetCode/tree/master/1044-find-common-characters) |
| [1421-find-numbers-with-even-number-of-digits](https://github.com/Beki78/LeetCode/tree/master/1421-find-numbers-with-even-number-of-digits) |
| [1482-how-many-numbers-are-smaller-than-the-current-number](https://github.com/Beki78/LeetCode/tree/master/1482-how-many-numbers-are-smaller-than-the-current-number) |
| [1603-running-sum-of-1d-array](https://github.com/Beki78/LeetCode/tree/master/1603-running-sum-of-1d-array) |
| [1635-number-of-good-pairs](https://github.com/Beki78/LeetCode/tree/master/1635-number-of-good-pairs) |
| [2350-find-closest-number-to-zero](https://github.com/Beki78/LeetCode/tree/master/2350-find-closest-number-to-zero) |
| [2442-number-of-arithmetic-triplets](https://github.com/Beki78/LeetCode/tree/master/2442-number-of-arithmetic-triplets) |
| [2714-left-and-right-sum-differences](https://github.com/Beki78/LeetCode/tree/master/2714-left-and-right-sum-differences) |
| [3515-find-if-digit-game-can-be-won](https://github.com/Beki78/LeetCode/tree/master/3515-find-if-digit-game-can-be-won) |
## Hash Table
| |
| ------- |
| [0013-roman-to-integer](https://github.com/Beki78/LeetCode/tree/master/0013-roman-to-integer) |
| [0169-majority-element](https://github.com/Beki78/LeetCode/tree/master/0169-majority-element) |
| [0383-ransom-note](https://github.com/Beki78/LeetCode/tree/master/0383-ransom-note) |
| [0782-jewels-and-stones](https://github.com/Beki78/LeetCode/tree/master/0782-jewels-and-stones) |
| [1044-find-common-characters](https://github.com/Beki78/LeetCode/tree/master/1044-find-common-characters) |
| [1482-how-many-numbers-are-smaller-than-the-current-number](https://github.com/Beki78/LeetCode/tree/master/1482-how-many-numbers-are-smaller-than-the-current-number) |
| [1635-number-of-good-pairs](https://github.com/Beki78/LeetCode/tree/master/1635-number-of-good-pairs) |
| [2427-first-letter-to-appear-twice](https://github.com/Beki78/LeetCode/tree/master/2427-first-letter-to-appear-twice) |
| [2442-number-of-arithmetic-triplets](https://github.com/Beki78/LeetCode/tree/master/2442-number-of-arithmetic-triplets) |
## Math
| |
| ------- |
| [0002-add-two-numbers](https://github.com/Beki78/LeetCode/tree/master/0002-add-two-numbers) |
| [0013-roman-to-integer](https://github.com/Beki78/LeetCode/tree/master/0013-roman-to-integer) |
| [0029-divide-two-integers](https://github.com/Beki78/LeetCode/tree/master/0029-divide-two-integers) |
| [0066-plus-one](https://github.com/Beki78/LeetCode/tree/master/0066-plus-one) |
| [0067-add-binary](https://github.com/Beki78/LeetCode/tree/master/0067-add-binary) |
| [0070-climbing-stairs](https://github.com/Beki78/LeetCode/tree/master/0070-climbing-stairs) |
| [1635-number-of-good-pairs](https://github.com/Beki78/LeetCode/tree/master/1635-number-of-good-pairs) |
| [3515-find-if-digit-game-can-be-won](https://github.com/Beki78/LeetCode/tree/master/3515-find-if-digit-game-can-be-won) |
## Counting
| |
| ------- |
| [0169-majority-element](https://github.com/Beki78/LeetCode/tree/master/0169-majority-element) |
| [0383-ransom-note](https://github.com/Beki78/LeetCode/tree/master/0383-ransom-note) |
| [1482-how-many-numbers-are-smaller-than-the-current-number](https://github.com/Beki78/LeetCode/tree/master/1482-how-many-numbers-are-smaller-than-the-current-number) |
| [1635-number-of-good-pairs](https://github.com/Beki78/LeetCode/tree/master/1635-number-of-good-pairs) |
| [2427-first-letter-to-appear-twice](https://github.com/Beki78/LeetCode/tree/master/2427-first-letter-to-appear-twice) |
## Two Pointers
| |
| ------- |
| [0026-remove-duplicates-from-sorted-array](https://github.com/Beki78/LeetCode/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/Beki78/LeetCode/tree/master/0027-remove-element) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/Beki78/LeetCode/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0125-valid-palindrome](https://github.com/Beki78/LeetCode/tree/master/0125-valid-palindrome) |
| [0344-reverse-string](https://github.com/Beki78/LeetCode/tree/master/0344-reverse-string) |
| [0392-is-subsequence](https://github.com/Beki78/LeetCode/tree/master/0392-is-subsequence) |
| [0874-backspace-string-compare](https://github.com/Beki78/LeetCode/tree/master/0874-backspace-string-compare) |
| [1019-squares-of-a-sorted-array](https://github.com/Beki78/LeetCode/tree/master/1019-squares-of-a-sorted-array) |
| [1894-merge-strings-alternately](https://github.com/Beki78/LeetCode/tree/master/1894-merge-strings-alternately) |
| [2442-number-of-arithmetic-triplets](https://github.com/Beki78/LeetCode/tree/master/2442-number-of-arithmetic-triplets) |
## Enumeration
| |
| ------- |
| [2442-number-of-arithmetic-triplets](https://github.com/Beki78/LeetCode/tree/master/2442-number-of-arithmetic-triplets) |
## Sorting
| |
| ------- |
| [0169-majority-element](https://github.com/Beki78/LeetCode/tree/master/0169-majority-element) |
| [1019-squares-of-a-sorted-array](https://github.com/Beki78/LeetCode/tree/master/1019-squares-of-a-sorted-array) |
| [1482-how-many-numbers-are-smaller-than-the-current-number](https://github.com/Beki78/LeetCode/tree/master/1482-how-many-numbers-are-smaller-than-the-current-number) |
## String
| |
| ------- |
| [0006-zigzag-conversion](https://github.com/Beki78/LeetCode/tree/master/0006-zigzag-conversion) |
| [0013-roman-to-integer](https://github.com/Beki78/LeetCode/tree/master/0013-roman-to-integer) |
| [0014-longest-common-prefix](https://github.com/Beki78/LeetCode/tree/master/0014-longest-common-prefix) |
| [0020-valid-parentheses](https://github.com/Beki78/LeetCode/tree/master/0020-valid-parentheses) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/Beki78/LeetCode/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0058-length-of-last-word](https://github.com/Beki78/LeetCode/tree/master/0058-length-of-last-word) |
| [0067-add-binary](https://github.com/Beki78/LeetCode/tree/master/0067-add-binary) |
| [0125-valid-palindrome](https://github.com/Beki78/LeetCode/tree/master/0125-valid-palindrome) |
| [0344-reverse-string](https://github.com/Beki78/LeetCode/tree/master/0344-reverse-string) |
| [0383-ransom-note](https://github.com/Beki78/LeetCode/tree/master/0383-ransom-note) |
| [0392-is-subsequence](https://github.com/Beki78/LeetCode/tree/master/0392-is-subsequence) |
| [0782-jewels-and-stones](https://github.com/Beki78/LeetCode/tree/master/0782-jewels-and-stones) |
| [0874-backspace-string-compare](https://github.com/Beki78/LeetCode/tree/master/0874-backspace-string-compare) |
| [1044-find-common-characters](https://github.com/Beki78/LeetCode/tree/master/1044-find-common-characters) |
| [1128-remove-all-adjacent-duplicates-in-string](https://github.com/Beki78/LeetCode/tree/master/1128-remove-all-adjacent-duplicates-in-string) |
| [1894-merge-strings-alternately](https://github.com/Beki78/LeetCode/tree/master/1894-merge-strings-alternately) |
| [2427-first-letter-to-appear-twice](https://github.com/Beki78/LeetCode/tree/master/2427-first-letter-to-appear-twice) |
## Stack
| |
| ------- |
| [0020-valid-parentheses](https://github.com/Beki78/LeetCode/tree/master/0020-valid-parentheses) |
| [0094-binary-tree-inorder-traversal](https://github.com/Beki78/LeetCode/tree/master/0094-binary-tree-inorder-traversal) |
| [0682-baseball-game](https://github.com/Beki78/LeetCode/tree/master/0682-baseball-game) |
| [0739-daily-temperatures](https://github.com/Beki78/LeetCode/tree/master/0739-daily-temperatures) |
| [0874-backspace-string-compare](https://github.com/Beki78/LeetCode/tree/master/0874-backspace-string-compare) |
| [1128-remove-all-adjacent-duplicates-in-string](https://github.com/Beki78/LeetCode/tree/master/1128-remove-all-adjacent-duplicates-in-string) |
## Simulation
| |
| ------- |
| [0067-add-binary](https://github.com/Beki78/LeetCode/tree/master/0067-add-binary) |
| [0682-baseball-game](https://github.com/Beki78/LeetCode/tree/master/0682-baseball-game) |
| [0874-backspace-string-compare](https://github.com/Beki78/LeetCode/tree/master/0874-backspace-string-compare) |
## Divide and Conquer
| |
| ------- |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/Beki78/LeetCode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0169-majority-element](https://github.com/Beki78/LeetCode/tree/master/0169-majority-element) |
## Bit Manipulation
| |
| ------- |
| [0029-divide-two-integers](https://github.com/Beki78/LeetCode/tree/master/0029-divide-two-integers) |
| [0067-add-binary](https://github.com/Beki78/LeetCode/tree/master/0067-add-binary) |
| [0078-subsets](https://github.com/Beki78/LeetCode/tree/master/0078-subsets) |
| [2427-first-letter-to-appear-twice](https://github.com/Beki78/LeetCode/tree/master/2427-first-letter-to-appear-twice) |
## Monotonic Stack
| |
| ------- |
| [0739-daily-temperatures](https://github.com/Beki78/LeetCode/tree/master/0739-daily-temperatures) |
## Prefix Sum
| |
| ------- |
| [1603-running-sum-of-1d-array](https://github.com/Beki78/LeetCode/tree/master/1603-running-sum-of-1d-array) |
| [2714-left-and-right-sum-differences](https://github.com/Beki78/LeetCode/tree/master/2714-left-and-right-sum-differences) |
## Dynamic Programming
| |
| ------- |
| [0070-climbing-stairs](https://github.com/Beki78/LeetCode/tree/master/0070-climbing-stairs) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/Beki78/LeetCode/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0392-is-subsequence](https://github.com/Beki78/LeetCode/tree/master/0392-is-subsequence) |
## Sliding Window
| |
| ------- |
| [0643-maximum-average-subarray-i](https://github.com/Beki78/LeetCode/tree/master/0643-maximum-average-subarray-i) |
## Linked List
| |
| ------- |
| [0002-add-two-numbers](https://github.com/Beki78/LeetCode/tree/master/0002-add-two-numbers) |
| [0021-merge-two-sorted-lists](https://github.com/Beki78/LeetCode/tree/master/0021-merge-two-sorted-lists) |
| [0083-remove-duplicates-from-sorted-list](https://github.com/Beki78/LeetCode/tree/master/0083-remove-duplicates-from-sorted-list) |
## Recursion
| |
| ------- |
| [0002-add-two-numbers](https://github.com/Beki78/LeetCode/tree/master/0002-add-two-numbers) |
| [0021-merge-two-sorted-lists](https://github.com/Beki78/LeetCode/tree/master/0021-merge-two-sorted-lists) |
## Binary Search
| |
| ------- |
| [0035-search-insert-position](https://github.com/Beki78/LeetCode/tree/master/0035-search-insert-position) |
## String Matching
| |
| ------- |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/Beki78/LeetCode/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
## Memoization
| |
| ------- |
| [0070-climbing-stairs](https://github.com/Beki78/LeetCode/tree/master/0070-climbing-stairs) |
## Trie
| |
| ------- |
| [0014-longest-common-prefix](https://github.com/Beki78/LeetCode/tree/master/0014-longest-common-prefix) |
## Backtracking
| |
| ------- |
| [0078-subsets](https://github.com/Beki78/LeetCode/tree/master/0078-subsets) |
## Tree
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/Beki78/LeetCode/tree/master/0094-binary-tree-inorder-traversal) |
| [0100-same-tree](https://github.com/Beki78/LeetCode/tree/master/0100-same-tree) |
| [0104-maximum-depth-of-binary-tree](https://github.com/Beki78/LeetCode/tree/master/0104-maximum-depth-of-binary-tree) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/Beki78/LeetCode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0110-balanced-binary-tree](https://github.com/Beki78/LeetCode/tree/master/0110-balanced-binary-tree) |
| [0111-minimum-depth-of-binary-tree](https://github.com/Beki78/LeetCode/tree/master/0111-minimum-depth-of-binary-tree) |
## Depth-First Search
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/Beki78/LeetCode/tree/master/0094-binary-tree-inorder-traversal) |
| [0100-same-tree](https://github.com/Beki78/LeetCode/tree/master/0100-same-tree) |
| [0104-maximum-depth-of-binary-tree](https://github.com/Beki78/LeetCode/tree/master/0104-maximum-depth-of-binary-tree) |
| [0110-balanced-binary-tree](https://github.com/Beki78/LeetCode/tree/master/0110-balanced-binary-tree) |
| [0111-minimum-depth-of-binary-tree](https://github.com/Beki78/LeetCode/tree/master/0111-minimum-depth-of-binary-tree) |
## Binary Tree
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/Beki78/LeetCode/tree/master/0094-binary-tree-inorder-traversal) |
| [0100-same-tree](https://github.com/Beki78/LeetCode/tree/master/0100-same-tree) |
| [0104-maximum-depth-of-binary-tree](https://github.com/Beki78/LeetCode/tree/master/0104-maximum-depth-of-binary-tree) |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/Beki78/LeetCode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |
| [0110-balanced-binary-tree](https://github.com/Beki78/LeetCode/tree/master/0110-balanced-binary-tree) |
| [0111-minimum-depth-of-binary-tree](https://github.com/Beki78/LeetCode/tree/master/0111-minimum-depth-of-binary-tree) |
## Breadth-First Search
| |
| ------- |
| [0100-same-tree](https://github.com/Beki78/LeetCode/tree/master/0100-same-tree) |
| [0104-maximum-depth-of-binary-tree](https://github.com/Beki78/LeetCode/tree/master/0104-maximum-depth-of-binary-tree) |
| [0111-minimum-depth-of-binary-tree](https://github.com/Beki78/LeetCode/tree/master/0111-minimum-depth-of-binary-tree) |
## Binary Search Tree
| |
| ------- |
| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/Beki78/LeetCode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |