Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/huzaifsk/leetcode
My leetcode solutions
https://github.com/huzaifsk/leetcode
dsa-algorithm dsa-learning-series dsa-practice javascript learning-by-doing leetcode leetcode-javascript leetcode-solutions problem-solving
Last synced: about 2 months ago
JSON representation
My leetcode solutions
- Host: GitHub
- URL: https://github.com/huzaifsk/leetcode
- Owner: huzaifsk
- Created: 2024-07-25T18:16:19.000Z (6 months ago)
- Default Branch: main
- Last Pushed: 2024-11-25T05:57:56.000Z (2 months ago)
- Last Synced: 2024-11-25T06:27:30.960Z (2 months ago)
- Topics: dsa-algorithm, dsa-learning-series, dsa-practice, javascript, learning-by-doing, leetcode, leetcode-javascript, leetcode-solutions, problem-solving
- Language: JavaScript
- Homepage: https://leetcode.com/u/huzaif_shaikh/
- Size: 68.4 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# LeetCode Solutions
Welcome to my LeetCode solutions repository! Here, you'll find solutions to various LeetCode problems, all implemented in JavaScript. I’ve organized the solutions by topic to make it easier to navigate and study specific concepts.
# About
Each solution includes detailed code to help you understand the approach taken to solve each problem. This repository is a work-in-progress as I continue to tackle new problems and add solutions.
Feel free to explore, and if you have suggestions or improvements, don't hesitate to contribute!
# LeetCode Topics
## Hash Table
| |
| ------- |
| [0013-roman-to-integer](https://github.com/huzaifsk/leetcode/tree/master/0013-roman-to-integer) |
| [0217-contains-duplicate](https://github.com/huzaifsk/leetcode/tree/master/0217-contains-duplicate) |
## Math
| |
| ------- |
| [0013-roman-to-integer](https://github.com/huzaifsk/leetcode/tree/master/0013-roman-to-integer) |
| [0233-number-of-digit-one](https://github.com/huzaifsk/leetcode/tree/master/0233-number-of-digit-one) |
| [0412-fizz-buzz](https://github.com/huzaifsk/leetcode/tree/master/0412-fizz-buzz) |
| [1013-fibonacci-number](https://github.com/huzaifsk/leetcode/tree/master/1013-fibonacci-number) |
## String
| |
| ------- |
| [0013-roman-to-integer](https://github.com/huzaifsk/leetcode/tree/master/0013-roman-to-integer) |
| [0412-fizz-buzz](https://github.com/huzaifsk/leetcode/tree/master/0412-fizz-buzz) |
## Dynamic Programming
| |
| ------- |
| [0233-number-of-digit-one](https://github.com/huzaifsk/leetcode/tree/master/0233-number-of-digit-one) |
| [1013-fibonacci-number](https://github.com/huzaifsk/leetcode/tree/master/1013-fibonacci-number) |
## Recursion
| |
| ------- |
| [0233-number-of-digit-one](https://github.com/huzaifsk/leetcode/tree/master/0233-number-of-digit-one) |
| [1013-fibonacci-number](https://github.com/huzaifsk/leetcode/tree/master/1013-fibonacci-number) |
## Memoization
| |
| ------- |
| [1013-fibonacci-number](https://github.com/huzaifsk/leetcode/tree/master/1013-fibonacci-number) |
## Simulation
| |
| ------- |
| [0412-fizz-buzz](https://github.com/huzaifsk/leetcode/tree/master/0412-fizz-buzz) |
## Array
| |
| ------- |
| [0217-contains-duplicate](https://github.com/huzaifsk/leetcode/tree/master/0217-contains-duplicate) |
## Sorting
| |
| ------- |
| [0217-contains-duplicate](https://github.com/huzaifsk/leetcode/tree/master/0217-contains-duplicate) |