JavaScript DSA

This is a learner's practice codebase

All the code written here is for practice and making sure my logic works. I revisit the code from time to time to revise, optimise, improve and maintain this codebase. Please have a look and help with the learning process by sharing your knowledge.

• dsa.js has all the "current" Datastructures and Algorithm implementations.

• JavaScript.js has random javascript practice, implementation and problem solving.

• Other datastructures which are successfully implemented and ready to use are stored in separate modules from which we can import any ADT on our command.

The list of contents is as follows

1. RECURSION (major implementations are using recursion. Core examples to be added)
2. LIST
3. STACK
4. QUEUE
5. PRIORITY QUEUE
6. DEQUE
7. LINKED LIST
8. DOUBLY LINKED LIST
9. CIRCULAR SINGLY LINKED LIST
10. CIRCULAR DOUBLY LINKED LIST
11. SETS
12. DICTIONARY
13. HASH TABLE
14. BINARY SEARCH TREE
15. AVL TREE
16. MIN HEAP WITH HEAP SORT ALGORITHM

BetterComments - A VSCode extention which is extensively used with this codebase. It will enhance the readability, I recommend using it.

Bracket pair colorizer - A tool to make the content more readable. Since JavaScript involves deep nesting of brackets, it is great to have a visual guide to help read the code.