There are no items in your cart
Add More
Add More
| Item Details | Price | ||
|---|---|---|---|
Basic + Advanced (C++ and DSA)
Instructor: Sunyul Hossen
Language: HINGLISH
Validity Period: Lifetime
₹5999 55% OFF
₹2661
It's a comprehensive course to boost your C++ and Data Structures and Algorithms skills. We cover core concepts, refine problem-solving abilities, and progress to advanced patterns. Through real world applications and detailed lectures, you'll be well-prepared for technical interviews and software challenges. Our teaching method ensures thorough understanding, empowering students to think critically and approach challenges confidently.
| C++ (I) | |||
| Installing C++ on Windows 6:00 | |||
| How C++ works in-depth 22:00 | |||
| Variables in C++ 25:00 | |||
| Assignment 1 | |||
| Functions in C++ 19:00 | |||
| Header Files 13:00 | |||
| Debugging in C++ 19:00 | |||
| Conditional Statements (I) 10:00 | |||
| Conditional Statements (II) 14:00 | |||
| C++ (II) | |||
| Loops & Control Flow in C++ 27:00 | |||
| Pointers in C++ 13:00 | |||
| Reference in C++, Pass by reference 10:00 | |||
| Classes, Objects, Constructors, Destructors in C++ 44:00 | |||
| Inheritance in C++ 15:00 | |||
| Assignment 2 | |||
| Coding Assignment 1 | |||
| Coding Assignment 2 | |||
| Coding Assignment 3 | |||
| Coding Assignment 4 | |||
| Coding Assignment 5 | |||
| Coding Assignment 6 | |||
| Pass by value vs Pass by reference 18:00 | |||
| Virtual Functions in C++ 9:00 | |||
| C++ (III) | |||
| Visibility in C++ (Public, Private, Proteceted) 7:00 | |||
| Arrays in C++ (How to create Array in Stack and Heap) 14:00 | |||
| How strings work in C++ 15:00 | |||
| CONST in C++ 9:00 | |||
| Operators & Operands 12:00 | |||
| Ternary Operators 10:00 | |||
| Structs in C++ 12:00 | |||
| Assignment 3 | |||
| Coding Assignment 7 | |||
| Coding Assignment 8 | |||
| Coding Assignment 9 | |||
| Prefix Sum, Suffix Sum, 2 Pointers, Sliding Window, Standard Template Library (STL) | |||
| Complete C++ STL 38:00 | |||
| Complete C++ STL Syntax Resources | |||
| See all the syntax in action 60:00 | |||
| Logic Building Assignment 1 to 25 | |||
| Coding Assignment 10 | |||
| Coding Assignment 11 | |||
| Coding Assignment 12 | |||
| Coding Assignment 13 | |||
| Coding Assignment 14 | |||
| Coding Assignment 15 | |||
| Coding Assignment 16 | |||
| Time & Space Complexity 23:00 | |||
| Prefix Sum (1-Dimensional Array) 18:00 | |||
| AtCoder CSUMQ Solution 10:00 | |||
| Prefix Sum (2-Dimensional Array) 22:00 | |||
| Prefix Sum (2-Dimensional Array) - Optimized 19:00 | |||
| 2-Dimensional Array: Sum of a Section 37:00 | |||
| Scanline Algorithm, Sliding Window 24:00 | |||
| Sliding Window (Nastya and Door Problem - Codeforces) 17:00 | |||
| Coding Assignment 17 | |||
| Coding Assignment 18 to 26 | |||
| Coding Assignment 27 | |||
| Coding Assignment 28 | |||
| Coding Assignment 29 | |||
| Coding Assignment 30 | |||
| Coding Assignment 31 | |||
| Coding Assignment 32 | |||
| Binary Search, Binary Exponentiation | |||
| Binary Search Part 1 38:00 | |||
| Binary Search Part 2 17:00 | |||
| Binary Search Part 3 18:00 | |||
| Binary Search Part 4 16:00 | |||
| Binary Exponentiation 17:00 | |||
| Binary Search - Lower Bound & Upper Bound | |||
| Place k elements such that minimum distance is maximized | |||
| Coding Assignment 33 to 36 | |||
| Coding Assignment 33 | |||
| Coding Assignment 34 | |||
| Coding Assignment 35 | |||
| Coding Assignment 36 | |||
| Coding Assignment 37 | |||
| Ternary Search | |||
| Coding Assignment 38 | |||
| Coding Assignment 39 | |||
| Coding Assignment 40 | |||
| Coding Assignment 41 | |||
| Coding Assignment 42 | |||
| Coding Assignment 43 | |||
| Coding Assignment 44 | |||
| Coding Assignment 45 | |||
| Coding Assignment 46 | |||
| Coding Assignment 47 | |||
| Coding Assignment 48 | |||
| Coding Assignment 49 | |||
| Prime Numbers, Prime Sieve, Segmented Sieve, Prime Factorization | |||
| Prime Numbers part 1 19:00 | |||
| Prime Numbers part 1 17:00 | |||
| Prime Numbers part 3 6:00 | |||
| Prime Numbers part 4 20:00 | |||
| Prime Numbers part 5 5:00 | |||
| Prime Numbers part 6 14:00 | |||
| Prime Numbers part 7 3:00 | |||
| Prime Numbers part 8 16:00 | |||
| Prime Numbers part 9 19:00 | |||
| Prime Numbers part 10 10:00 | |||
| Coding Assignment 50 to 52 | |||
| Coding Assignment 50 | |||
| Coding Assignment 51 | |||
| Coding Assignment 52 | |||
| Coding Assignment 53 | |||
| Coding Assignment 54 | |||
| Coding Assignment 55 | |||
| Coding Assignment 56 | |||
| Coding Assignment 57 | |||
| Coding Assignment 58 | |||
| Coding Assignment 59 | |||
| BIT Manipulation (Classic and Advanced Algorithms) | |||
| Bit Manipulation Part 1 9:00 | |||
| Bit Manipulation Part 2 6:00 | |||
| Bit Manipulation Part 3 7:00 | |||
| Bit Manipulation Part 4 12:00 | |||
| Bit Manipulation Part 5 6:00 | |||
| Bit Manipulation Part 6 10:00 | |||
| Bit Manipulation Part 7 28:00 | |||
| Bit Manipulation Part 8 10:00 | |||
| Bit Manipulation Part 9 3:00 | |||
| Bit Manipulation Part 10 6:00 | |||
| Bit Manipulation Part 11 5:00 | |||
| Bit Manipulation Part 12 1:00 | |||
| Bit Manipulation Part 13 20:00 | |||
| Bit Manipulation Part 14 11:00 | |||
| Bit Manipulation Part 15 | |||
| Hasing Part 1 25:00 | |||
| Hashing + BIT Manipulation Part 16 5:00 | |||
| Bit Manipulation Part 17 10:00 | |||
| Bit Manipulation Part 18 7:00 | |||
| Bit Manipulation Part 19 13:00 | |||
| Bit Manipulation Part 20 | |||
| Bit Manipulation Part 21 3:00 | |||
| Coding Assignment 60 to 74 | |||
| Coding Assignment 60 | |||
| Coding Assignment 61 | |||
| Coding Assignment 62 | |||
| Coding Assignment 63 | |||
| Coding Assignment 64 | |||
| Coding Assignment 65 | |||
| Coding Assignment 66 | |||
| Coding Assignment 67 | |||
| Coding Assignment 68 | |||
| Coding Assignment 69 | |||
| Coding Assignment 70 | |||
| Coding Assignment 71 | |||
| Coding Assignment 72 | |||
| Coding Assignment 73 | |||
| Coding Assignment 74 | |||
| Coding Assignment 75 | |||
| Coding Assignment 76 | |||
| Coding Assignment 77 | |||
| Coding Assignment 78 | |||
| Coding Assignment 79 | |||
| Coding Assignment 80 | |||
| Coding Assignment 81 | |||
| Coding Assignment 82 | |||
| Coding Assignment 83 | |||
| Coding Assignment 84 | |||
| Coding Assignment 85 | |||
| Coding Assignment 86 | |||
| Coding Assignment 87 | |||
| Permutations & Combinations | |||
| Permutations & Combinations Part 1 14:00 | |||
| Permutations & Combinations Part 2 10:00 | |||
| Permutations & Combinations Part 3 16:00 | |||
| Permutations & Combinations Part 4 22:00 | |||
| Combinatorics Basics | |||
| Binomial Coefficient | |||
| Coding Assignment 88 | |||
| Coding Assignment 89 | |||
| Permutations and Combinations Formulas | |||
| Coding Assignment 90 | |||
| Coding Assignment 91 | |||
| Coding Assignment 92 | |||
| Coding Assignment 93 | |||
| Coding Assignment 94 | |||
| Recursion (Classic & Advanced Algorithms) | |||
| Recursion Part 1 22:00 | |||
| Recursion Part 2 19:00 | |||
| Recursion Part 3 21:00 | |||
| Recursion Part 4 23:00 | |||
| Recursion Part 5 6:00 | |||
| Recursion Part 6 10:00 | |||
| Recursion Part 7 17:00 | |||
| Recursion Part 8 10:00 | |||
| Coding Assignment 95 | |||
| Coding Assignment 96 | |||
| Coding Assignment 97 | |||
| Coding Assignment 98 | |||
| Coding Assignment 99 | |||
| Coding Assignment 100 | |||
| Coding Assignment 101 | |||
| Coding Assignment 102 | |||
| Coding Assignment 103 | |||
| Coding Assignment 104 to 107 | |||
| Coding Assignment 104 | |||
| Coding Assignment 105 | |||
| Coding Assignment 106 | |||
| Coding Assignment 107 | |||
| Divide & Conquer | |||
| Divide & Conquer part 1 15:00 | |||
| Divide & Conquer part 2 17:00 | |||
| Divide & Conquer part 3 7:00 | |||
| Divide & Conquer part 4 6:00 | |||
| Divide & Conquer part 5 10:00 | |||
| Divide & Conquer part 6 1:00 | |||
| Divide & Conquer + BIT Manipulation (Advanced Algorithms) | |||
| Divide & Conquer + BIT Manipulation part 1 10:00 | |||
| Divide & Conquer + BIT Manipulation part 2 7:00 | |||
| Divide & Conquer + BIT Manipulation part 3 8:00 | |||
| Divide & Conquer + BIT Manipulation part 4 3:00 | |||
| Divide & Conquer + BIT Manipulation part 5 2:00 | |||
| Greedy Algorithms | |||
| Greedy Algorithm Part 1 13:00 | |||
| Greedy Algorithm Part 2 7:00 | |||
| Greedy Algorithm Part 3 26:00 | |||
| Coding Assignment 109 to 112 | |||
| Dynamic Programming (Classic & Advanced Algorithms) | |||
| Dynamic Programming Part 1 51:00 | |||
| Dynamic Programming Part 2 27:00 | |||
| Dynamic Programming Part 3 11:00 | |||
| Dynamic Programming Part 4 3:00 | |||
| Dynamic Programming Part 5 15:00 | |||
| Dynamic Programming Part 6 4:00 | |||
| Dynamic Programming Part 7 15:00 | |||
| Dynamic Programming Part 8 2:00 | |||
| Dynamic Programming Part 9 36:00 | |||
| Dynamic Programming Part 10 2:00 | |||
| Dynamic Programming Part 11 17:00 | |||
| Dynamic Programming Part 12 | |||
| Dynamic Programming Part 13 7:00 | |||
| Dynamic Programming Part 14 10:00 | |||
| Dynamic Programming Part 15 2:00 | |||
| Dynamic Programming Part 16 5:00 | |||
| Dynamic Programming Part 17 8:00 | |||
| Dynamic Programming Part 18 6:00 | |||
| Dynamic Programming Part 19 12:00 | |||
| Dynamic Programming Part 20 5:00 | |||
| Dynamic Programming Part 21 19:00 | |||
| Dynamic Programming Part 22 25:00 | |||
| Dynamic Programming Part 23 17:00 | |||
| Dynamic Programming Part 24 7:00 | |||
| Dynamic Programming Part 25 4:00 | |||
| Dynamic Programming Part 26 7:00 | |||
| Dynamic Programming Part 27 4:00 | |||
| Coding Assignment 113 to 192 | |||
| Stack, Queue, Kadane | |||
| kadane Algorithm Part 1 9:00 | |||
| kadane Algorithm Part 2 2:00 | |||
| Kadane Algorithm Part 3 6:00 | |||
| Kadane Algorithm Part 4 7:00 | |||
| Stack Part 1 3:00 | |||
| Stack Part 2 7:00 | |||
| Stack Part 3 8:00 | |||
| Stack Part 4 15:00 | |||
| Stack Part 5 7:00 | |||
| Stack Part 6 | |||
| Stack Part 7 4:00 | |||
| Stack Part 8 7:00 | |||
| Stack Part 9 1:00 | |||
| Queue part 1 17:00 | |||
| Queue part 2 10:00 | |||
| Queue part 3 5:00 | |||
| Queue part 4 3:00 | |||
| Queue part 5 4:00 | |||
| Coding Assignment 193 to 205 | |||
| Priority Queue | |||
| Priority Queue Part 1 12:00 | |||
| Priority Queue Part 2 10:00 | |||
| Priority Queue Part 3 5:00 | |||
| Priority Queue part 4 26:00 | |||
| Priority Queue part 5 14:00 | |||
| Rolling Hash, Prefix Function, Rabin Karp, KMP | |||
| Rolling Hash Part 1 9:00 | |||
| Rolling Hash Part 2 11:00 | |||
| Rolling Hash Part 3 7:00 | |||
| Rolling Hash Part 4 12:00 | |||
| Rolling Hash Part 5 1:00 | |||
| Rolling Hash Part 6 25:00 | |||
| Rolling Hash Part 7 9:00 | |||
| Rolling Hash Part 8 | |||
| Rolling Hash Part 9 3:00 | |||
| Rolling Hash Part 10 13:00 | |||
| Rolling Hash Part 11 | |||
| Coding Assignment 206 to 227 | |||
| Trees | |||
| Lecture 1 5:00 | |||
| Lecture 2 5:00 | |||
| Lecture 3 7:00 | |||
| Lecture 4 10:00 | |||
| Lecture 5 4:00 | |||
| Lecture 6 | |||
| Lecture 7 6:00 | |||
| Lecture 8 2:00 | |||
| Lecture 9 8:00 | |||
| Lecture 10 3:00 | |||
| Coding Assignment 228 to 249 | |||
| Fenwick Tree | |||
| Coding Assignment 250 to 264 | |||
| Graph Algorithms | |||
| Coding Assignment 265 to 306 | |||
| Segment Tree | |||
| Coding Assignment 307 to 324 | |||
| Disjoint Set | |||
| Coding Assignment 325 to 339 | |||
| SQRT Decomposition, MO's Algorithm, Lazy Propagation | |||
| Coding Assignment 340 to 357 | |||
| Big Integers | |||
| Big integers 52:00 | |||
| Linear Recurrence & Matrix Exponentiation | |||
| Linear Recurrence & Matrix Exponentiation 49:00 | |||
| Pigeonhole Principle | |||
| Pigeonhole Principle 52:00 | |||
| Mathematical Expectations | |||
| Complete Mathematical Expectations in 1 Video 43:00 | |||
| Inclusion Exclusion Principle | |||
| Complete Inclusion Exclusion Principle 70:00 | |||
| Euclidean, Extended Euclidean, Multiplicative Modulo Inverse | |||
| Extended Euclidean Aglorithm & Applications 45:00 | |||
| Theorems in Number Theory | |||
| Theorems in Number Theory 57:00 | |||
After successful purchase, this item would be added to your Library.
You can access the library in the following ways :
- From Computer, you can access your library after successful login
- For other devices, you can access your library using this web app through browser of your device.
Other Courses
Launch your Graphy