DataStructuresAndAlgorithms

Practice data structures and algorithms in javascript

Space and time complexities

1. Find big O i.e space and time complexity for all algorithms

Arrays

1. Study static vs dynamic arrays
2. Implement an array
3. Strings and Arrays
4. Reverse a string using an array
5. Merge sorted arrays

Hash tables

1. Hash functions
2. Implement a hash table
3. Find first recurring character or nuumber in an array using hash table
4. Find tradeoff between using array or hash table

Linked List

1. Implement a linked list
2. Implement insert() remove() push() pop() shift() unshift() and lookup() in singly linked list
3. Implement insert() remove() push() pop() shift() unshift() and lookup() in doubly linked list
4. Reverse a string using a linked list
5. Find tradeoffs between using array , hash tables and linked list