https://github.com/deepanchal/dsa
Repo to practice Data Structures & Algorithms.
https://github.com/deepanchal/dsa
algorithms-and-data-structures cpp java leetcode leetcode-solutions
Last synced: 7 months ago
JSON representation
Repo to practice Data Structures & Algorithms.
- Host: GitHub
- URL: https://github.com/deepanchal/dsa
- Owner: deepanchal
- Created: 2020-08-15T22:19:41.000Z (about 5 years ago)
- Default Branch: main
- Last Pushed: 2022-07-17T23:25:12.000Z (about 3 years ago)
- Last Synced: 2023-03-04T21:06:09.474Z (over 2 years ago)
- Topics: algorithms-and-data-structures, cpp, java, leetcode, leetcode-solutions
- Language: TypeScript
- Homepage:
- Size: 75.2 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# DSA (Data Structures & Algorithms)
Repo for practicing Data Structures & Algorithms
## [Leetcode](https://leetcode.com/problems/)
Problems solved so far:
| Num | Title | Difficulty | Solution |
| :-: | ----- | :--------: | :------: |
| 1 | [Two sum]() | | [java](leetcode/1-two-sum/Solution.java) |
| 13 | [Roman to integer]() | | [java](leetcode/13-roman-to-integer/Solution.java) |
| 1544 | [Make the string great]() | | [java](leetcode/1544-make-the-string-great/Solution.java) |
| 20 | [Valid parenthesis]() | | [cpp](leetcode/20-valid-parenthesis/Solution.cpp) |
| 21 | [Merge two sorted lists]() | | [java](leetcode/21-merge-two-sorted-lists/Solution.java) |
| 26 | [Remove duplicates from sorted array]() | | [java](leetcode/26-remove-duplicates-from-sorted-array/Solution.java) |
| 27 | [Remove element]() | | [java](leetcode/27-remove-element/Solution.java) |
| 28 | [Implement strstr]() | | [java](leetcode/28-implement-strstr/Solution.java) |
| 724 | [Find pivot index]() | | [java](leetcode/724-find-pivot-index/Solution.java) |
| 35 | [Search insert position]() | | [py](leetcode/35-search-insert-position/solution.py), [ts](leetcode/35-search-insert-position/solution.ts) |
| 58 | [Length of last word]() | | [py](leetcode/58-length-of-last-word/solution.py), [ts](leetcode/58-length-of-last-word/solution.ts), [java](leetcode/58-length-of-last-word/Solution.java) |
## [Type Challenges](https://tsch.js.org/)
Challenges solved so far:
| Num | Title | Difficulty | Solution |
| :-: | ----- | :--------: | :------: |
| 00013 | [Hello world]() | warm | [.ts](type-challenges/problems/00013-warm-hello-world.ts) |
| 00007 | [Readonly]() | easy | [.ts](type-challenges/problems/00007-easy-readonly.ts) |
| 00004 | [Pick]() | easy | [.ts](type-challenges/problems/00004-easy-pick.ts) |
| 00014 | [First]() | easy | [.ts](type-challenges/problems/00014-easy-first.ts) |
| 00011 | [Tuple to object]() | easy | [.ts](type-challenges/problems/00011-easy-tuple-to-object.ts) |
| 00018 | [Tuple length]() | easy | [.ts](type-challenges/problems/00018-easy-tuple-length.ts) |
| 00043 | [Exclude]() | easy | [.ts](type-challenges/problems/00043-easy-exclude.ts) |
| 00189 | [Awaited]() | easy | [.ts](type-challenges/problems/00189-easy-awaited.ts) |
| 00268 | [If]() | easy | [.ts](type-challenges/problems/00268-easy-if.ts) |
| 00533 | [Concat]() | easy | [.ts](type-challenges/problems/00533-easy-concat.ts) |
| 00898 | [Includes]() | easy | [.ts](type-challenges/problems/00898-easy-includes.ts) |
| 03057 | [Push]() | easy | [.ts](type-challenges/problems/03057-easy-push.ts) |
| 03060 | [Unshift]() | easy | [.ts](type-challenges/problems/03060-easy-unshift.ts) |
| 03312 | [Parameters]() | easy | [.ts](type-challenges/problems/03312-easy-parameters.ts) |
## Getting Started
### Generate README.md
```bash
./scripts/generate-readme.py
```
## License
MIT