- Big O Notation
 - Performance of Arrays and Objects
 - Problem Solving Approach
 - Problem Solving Pattern
- Frequency Counter
 - Multiple Pointers
 - Sliding Window
 - Divide and Conquer
 
 - Recursion
- Basic Problems and Solutions
 - Basic Intermediate Problems and Solutions
 
 - Searching Algorithms
- Linear Search vs Binary Search
 - Naive String Search vs KMP String Search
 
 - Sorting Algorithms
- All sort visualization
 - Bubble Sort
 - Selection Sort
 - Insertion Sort
 - Merge Sort
 - Quick Sort
 - Radix Sort
 
 - 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)
 
 
- 
                Notifications
    
You must be signed in to change notification settings  - Fork 0
 
Datastructure and Algorithm in Javascript notes. It includes the big O notation, problem solving patterns, recursion, searching algorithm, sorting algorithms, and datas tructures
Prakharnagore/javascript-dsa-course
Folders and files
| Name | Name | Last commit message  | Last commit date  | |
|---|---|---|---|---|
Repository files navigation
About
Datastructure and Algorithm in Javascript notes. It includes the big O notation, problem solving patterns, recursion, searching algorithm, sorting algorithms, and datas tructures