Data Structures and Algorithms: Patterns for Interviews
Learn core data structures, graph algorithms, sorting and problem-solving patterns with Python examples. For students and interview candidates.
What you'll learn
- Analyse time and space complexity with Big-O.
- Choose and implement arrays, hash maps, trees, heaps and graphs.
- Apply sorting, searching and graph algorithms such as BFS, DFS and Dijkstra.
- Recognize patterns: two pointers, sliding window, backtracking, greedy and dynamic programming.
- Design structures such as LRU cache and solve interval and K-way merge problems.
Syllabus
Module 1: Foundations
Module 2: Data Structures
- Arrays
- Strings
- Linked List
- Stack
- Queue
- Hash Map
- Binary Tree
- Binary Search Tree
- Heap / Priority Queue
- Graph
- Trie
- Segment Tree
- Fenwick Tree (BIT)
- Monotonic Stack / Queue
Module 3: Graph Algorithms
- Topological Sort
- Dijkstra's Algorithm
- Bellman-Ford Algorithm
- Floyd-Warshall Algorithm
- Minimum Spanning Tree
- Union-Find / Disjoint Set
Module 4: Sorting & Searching
Module 5: Algorithm Patterns
- Recursion
- Two Pointers
- Sliding Window
- Breadth-First Search
- Depth-First Search
- Backtracking
- Greedy
- Dynamic Programming