Curriculum
- 4 Sections
- 25 Lessons
- 16 Weeks
Expand all sectionsCollapse all sections
- Basic Data Structure13
- 1.0Arrays and Maths: Subarray problems, Prefix Sum Technique, 2D arrays, Number Theory
- 1.1Backtracking: Recursion, Permutations & Combinations
- 1.2Binary Search Trees: Insertion, deletion, traversal
- 1.3Bit Manipulation: Basic operations, Bit masking, Hamming distance
- 1.4Hashing: Collision resolution techniques, Hash tables, Applications of hashing
- 1.5Linked Lists: Types and implementation, Pointer-based questions
- 1.6Queues: Implementation, Circular queue, Priority queue, Deque
- 1.7Searching: Linear search, Binary search and variations
- 1.8Sorting: Bubble sort, Selection sort, Insertion sort, Quick sort, Merge sort
- 1.9Stacks: Implementation, Expression evaluation, Sequence and pattern identification, Histogram and area problems
- 1.10Strings: String manipulation, String matching
- 1.11Trees: Inorder, Preorder, Postorder, Level Order traversal, Lowest Common Ancestor
- 1.12Two Pointers: Opposite direction pointers, Same direction pointers, Three pointer techniques
- Advanced Algorithms5
- 2.0Dynamic Programming: Classic DP problems, Array, tree, and graph-based problems
- 2.1Graphs: BFS, DFS, Shortest Path algorithms, Minimum Spanning Tree algorithm
- 2.2Greedy Algorithm: Classic problems, Array and graph-based problems
- 2.3Heaps: Min Heap, Max Heap
- 2.4Tries: Basic operations, Word search problems
- System Design3
- 3.0Case Studies: Social Media (Instagram, WhatsApp), E-Commerce (Amazon, Flipkart), Aggregator (Uber, Swiggy, Zomato)
- 3.1High-Level Design: System architecture, Scalability, Performance optimization, Database and storage design, Security, Reliability, Networking and integration strategies
- 3.2Low-Level Design: Design patterns, UML diagrams, SOLID principles
- 100% Placement Support4