Skip to content

Datastructure and Algorithm in Javascript notes. It includes the big O notation, problem solving patterns, recursion, searching algorithm, sorting algorithms, and datas tructures

Notifications You must be signed in to change notification settings

Prakharnagore/javascript-dsa-course

Repository files navigation

Data-Structure-And-Algorithm-Notes

Syllabus

  1. Big O Notation
  2. Performance of Arrays and Objects
  3. Problem Solving Approach
  4. Problem Solving Pattern
    • Frequency Counter
    • Multiple Pointers
    • Sliding Window
    • Divide and Conquer
  5. Recursion
    • Basic Problems and Solutions
    • Basic Intermediate Problems and Solutions
  6. Searching Algorithms
    • Linear Search vs Binary Search
    • Naive String Search vs KMP String Search
  7. Sorting Algorithms
  8. Data Structure Introduction
    • Introduction
    • Linked List Linked List visualization (Singly Linked List ,Doubly Linked List DLL)
    • Stack and Queue
    • Binary Seach Tree & Tree Traversal (BFS & DFS(InOrder,PreOrder,PostOrder))
    • Binary Heaps (Max Binary Heap & Min Binary Heap)
    • Hash Table
    • Graphs & Graphs Traversal (BFS & DFS)