This project is suited for those who want to promote full-stack coding ability systematically 🏗
All problems are implemented by vanilla js 💛
Codes are divided into 4 parts: 🥘
You can filter themes by tag #xxx
#hot #dp #backtracking #tree #recursion #data-structure #math #knapsack #string #promise #monotonic-stack #dfs #closure #bit #combination #hashmap #two-pointers #concurrence #design-mode #bst #format #topk #quickselect #linkedlist #LIS #async #hash #api #debounce #clone #flat #regex #prototype #callback #event #rpc #throttle #graph #heap #priority-queue #trie #stack #monotonic-queue #sliding-window #permutation #sort
The leetcode run time and beat info could be used as a reference, but please not taking much seriously
Run time is calculated by the sum of all test cases, and making optimization is only needed when your submission is at the bottom or has a magnitude difference from the fastest one
Fun facts: 💡
- The test cases may be supplemented at any time. The earlier you submit, the fewer cases you need to run
- The run time of the same code may be different at each submission. The most extreme situation I met is submitting the same code twice, once 3s but once 2s, which is related to the server resource allocation and current usage
- Encountered the submission of the first 50% only gap 10ms, 50% seems huge, while the difference is just natural environment fluctuation