https://github.com/metrue/algorithm-in-js
Let's hack LeetCode/HackerRank in JavaScript
https://github.com/metrue/algorithm-in-js
Last synced: about 1 month ago
JSON representation
Let's hack LeetCode/HackerRank in JavaScript
- Host: GitHub
- URL: https://github.com/metrue/algorithm-in-js
- Owner: metrue
- Created: 2019-10-17T02:01:30.000Z (over 5 years ago)
- Default Branch: master
- Last Pushed: 2025-03-08T18:51:32.000Z (about 2 months ago)
- Last Synced: 2025-03-08T19:30:54.713Z (about 2 months ago)
- Language: JavaScript
- Size: 286 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Solve Algorithm in JS
| Number | Title | Difficulty | Status | Tag | Solution |
| ------------- |:-------------:|:--------------:| :--------------:|:------------------:|:-------------------:|
| 53 | Maximum Subarray| Easy | * | | |
| 122 | Best Time to Buy and Sell Stock II| Easy, Medium, and Hard | * | | |
| 241 | Different Ways to Add Parentheses| Medium | * | | |
| 545 | Boundary of Binary Tree | Medium | * | | |
| 99 | Recover Binary Search Tree | Hard | * | DC | |
| 119 | Pascal's Triangle II | Easy | ? | Array | |
| 109 | Convert Sorted List to Binary Search Tree | Medium | ? | DC | |
| 109 | Convert Sorted List to Binary Search Tree | Medium | ? | DC | |
| 113 | Path Sum II | Medium | ? | DFS | |
| 437 | Path Sum III | Easy | * | DFS, DC | |
| 114 | Flatten Binary Tree to Linked List | Medium | * | DC, DFS | |
| 116 | Populating Next Right Pointers in Each Node | Medium | ?* | DC, Queue | |
| 117 | Populating Next Right Pointers in Each Node ii | Medium | ? | DC, Queue | |
| 5 | Longest Palindromic Substring | Medium | * | DP ||
| 11 | Container With Most Water | Medium | * | Two Point | |
| 6 | ZigZag Conversion | Medium | ? | String ||
| 1 | 2Sum | Easy | ? | Hash Table, Two Pointers | |
| 15 | 3Sum | Medium | ? | Two Pointers | |
| 18 | 4Sum | Medium | ? | Two Pointers, Hash Table | |
| 29 | Divide Two Integers | Medium | * | Binary Search | |
| 415 | Add Strings | Medium | ? | String | |
| 43 | Multiply Strings | Medium | * | String | |
| 2 | Add Two Numbers | Medium | ? | LinkedList | |
| 48 | Rotate Image | Medium | * | Array | |
| 54 | Spiral Matrix | Medium | * | Array | |
| 59 | Spiral Matrix II | Medium | * | Array | |
| 56 | Merge Intervals | Medium | ? | Array | |
| 60 | Permutation Sequence | Medium | ? | Backtracking | |
| 61 | Rotate List | Medium | ? | Two Pointers | |
| 73 | Set Matrix Zeroes | Medium | ? | Array | |
| 236 | Lowest Common Ancestor of a Binary Tree | Medium | ? | Tree | |
| 124 | Binary Tree Maximum Path Sum | Medium | * | Tree,DFS ||
| 332 | Reconstruct Itinerary | Medium | * | Tree,DFS ||
| 295 | [Find Median From Data Stream](https://leetcode.com/problems/find-median-from-data-stream/description/) | Hard | * | Count Sort ||
| 297 |[Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/description/) | Hard | * | Pre Order Travesal, Level Order Traversal | |
| 315 | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/description/)| Hard | * | Divide and Conque, Merge Sort | |