All algorithms.
This will be my own practice repo, initially the repo does not have any solutions. I will practice each problem along with my studying progress.
For each exercise, I will include a readme file with my own personal notes and descriptions.
I might be adding more problems in the furetur once I have completed the course.
- ensure that node -v greater than v8.0
- run npm install -g jest
- run test e.g. jest fib/test.js --watch
- use debugger; to debug the solution
- remember to call the function after debug
- go to your function file and run your js, e.g. node inspect index.js
- use repl to see data
(some exercises not listed below (I am lazy...))
- Reverse String https://github.com/RyanDaDeng/data-structure-self-practice/tree/master/exercises/reversestring
- Tree/traverseBF/traverseDF https://github.com/RyanDaDeng/data-structure-self-practice/tree/master/exercises/tree
- Tree/levelWidth https://github.com/RyanDaDeng/data-structure-self-practice/tree/master/exercises/levelwidth
- Palindrome https://github.com/RyanDaDeng/data-structure-self-practice/tree/master/exercises/palindrome
- Reverse Int https://github.com/RyanDaDeng/data-structure-self-practice/tree/master/exercises/reverseint
- kcloset
- shortest path (bfs)
- pairSumLargest
- flightReturnPath