SwadhyAI Notes
DSA Notes
Learn data structures and algorithms through interview patterns: arrays, hashing, two pointers, sliding window, graphs, dynamic programming, heaps, tries, greedy and more.
Pattern keywords
Arrays and hashing, Two pointers, Sliding window, Prefix sums, Binary search, Heaps and top K, Tries, Graphs, Union-Find, Dijkstra, Dynamic programming, Greedy, Backtracking, Bit manipulation
Lessons
- DSA Intro
- DSA Simple Algorithm
- Crack FAANG: Step-by-Step Roadmap
- Problem-Solving Patterns
- Two Pointers
- Sliding Window
- Backtracking
- Priority Queues & Heaps
- DSA Arrays
- DSA Bubble Sort
- DSA Selection Sort
- DSA Insertion Sort
- DSA Quick Sort
- DSA Counting Sort
- DSA Radix Sort
- DSA Merge Sort
- DSA Linear Search
- DSA Binary Search
- DSA Linked Lists
- DSA Linked Lists in Memory
- DSA Linked Lists Types
- Linked Lists Operations
- DSA Stacks
- DSA Queues
- DSA Hash Tables
- DSA Hash Sets
- DSA Hash Maps
- DSA Trees
- DSA Binary Trees
- DSA Pre-order Traversal
- DSA In-order Traversal
- DSA Post-order Traversal
- DSA Array Implementation
- DSA Binary Search Trees
- DSA AVL Trees
- Bloom Filters
- B-Trees & LSM-Trees
- DSA Graphs
- Graphs Implementation
- DSA Graphs Traversal
- DSA Cycle Detection
- DSA Shortest Path
- DSA Dijkstra's
- DSA Bellman-Ford
- Minimum Spanning Tree
- DSA Prim's
- DSA Kruskal's
- DSA Maximum Flow
- DSA Ford-Fulkerson
- DSA Edmonds-Karp
- DSA Dinic's
- DSA Push-Relabel
- Time complexity
- Bubble Sort
- Selection Sort
- Insertion Sort
- Quick Sort
- Counting Sort
- Radix Sort
- Merge Sort
- Linear Search
- Binary Search
- Heap Sort
- IntroSort
- TimSort
- DSA Euclidean Algorithm
- DSA Huffman Coding
- DSA The Traveling Salesman
- DSA 0/1 Knapsack
- DSA Memoization
- DSA Tabulation
- DSA Dynamic Programming
- Advanced Dynamic Programming
- DSA Greedy Algorithms
- Disjoint Set Union (DSU)
- Trie (Prefix Tree)
- String Mastery
- Computational Geometry
- Segment Tree
- Bit Manipulation