Data Structures and Algorithms Masterclass
Master DSA concepts with 200+ FAANG-level coding problems
Taught by Amit Singh — Senior software engineer at Amazon with 12+ years of experience building scalable distributed systems.
- Starts
- October 4, 2026
- Format
- 10 weeks · 5 nights a week (Sun–Thu), 9–11 PM CTNext morning in India — 7:30–9:30 AM IST (8:30–10:30 from Nov 1)
- Seats
- 30 per cohort
- Enroll by
- October 3, 2026
7-day money-back guarantee — full refund within 7 days of the cohort start, no questions asked.
No job-placement promises — we make you interview-ready with real mock interviews and honest feedback.
Data Structures and Algorithms Masterclass
Why the live cohort works
Content is everywhere. What actually moves interview outcomes is live instruction, real practice, and honest feedback — that's what this is built around.
Live, not recorded
Real-time instruction and Q&A from an engineer who has been on both sides of the FAANG interview table — not a video you watch alone.
A real cohort, capped at 30
Small enough for personal attention and accountability. You are a name, not a seat in a giant course.
Weekly mock interviews + feedback
Practice under real pressure, then get honest, specific feedback on how you actually performed — the part self-study can never give you.
Pattern-based, and yours for life
200+ curated problems over 10 weeks, plus lifetime access to every recording, solution, and future update.
Course overview
Intensive 10-week course covering all essential data structures and algorithms in 3 iterations (Foundations, Intermediate, Advanced). Learn arrays, linked lists, trees, graphs, dynamic programming, and more through hands-on practice with 186 carefully curated problems from top tech companies and LeetCode Top Interview 150.
Duration
10 weeks
Format
Live + Offline
Problems
186+
Difficulty
Intermediate
What You'll Learn
Curriculum at a glance
| Week | Focus | Key topics | Problems |
|---|---|---|---|
| 1 | Design, Binary Search & Hashing | Day 1: Design HashMap, Min Stack, Day 2: Implement Queue using Stacks, Design HashSet, Search in Rotated Sorted Array, Day 3: Search Unknown Size, Search 2D Matrix, Find First/Last Position, Day 4: Find Minimum Rotated, Find Peak Element, Group Anagrams, Day 5: Isomorphic Strings, Word Pattern, Weekly Test | 16 |
| 2 | Dynamic Programming, Arrays & Two Pointers | Day 1: Coin Change, House Robber, Paint House, Day 2: Coin Change II, Minimum Falling Path Sum, Delete and Earn, Day 3: Product of Array Except Self, Diagonal Traverse, Spiral Matrix, Day 4: Find Disappeared Numbers, Two Sum, Game of Life, Day 5: Sort Colors, 3Sum, Container With Most Water, Weekly Test | 19 |
| 3 | Trees & Linked Lists | Day 1: Validate BST, Construct from Preorder+Inorder, Construct from Inorder+Postorder, Day 2: Sum Root to Leaf Numbers, Path Sum II, Symmetric Tree, Day 3: Reverse Linked List, Remove Nth Node, Linked List Cycle II, Day 4: BST Iterator, Reorder List, Add Two Numbers, Day 5: Intersection of Two LL, Level Order Traversal, Course Schedule, Right Side View, Weekly Test | 19 |
| 4 | DFS, Backtracking, Tries & Advanced Design | Day 1: Flood Fill, 01 Matrix, Number of Islands, Day 2: Decode String, Combination Sum, Expression Add Operators, Day 3: Subsets, Palindrome Partitioning, N-Queens, Day 4: Word Search, Implement Trie, Longest Word in Dictionary, Day 5: Replace Words, Flatten Nested List Iterator, Weekly Test | 17 |
| 5 | Advanced Design, Binary Search & Strings | Day 1: Design Twitter, Simplify Path, Pow(x,n), Day 2: Find K Closest Elements, Optimize Air Routes, H-Index II, Day 3: Intersection of Two Arrays II, Median of Two Sorted Arrays, Custom Sort String, Day 4: Longest Substring Without Repeating, Find First Occurrence, Day 5: Find All Anagrams, Minimum Window Substring, Weekly Test | 17 |
| 6 | Advanced Trees, DP & Graphs Intro | Day 1: LCA of Binary Tree, Populating Next Right Pointers, Recover BST, Day 2: Invert Binary Tree, Maximal Square, Partition Array for Maximum Sum, Day 3: Word Break, Unique Paths, Design Parking Lot, Day 4: Copy List with Random Pointer, Find the Town Judge, Day 5: Surrounded Regions, Merge Intervals, Weekly Test | 17 |
| 7 | Arrays, Design, Stacks & Greedy | Day 1: Maximum Subarray, Next Permutation, Design Phone Directory, Design Autocomplete, Day 2: LFU Cache, Design Snake Game, Daily Temperatures, Day 3: Next Greater Element II, Evaluate Reverse Polish Notation, Valid Parentheses, Day 4: Jump Game, Jump Game II, Candy, Task Scheduler, Day 5: Queue Reconstruction, Partition Labels, Word Ladder, Clone Graph, Weekly Test | 22 |
| 8 | Advanced DP, Graphs & Greedy | Day 1: Arithmetic Slices, Triangle, LIS, Day 2: Russian Doll Envelopes, Burst Balloons, Super Egg Drop, Day 3: Critical Connections, Minimize Malware Spread, Permutations, Day 4: Generate Parentheses, Shortest Way to Form String, Minimum Domino Rotations, Day 5: Wildcard Matching, Gas Station, Repeated DNA Sequences, Weekly Test | 20 |
| 9 | Bit Manipulation, Trees, DFS, Strings & Tries | Day 1: Divide Two Integers, Single Number, Single Number III, Day 2: Find Object in Grid, Range Sum BST, Serialize/Deserialize Binary Tree, Day 3: Vertical Order Traversal, Binary Tree Max Path Sum, Matchsticks to Square, Day 4: String to Integer (atoi), Best Time to Buy/Sell Stock II, Word Squares, Day 5: Camelcase Matching, Top K Frequent Elements, Best Time to Buy/Sell Stock, Weekly Test | 20 |
| 10 | Advanced Graphs, DFS, Miscellaneous & Final Review | Day 1: Alien Dictionary, Optimize Water Distribution, Nested List Weight Sum, Day 2: Distribute Coins, Broken Calculator, Stream of Characters, Day 3: Sum of Products, Valid Palindrome, Shortest Word Distance, Day 4: Shortest Word Distance II & III, Day 5: Capacity to Ship Packages, Reverse Nodes in k-Group, Online Election, Weekly Test | 19 |
Course Curriculum
Total: 186+ problems
Note: Curriculum may vary based on cohort progress and student needs. All enrolled students get lifetime access to course materials and recordings.
Meet Your Instructor
Amit Singh
AlgoEngineer Instructor
Senior software engineer at Amazon with 12+ years of experience building scalable distributed systems. Holds a Master's degree in Computer Science with a concentration in Artificial Intelligence and Machine Learning from Arizona State University (GPA 3.92). Claude Certified Architect, AWS Certified Developer and Oracle Certified Java Programmer, with deep expertise in data structures, algorithms, system design, and full-stack development. Passionate about mentoring engineers and helping them crack FAANG interviews through structured, pattern-based learning.
Frequently Asked Questions
Everything you need to know about AlgoEngineer
Still have questions? Get in touch