DSA with JavaScript

Problem Solving Approaches:

• Divide Conquer
• Frequency Counter
• Multiple Pointer
• Sliding Window

Class and object in javascript (BasicClass.js)

Sorting:

• Merge Sort
• Quick Sort
• Radix Sort

Linked Lists:

• Singly Linked List
• Doubly Linked List

Stack

• Push
• Pop

Queue

• Enqueue
• Dequeue

Trees

• Binary Search Tree
  • Implement BST (insert operation)
  • Traversal
    • BFS
    • DFS (Pre-Order, In-Order, Post-Order)
• Binary Heap
  • Max Binary Heap
  • Priority Queue

Hash Table

• Implement own hash table functionality.
• Check JavaScript Map.

Graphs

• Implement graph (add, remove edge and vertex).
• Traversal
  • DFS
  • BFS
• Dijkstra's Algorithm

Dynamic Programming

• Memoization (Up Bottom Approach)
• Tabulation (Bottom Up Approach)