There are no items in your cart
Add More
Add More
Item Details | Price |
---|
Ignite Your Potential with Personalized Guidance and Career Success Support
Instructor: Sunyul Hossen
Language: HINGLISH
Validity Period: 1460 days
1:1 Mentorship Program And Placement Assistance description
C++ (I) | |||
Installing C++ on Windows | |||
How C++ works in-depth | |||
Orientation Session | |||
Variables in C++ | |||
Assignment 1 | |||
Functions in C++ | |||
Header Files | |||
Debugging in C++ | |||
Conditional Statements (I) | |||
Conditional Statements (II) | |||
C++ (II), LinkedIn Profile Building Session | |||
Loops & Control Flow in C++ | |||
Pointers in C++ | |||
Reference in C++, Pass by reference | |||
Classes, Objects, Constructors, Destructors in C++ | |||
Inheritance in C++ | |||
Assignment 2 | |||
Coding Assignment 1 | |||
Coding Assignment 2 | |||
Coding Assignment 3 | |||
Coding Assignment 4 | |||
Coding Assignment 5 | |||
Coding Assignment 6 | |||
Build Top Notch LinkedIn Profile (I) | |||
Build Top Notch LinkedIn Profile (II) | |||
Pass by value vs Pass by reference | |||
Virtual Functions in C++ | |||
C++ (III) | |||
Visibility in C++ (Public, Private, Proteceted) | |||
Arrays in C++ (How to create Array in Stack and Heap) | |||
How strings work in C++ | |||
CONST in C++ | |||
Operators & Operands | |||
Ternary Operators | |||
Structs in C++ | |||
Assignment 3 | |||
Coding Assignment 7 | |||
Coding Assignment 8 | |||
Coding Assignment 9 | |||
Resume Building Session, Prefix Sum, Suffix Sum, 2 Pointers, Sliding Window, Standard Template Library (STL) | |||
Complete C++ STL | |||
Complete C++ STL Syntax Resources | |||
See all the syntax in action | |||
Time & Space Complexity | |||
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 | |||
Prefix Sum (1-Dimensional Array) | |||
AtCoder CSUMQ Solution | |||
Prefix Sum (2-Dimensional Array) | |||
Prefix Sum (2-Dimensional Array) - Optimized | |||
2-Dimensional Array: Sum of a Section | |||
Scanline Algorithm, Sliding Window | |||
Sliding Window (Nastya and Door Problem - Codeforces) | |||
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 | |||
Resume Building Session | |||
Resume Format Link - Make a copy and edit | |||
Binary Search, Binary Exponentiation | |||
Binary Search Part 1 | |||
Binary Search Part 2 | |||
Binary Search Part 3 | |||
Binary Search Part 4 | |||
Binary Exponentiation | |||
Binary Search - Lower Bound & Upper Bound | |||
Place k elements such that minimum distance is maximized | |||
Coding Assignment 33 to 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 | |||
Job Hunting on Different Platforms, Prime Numbers, Prime Sieve, Segmented Sieve, Prime Factorization | |||
Prime Numbers part 1 | |||
Prime Numbers part 2 | |||
Prime Numbers part 3 | |||
Prime Numbers part 4 | |||
Prime Numbers part 5 | |||
Prime Numbers part 6 | |||
Prime Numbers part 7 | |||
Prime Numbers part 8 | |||
Prime Numbers part 9 | |||
Prime Numbers part 10 | |||
Coding Assignment 50 to 52 | |||
Coding Assignment 53 | |||
Coding Assignment 54 | |||
Coding Assignment 55 | |||
Coding Assignment 56 | |||
Coding Assignment 57 | |||
Coding Assignment 58 | |||
Coding Assignment 59 | |||
Job Hunting on Different Platforms Part 1 | |||
Job Hunting on Different Platforms Part 2 | |||
Job Hunting on Different Platforms Part 3 | |||
BIT Manipulation (Classic and Advanced Algorithms) | |||
Bit Manipulation Part 1 | |||
Bit Manipulation Part 2 | |||
Bit Manipulation Part 3 | |||
Bit Manipulation Part 4 | |||
Bit Manipulation Part 5 | |||
Bit Manipulation Part 6 | |||
Bit Manipulation Part 7 | |||
Bit Manipulation Part 8 | |||
Bit Manipulation Part 9 | |||
Bit Manipulation Part 10 | |||
Bit Manipulation Part 11 | |||
Bit Manipulation Part 12 | |||
Bit Manipulation Part 13 | |||
Bit Manipulation Part 14 | |||
Bit Manipulation Part 15 | |||
Hasing Part 1 | |||
Hashing + BIT Manipulation Part 16 | |||
Bit Manipulation Part 17 | |||
Bit Manipulation Part 18 | |||
Bit Manipulation Part 19 | |||
Bit Manipulation Part 20 | |||
Bit Manipulation Part 21 | |||
Coding Assignment 60 to 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 | |||
Permutations & Combinations Part 2 | |||
Permutations & Combinations Part 3 | |||
Permutations & Combinations Part 4 | |||
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 | |||
Recursion Part 2 | |||
Recursion Part 3 | |||
Recursion Part 4 | |||
Recursion Part 5 | |||
Recursion Part 6 | |||
Recursion Part 7 | |||
Recursion Part 8 | |||
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 | |||
Divide & Conquer | |||
Divide & Conquer part 1 | |||
Divide & Conquer part 2 | |||
Divide & Conquer part 3 | |||
Divide & Conquer part 4 | |||
Divide & Conquer part 5 | |||
Divide & Conquer part 6 | |||
Coding Assignment 108 | |||
Divide & Conquer + BIT Manipulation (Advanced Algorithms) | |||
Divide & Conquer + BIT Manipulation part 1 | |||
Divide & Conquer + BIT Manipulation part 2 | |||
Divide & Conquer + BIT Manipulation part 3 | |||
Divide & Conquer + BIT Manipulation part 4 | |||
Divide & Conquer + BIT Manipulation part 5 | |||
Greedy Algorithms | |||
Greedy Algorithm Part 1 | |||
Greedy Algorithm Part 2 | |||
Greedy Algorithm Part 3 | |||
Coding Assignment 109 to 112 | |||
Dynamic Programming (Classic & Advanced Algorithms) | |||
Dynamic Programming Part 1 | |||
Dynamic Programming Part 2 | |||
Dynamic Programming Part 3 | |||
Dynamic Programming Part 4 | |||
Dynamic Programming Part 5 | |||
Dynamic Programming Part 6 | |||
Dynamic Programming Part 7 | |||
Dynamic Programming Part 8 | |||
Dynamic Programming Part 9 | |||
Dynamic Programming Part 10 | |||
Dynamic Programming Part 11 | |||
Dynamic Programming Part 12 | |||
Dynamic Programming Part 13 | |||
Dynamic Programming Part 14 | |||
Dynamic Programming Part 15 | |||
Dynamic Programming Part 16 | |||
Dynamic Programming Part 17 | |||
Dynamic Programming Part 18 | |||
Dynamic Programming Part 19 | |||
Dynamic Programming Part 20 | |||
Dynamic Programming Part 21 | |||
Dynamic Programming Part 22 | |||
Dynamic Programming Part 23 | |||
Dynamic Programming Part 24 | |||
Dynamic Programming Part 25 | |||
Dynamic Programming Part 26 | |||
Dynamic Programming Part 27 | |||
Coding Assignment 113 to 192 | |||
Stack, Queue, Kadane | |||
kadane Algorithm Part 1 | |||
kadane Algorithm Part 2 | |||
Kadane Algorithm Part 3 | |||
Kadane Algorithm Part 4 | |||
Stack Part 1 | |||
Stack Part 2 | |||
Stack Part 3 | |||
Stack Part 4 | |||
Stack Part 5 | |||
Stack Part 6 | |||
Stack Part 7 | |||
Stack Part 8 | |||
Stack Part 9 | |||
Queue part 1 | |||
Queue part 2 | |||
Queue part 3 | |||
Queue part 4 | |||
Queue part 5 | |||
Coding Assignment 193 to 205 | |||
Priority Queue | |||
Priority Queue Part 1 | |||
Priority Queue Part 2 | |||
Priority Queue Part 3 | |||
Priority Queue part 4 | |||
Priority Queue part 5 | |||
Rolling Hash, Prefix Function, Rabin Karp, KMP | |||
Rolling Hash Part 1 | |||
Rolling Hash Part 2 | |||
Rolling Hash Part 3 | |||
Rolling Hash Part 4 | |||
Rolling Hash Part 5 | |||
Rolling Hash Part 6 | |||
Rolling Hash Part 7 | |||
Rolling Hash Part 8 | |||
Rolling Hash Part 9 | |||
Rolling Hash Part 10 | |||
Rolling Hash Part 11 | |||
Coding Assignment 206 to 227 | |||
Trees | |||
Lecture 1 | |||
Lecture 2 | |||
Lecture 3 | |||
Lecture 4 | |||
Lecture 5 | |||
Lecture 6 | |||
Lecture 7 | |||
Lecture 8 | |||
Lecture 9 | |||
Lecture 10 | |||
Lecture 11 | |||
Lecture 12 | |||
Coding Assignment 228 to 249 | |||
Fenwick Tree | |||
Coding Assignment 250 to 264 | |||
Graph Algorithms | |||
Coding Assignment 265 to 306 | |||
Segment Trees | |||
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 | |||
Linear Recurrence & Matrix Exponentiation | |||
Linear Recurrence & Matrix Exponentiation | |||
Pigeonhole Principle | |||
Pigeonhole Principle | |||
Mathematical Expectations | |||
Complete Mathematical Expectations in 1 Video | |||
Inclusion Exclusion Principle | |||
Complete Inclusion Exclusion Principle | |||
Euclidean, Extended Euclidean, Multiplicative Modulo Inverse | |||
Extended Euclidean Aglorithm & Applications | |||
Job Hunting Strategy for Current Market | |||
Job Hunting Strategy for Current Market | |||
Projects in Different Domains | |||
Projects in Different Domains | |||
Operating Systems | |||
Top Interview Questions & Answers | |||
DBMS & SQL Queries | |||
Top Interview Questions & Answers | |||
Computer Networking | |||
Top Interview Questions & Answers | |||
Object Oriented Programming | |||
Top Interview Questions & Answers | |||
System Design Basics | |||
Microservices Vs Monoliths | |||
Scalability | |||
Load Balancing | |||
Designing a Pizza Shop Practically | |||
ingle Point of Failure | |||
Sharding | |||
Database Sharding | |||
Service discovery and Heartbeat | |||
System Design Messaging & Event Handling | |||
Message Queue | |||
Asynchronous messaging benefits | |||
Publishers Subscribers Model | |||
Live Sessions | |||
24 September | |||
28th October | |||
29th October | |||
Dec 10 | |||
7 Jan | |||
March 3, 2024 | |||
Coding Assignment Solutions | |||
All Coding Assignment Solutions | |||
Reachout Format | |||
Reachout Format | |||
Practice IDE | |||
CS FOR ALL Contest Solutions | |||
CS FOR ALL Contest 1 Solutions | |||
Theorems in Number Theory | |||
Theorems in Number Theory | |||
Job Hunting in 2024 [English] | |||
Part 1 | |||
Part 2 | |||
Part 3 | |||
Behavioral Question | |||
Top Behavioral Questions with Answers |
After successful purchase, this item would be added to your Library.
You can access the library in the following ways :