Data Structures & Algorithms (Beginner to Advanced) + FREE LLD Recordings
A methodical live DSA course that starts with language fundamentals for beginners and goes all the way to advanced topics like Graph Algorithms, Segment Trees, Sparse Tables etc.
Get 30% OFF on this course
Special Discount ends tonight.
00:
Days
00:
Hours
00:
Mins
00
Secs
Basic Course Details
Start Date - (4.0 Batch)
1st January 2025
Duration
~6 months
Live Classes
Mon, Fri (9 - 11 PM IST)
Recorded Classes
Tues, Sat (9 - 11 PM IST)
Class Duration
2-2.5 hours
Doubt Sessions
Thurs (9 - 11 PM IST)
Recordings available?
Yes
Validity of Recordings
4 Years
Programming Languages
C++ & Java
Language of Communication
Hindi
This Course Includes
About the instructor
Mohammad Fraz
Ex-Google
Meet Fraz, an ex-googler and a dedicated educator known for simplifying DSA. With teaching experience on platforms like Unacademy, CodeChef, Coding Ninjas, NextLeap, and GeeksforGeeks, and his own YouTube channel, he has reached over 500K students, making challenging topics easily understandable.
Beyond the classroom, he has been inspiring students for over 4 years through his YouTube videos. Moreover, He is a seasoned problem-solver who has solved over 2000 problems across various platforms.
About the instructor
Saksham Arora
SDE at Microsoft
Introducing Saksham, a seasoned software engineer at Microsoft and a top-rated 5-star coder on CodeChef. With an impressive track record of solving over 3000 problems across various platforms, Saksham is not only a coding expert but also a dedicated educator.
Known for his patient teaching style, Saksham excels at breaking down complex DSA concepts and addressing all your doubts. His goal is to make learning engaging and straightforward, ensuring you grasp each topic with confidence. Get ready to enhance your skills with guidance from one of the best in the field!
Sample lectures for your reference
Course Content
Choose b/w C++ & Java (parallel tracks will go on)
Introduction, Variables, Operators, Input/Output
Control Flow (if-else, loops), Methods/Functions
Array Basics, Strings
Object-oriented programming Concepts
A bit about Standard Template Library
Why, What and How?
Different Notations
Comparing different complexities
Practice problems
Theory & basic operations
Memory Allocation
Dynamic Arrays
Practising patterns like 2-pointer, sliding window, etc.
Also, auxiliary arrays, using an array as a map etc.
Multi-dimensional arrays and problems
Why, What and How?
Beginner Classical Problems
Recursion Tree & Space Time Complexities
Bubble Sort, Selection sort, Insertion sort: beginner-friendly
Merge Sort, Quick Sort: the better ones
Applications of the above algorithms
Binary Search: The OG way of searching
Practicing patterns like BS on Arrays, on the answer
A bit about Ternary Search
Intuition and Implementation
Questions based on different patterns
Doubly and circularly linked list
Design problems
Theory and Basic operations
Implementation using arrays and linked list
Expression Evaluation: In-Fix, Post-Fix etc.
Problems like Rain Water Harvesting, Next Greater Element etc.
Deque & its classical problems
Intuition behind Hash Function
Implementation unordered map
Introducing Unordered Set & Ordered Set and Map
LRU Cache
Lots of more practice problems
Prime Numbers: Primality Testing and Factorization
Sieve of Eratosthenes and its variations
Modular Arithmetic and Binary Exponentiation
Euclid’s GCD and extended GCD Algorithm
Linear Diophantine Equation and Modular Inverse
Practice, Practice, Practice
Introduction and How to identify
Activity Selection Problem, Fractional Knapsack
Job Selection Problem, Huffman Encoding
Practicing more classical problems
Classical Problems: Generating Subsets, Permutations etc
More Problems: Rat in a Maze, Sudoku Solver, N-Queen etc
Iteration vs Recursion
Classical Patterns (LIS, LCS, Knapsack, Matrix Multiplication etc.)
DP with Bitmasks
DP for Combinatorics and Probability
DP in Trees & Graphs
Solving Recurrence Relations
Boolean Algebra and Bit Manipulation
Combinatorics: Basics, Binomial Cofficients, Stars & Bars etc.
Pigeon Hole Principle
Probability
Theory and Implementation
Binary Trees: traversals & basic operations
Binary Search Trees
Classical Problems
Heap Theory and Implementation
Implementing Priority CPU Scheduling
Binary Trie Theory and Implementation
Classical Problems
Theory and methods to implement
Traversals (DFS, BFS)
Connected Components & DSU
Shortest Paths - Dijkstra, Bellman Ford, Floyd Warshall Algorithms
Minimum Spanning Tree - Prim, Kruskal Algorithms
Directed Graphs
Topological Sorting, SCCs
Naive Pattern Matching & Rabin Karp
Prefix Function & KMP Algorithm
Practicing above algorithms
Practicing more string problems
Digit DP
Game Theory Basics
DP with Game Theory
Sparse Table
Segment Tree
Fenwick Tree (aka BIT)
Why should you join?
Why should you join?
We’d like to take some pride in saying that this is the most exhaustive DSA curriculum in the market. Fraz & Saksham sat together for hours multiple times and researched intensively to ensure that no important topic was missed.
With Fraz’s knack for categorizing different types of problems into easy-to-understand buckets, and Saksham’s way of approaching & explaining every problem from 1st principle,the combination of learnings students will have is unparalleled.
Also, Get a Signed Certificate on successful Completion of the Course.
Also, Get a Signed Certificate on successful Completion of the Course.
Fraz's teaching methods made intricate concepts understandable.
It was a very good journey to solve the DSA problems in the live classes.
Fraz's beginner-friendly approach facilitated a solid grasp of every concept
The DSA course was insightful, challenging and detailed.
Fraz's dedication to the classes was commendable
Simply Awesome 😎.
Fraz made sure new learners like me got every concept down solid
Transformative DSA course, brought clarity to complex concepts.
Amazing teaching skills. Fraz makes even the most difficult topic easy to understand
Frequently Asked Questions
Yes, we've got you covered, but safety comes with precaution, and for you, that means a commitment to attend classes and practice regularly.
In most companies that pay highly, there is at least 1 DSA interview round, even when hiring for senior levels. And if I talk about famous product-based companies hiring freshers, then almost all the interview rounds are DSA-based. Now, whether DSA is a good metric to hire or not is a debate for a different day, but what we've told above holds true presently.
Honestly, it depends on your time management, but we'd like to share that both instructors did it in their college time. There needs to be more than the DSA taught in most colleges for placements & internships.
The session will be a Hybrid of 2 live classes , 2 recordings and 1 live doubt session every week.
No problem, just don't make it a habit, please. Recording for each class will be uploaded within a few hours, and the recordings will have a validity of 4 years from the course start date.
We have yet to do an exact counting but be ready to solve 500+ problems.
Yes, of course. There will be an online community that you'll all become a part of after buying the course.
This is precisely why we’ve hired TA’s who are experts in DSA,you can simply raise a doubt ticket and the TA’s will revert it to you.Trust us, we’ve grilled them well in the interviews. Also, the doubt session we have every week will come to your rescue.
That's not necessary. When on the checkout page, you'll see that there are EMI options for many of the cards.
You should be able to access the course dashboard once you purchase it by logging in to your classroom.
No, you're not. Please reach out to us on support@learnyard.com. Our payments team will give you access as soon as they verify your case.