https://github.com/jmarove/leetcode-playground
Another repo with the solutions of the Leetcode problems of the owner. Planning to expand all the solutions to Rust, just for fun.
https://github.com/jmarove/leetcode-playground
algorithms leetcode leetcode-solutions python
Last synced: 7 months ago
JSON representation
Another repo with the solutions of the Leetcode problems of the owner. Planning to expand all the solutions to Rust, just for fun.
- Host: GitHub
- URL: https://github.com/jmarove/leetcode-playground
- Owner: JMarOve
- Created: 2025-01-08T22:53:07.000Z (9 months ago)
- Default Branch: main
- Last Pushed: 2025-01-26T19:25:13.000Z (8 months ago)
- Last Synced: 2025-01-26T20:25:53.037Z (8 months ago)
- Topics: algorithms, leetcode, leetcode-solutions, python
- Language: Python
- Homepage:
- Size: 146 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# LeetCode-Playground
Just me wrestling with LeetCode problems in Python (for now) for fun"
# To do:
- [ ] Organize the repo with folders. It's not clear if it's better to have easy-medium-hard or just by numbers.
- [ ] Create a parallel repo with C++/Rust solutions
# LeetCode Topics
## Array
| |
| ------- |
| [0001-two-sum](https://github.com/JMarOve/LeetCode-Playground/tree/master/0001-two-sum) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/JMarOve/LeetCode-Playground/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/JMarOve/LeetCode-Playground/tree/master/0027-remove-element) |
| [0035-search-insert-position](https://github.com/JMarOve/LeetCode-Playground/tree/master/0035-search-insert-position) |
| [0054-spiral-matrix](https://github.com/JMarOve/LeetCode-Playground/tree/master/0054-spiral-matrix) |
| [0066-plus-one](https://github.com/JMarOve/LeetCode-Playground/tree/master/0066-plus-one) |
| [0118-pascals-triangle](https://github.com/JMarOve/LeetCode-Playground/tree/master/0118-pascals-triangle) |
| [0119-pascals-triangle-ii](https://github.com/JMarOve/LeetCode-Playground/tree/master/0119-pascals-triangle-ii) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/JMarOve/LeetCode-Playground/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0136-single-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/0136-single-number) |
| [0169-majority-element](https://github.com/JMarOve/LeetCode-Playground/tree/master/0169-majority-element) |
| [0268-missing-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/0268-missing-number) |
| [0448-find-all-numbers-disappeared-in-an-array](https://github.com/JMarOve/LeetCode-Playground/tree/master/0448-find-all-numbers-disappeared-in-an-array) |
| [1395-minimum-time-visiting-all-points](https://github.com/JMarOve/LeetCode-Playground/tree/master/1395-minimum-time-visiting-all-points) |
| [1482-how-many-numbers-are-smaller-than-the-current-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/1482-how-many-numbers-are-smaller-than-the-current-number) |
## Hash Table
| |
| ------- |
| [0001-two-sum](https://github.com/JMarOve/LeetCode-Playground/tree/master/0001-two-sum) |
| [0013-roman-to-integer](https://github.com/JMarOve/LeetCode-Playground/tree/master/0013-roman-to-integer) |
| [0169-majority-element](https://github.com/JMarOve/LeetCode-Playground/tree/master/0169-majority-element) |
| [0268-missing-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/0268-missing-number) |
| [0448-find-all-numbers-disappeared-in-an-array](https://github.com/JMarOve/LeetCode-Playground/tree/master/0448-find-all-numbers-disappeared-in-an-array) |
| [1482-how-many-numbers-are-smaller-than-the-current-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/1482-how-many-numbers-are-smaller-than-the-current-number) |
## Math
| |
| ------- |
| [0007-reverse-integer](https://github.com/JMarOve/LeetCode-Playground/tree/master/0007-reverse-integer) |
| [0009-palindrome-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/0009-palindrome-number) |
| [0013-roman-to-integer](https://github.com/JMarOve/LeetCode-Playground/tree/master/0013-roman-to-integer) |
| [0029-divide-two-integers](https://github.com/JMarOve/LeetCode-Playground/tree/master/0029-divide-two-integers) |
| [0050-powx-n](https://github.com/JMarOve/LeetCode-Playground/tree/master/0050-powx-n) |
| [0066-plus-one](https://github.com/JMarOve/LeetCode-Playground/tree/master/0066-plus-one) |
| [0069-sqrtx](https://github.com/JMarOve/LeetCode-Playground/tree/master/0069-sqrtx) |
| [0070-climbing-stairs](https://github.com/JMarOve/LeetCode-Playground/tree/master/0070-climbing-stairs) |
| [0231-power-of-two](https://github.com/JMarOve/LeetCode-Playground/tree/master/0231-power-of-two) |
| [0258-add-digits](https://github.com/JMarOve/LeetCode-Playground/tree/master/0258-add-digits) |
| [0263-ugly-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/0263-ugly-number) |
| [0268-missing-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/0268-missing-number) |
| [0412-fizz-buzz](https://github.com/JMarOve/LeetCode-Playground/tree/master/0412-fizz-buzz) |
| [1395-minimum-time-visiting-all-points](https://github.com/JMarOve/LeetCode-Playground/tree/master/1395-minimum-time-visiting-all-points) |
## Binary Search
| |
| ------- |
| [0035-search-insert-position](https://github.com/JMarOve/LeetCode-Playground/tree/master/0035-search-insert-position) |
| [0069-sqrtx](https://github.com/JMarOve/LeetCode-Playground/tree/master/0069-sqrtx) |
| [0268-missing-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/0268-missing-number) |
## Bit Manipulation
| |
| ------- |
| [0029-divide-two-integers](https://github.com/JMarOve/LeetCode-Playground/tree/master/0029-divide-two-integers) |
| [0136-single-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/0136-single-number) |
| [0190-reverse-bits](https://github.com/JMarOve/LeetCode-Playground/tree/master/0190-reverse-bits) |
| [0191-number-of-1-bits](https://github.com/JMarOve/LeetCode-Playground/tree/master/0191-number-of-1-bits) |
| [0231-power-of-two](https://github.com/JMarOve/LeetCode-Playground/tree/master/0231-power-of-two) |
| [0268-missing-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/0268-missing-number) |
## Sorting
| |
| ------- |
| [0169-majority-element](https://github.com/JMarOve/LeetCode-Playground/tree/master/0169-majority-element) |
| [0268-missing-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/0268-missing-number) |
| [1482-how-many-numbers-are-smaller-than-the-current-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/1482-how-many-numbers-are-smaller-than-the-current-number) |
## Counting
| |
| ------- |
| [0169-majority-element](https://github.com/JMarOve/LeetCode-Playground/tree/master/0169-majority-element) |
| [1482-how-many-numbers-are-smaller-than-the-current-number](https://github.com/JMarOve/LeetCode-Playground/tree/master/1482-how-many-numbers-are-smaller-than-the-current-number) |
## String
| |
| ------- |
| [0013-roman-to-integer](https://github.com/JMarOve/LeetCode-Playground/tree/master/0013-roman-to-integer) |
| [0014-longest-common-prefix](https://github.com/JMarOve/LeetCode-Playground/tree/master/0014-longest-common-prefix) |
| [0020-valid-parentheses](https://github.com/JMarOve/LeetCode-Playground/tree/master/0020-valid-parentheses) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/JMarOve/LeetCode-Playground/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0058-length-of-last-word](https://github.com/JMarOve/LeetCode-Playground/tree/master/0058-length-of-last-word) |
| [0125-valid-palindrome](https://github.com/JMarOve/LeetCode-Playground/tree/master/0125-valid-palindrome) |
| [0412-fizz-buzz](https://github.com/JMarOve/LeetCode-Playground/tree/master/0412-fizz-buzz) |
## Database
| |
| ------- |
| [0175-combine-two-tables](https://github.com/JMarOve/LeetCode-Playground/tree/master/0175-combine-two-tables) |
## Geometry
| |
| ------- |
| [1395-minimum-time-visiting-all-points](https://github.com/JMarOve/LeetCode-Playground/tree/master/1395-minimum-time-visiting-all-points) |
## Matrix
| |
| ------- |
| [0054-spiral-matrix](https://github.com/JMarOve/LeetCode-Playground/tree/master/0054-spiral-matrix) |
## Simulation
| |
| ------- |
| [0054-spiral-matrix](https://github.com/JMarOve/LeetCode-Playground/tree/master/0054-spiral-matrix) |
| [0258-add-digits](https://github.com/JMarOve/LeetCode-Playground/tree/master/0258-add-digits) |
| [0412-fizz-buzz](https://github.com/JMarOve/LeetCode-Playground/tree/master/0412-fizz-buzz) |
## Trie
| |
| ------- |
| [0014-longest-common-prefix](https://github.com/JMarOve/LeetCode-Playground/tree/master/0014-longest-common-prefix) |
## Stack
| |
| ------- |
| [0020-valid-parentheses](https://github.com/JMarOve/LeetCode-Playground/tree/master/0020-valid-parentheses) |
## Two Pointers
| |
| ------- |
| [0026-remove-duplicates-from-sorted-array](https://github.com/JMarOve/LeetCode-Playground/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/JMarOve/LeetCode-Playground/tree/master/0027-remove-element) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/JMarOve/LeetCode-Playground/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0125-valid-palindrome](https://github.com/JMarOve/LeetCode-Playground/tree/master/0125-valid-palindrome) |
## String Matching
| |
| ------- |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/JMarOve/LeetCode-Playground/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
## Dynamic Programming
| |
| ------- |
| [0070-climbing-stairs](https://github.com/JMarOve/LeetCode-Playground/tree/master/0070-climbing-stairs) |
| [0118-pascals-triangle](https://github.com/JMarOve/LeetCode-Playground/tree/master/0118-pascals-triangle) |
| [0119-pascals-triangle-ii](https://github.com/JMarOve/LeetCode-Playground/tree/master/0119-pascals-triangle-ii) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/JMarOve/LeetCode-Playground/tree/master/0121-best-time-to-buy-and-sell-stock) |
## Memoization
| |
| ------- |
| [0070-climbing-stairs](https://github.com/JMarOve/LeetCode-Playground/tree/master/0070-climbing-stairs) |
## Divide and Conquer
| |
| ------- |
| [0169-majority-element](https://github.com/JMarOve/LeetCode-Playground/tree/master/0169-majority-element) |
| [0190-reverse-bits](https://github.com/JMarOve/LeetCode-Playground/tree/master/0190-reverse-bits) |
| [0191-number-of-1-bits](https://github.com/JMarOve/LeetCode-Playground/tree/master/0191-number-of-1-bits) |
## Recursion
| |
| ------- |
| [0021-merge-two-sorted-lists](https://github.com/JMarOve/LeetCode-Playground/tree/master/0021-merge-two-sorted-lists) |
| [0050-powx-n](https://github.com/JMarOve/LeetCode-Playground/tree/master/0050-powx-n) |
| [0231-power-of-two](https://github.com/JMarOve/LeetCode-Playground/tree/master/0231-power-of-two) |
## Number Theory
| |
| ------- |
| [0258-add-digits](https://github.com/JMarOve/LeetCode-Playground/tree/master/0258-add-digits) |
## Linked List
| |
| ------- |
| [0021-merge-two-sorted-lists](https://github.com/JMarOve/LeetCode-Playground/tree/master/0021-merge-two-sorted-lists) |