Data Structures & Algorithms (Beginner to Advanced)
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
30th April 2024
Duration
~6 months
Class Timings (Weekdays)
Tue, Thu (9 PM IST)
Class Timings (Weekend)
Sun (4 PM) & Sun (9 PM)
Class Duration
2-2.5 hours
Doubt Sessions
Mon, Wed (9 PM IST)
Recordings available?
Yes
Validity of Recordings
4 Years
Programming Languages
C++ & Java
Language of Communication
English
About the instructor
Mohammad Fraz
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
Pulkit Chhabra
Pulkit is a DSA expert with experience working in companies like Google, CodeNation & HackerRank. Not only that, he is also one of the most celebrated Competitive Programmers in India who is a master on CodeForces and has a 6-star rating on CodeChef.
Pulkit also has teaching experience on platforms like Relevel, Unacademy, CodeChef, Coding Blocks and Coding Ninjas. With a mix of in-depth DSA knowledge and a lot of teaching experience, he'll be a great mentor for students in their journey.
Have a look at our previous live lectures
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 in Game Theory
DP for Combinatorics and Probability
DP in Trees & Graphs
Digit DP
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
Game Theory Basics
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 probably the most exhaustive curriculum in the market. Fraz & Pulkit sat together for hours multiple times and researched intensively to ensure that no important topic was missed.
With Fraz's knack for categorising different types of problems into easy-to-understand buckets, and Pulkit's way of approaching & explaining every problem from 1st principle, the combination of the learnings students will have is unparalleled.
We believe that when there is right motivation, you'll tend to put in those extra efforts to stand out and perform better and better. What better way than giving you exciting prizes & making you famous among your batchmates if you're performing well? xD
Yes, we'll have regular bonus sessions on topics like importance of LinkedIn profile, Resume building, Interview tips etc. Not only that, we'll also bring in technical recruiters from top product based companies & hiring managers to answer your questions, first hand.
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.
Very supportive, always goes out of the way to clear all the doubts
Fraz's beginner-friendly approach facilitated a solid grasp of every concept
Pulkit's lectures are a goldmine
Fraz's dedication to the classes was commendable
Pulkit bhaiya's course helped me crack Amazon
Fraz made sure new learners like me got every concept down solid
Without Pulkit sir's guidance, I wouldn't be where I am today
Transformative DSA course, brought clarity to complex concepts.
Pulkit sir's approach of explaining things in total depth is unforgettable
Amazing teaching skills. Fraz makes even the most difficult topic easy to understand
Taking Pulkit sir's course was one of my best decisions of 2021
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.
We'll have 2 parallel tracks for the initial part of the cohort, where the basic language fundamentals will be taught, but after that, we'll have a single merged track where algorithms discussed will be common for C++ and Java, and codes in both the languages will be given.
Yes, you guessed right, there will be 100+ live sessions.
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 TAs who are experts in
DSA. Trust us, we've grilled them well in their
interviews.
Also, the 2 doubt sessions 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. You may not see much on the course dashboard for now, but we'll start adding the curriculum by 2nd half of April.
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.