The “Cracking the Coding Interview” course is a comprehensive program designed to prepare individuals for technical interviews. It covers various aspects of the interview process over the span of seven weeks and 150+ Leetcode Problems:
Week 1-2 focuses on brainstorming strategies, understanding data, problem-solving techniques, and the efficiency of algorithms. It delves into topics like direct access techniques, string processing, and hashing.
Week 2 explores search problem strategies, emphasizing linked structures and dynamic data structures, including lists and binary trees.
Week 3 introduces the concept of recursion and when to use brute force in problem-solving.
Week 4-5 covers optimization techniques, including dynamic programming and greedy algorithms.
Week 6 delves into modeling dependency-based problems, focusing on graph theory, priority queues, and greedy algorithms.
Week 7 provides domain-specific knowledge for programming interviews, including object-oriented programming, database concepts, and operating systems.
Throughout the course, participants learn essential problem-solving skills, data structures, and interview-specific techniques to excel in technical interviews.
What Will You Learn?
- Understanding Data
- Problem Solving Strategies
- Algorithm Efficiency
- Arrays, Strings, Stacks, Queues
- 150+ Leetcode Problems
- Dynamic Data Structures
- Binary Trees
- Linked Structures vs. Hashing
- Understanding Recursion
- Solution Space Navigation
- Dynamic Programming
- Greedy Algorithms
- Graph Modeling
- Priority Queues
- Greedy Algorithms
- Object-Oriented Programming
- Operating Systems (Threads, Locks)
- Theory of Computation
- Quantitative and Analytical Problems
Arrays and Strings01:58:00
Algorithm and Data Structure’s Efficiency02:09:00
Stacks and Queues(using vector) and their applications – Iterative Merge Sort02:02:48
Dynamic Data Structures(Lists)02:01:54
Iterators (list, forward-list, set, multi-set, ordered_set)02:07:00
Binary Trees and Binary Search Tree02:06:00
Binary Search Tree (Delete, Iterators) + Level Order Traversal + set, multi-set of STL01:57:00
Dynamic Programming I01:50:00
Divide and Conquer + Dynamic Programming II02:19:00
Dynamic Programming III01:43:00
2D Dynamic Programming02:06:00
Graphs II – Priority Queues and Dijkstra Algorithm02:24:00
Lecture 17a – Discussion Priority Queue Based Problems24:00
Lecture 17b Priority queue based problems02:42:00
Revision of Theory of Computation02:00:00
Story of Databases02:42:00
Quantitative and Analytical Problems01:09:00