Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/tasxatzial/leetcode-js
Leetcode solutions in JavaScript
https://github.com/tasxatzial/leetcode-js
leetcode leetcode-javascript
Last synced: 3 days ago
JSON representation
Leetcode solutions in JavaScript
- Host: GitHub
- URL: https://github.com/tasxatzial/leetcode-js
- Owner: tasxatzial
- Created: 2023-06-03T16:46:33.000Z (over 1 year ago)
- Default Branch: master
- Last Pushed: 2024-07-12T00:20:06.000Z (6 months ago)
- Last Synced: 2024-11-13T16:43:05.030Z (2 months ago)
- Topics: leetcode, leetcode-javascript
- Language: JavaScript
- Homepage:
- Size: 73.2 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Leetcode (JavaScript)
[Leetcode](https://leetcode.com/) is an online platform that provides a collection of coding challenges and algorithmic problems to help individuals improve their programming skills and prepare for technical interviews.
---
This repo contains my solutions to the problems.
## Solutions
| # | Problem | Algorithm / Structure | Concept |
|------|----------------------------------------------------------------------------------|------------------------------|---------------------|
| 1 | [Two Sum](problems/1/) | Binary search, Hash map | |
| 20 | [Valid Parentheses](problems/20/) | Stack | |
| 21 | [Merge Two Sorted Lists](problems/21/) | | |
| 34 | [Find First and Last Position of Element in Sorted Array](problems/34) | Binary search | |
| 84 | [Largest Rectangle in Histogram](problems/84/) | Stack | |
| 113 | [Path Sum II](problems/113/) | Depth-first search | |
| 121 | [Best Time to Buy and Sell Stock](problems/121/) | | |
| 189 | [Rotate Array](problems/189/) | | |
| 191 | [Number of 1 Bits](problems/191/) | | Hamming weight |
| 211 | [Design Add and Search Words Data Structure](problems/211/) | Trie | |
| 258 | [Add Digits](problems/258/) | | Digital root |
| 421 | [Maximum XOR of Two Numbers in an Array](problems/421/) | Trie | |
| 532 | [K-diff Pairs in an Array](problems/532/) | Binary search, Hash map | |
| 941 | [Valid Mountain Array](problems/941/) | | |
| 1305 | [All Elements in Two Binary Search Trees](problems/1305/) | Depth-first search | |
| 1672 | [Richest Customer Wealth](problems/1672/) | | |
| | | | |
## Implemented algorithms & data structures
* [Binary search](https://en.wikipedia.org/wiki/Binary_search_algorithm)
* [Depth-first search](https://en.wikipedia.org/wiki/Depth-first_search)
* [Hash map](https://en.wikipedia.org/wiki/Hash_table)
* [Stack](https://en.wikipedia.org/wiki/Stack_(abstract_data_type))
* [Trie](https://en.wikipedia.org/wiki/Trie)
## Concepts
* [Digital root](https://en.wikipedia.org/wiki/Digital_root)
* [Hamming weight](https://en.wikipedia.org/wiki/Hamming_weight)