Data structures and algorithms implemented using JavaScript.
- Topological Sorting – When a set of tasks or steps need to be executed in a specific order, topological sort orders them in the order they need to be executed. A real world example of this is courses that have pre-requisites, you have to take Drawing I before you can take Drawing II.
- Dictionary
- Linked List
- Queue
- Stack
- Set
- Graph
- Adjacency List
- Adjacency Matrix
- Tree
- FizzBuzz
- Most frequent integer
- Roman Numeral Converter
- Palindrome Checker
- [Balanced Parens] (./algorithms/balancedParens)
- Factorial
- Find the number of pairs whose sum is 10
- Write fibbonaci iteratively and recursively
- Implement
parseInt
- Write a multiply function that multiples 2 integers without using
*
- Calculate the mean, median, mode and range for a set of numbers.
- Write tests for all data structures and algorithms
- Write documentation for data structures that don't have it
- Add ESlint to help with coding style