Skip to content
Zenvora
Curated Learning Tracks & Playlists

Tech Lectures & Courses

Step-by-step course tracks organized strictly by domain and YouTube channel playlist. No mixed lectures, no confusing jumps.

Sort:
Courses:

HTML

Web DevChai aur Code

1 sequential lectures • Channel course track

HTML complete course in Hindi
15:00
Chai aur CodeWatch

OS

CS Fundamentals

32 sequential lectures • Channel course track

Introduction to Operating Systems Placements Course 2022
7:21
YouTube CourseWatch
Lecture 1: What is an Operating System ?
18:38
YouTube CourseWatch
Lecture 2: Types of Operating Systems
40:21
YouTube CourseWatch
Lecture 3: Multi-Tasking vs Multi-Threading
38:57
YouTube CourseWatch
Lecture 4: Components of Operating System
45:16
YouTube CourseWatch
Lecture 5: System Calls in Operating System [Theory + Example + Hands-on Terminal]
28:13
YouTube CourseWatch
Lecture 6: How Operating System Boots up?
18:31
YouTube CourseWatch
Lecture 7: Difference between 32-bit & 64-bit Operating System
20:17
YouTube CourseWatch
Lecture 8: Comparison between different STORAGES used in Computer
11:14
YouTube CourseWatch
Lecture 9: How OS creates a PROCESS || Introduction to Process
37:35
YouTube CourseWatch
Lecture 10: What are different Process States in Operating System ?
18:18
YouTube CourseWatch
Lecture 11: Context Switching in OS | Medium Term Scheduler | Orphan/Zombie Process
40:41
YouTube CourseWatch
Lecture 12: What is Convoy Effect | FCFS CPU Scheduling Algorithm
24:55
YouTube CourseWatch
Lecture 13: Shortest Job First Algorithm | Priority Scheduling | Round Robin CPU Scheduling
44:33
YouTube CourseWatch
Lecture 14: Multi Level Queue Scheduling || MLFQ || Comparison btw CPU Scheduling Algorithms
28:02
YouTube CourseWatch
Lecture 15: What is Concurrency ? || Multi-Threading in C++ || Operating Systems Placement Series
24:20
YouTube CourseWatch
Lecture 16: Critical Section Problem || Race condition in OS
35:29
YouTube CourseWatch
Lecture 17: Conditional Variables & Semaphores to Synchronise Threads
22:53
YouTube CourseWatch
Lecture 18: Producer Consumer Problem and its Solution || OS Placement Series
14:47
YouTube CourseWatch
Lecture 19: Reader-Writer Problem and its Solution || OS Placement Series
13:51
YouTube CourseWatch
Lecture 20: The Dining Philosophers Problem & its Solution
16:24
YouTube CourseWatch
Lecture 21: What is Deadlock | Necessary Conditions | Handling Methods | Part - 1
54:06
YouTube CourseWatch
Lecture 22: Deadlock Avoidance | Deadlock Detection and Recovery | Part - 2
23:50
YouTube CourseWatch
Lecture 23: Solving LeetCode Problems on Concurrency || OS Placement Series
31:21
YouTube CourseWatch
Lecture 24: Memory Management in OS || Contiguous Memory Allocation
49:09
YouTube CourseWatch
Lecture 25: How OS manages Free Space? || Memory Management
31:10
YouTube CourseWatch
Lecture 26: What is Paging? || Non-Contiguous Memory Allocation
47:37
YouTube CourseWatch
Lecture 27: What is Segmentation || Non-Contiguous Memory Allocation
27:12
YouTube CourseWatch
Lecture 28: What is Virtual Memory? || Page fault in OS
44:15
YouTube CourseWatch
Lecture 29: Page Replacement Algorithms || How to implement LRU algorithm?
41:29
YouTube CourseWatch
Lecture 30: What is Thrashing? || Important Interview Question
35:09
YouTube CourseWatch
Bonus Session: Solving LeetCode Problems on Concurrency || Operating Systems Placement Series
33:49
YouTube CourseWatch

100 Days of Machine Learning

ML (Machine Learning)CampusX

134 sequential lectures • Channel course track

What is Machine Learning? | 100 Days of Machine Learning
20:00
CampusXWatch
AI Vs ML Vs DL for Beginners in Hindi
16:02
CampusXWatch
Types of Machine Learning for Beginners | Types of Machine learning in Hindi | Types of ML in Depth
27:42
CampusXWatch
Batch Machine Learning | Offline Vs Online Learning | Machine Learning Types
11:28
CampusXWatch
Online Machine Learning | Online Learning | Online Vs Offline Machine Learning
19:28
CampusXWatch
Instance-Based Vs Model-Based Learning | Types of Machine Learning
16:44
CampusXWatch
Challenges in Machine Learning | Problems in Machine Learning
23:40
CampusXWatch
Application of Machine Learning | Real Life Machine Learning Applications
29:02
CampusXWatch
Machine Learning Development Life Cycle | MLDLC in Data Science
25:13
CampusXWatch
Data Engineer Vs Data Analyst Vs Data Scientist Vs ML Engineer | Data Science Job Roles
26:23
CampusXWatch
What are Tensors | Tensor In-depth Explanation | Tensor in Machine Learning
41:29
CampusXWatch
Installing Anaconda For Data Science | Jupyter Notebook for Machine Learning | Google Colab for ML
10:00
CampusXWatch
End to End Toy Project | Day 13 | 100 Days of Machine Learning
10:00
CampusXWatch
How to Frame a Machine Learning Problem | How to plan a Data Science Project Effectively
10:00
CampusXWatch
Working with CSV files | Day 15 | 100 Days of Machine Learning
10:00
CampusXWatch
Working with JSON/SQL | Day 16 | 100 Days of Machine Learning
10:00
CampusXWatch
Fetching Data From an API | Day 17 | 100 Days of Machine Learning
10:00
CampusXWatch
Fetching data using Web Scraping | Day 18 | 100 Days of Machine Learning
10:00
CampusXWatch
Understanding Your Data | Day 19 | 100 Days of Machine Learning
10:00
CampusXWatch
EDA using Univariate Analysis | Day 20 | 100 Days of Machine Learning
10:00
CampusXWatch
EDA using Bivariate and Multivariate Analysis | Day 21 | 100 Days of Machine Learning
10:00
CampusXWatch
Pandas Profiling | Day 22 | 100 Days of Machine Learning
10:00
CampusXWatch
What is Feature Engineering | Day 23 | 100 Days of Machine Learning
10:00
CampusXWatch
Feature Scaling - Standardization | Day 24 | 100 Days of Machine Learning
10:00
CampusXWatch
Feature Scaling - Normalization | MinMaxScaling | MaxAbsScaling | RobustScaling
10:00
CampusXWatch
Encoding Categorical Data | Ordinal Encoding | Label Encoding
10:00
CampusXWatch
One Hot Encoding | Handling Categorical Data | Day 27 | 100 Days of Machine Learning
10:00
CampusXWatch
Column Transformer in Machine Learning | How to use ColumnTransformer in Sklearn
10:00
CampusXWatch
Machine Learning Pipelines A-Z | Day 29 | 100 Days of Machine Learning
10:00
CampusXWatch
Function Transformer | Log Transform | Reciprocal Transform | Square Root Transform
10:00
CampusXWatch
Power Transformer | Box - Cox Transform | Yeo - Johnson Transform
10:00
CampusXWatch
Binning and Binarization | Discretization | Quantile Binning | KMeans Binning
10:00
CampusXWatch
Handling Mixed Variables | Feature Engineering
10:00
CampusXWatch
Handling Date and Time Variables | Day 34 | 100 Days of Machine Learning
10:00
CampusXWatch
Handling Missing Data | Part 1 | Complete Case Analysis
10:00
CampusXWatch
Handling missing data | Numerical Data | Simple Imputer
10:00
CampusXWatch
Handling Missing Categorical Data | Simple Imputer | Most Frequent Imputation | Missing Category Imp
10:00
CampusXWatch
Missing Indicator | Random Sample Imputation | Handling Missing Data Part 4
10:00
CampusXWatch
KNN Imputer | Multivariate Imputation | Handling Missing Data Part 5
10:00
CampusXWatch
Multivariate Imputation by Chained Equations for Missing Value | MICE Algorithm | Iterative Imputer
10:00
CampusXWatch
What are Outliers | Outliers in Machine Learning
10:00
CampusXWatch
Outlier Detection and Removal using Z-score Method | Handling Outliers Part 2
10:00
CampusXWatch
Outlier Detection and Removal using the IQR Method | Handing Outliers Part 3
10:00
CampusXWatch
Outlier Detection using the Percentile Method | Winsorization Technique
10:00
CampusXWatch
Feature Construction | Feature Splitting
10:00
CampusXWatch
Curse of Dimensionality
10:00
CampusXWatch
Principle Component Analysis (PCA) | Part 1 | Geometric Intuition
10:00
CampusXWatch
Principle Component Analysis (PCA) | Part 2 | Problem Formulation and Step by Step Solution
10:00
CampusXWatch
Principle Component Analysis(PCA) | Part 3 | Code Example and Visualization
10:00
CampusXWatch
Simple Linear Regression | Code + Intuition | Simplest Explanation in Hindi
10:00
CampusXWatch
Simple Linear Regression | Mathematical Formulation | Coding from Scratch
10:00
CampusXWatch
Regression Metrics | MSE, MAE & RMSE | R2 Score & Adjusted R2 Score
10:00
CampusXWatch
Multiple Linear Regression | Geometric Intuition & Code
10:00
CampusXWatch
Multiple Linear Regression | Part 2 | Mathematical Formulation From Scratch
10:00
CampusXWatch
Multiple Linear Regression | Part 3 | Code From Scratch
10:00
CampusXWatch
What are the main Assumptions of Linear Regression? | Top 5 Assumptions of Linear Regression
10:00
CampusXWatch
Gradient Descent From Scratch | End to End Gradient Descent | Gradient Descent Animation
10:00
CampusXWatch
Batch Gradient Descent with Code Demo | Simple Explanation in Hindi
10:00
CampusXWatch
Stochastic Gradient Descent
10:00
CampusXWatch
Mini-Batch Gradient Descent
10:00
CampusXWatch
Polynomial Regression | Machine Learning
10:00
CampusXWatch
Bias Variance Trade-off | Overfitting and Underfitting in Machine Learning
10:00
CampusXWatch
Ridge Regression Part 1 | Geometric Intuition and Code | Regularized Linear Models
10:00
CampusXWatch
Ridge Regression Part 2 | Mathematical Formulation & Code from scratch | Regularized Linear Models
10:00
CampusXWatch
Ridge Regression Part 3 | Gradient Descent | Regularized Linear Models
10:00
CampusXWatch
5 Key Points - Ridge Regression | Part 4 | Regularized Linear Models
10:00
CampusXWatch
Lasso Regression | Intuition and Code Sample | Regularized Linear Models
10:00
CampusXWatch
Why Lasso Regression creates sparsity?
10:00
CampusXWatch
ElasticNet Regression | Intuition and Code Example | Regularized Linear Models
10:00
CampusXWatch
Logistic Regression Part 1 | Perceptron Trick
10:00
CampusXWatch
Logistic Regression Part 2 | Perceptron Trick Code
10:00
CampusXWatch
Logistic Regression Part 3 | Sigmoid Function | 100 Days of ML
10:00
CampusXWatch
Logistic Regression Part 4 | Loss Function | Maximum Likelihood | Binary Cross Entropy
10:00
CampusXWatch
Derivative of Sigmoid Function
10:00
CampusXWatch
Logistic Regression Part 5 | Gradient Descent & Code From Scratch
10:00
CampusXWatch
Accuracy and Confusion Matrix | Type 1 and Type 2 Errors | Classification Metrics Part 1
10:00
CampusXWatch
Precision, Recall and F1 Score | Classification Metrics Part 2
10:00
CampusXWatch
ROC Curve in Machine Learning | ROC-AUC in Machine Learning Simplified | CampusX
10:00
CampusXWatch
Softmax Regression || Multinomial Logistic Regression || Logistic Regression Part 6
10:00
CampusXWatch
Polynomial Features in Logistic Regression | Non Linear Logistic Regression | Logistic Regression 7
10:00
CampusXWatch
Logistic Regression Hyperparameters || Logistic Regression Part 8
10:00
CampusXWatch
Naive Bayes Classifier | Part 1 | Conditional Probability
10:00
CampusXWatch
Naive Bayes Classifier | Part 2 | Independent Events in Probability
10:00
CampusXWatch
Naive Bayes Classifier | Part 3 | Mutually Exclusive Events
10:00
CampusXWatch
Naive Bayes Classifier | Part 4 | Bayes Theorem in Probability
10:00
CampusXWatch
Naive Bayes Classifier | Part 5 | Problem based upon Bayes Theorem
10:00
CampusXWatch
Naive Bayes Classifier | Part 6 | Intuition
10:00
CampusXWatch
Naive Bayes Classifier | Part 7 | Mathematics behind Naive Bayes Algorithm
10:00
CampusXWatch
Naive Bayes Classifier | Part 8 | Simple Example Code
10:00
CampusXWatch
Naive Bayes Part 9 | Handling Numerical Data
10:00
CampusXWatch
What is K Nearest Neighbors? | KNN Explained in Hindi | Simple Overview in 1 Video | CampusX
10:00
CampusXWatch
Support Vector Machines | Geometric Intuition
10:00
CampusXWatch
Mathematics of SVM | Support Vector Machines | Hard margin SVM
10:00
CampusXWatch
Mathematics of Support Vector Machine | Soft Margin SVM
10:00
CampusXWatch
Kernel Trick in SVM | Geometric Intuition
10:00
CampusXWatch
Kernel Trick in SVM | Code Example
10:00
CampusXWatch
Decision Trees Geometric Intuition | Entropy | Gini impurity | Information Gain
10:00
CampusXWatch
Decision Trees - Hyperparameters | Overfitting and Underfitting in Decision Trees
10:00
CampusXWatch
Regression Trees | Decision Trees Part 3
10:00
CampusXWatch
Awesome Decision Tree Visualization using dtreeviz library
10:00
CampusXWatch
Introduction to Ensemble Learning | Ensemble Techniques in Machine Learning
10:00
CampusXWatch
Voting Ensemble | Introduction and Core Idea | Part 1
10:00
CampusXWatch
Voting Ensemble | Classification | Voting Classifier | Hard Voting Vs Soft Voting | Part 2
10:00
CampusXWatch
Voting Ensemble | Regression | Part 3
10:00
CampusXWatch
Bagging | Introduction | Part 1
10:00
CampusXWatch
Bagging Ensemble | Part 2 | Bagging Classifiers
10:00
CampusXWatch
Bagging Ensemble | Part 3 | Bagging Regressor
10:00
CampusXWatch
Introduction to Random Forest | Intuition behind the Algorithm
10:00
CampusXWatch
How Random Forest Performs So Well? Bias Variance Trade-Off in Random Forest
10:00
CampusXWatch
Bagging Vs Random Forest | What is the difference between Bagging and Random Forest | Very Important
10:00
CampusXWatch
Random Forest Hyper-parameters
10:00
CampusXWatch
Hyperparameter Tuning Random Forest using GridSearchCV and RandomizedSearchCV | Code Example
10:00
CampusXWatch
OOB Score | Out of Bag Evaluation in Random Forest | Machine Learning
10:00
CampusXWatch
Feature Importance using Random Forest and Decision Trees | How is Feature Importance calculated
10:00
CampusXWatch
How Adaboost Classifier Works? | Geometric Intuition
10:00
CampusXWatch
AdaBoost - A Step by Step Explanation
10:00
CampusXWatch
AdaBoost Algorithm | Code from Scratch
10:00
CampusXWatch
AdaBoost Hyperparameters | GridSearchCV in Adaboost
10:00
CampusXWatch
Bagging Vs Boosting | What is the difference between Bagging and Boosting
10:00
CampusXWatch
Gradient Boosting Explained | How Gradient Boosting Works?
10:00
CampusXWatch
Gradient Boosting Regression Part 2 | Mathematics of Gradient Boosting
10:00
CampusXWatch
Gradient Boosting for Classification | Geometric Intuition | CampusX
10:00
CampusXWatch
Introduction to XGBOOST | Machine Learning | CampusX
10:00
CampusXWatch
XGBoost for Regression | XGBoost Part 2 | CampusX
10:00
CampusXWatch
XGBoost For Classification | How XGBoost works on Classification Problems | CampusX
10:00
CampusXWatch
The Maths Behind XGBoost | Machine Learning | CampusX
10:00
CampusXWatch
Stacking and Blending Ensembles
10:00
CampusXWatch
K-Means Clustering Algorithm | Geometric Intuition | Clustering | Unsupervised Learning
10:00
CampusXWatch
K-Means Clustering Algorithm in Python | Practical Example | Student Clustering Example | sklearn
10:00
CampusXWatch
K-Means Clustering Algorithm From Scratch In Python | ML Algorithms From Scratch
10:00
CampusXWatch
Agglomerative Hierarchical Clustering | Python Code Example
10:00
CampusXWatch
DBSCAN Clustering Algorithms | Density Based Clustering | How DBSCAN Works | CampusX
10:00
CampusXWatch
Imbalanced Data in Machine Learning | Undersampling | Oversampling | SMOTE
10:00
CampusXWatch
Hyperparameter Tuning using Optuna | Bayesian Optimization using Optuna
10:00
CampusXWatch

Generative AI using LangChain & LLMs

GenAICampusX

21 sequential lectures • Channel course track

GenAI Roadmap for Beginners | End-to-End GenAI Course 2025 | CampusX
50:15
CampusXWatch
Generative AI using LangChain | GENAI for Beginners | CampusX
15:19
CampusXWatch
Introduction to LangChain | LangChain for Beginners | Video 1 | CampusX
37:44
CampusXWatch
LangChain Components | GenAI using LangChain | Video 2 | CampusX
53:24
CampusXWatch
LangChain Models | Indepth Tutorial with Code Demo | Video 3 | CampusX
1:42:03
CampusXWatch
Prompts in LangChain | Generative AI using LangChain | Video 4 | CampusX
1:18:33
CampusXWatch
Structured Output in LangChain | Generative AI using LangChain | Video 5 | CampusX
1:08:13
CampusXWatch
Output Parsers in LangChain | Generative AI using LangChain | Video 6 | CampusX
53:13
CampusXWatch
Chains in LangChain | Generative AI using LangChain | Video 7 | CampusX
54:01
CampusXWatch
What are Runnables in LangChain | Generative AI using LangChain | Video 8 | CampusX
1:16:22
CampusXWatch
Langchain Runnables - Part 2 | Generative AI using LangChain | Video 9 | CampusX
54:26
CampusXWatch
Document Loaders in LangChain | Generative AI using LangChain | Video 10 | CampusX
56:44
CampusXWatch
Text Splitters in LangChain | Generative AI using LangChain | Video 11 | CampusX
59:01
CampusXWatch
Vector Stores in LangChain | Generative AI using LangChain | Video 12 | CampusX
50:31
CampusXWatch
Retrievers in LangChain | Generative AI using LangChain | Video 13 | CampusX
51:10
CampusXWatch
Retrieval Augmented Generation | What is RAG | How does RAG Work | RAG Explained | CampusX
59:24
CampusXWatch
YouTube Chatbot using LangChain | Building a RAG system in LangChain | Video 15 | CampusX
46:15
CampusXWatch
Tools in LangChain | Generative AI using LangChain | Video 16 | CampusX
45:16
CampusXWatch
Tool Calling in LangChain | Generative AI using LangChain | Video 17 | CampusX
58:47
CampusXWatch
Building end-to-end AI Agent in LangChain | Generative AI using LangChain | Video 18 | CampusX
1:12:47
CampusXWatch
Ollama Masterclass 2026: Run Powerful Local LLMs with Ollama (3-Hour Full Course) | CampusX
2:49:41
CampusXWatch

Backend Engineering from First Principles

Backend DevPiyush Garg

31 sequential lectures • Channel course track

1. Roadmap for backend from first principles
31:24
Piyush GargWatch
2. Walk the path of a true backend engineer
3:53
Piyush GargWatch
3. What is a Backend, how do they work and why do we need them?
19:01
Piyush GargWatch
4. Benefits of learning backend engineering from first principles
10:11
Piyush GargWatch
5. Understanding HTTP for backend engineers, where it all starts
1:18:13
Piyush GargWatch
6. What is Routing in Backend? How Requests Find Their Way Home
24:04
Piyush GargWatch
7. Serialization and Deserialization for backend engineers
21:48
Piyush GargWatch
8. Authentication and authorization for backend engineers
1:35:57
Piyush GargWatch
9. Validations and transformations for backend engineers
42:48
Piyush GargWatch
10. What are controllers, services, repositories, middlewares and request context?
59:57
Piyush GargWatch
11. Complete REST API Design
2:03:34
Piyush GargWatch
12. Mastering Databases with Postgres
2:45:25
Piyush GargWatch
13. Caching, the secret behind it all
1:04:23
Piyush GargWatch
14. Task queues and background jobs
55:47
Piyush GargWatch
15. Full text search using Elasticsearch for blazingly fast search
32:08
Piyush GargWatch
16. Error Handling and Building Fault Tolerant Systems
1:09:25
Piyush GargWatch
17. Production-grade Configuration Management
36:14
Piyush GargWatch
18. Logging, Monitoring and Observability
39:51
Piyush GargWatch
19. Graceful Shutdown
35:56
Piyush GargWatch
20. Backend Security: Everything You Need to Know
2:50:03
Piyush GargWatch
21.1. Backend Scaling and Performance Engineering: Part-1
1:47:31
Piyush GargWatch
21.2. Backend Scaling and Performance Engineering: Part-2
2:18:11
Piyush GargWatch
22. Concurrency & Parallelism: IO Bound vs CPU Bound
1:28:06
Piyush GargWatch
23. Object Storage - Everything You Need to Know: Part -1
1:29:29
Piyush GargWatch
24. Object Storage - Everything You Need to Know: Part - 2
49:37
Piyush GargWatch
25. Real-Time Backends
51:54
Piyush GargWatch
26. Testing for Backend Engineers: mocks, TDD and coverage
1:24:32
Piyush GargWatch
27. The Twelve-Factor App
1:33:18
Piyush GargWatch
28. OpenAPI: The universal contract between clients and servers
43:55
Piyush GargWatch
29. Webhooks: how the server calls you
56:07
Piyush GargWatch
30. DevOps for backend engineers
1:48:26
Piyush GargWatch

Complete Modern Full Stack & MERN Bootcamp

Full StackSheryians Coding School

13 sequential lectures • Channel course track

Learn HTML, CSS and JavaScript in Single Video | Basics of MERN Stack Development
3:53:18
Sheryians Coding SchoolWatch
Responsive Web Development Complete Course for Beginners | Tutorial + Full Project
3:22:05
Sheryians Coding SchoolWatch
JavaScript Full Course | JavaScript - Learn Everything | Sheryians Coding School
8:04:12
Sheryians Coding SchoolWatch
Part 2 – Master JavaScript & Become a Real Developer | Full Course
7:26:21
Sheryians Coding SchoolWatch
Part 3 – Advanced JavaScript, Projects & Real Developer Mindset | Full Course
4:15:37
Sheryians Coding SchoolWatch
Part 4 – JavaScript for Placements | Get Ready for Your First Developer Job
2:38:51
Sheryians Coding SchoolWatch
ReactJS Full Course | ReactJS - Learn Everything | Sheryians Coding School
11:15:54
Sheryians Coding SchoolWatch
Redux Toolkit Complete Course 2026 | Beginner to Advanced with Project
4:51:54
Sheryians Coding SchoolWatch
TypeScript Domination - Full Course
3:57:44
Sheryians Coding SchoolWatch
Complete Backend One Shot | Beginners to Advanced | Learn Node.js, Express, MongoDB from Scratch
8:23:30
Sheryians Coding SchoolWatch
Advanced Backend Project | Learn Bank Transaction System with Node.js, Express & MongoDB
4:04:22
Sheryians Coding SchoolWatch
Complete Authentication System | JWT, Refresh Token, OTP, Logout All Devices
2:43:17
Sheryians Coding SchoolWatch
Gen AI + Full Stack Web Development Project | React, Node, JWT, Gemini
5:56:05
Sheryians Coding SchoolWatch

Complete C++ Placement DSA Course

Data Structure & Algorithm (DSA)YouTube Playlist

149 sequential lectures • Channel course track

Lecture 1: Intro to Programming & Flowcharts
57:54
YouTube PlaylistWatch
Lecture 2: Write Your First Program in C++
56:00
YouTube PlaylistWatch
Lecture 3: If-Else, While loop & Lots of Patterns (Part-1)
55:52
YouTube PlaylistWatch
Lecture 4: Solving Pattern Questions (Part-2)
1:03:58
YouTube PlaylistWatch
Lecture 5: Bitwise Operators, For Loops, Operator Precedence & Variable Scoping
1:15:44
YouTube PlaylistWatch
Lecture 6: Binary & Decimal Number System
35:15
YouTube PlaylistWatch
Lecture 7: LeetCode Problem Solving Session
42:43
YouTube PlaylistWatch
Lecture 8: Switch Statement & Functions
1:24:59
YouTube PlaylistWatch
Lecture 9: Introduction to Arrays in C++
1:29:54
YouTube PlaylistWatch
Lecture 10: Solving LeetCode/CodeStudio Questions [Arrays]
1:34:54
YouTube PlaylistWatch
Lecture 11:Time & Space Complexity || How to avoid Time Limit Exceeded [TLE]
29:12
YouTube PlaylistWatch
Lecture 12: Binary Search Explained in 1 Video [Theory + Code]
38:41
YouTube PlaylistWatch
Lecture 13: Binary Search Interview Questions [Google, Amazon, Microsoft] || ProblemSet - 1
41:33
YouTube PlaylistWatch
Lecture14: Binary Search Interview Questions [Google, Amazon, Microsoft] || ProblemSet - 2
55:35
YouTube PlaylistWatch
Lecture 15: Book Allocation Problem || Aggressive Cows Problem || Binary Search Advanced Problems
1:05:13
YouTube PlaylistWatch
Lecture16: Selection Sort [Theory + Code] || C++ Placement Series
34:29
YouTube PlaylistWatch
CodeHelp Weekly Contest 1 is LIVE || Game starts Now
2:13
YouTube PlaylistWatch
Lecture 17: BUBBLE SORT in 1 Video [Theory + Optimised Code] || Best/Worst Case Complexity
31:52
YouTube PlaylistWatch
Lecture 18: INSERTION SORT in 1 Video [Theory + Code] || Best/Worst Case Complexity
34:04
YouTube PlaylistWatch
Lecture19: C++ STL in 1 Video (Re-Uploaded)
1:01:51
YouTube PlaylistWatch
Lecture 20: Solving LeetCode/CodeStudio Questions [Arrays]
35:38
YouTube PlaylistWatch
Lecture21: Solving LeetCode/CodeStudio Questions [Arrays]
33:32
YouTube PlaylistWatch
CodeHelp Weekly Contest 2 is LIVE || Contest 1 Results announced
3:22
YouTube PlaylistWatch
Lecture22: All about Char Arrays, Strings & solving LeetCode Questions
1:53:20
YouTube PlaylistWatch
Lecture 23: Introduction to 2D Arrays in C++ || LeetCode Questions
1:30:36
YouTube PlaylistWatch
Lecture 24: Basic Maths for DSA || Sieve || Modular Arithmetics || Euclid’s Algorithm
44:08
YouTube PlaylistWatch
DSA Placement course || Phase-1 Completed
0:55
YouTube PlaylistWatch
Lecture 25: Pointers in C++ || Part-1 || DSA Placement Course - Love Babbar
44:11
YouTube PlaylistWatch
Lecture 26: Pointers in C++ || Part-2 || DSA Placement Course - Love Babbar
1:03:59
YouTube PlaylistWatch
Lecture27: Double Pointers in C++ || Pointers Practice MCQs
52:52
YouTube PlaylistWatch
Lecture28: Reference Variable | Static vs Dynamic Memory | Part-1
47:12
YouTube PlaylistWatch
Lecture29: Dynamic Memory Allocation of 2D Arrays
22:53
YouTube PlaylistWatch
Lecture30: Macros, Global Variables, Inline Functions & Default Args
39:23
YouTube PlaylistWatch
Lecture 31: Learning Recursion the Best Way! | 10 Day Recursion Challenge
37:36
YouTube PlaylistWatch
Lecture32: Understanding Recursion the easiest way || Day-2 || 10 Day Recursion Challenge
45:16
YouTube PlaylistWatch
Lecture33: Recursion and Binary Search | Day-3 | 10 Days Recursion Challenge
43:14
YouTube PlaylistWatch
Lecture34: Recursion with Strings | Day-4 | 10 Day Recursion Challenge
36:49
YouTube PlaylistWatch
Lecture35: Merge Sort using Recursion | Day-5 | 10 Day Recursion Challenge
24:23
YouTube PlaylistWatch
CodeHelp Weekly Contest 3 is LIVE || Contest 1 & 2 Gifts Sent !!
2:32
YouTube PlaylistWatch
Lecture36: Quick Sort using Recursion | Day-6 | 10 Day Recursion Challenge
37:55
YouTube PlaylistWatch
Lecture37: Recursion - Subsets / Subsequences of String [Theory + Code]
27:25
YouTube PlaylistWatch
Lecture38: Phone Keypad Problem Recursion || C++ Placement Course
30:42
YouTube PlaylistWatch
Lecture39: Permutations of a String || C++ Placement Course
21:50
YouTube PlaylistWatch
Lecture40: Rat in a Maze Problem || C++ Placement Course 2022
37:31
YouTube PlaylistWatch
Lecture 41: Time & Space Complexity of Recursive Algorithms || C++ Placement Course
49:23
YouTube PlaylistWatch
Lecture 42: OOPs Concepts in C++ || Part-1
1:29:14
YouTube PlaylistWatch
Lecture 43 : 4 Pillars of OOPs Concept -Inheritance, Polymorphism, Encapsulation & Abstraction
1:35:29
YouTube PlaylistWatch
Lecture 44: Linked List & its types - Singly, Doubly, Circular etc.
2:21:18
YouTube PlaylistWatch
Lecture 45: Linked List Questions: Reverse LL and find Middle of LL
52:40
YouTube PlaylistWatch
CodeHelp Weekly Contest 4 is LIVE || Contest Editorial/Solutions
3:35
YouTube PlaylistWatch
Lecture 46: Linked List Questions: Reverse LL in "K group" && Check LL is Circular or not
40:08
YouTube PlaylistWatch
Lecture47: Detect & Remove Loop in Linked List [Approach Discussion + Optimised Implementation]
50:36
YouTube PlaylistWatch
Lecture 48: Remove Duplicates from a Sorted/UnSorted Linked List
27:25
YouTube PlaylistWatch
Lecture 49: Merge 2 Sorted Linked Lists || Sort 0s, 1s and 2s in Linked List
58:44
YouTube PlaylistWatch
Lecture 50: Check Palindrome in Linked List || C++ Placement Course
22:38
YouTube PlaylistWatch
Lecture 51: Add 2 Numbers represented by Linked Lists || C++ Placement Course
26:24
YouTube PlaylistWatch
Lecture 52: Clone a Linked List with Random Pointers || C++ Placement Course
55:08
YouTube PlaylistWatch
Lecture 53: Merge Sort in Linked List [ Theory + Implementation ]
27:49
YouTube PlaylistWatch
Lecture 54: Introduction to Stacks [Theory + Implementation] || C++ Placement Course
43:11
YouTube PlaylistWatch
Lecture 55: Stack Interview Questions || Placement Series by Love Babbar
1:35:53
YouTube PlaylistWatch
Lecture 56: Largest Rectangular Area in Histogram [Optimised Approach]
28:31
YouTube PlaylistWatch
Lecture 57: Stack - Celebrity Problem && Max Rectangle in Binary Matrix with all 1's
43:54
YouTube PlaylistWatch
Lecture 58: "N" Stacks in an Array || Stack Hard Question
37:48
YouTube PlaylistWatch
Lecture 59: Design Special Stack Problem || C++ Placement Course
29:29
YouTube PlaylistWatch
Lecture 60: Queues in C++ [STL + Implementation + Types of Queues ]
1:05:02
YouTube PlaylistWatch
Lecture 61: Queue FAANG Interview Questions || Placement Series by Love Babbar
2:23:55
YouTube PlaylistWatch
Lecture 62: Binary Trees & its Representation || Different types of Traversals
55:06
YouTube PlaylistWatch
CodeHelp Weekly Contest 5 is LIVE || Contest Editorial/Solutions
2:24
YouTube PlaylistWatch
Lecture 63: Binary Tree FAANG Interview Questions || Part-1
1:01:05
YouTube PlaylistWatch
Lecture 64: Binary Tree FAANG Interview Questions || Part-2
1:11:31
YouTube PlaylistWatch
Lecture 65: Binary Tree FAANG Interview Questions || Part-3
59:15
YouTube PlaylistWatch
Lecture 66: Construct a Binary Tree from InOrder/PreOrder/PostOrder Traversal
36:35
YouTube PlaylistWatch
Lecture 67: Minimum Time to BURN the Entire Binary Tree || C++ Placement Series
28:28
YouTube PlaylistWatch
Lecture 68: Morris Traversal || Flatten a Binary tree to Linked List || C++ Placement Series
31:54
YouTube PlaylistWatch
Lecture 69: Binary Search Tree & its Implementation || Insertion, Deletion & Searching a Node
1:05:47
YouTube PlaylistWatch
Lecture 70: Binary SearchTree FAANG Interview Questions || Part-1
37:55
YouTube PlaylistWatch
Lecture 71: Binary SearchTree FAANG Interview Questions || Part-2
48:19
YouTube PlaylistWatch
Lecture 72: Merge 2 Binary Search Trees || C++ Placement Series
45:58
YouTube PlaylistWatch
Lecture 73: Largest BST in a Binary Tree || C++ Placement Series
23:09
YouTube PlaylistWatch
Lecture 74: Heaps in C++ || Heap Sort || Insertion/Deletion in Heap || Priority Queue STL
1:04:56
YouTube PlaylistWatch
Lecture 75: Heaps in C++ || Interview Questions || Part - 1
1:08:00
YouTube PlaylistWatch
CodeHelp Weekly Contest 6 is LIVE || MacBook Giveaway Coming Soon
2:51
YouTube PlaylistWatch
Lecture 76: Heaps in C++ || Interview Questions || Part - 2
50:01
YouTube PlaylistWatch
Lecture 77: Heaps Hard Interview Questions || Part - 3
1:05:15
YouTube PlaylistWatch
Lecture 78: Hashmaps in C++ || C++ Placement Series
1:03:27
YouTube PlaylistWatch
CodeHelp Weekly Contest 7 is LIVE
1:20
YouTube PlaylistWatch
Lecture 79: Trie & its Implementation || C++ Placement Series
48:20
YouTube PlaylistWatch
Lecture 80: Longest Common Prefix Problem || Tries || C++ Placement Series
20:17
YouTube PlaylistWatch
Lecture 81: Implement a Phone Directory Using Trie || C++ Placement Series
27:04
YouTube PlaylistWatch
Lecture 82: Rat in Maze Problem || Backtracking Day 1 || C++ Placement Series
31:37
YouTube PlaylistWatch
Lecture 83: N-Queen Problem || Backtracking Day 2 || C++ Placement Series
31:04
YouTube PlaylistWatch
Lecture 84: Sudoku Solver Problem || Backtracking Day 3 || C++ Placement Series
23:10
YouTube PlaylistWatch
Lecture 85: Introduction to Graphs || Creation and Implementation
33:29
YouTube PlaylistWatch
Lecture 86: BFS Traversal in Graph || C++ Placement Series
23:39
YouTube PlaylistWatch
Lecture 87: DFS Traversal in Graph || C++ Placement Series
14:18
YouTube PlaylistWatch
Lecture 88: Cycle Detection in Undirected Graphs || Using BFS and DFS
32:03
YouTube PlaylistWatch
Lecture 89: Cycle Detection in Directed Graphs || Placement Series
18:30
YouTube PlaylistWatch
Lecture 90: Topological Sort ( Using DFS ) || Placement Series
20:09
YouTube PlaylistWatch
Lecture 91: Topological Sort ( Using Kahn's Algorithm ) || Placement Series
17:02
YouTube PlaylistWatch
CodeHelp Weekly Contest 9 is LIVE || C++ Placement Series
2:35
YouTube PlaylistWatch
Lecture 92: Cycle Detection in Directed Graph || Using BFS
8:23
YouTube PlaylistWatch
Lecture 93: Shortest Path in Undirected Graphs || C++ Placement Series
19:53
YouTube PlaylistWatch
Lecture 94: Shortest Path in Directed Acyclic Graphs || C++ Placement Series
34:09
YouTube PlaylistWatch
Lecture 95: Dijkstra's Algorithm || C++ Placement Series
35:55
YouTube PlaylistWatch
Lecture 96: Minimum Spanning Tree || Prim's Algorithm
33:04
YouTube PlaylistWatch
Lecture 97: Kruskal's Algorithm || Disjoint Set || Union by Rank & Path Compression
40:31
YouTube PlaylistWatch
Lecture 98: Bridges in a Graph || C++ Placement Series
25:13
YouTube PlaylistWatch
Lecture 99: Articulation Points in Graphs || C++ Placement Series
29:52
YouTube PlaylistWatch
Lecture 100: Kosaraju's Algorithm for Strongly Connected Components || C++ Placement Series
21:43
YouTube PlaylistWatch
Lecture 101: Bellman Ford Algorithm || C++ Placement Series
22:06
YouTube PlaylistWatch
Lecture 102: Introduction to Dynamic Programming | Memoization | Tabulation | Space Optimisation
37:21
YouTube PlaylistWatch
Lecture 103: Minimum Cost Climbing Stairs || DP Series
34:28
YouTube PlaylistWatch
Lecture 104: Minimum Number of Coins || DP Series
30:36
YouTube PlaylistWatch
Lecture 105: Maximum Sum of Non-Adjacent Elements || DP Series
20:33
YouTube PlaylistWatch
Lecture 106: House Robbery Problem || DP Series
11:33
YouTube PlaylistWatch
Lecture 107: Cut Rod into Segments of X, Y, Z || DP Series
24:39
YouTube PlaylistWatch
Lecture 108: Count derangements || DP Series
26:35
YouTube PlaylistWatch
Lecture 109: Painting Fence Algorithm || DP Series
25:03
YouTube PlaylistWatch
Lecture 110: 0/1 KnapSack Problem || learn 2-D DP Concept || DP Series
51:19
YouTube PlaylistWatch
Lecture 111: Combination Sum IV Problem || DP Series
17:45
YouTube PlaylistWatch
Lecture 112: Perfect Squares Problem || DP Series
20:38
YouTube PlaylistWatch
Lecture 113: Minimum Cost for Tickets || Part-1 || DP Series
26:17
YouTube PlaylistWatch
Lecture 114: Minimum Cost for Tickets || Part-2 || DP Series
17:45
YouTube PlaylistWatch
Lecture 115: Largest Square area in Matrix || DP Series
27:31
YouTube PlaylistWatch
Lecture 116: Min Score Triangulation of Polygon || DP Series
26:08
YouTube PlaylistWatch
Lecture 117: Minimum Sideways Jump LeetCode || 2D-DP || DP Series
50:31
YouTube PlaylistWatch
Lecture 118: Reducing Dishes LeetCode || 2D-DP || DP Series
27:27
YouTube PlaylistWatch
Lecture 119: Longest Increasing Subsequence + Russian Doll LeetCode || DP + Binary Search
46:24
YouTube PlaylistWatch
Lecture 120: Maximum Height by Stacking Cuboid || DP Series
16:10
YouTube PlaylistWatch
Lecture 121: Pizza with 3n Slices || 2D - DP || DP Series
27:31
YouTube PlaylistWatch
Lecture 122: Number of Dice Rolls with Target Sum || DP Series
33:19
YouTube PlaylistWatch
Lecture 123: Partition Equal Subset Sum || DP Series
27:59
YouTube PlaylistWatch
Lecture 124: Minimum Swaps to make Subsequences Increasing || DP Series
42:10
YouTube PlaylistWatch
Lecture 125: Longest Arithmetic Subsequence || DP Series
37:42
YouTube PlaylistWatch
Lecture 126: Longest AP with given Difference "d" || DP Series
11:24
YouTube PlaylistWatch
Lecture 127: Unique Binary Search Trees || Catalan Number
20:27
YouTube PlaylistWatch
Lecture 128: Guess Number Higher or Lower || DP Series
25:03
YouTube PlaylistWatch
Lecture 129: Minimum Cost Tree From Leaf Values || DP Series
26:49
YouTube PlaylistWatch
Lecture 130: Buy and Sell Stock [Part 1] || DP Series
9:50
YouTube PlaylistWatch
Lecture 131: Buy and Sell Stock [Part 2] || DP Series
30:05
YouTube PlaylistWatch
Lecture 132: Buy and Sell Stock [Part 3] || DP Series
20:59
YouTube PlaylistWatch
Lecture 133: Buy and Sell Stock [Part 4] || DP Series
18:30
YouTube PlaylistWatch
Lecture 134: Buy and Sell Stock [Part 5] || DP Series
8:26
YouTube PlaylistWatch
Lecture 135: Longest Common Subsequence || DP on Strings
22:07
YouTube PlaylistWatch
Lecture 136: Longest Palindromic Subsequence || DP on Strings
8:25
YouTube PlaylistWatch
Lecture 137: EDIT Distance || DP on Strings
30:03
YouTube PlaylistWatch
Lecture 138: Maximum Rectangle with all 1's || DP Series
13:07
YouTube PlaylistWatch
Lecture 139: Wildcard Pattern Matching || DP Series
31:35
YouTube PlaylistWatch
Lecture 140: GREEDY ALGORITHMS in 1 VIDEO
1:29:51
YouTube PlaylistWatch

Competitive Programming Guidance

Competitive ProgrammingYouTube Playlist

8 sequential lectures • Channel course track

Competitive Programming Roadmap | 0 to 6⭐ and Candidate Master | How to Start | 2024
15:17
YouTube PlaylistWatch
Take your Logic and Problem Solving Skills to the Moon | Coding | Competitive Programming | Guidance
11:17
YouTube PlaylistWatch
Regrets from my CP Journey as a Master on Codeforces | Develop the right mindset in just 10 minutes
13:02
YouTube PlaylistWatch
Topics You Must Know to Reach Expert on Codeforces || 5* on CodeChef || Free Resources
22:54
YouTube PlaylistWatch
All about ICPC | Eligibility | Stages | Tips to perform better | Benefits | My Experience
17:31
YouTube PlaylistWatch
Why even top coders fail to get jobs? | Just being a Pro Coder isn't enough!!! Ft. @Parikh Jain
16:40
YouTube PlaylistWatch
CP Sheet | Handpicked Problems from 800 to 1600 Rating on Codeforces | Newbie to Expert
6:50
YouTube PlaylistWatch
How to become an Expert on Codeforces | Tips and Topics for each Rating from Newbie to Specialist
15:59
YouTube PlaylistWatch

System Design (Beginner)

System DesigncodestorywithMIK

15 sequential lectures • Channel course track

Introduction - Why & what ?
1:56
codestorywithMIKWatch
Single Server Setup
6:31
codestorywithMIKWatch
Database & Multiple Servers
4:10
codestorywithMIKWatch
Which Database to use ?
6:59
codestorywithMIKWatch
Vertical Scaling vs Horizontal Scaling
4:35
codestorywithMIKWatch
Load Balancer ⚖️
4:53
codestorywithMIKWatch
Database Replication 💿💿📚📖📒
7:30
codestorywithMIKWatch
Caching
7:13
codestorywithMIKWatch
CDN (Content Delivery Network) 🚚📦
7:57
codestorywithMIKWatch
Stateful & Stateless Architecture 👷🏗
8:49
codestorywithMIKWatch
Data Centers & geoDNS
6:00
codestorywithMIKWatch
Message Queue
8:39
codestorywithMIKWatch
Logging, Metric, Automation 🤖⚙️
7:42
codestorywithMIKWatch
Database Scaling, Sharding & Justin Bieber Problem 🧑‍🎤💿
13:08
codestorywithMIKWatch
Normalization vs Denormalization in RDBMS | Examples | Tables | SQL Query | codestorywithMIK
17:39
codestorywithMIKWatch

System Design (Intermediate)

System DesigncodestroywithMIK

59 sequential lectures • Channel course track

Back-Of-The-Envelope-Estimation 🕵️📈📏📁
9:24
codestroywithMIKWatch
Twitter QPS & Storage Estimation 🐦🔎📀
7:41
codestroywithMIKWatch
System Design Interview : 🚩 Red Flags & Myths 💥🤯🫢
6:08
codestroywithMIKWatch
Design News Feed System : step-1 of 4
7:29
codestroywithMIKWatch
Design News Feed System : step-2 of 4
7:13
codestroywithMIKWatch
Design News Feed System : step-3 of 4
7:40
codestroywithMIKWatch
Design News Feed System : Step 4 of 4
6:10
codestroywithMIKWatch
Design Rate Limiter : What is it ❓🤨📈
4:56
codestroywithMIKWatch
Design Rate Limiter : step-1 of 4 📈📏⚙️🏗
5:34
codestroywithMIKWatch
Design Rate Limiter : Step-2 of 4 (PART-I) - Where To Put Rate Limiter
5:21
codestroywithMIKWatch
Design Rate Limiter : step-2 of 4 (PART-2) - Token Bucket Algorithm
9:06
codestroywithMIKWatch
Design Rate Limiter : step-2 of 4 (PART-3) - Leaky Bucket Algorithm 🪣💦💧
5:43
codestroywithMIKWatch
Design Rate Limiter : step-2 of 4 (PART-IV) - Fixed Window Counter Algorithm 👩‍🔧🏗⚙️
11:12
codestroywithMIKWatch
Design Rate Limiter : step-2 of 4 (PART-V) - Sliding Window Log Algorithm
9:06
codestroywithMIKWatch
Design Rate Limiter : step-2 of 4 (PART-VI) - High Level Architecture
6:06
codestroywithMIKWatch
Design Rate Limiter : step-3 of 4 (PART-I) - Design Deep Dive & LYFT 🚕🚖
7:59
codestroywithMIKWatch
Design Rate Limiter : step-3 (PART-II) - Detailed Design 🕵️🔎⚙️🏗
8:24
codestroywithMIKWatch
Design Rate Limiter : step-3 of 4 (PART-III) - Rate Limiter in Distributed Environment ⚙️🏗🤯
6:25
codestroywithMIKWatch
Design Rate Limiter - step-3 of 4 (PART-IV) - Performance Optimisation & Monitoring
4:28
codestroywithMIKWatch
Design Rate Limiter - step-4 of 4 - WRAP UP
3:30
codestroywithMIKWatch
Design Consistent Hashing - What’s the problem ? Why need it ? #️⃣🕵️
8:28
codestroywithMIKWatch
Design Consistent Hashing - How It Works ? #️⃣🏗
9:27
codestroywithMIKWatch
Design Consistent Hashing - Two Problems with Basic Approach 🤯#️⃣🕵🏻
6:24
codestroywithMIKWatch
Design Consistent Hashing - Virtual Nodes #️⃣🤯🕵🏻
9:21
codestroywithMIKWatch
Design Consistent Hashing - Wrap Up #️⃣🥳🤩
2:30
codestroywithMIKWatch
Design Key-Value Store - (Part-I)
6:31
codestroywithMIKWatch
Design Key-Value Store - (PART-II) : Single Server Key-Value Store 🏗⚙️💻💿
2:55
codestroywithMIKWatch
Design Key-Value Store - (PART-III) : Distributed Key-Value Store and CAP Theorem 🤯
11:41
codestroywithMIKWatch
Design Key-Value Store - (PART-IV) : Data Partition & Data Replication 💿⚙️🏗
9:52
codestroywithMIKWatch
Design Key-Value Store - (PART-V) : Consistency, Quorum, Tunable Consistency 😱🤯⚙️
17:56
codestroywithMIKWatch
Design Key-Value Store - (PART-VI) : Inconsistency Resolution and Vector Clocks😱🤯⚙️
13:15
codestroywithMIKWatch
Design Key-Value Store - (PART-VII) : Handling Temporary Failures | Gossip Protocol | Hinted 🤯😱🏗
11:24
codestroywithMIKWatch
Design Key-Value Store - (PART-VIII) : Handling Permanent Failures | Anti-Entropy | Merkle Tree😱
9:15
codestroywithMIKWatch
Design Key-Value Store - (PART-IX) : System Architecture Diagram 😱⚙️🏗👩‍🎨👷👷‍♀️
7:24
codestroywithMIKWatch
Design Key-Value Store - (PART-X) : Read Path & Write Path⚙️🧑🏻‍💻👷🏗👩‍🎨
8:30
codestroywithMIKWatch
Design A Unique ID Generator In Distributed Systems - (Part-I) : Understand The Problem 🏗👷👩🏻‍💻
5:16
codestroywithMIKWatch
Design A Unique ID Generator In Distributed Systems (Part-II): Multi Master Replication 🏗👷👩🏻‍💻
6:28
codestroywithMIKWatch
Design A Unique ID Generator In Distributed Systems (Part-III): UUID 🏗👷👩🏻‍💻
4:32
codestroywithMIKWatch
Design A Unique ID Generator In Distributed Systems (Part-IV): Ticket Server 🏗👷👩🏻‍💻
4:31
codestroywithMIKWatch
Design A Unique ID Generator In Distributed Systems (Part-V): Twitter Snowflake Approach 🏗👷👩🏻‍💻
5:58
codestroywithMIKWatch
Design A Unique ID Generator In Distributed Systems (Part-VI): Design Deep Dive 🏗👷👩🏻‍💻
5:42
codestroywithMIKWatch
Design A Unique ID Generator In Distributed Systems (Part-VII): Wrap Up !!! 🏗👷👩🏻‍💻
3:48
codestroywithMIKWatch
Design A URL Shortener (Part-I): Step-1 (Understand The Problem & Establish Design Scope) !!! 🏗⚙️👷
5:59
codestroywithMIKWatch
Design A URL Shortener (Part-II): Back Of The Envelope Estimation !!! 🏗⚙️👷
7:07
codestroywithMIKWatch
Design A URL Shortener (Part-III): STEP-2 : Propose High Level Design & Get Buy-In !!! 🏗⚙️👷
7:04
codestroywithMIKWatch
Design A URL Shortener (Part-IV): STEP-2 : 301 Redirect Vs 302 Redirect Status Code !!! 🏗⚙️👷
7:46
codestroywithMIKWatch
Design A URL Shortener (Part-V): STEP-2 : URL SHORTENING (HASH FUNCTION) !!! 🏗⚙️👷
3:55
codestroywithMIKWatch
Design A URL Shortener (Part-VI): STEP-3 : DESIGN DEEP DIVE (DATA MODEL) !!! 🏗⚙️👷
3:58
codestroywithMIKWatch
Design A URL Shortener (Part-VII): STEP-3 : DESIGN DEEP DIVE (HASH FUNCTION) !!! 🏗⚙️👷
5:04
codestroywithMIKWatch
Design A URL Shortener (Part-VIII): STEP-3 : DESIGN DEEP DIVE (HASH + COLLISION RESOLUTION) 🏗⚙️👷
7:20
codestroywithMIKWatch
Design A URL Shortener (Part-IX): STEP-3 : DESIGN DEEP DIVE (BASE-62 CONVERSION) 🏗⚙️👷
12:28
codestroywithMIKWatch
Design A URL Shortener (Part-X): STEP-3 : DESIGN DEEP DIVE (URL SHORTENING FLOW) 🏗⚙️👷
6:51
codestroywithMIKWatch
Design A URL Shortener (Part-XI): STEP-3&4 : DESIGN DEEP DIVE & WRAP UP (URL Redirecting Deep Dive)
10:21
codestroywithMIKWatch
Design Web Crawler (Part-I): (Google) : STEP-1 : Understand The Problem & Establish Design Scope
9:09
codestroywithMIKWatch
Design Web Crawler (Part-II) : Google, Amazon, Meta: STEP-1 : Back Of The Envelope Estimation 🏗⚙️👷
8:10
codestroywithMIKWatch
Design Web Crawler(Part-III):Google, Amazon, Meta: STEP-2 : Propose A High Level Design & Get Buy-in
17:38
codestroywithMIKWatch
Design Web Crawler (Part-IV) : Google, Amazon, Meta : STEP-3 : Design Deep Dive (BFS vs DFS) 🏗⚙️👷
9:27
codestroywithMIKWatch
Design Web Crawler (Part-V) : Google, Amazon, Meta : STEP-3 : Design Deep Dive (URL Frontier) 🏗⚙️👷
19:41
codestroywithMIKWatch
Design Web Crawler (Part-VI) : Google, Amazon, Meta : STEP-3 : Design Deep Dive Complete & WRAP-UP
32:04
codestroywithMIKWatch

Strivers A2Z-DSA Course | DSA Playlist | Placements

Data Structure & Algorithm (DSA)YouTube Playlist

200 sequential lectures • Channel course track

Don't watch my A2Z DSA Course
8:24
YouTube PlaylistWatch
How to setup VS code for DSA and CP | Input / Output split format
8:51
YouTube PlaylistWatch
C++ Basics in One Shot - Strivers A2Z DSA Course - L1
1:26:27
YouTube PlaylistWatch
Time and Space Complexity - Strivers A2Z DSA Course
35:16
YouTube PlaylistWatch
Solve any Pattern Question - Trick Explained | 22 Patterns in 1 Shot | Strivers A2Z DSA Course
1:22:06
YouTube PlaylistWatch
Complete C++ STL in 1 Video | Time Complexity and Notes
1:07:37
YouTube PlaylistWatch
Basic Maths for DSA | Euclidean Algorithm | Strivers A2Z DSA Course
1:03:20
YouTube PlaylistWatch
Re 1. Introduction to Recursion | Recursion Tree | Stack Space | Strivers A2Z DSA Course
22:46
YouTube PlaylistWatch
Re 2. Problems on Recursion | Strivers A2Z DSA Course
22:04
YouTube PlaylistWatch
Re 3. Parameterised and Functional Recursion | Strivers A2Z DSA Course
18:14
YouTube PlaylistWatch
Re 4. Problems on Functional Recursion | Strivers A2Z DSA Course
19:48
YouTube PlaylistWatch
Re 5. Multiple Recursion Calls | Problems | Strivers A2Z DSA Course
16:45
YouTube PlaylistWatch
Hashing | Maps | Time Complexity | Collisions | Division Rule of Hashing | Strivers A2Z DSA Course
1:00:06
YouTube PlaylistWatch
Sorting - Part 1 | Selection Sort, Bubble Sort, Insertion Sort | Strivers A2Z DSA Course
10:00
YouTube PlaylistWatch
Merge Sort | Algorithm | Pseudocode | Dry Run | Code | Strivers A2Z DSA Course
10:00
YouTube PlaylistWatch
Quick Sort For Beginners | Strivers A2Z DSA Course
10:00
YouTube PlaylistWatch
Find Second Largest Element in Array | Remove duplicates from Sorted Array | Arrays Intro Video
10:00
YouTube PlaylistWatch
Rotate Array by K places | Union, Intersection of Sorted Arrays | Move Zeros to End | Arrays Part-2
10:00
YouTube PlaylistWatch
Find element that appears once | Find missing number | Max Consecutive number of 1's | Arrays Part-3
10:00
YouTube PlaylistWatch
Longest Subarray with sum K | Brute - Better - Optimal | Generate Subarrays
10:00
YouTube PlaylistWatch
2 Sum Problem | 2 types of the same problem for Interviews | Brute-Better-Optimal
10:00
YouTube PlaylistWatch
Sort an array of 0's 1's & 2's | Intuition of Algo🔥 | C++ Java Python | Brute-Better-Optimal
10:00
YouTube PlaylistWatch
Majority Element I | Brute-Better-Optimal | Moore's Voting Algorithm | Intuition 🔥|Brute to Optimal
10:00
YouTube PlaylistWatch
Kadane's Algorithm | Maximum Subarray Sum | Finding and Printing
10:00
YouTube PlaylistWatch
DP 35. Best Time to Buy and Sell Stock | DP on Stocks 🔥
10:00
YouTube PlaylistWatch
Rearrange Array Elements by Sign | 2 Varieties of same Problem
10:00
YouTube PlaylistWatch
Next Permutation - Intuition in Detail 🔥 | Brute to Optimal
10:00
YouTube PlaylistWatch
Leaders in an Array | Brute - Optimal | Strivers A2Z DSA Course
10:00
YouTube PlaylistWatch
Longest Consecutive Sequence | Google Interview Question | Brute Better Optimal
10:00
YouTube PlaylistWatch
Set Matrix Zeroes | O(1) Space Approach | Brute - Better - Optimal
10:00
YouTube PlaylistWatch
Rotate Matrix/Image by 90 Degrees | Brute - Optimal
10:00
YouTube PlaylistWatch
Spiral Traversal of a Matrix | Spiral Matrix
10:00
YouTube PlaylistWatch
Count Subarray sum Equals K | Brute - Better -Optimal
10:00
YouTube PlaylistWatch
Pascal Triangle | Finding nCr in minimal time
10:00
YouTube PlaylistWatch
Majority Element II | Brute-Better-Optimal
10:00
YouTube PlaylistWatch
3 Sum | Brute - Better - Optimal with Codes
10:00
YouTube PlaylistWatch
4 Sum | Brute - Better - Optimal with Codes
10:00
YouTube PlaylistWatch
Number of Subarrays with xor K | Brute - Better - Optimal
10:00
YouTube PlaylistWatch
Merge Overlapping Intervals | Brute, Optimal with Precise TC analysis
10:00
YouTube PlaylistWatch
Merge Sorted Arrays Without Extra Space | 2 Optimal Solution
10:00
YouTube PlaylistWatch
Find the Missing and Repeating Number | 4 Approaches 🔥
10:00
YouTube PlaylistWatch
Count Inversions in an Array | Brute and Optimal
10:00
YouTube PlaylistWatch
Reverse Pairs | Hard Interview Question
10:00
YouTube PlaylistWatch
Maximum Product Subarray - Best Intuitive Approach Discussed
10:00
YouTube PlaylistWatch
BS-1. Binary Search Introduction | Real Life Example | Iterative | Recursive | Overflow Cases
10:00
YouTube PlaylistWatch
BS-2. Implement Lower Bound and Upper Bound | Search Insert Position | Floor and Ceil
10:00
YouTube PlaylistWatch
BS-3. First and Last Occurrences in Array | Count occurrences in Array
10:00
YouTube PlaylistWatch
BS-4. Search Element in Rotated Sorted Array - I
10:00
YouTube PlaylistWatch
BS-5. Search Element in Rotated Sorted Array II
10:00
YouTube PlaylistWatch
BS-6. Minimum in Rotated Sorted Array
10:00
YouTube PlaylistWatch
BS-7. Find out how many times array has been rotated
10:00
YouTube PlaylistWatch
BS-8. Single Element in Sorted Array
10:00
YouTube PlaylistWatch
BS-9. Find Peak Element
10:00
YouTube PlaylistWatch
BS-10. Finding Sqrt of a number using Binary Search
10:00
YouTube PlaylistWatch
BS-11. Find the Nth root of an Integer
10:00
YouTube PlaylistWatch
BS-12. Koko Eating Bananas
10:00
YouTube PlaylistWatch
BS-13. Minimum days to make M bouquets | Binary Search
10:00
YouTube PlaylistWatch
BS-14. Find the Smallest Divisor Given a Threshold | Binary Search
10:00
YouTube PlaylistWatch
BS-15. Capacity to Ship Packages within D Days
10:00
YouTube PlaylistWatch
BS-16. Kth Missing Positive Number | Maths + Binary Search
10:00
YouTube PlaylistWatch
BS-17. Aggressive Cows | Binary Search Hard
10:00
YouTube PlaylistWatch
BS-18. Allocate Books or Book Allocation | Hard Binary Search
10:00
YouTube PlaylistWatch
BS 19. Painter's Partition and Split Array - Largest Sum
10:00
YouTube PlaylistWatch
BS-20. Minimise Maximum Distance between Gas Stations | 3 Approaches | Heap | Binary Search
10:00
YouTube PlaylistWatch
BS 21: Median of two Sorted Arrays of Different Sizes | Brute and Better Approach
10:00
YouTube PlaylistWatch
BS-21. Median of two Sorted Arrays of Different Sizes | Binary Search Approach With Intuition
10:00
YouTube PlaylistWatch
Bs-22. K-th element of two sorted arrays | Binary Search Approach
10:00
YouTube PlaylistWatch
BS 23. Row with maximum number of 1s | Binary Search on 2D Arrays
10:00
YouTube PlaylistWatch
BS-24. Search in a 2D Matrix - I | Binary Search of 2D
10:00
YouTube PlaylistWatch
BS-25. Search in a 2D Matrix - II | Binary Search on 2D
10:00
YouTube PlaylistWatch
BS-26. Find Peak Element-II | Binary Search
10:00
YouTube PlaylistWatch
BS-27. Median in a Row Wise Sorted Matrix
10:00
YouTube PlaylistWatch
L1. Introduction to Trees | Types of Trees
10:00
YouTube PlaylistWatch
L2. Binary Tree Representation in C++
10:00
YouTube PlaylistWatch
L3. Binary Tree Representation in Java
10:00
YouTube PlaylistWatch
L4. Binary Tree Traversals in Binary Tree | BFS | DFS
10:00
YouTube PlaylistWatch
L5. Preorder Traversal of Binary Tree | C++ | Java | Code Explanation
10:00
YouTube PlaylistWatch
L6. Inorder Traversal of Binary Tree | C++ | Java | Code Explanation
10:00
YouTube PlaylistWatch
L7. Postorder Traversal of Binary Tree | C++ | Java | Code Explanation
10:00
YouTube PlaylistWatch
L8. Level Order Traversal of Binary Tree | BFS | C++ | Java
10:00
YouTube PlaylistWatch
L9. Iterative Preorder Traversal in Binary Tree | C++ | Java | Stack
10:00
YouTube PlaylistWatch
L10. iterative Inorder Traversal in Binary Tree | C++ | Java | Stack
10:00
YouTube PlaylistWatch
L11. Iterative Postorder Traversal using 2 Stack | C++ | Java | Binary Tree
10:00
YouTube PlaylistWatch
L12. Iterative Postorder Traversal using 1 Stack | C++ | Java | Binary Trees
10:00
YouTube PlaylistWatch
L13. Preorder Inorder Postorder Traversals in One Traversal | C++ | Java | Stack | Binary Trees
10:00
YouTube PlaylistWatch
L14. Maximum Depth in Binary Tree | Height of Binary Tree | C++ | Java
10:00
YouTube PlaylistWatch
L15. Check for Balanced Binary Tree | C++ | Java
10:00
YouTube PlaylistWatch
L16. Diameter of Binary Tree | C++ | Java
10:00
YouTube PlaylistWatch
L17. Maximum Path Sum in Binary Tree | C++ | Java
10:00
YouTube PlaylistWatch
L18. Check it two trees are Identical or Not | C++ | Java
10:00
YouTube PlaylistWatch
L19. Zig-Zag or Spiral Traversal in Binary Tree | C++ | Java
10:00
YouTube PlaylistWatch
L20. Boundary Traversal in Binary Tree | C++ | Java
10:00
YouTube PlaylistWatch
L21. Vertical Order Traversal of Binary Tree | C++ | Java
10:00
YouTube PlaylistWatch
L22. Top View of Binary Tree | C++ | Java
10:00
YouTube PlaylistWatch
L23. Bottom View of Binary Tree | C++ | Java
10:00
YouTube PlaylistWatch
L24. Right/Left View of Binary Tree | C++ | Java
10:00
YouTube PlaylistWatch
L25. Check for Symmetrical Binary Trees | C++ | Java
10:00
YouTube PlaylistWatch
L26. Print Root to Node Path in Binary Tree | C++ | Java
10:00
YouTube PlaylistWatch
L27. Lowest Common Ancestor in Binary Tree | LCA | C++ | Java
10:00
YouTube PlaylistWatch
L28. Maximum Width of Binary Tree | C++ | Java
10:00
YouTube PlaylistWatch
L29. Children Sum Property in Binary Tree | O(N) Approach | C++ | Java
10:00
YouTube PlaylistWatch
L30. Print all the Nodes at a distance of K in Binary Tree | C++ | Java
10:00
YouTube PlaylistWatch
L31. Minimum time taken to BURN the Binary Tree from a Node | C++ | Java
10:00
YouTube PlaylistWatch
L32. Count total Nodes in a COMPLETE Binary Tree | O(Log^2 N) Approach | C++ | Java
10:00
YouTube PlaylistWatch
L33. Requirements needed to construct a Unique Binary Tree | Theory
10:00
YouTube PlaylistWatch
L34. Construct a Binary Tree from Preorder and Inorder Traversal | C++ | Java
10:00
YouTube PlaylistWatch
L35. Construct the Binary Tree from Postorder and Inorder Traversal | C++ | Java
10:00
YouTube PlaylistWatch
L36. Serialize and De-serialize Binary Tree | C++ | Java
10:00
YouTube PlaylistWatch
L37. Morris Traversal | Preorder | Inorder | C++ | Java
10:00
YouTube PlaylistWatch
L38. Flatten a Binary Tree to Linked List | 3 Approaches | C++ | Java
10:00
YouTube PlaylistWatch
L39. Introduction to Binary Search Tree | BST
10:00
YouTube PlaylistWatch
L40. Search in a Binary Search Tree | BST | C++ | Java
10:00
YouTube PlaylistWatch
L41. Ceil in a Binary Search Tree | BST | C++ | Java
10:00
YouTube PlaylistWatch
L42. Floor in a Binary Search Tree | BST | C++ | Java
10:00
YouTube PlaylistWatch
L43. Insert a given Node in Binary Search Tree | BST | C++ | Java
10:00
YouTube PlaylistWatch
L44. Delete a Node in Binary Search Tree | BST | C++ | Java
10:00
YouTube PlaylistWatch
L45. K-th Smallest/Largest Element in BST
10:00
YouTube PlaylistWatch
L46. Check if a tree is a BST or BT | Validate a BST
10:00
YouTube PlaylistWatch
L47. LCA in Binary Search Tree
10:00
YouTube PlaylistWatch
L48. Construct a BST from a preorder traversal | 3 Methods
10:00
YouTube PlaylistWatch
L49. Inorder Successor/Predecessor in BST | 3 Methods
10:00
YouTube PlaylistWatch
L50. Binary Search Tree Iterator | BST | O(H) Space
10:00
YouTube PlaylistWatch
L51. Two Sum In BST | Check if there exists a pair with Sum K
10:00
YouTube PlaylistWatch
L52. Recover BST | Correct BST with two nodes swapped
10:00
YouTube PlaylistWatch
L53. Largest BST in Binary Tree
10:00
YouTube PlaylistWatch
G-1. Introduction to Graph | Types | Different Conventions Used
10:00
YouTube PlaylistWatch
G-2. Graph Representation in C++ | Two Ways to Represent
10:00
YouTube PlaylistWatch
G-3. Graph Representation in Java | Two Ways to Represent
10:00
YouTube PlaylistWatch
G-4. What are Connected Components ?
10:00
YouTube PlaylistWatch
G-5. Breadth-First Search (BFS) | C++ and Java | Traversal Technique in Graphs
10:00
YouTube PlaylistWatch
G-6. Depth-First Search (DFS) | C++ and Java | Traversal Technique in Graphs
10:00
YouTube PlaylistWatch
G-7. Number of Provinces | C++ | Java | Connected Components
10:00
YouTube PlaylistWatch
G-8. Number of Islands | Number of Connected Components in Matrix | C++ | Java
10:00
YouTube PlaylistWatch
G-9. Flood Fill Algorithm | C++ | Java
10:00
YouTube PlaylistWatch
G-10. Rotten Oranges | C++ | Java
10:00
YouTube PlaylistWatch
G-11. Detect a Cycle in an Undirected Graph using BFS | C++ | Java
10:00
YouTube PlaylistWatch
G-12. Detect a Cycle in an Undirected Graph using DFS | C++ | Java
10:00
YouTube PlaylistWatch
G-13. Distance of nearest cell having 1 | 0/1 Matrix | C++ | Java
10:00
YouTube PlaylistWatch
G-14. Surrounded Regions | Replace O's with X's | C++ | Java
10:00
YouTube PlaylistWatch
G-15. Number of Enclaves | Multi-source BFS | C++ | Java
10:00
YouTube PlaylistWatch
G-16. Number of Distinct Islands | Constructive Thinking + DFS | C++ | Java
10:00
YouTube PlaylistWatch
G-17. Bipartite Graph | BFS | C++ | Java
10:00
YouTube PlaylistWatch
G-18. Bipartite Graph | DFS | C++ | Java
10:00
YouTube PlaylistWatch
G-19. Detect cycle in a directed graph using DFS | Java | C++
10:00
YouTube PlaylistWatch
G-20. Find Eventual Safe States - DFS
10:00
YouTube PlaylistWatch
G-21. Topological Sort Algorithm | DFS
10:00
YouTube PlaylistWatch
G-22. Kahn's Algorithm | Topological Sort Algorithm | BFS
10:00
YouTube PlaylistWatch
G-23. Detect a Cycle in Directed Graph | Topological Sort | Kahn's Algorithm | BFS
10:00
YouTube PlaylistWatch
G-24. Course Schedule I and II | Pre-requisite Tasks | Topological Sort
10:00
YouTube PlaylistWatch
G-25. Find Eventual Safe States - BFS - Topological Sort
10:00
YouTube PlaylistWatch
G-26. Alien Dictionary - Topological Sort
10:00
YouTube PlaylistWatch
G-27. Shortest Path in Directed Acyclic Graph - Topological Sort
10:00
YouTube PlaylistWatch
G-28. Shortest Path in Undirected Graph with Unit Weights
10:00
YouTube PlaylistWatch
G-29. Word Ladder - I | Shortest Paths
10:00
YouTube PlaylistWatch
G-30. Word Ladder - 2 | Shortest Paths
10:00
YouTube PlaylistWatch
G-31. Word Ladder - 2 | Optimised Approach for Leetcode
10:00
YouTube PlaylistWatch
G-32. Dijkstra's Algorithm - Using Priority Queue - C++ and Java - Part 1
10:00
YouTube PlaylistWatch
G-33. Dijkstra's Algorithm - Using Set - Part 2
10:00
YouTube PlaylistWatch
G-34. Dijkstra's Algorithm - Why PQ and not Q, Intuition, Time Complexity Derivation - Part 3
10:00
YouTube PlaylistWatch
G-35. Print Shortest Path - Dijkstra's Algorithm
10:00
YouTube PlaylistWatch
G-36. Shortest Distance in a Binary Maze
10:00
YouTube PlaylistWatch
G-37. Path With Minimum Effort
10:00
YouTube PlaylistWatch
G-38. Cheapest Flights Within K Stops
10:00
YouTube PlaylistWatch
G-39. Minimum Multiplications to Reach End
10:00
YouTube PlaylistWatch
G-40. Number of Ways to Arrive at Destination
10:00
YouTube PlaylistWatch
G-41. Bellman Ford Algorithm
10:00
YouTube PlaylistWatch
G-42. Floyd Warshall Algorithm
10:00
YouTube PlaylistWatch
G-43. Find the City With the Smallest Number of Neighbours at a Threshold Distance
10:00
YouTube PlaylistWatch
G-44. Minimum Spanning Tree - Theory
10:00
YouTube PlaylistWatch
G-45. Prim's Algorithm - Minimum Spanning Tree - C++ and Java
10:00
YouTube PlaylistWatch
G-46. Disjoint Set | Union by Rank | Union by Size | Path Compression
10:00
YouTube PlaylistWatch
G-47. Kruskal's Algorithm - Minimum Spanning Tree - C++ and Java
10:00
YouTube PlaylistWatch
G-48. Number of Provinces - Disjoint Set
10:00
YouTube PlaylistWatch
G-49. Number of Operations to Make Network Connected - DSU
10:00
YouTube PlaylistWatch
G-50. Accounts Merge - DSU
10:00
YouTube PlaylistWatch
G-51. Number of Islands - II - Online Queries - DSU
10:00
YouTube PlaylistWatch
G-52. Making a Large Island - DSU
10:00
YouTube PlaylistWatch
G-53. Most Stones Removed with Same Row or Column - DSU
10:00
YouTube PlaylistWatch
G-54. Strongly Connected Components - Kosaraju's Algorithm
10:00
YouTube PlaylistWatch
G-55. Bridges in Graph - Using Tarjan's Algorithm of time in and low time
10:00
YouTube PlaylistWatch
G-56. Articulation Point in Graph
10:00
YouTube PlaylistWatch
DP 1. Introduction to Dynamic Programming | Memoization | Tabulation | Space Optimization Techniques
10:00
YouTube PlaylistWatch
DP 2. Climbing Stairs | Learn How to Write 1D Recurrence Relations
10:00
YouTube PlaylistWatch
DP 3. Frog Jump | Dynamic Programming | Learn to write 1D DP
10:00
YouTube PlaylistWatch
DP 4. Frog Jump with K Distance | Lecture 3 Follow Up Question
10:00
YouTube PlaylistWatch
DP 5. Maximum Sum of Non-Adjacent Elements | House Robber | 1-D | DP on Subsequences
10:00
YouTube PlaylistWatch
DP 6. House Robber 2 | 1D DP | DP on Subsequences
10:00
YouTube PlaylistWatch
DP 7. Ninja's Training | MUST WATCH for 2D CONCEPTS 🔥 | Vacation | Atcoder | 2D DP |
10:00
YouTube PlaylistWatch
DP 8. Grid Unique Paths | Learn Everything about DP on Grids | ALL TECHNIQUES 🔥
10:00
YouTube PlaylistWatch
DP 9. Unique Paths 2 | DP on Grid with Maze Obstacles
10:00
YouTube PlaylistWatch
DP 10. Minimum Path Sum in Grid | Asked to me In Microsoft Internship Interview | DP on GRIDS
10:00
YouTube PlaylistWatch
DP 11. Triangle | Fixed Starting Point and Variable Ending Point | DP on GRIDS
10:00
YouTube PlaylistWatch
DP 12. Minimum/Maximum Falling Path Sum | Variable Starting and Ending Points | DP on Grids
10:00
YouTube PlaylistWatch
DP 13. Cherry Pickup II | 3D DP Made Easy | DP On Grids
10:00
YouTube PlaylistWatch
DP 14. Subset Sum Equals to Target | Identify DP on Subsequences and Ways to Solve them
10:00
YouTube PlaylistWatch
DP 15. Partition Equal Subset Sum | DP on Subsequences
10:00
YouTube PlaylistWatch
Dp 16. Partition A Set Into Two Subsets With Minimum Absolute Sum Difference | DP on Subsequences
10:00
YouTube PlaylistWatch
DP 17. Counts Subsets with Sum K | Dp on Subsequences
10:00
YouTube PlaylistWatch
DP 18. Count Partitions With Given Difference | Dp on Subsequences
10:00
YouTube PlaylistWatch
DP 19. 0/1 Knapsack | Recursion to Single Array Space Optimised Approach | DP on Subsequences
10:00
YouTube PlaylistWatch

CSS

Web DevBro code

1 sequential lectures • Channel course track

CSS tutorial for beginners 🎨
15:00
Bro codeWatch

DBMS

CS Fundamentals

22 sequential lectures • Channel course track

Introduction to DBMS Placements Course 2022
10:23
YouTube CourseWatch
Lecture 1: What the heck is Database Management System (DBMS)?
44:59
YouTube CourseWatch
Lecture 2: DBMS Architecture || Role of DBA
1:13:27
YouTube CourseWatch
Lecture 3: ER Model Explained || ER Diagram Notations || DBMS for Placements
55:01
YouTube CourseWatch
Lecture 4: Extended ER Features || Abstraction in ER Model
30:57
YouTube CourseWatch
Lecture 5: How to think and formulate an ER Diagram || Banking System ER Model
26:52
YouTube CourseWatch
Lecture 6: Designing the ER Model of FACEBOOK Database || DBMS for Placements
20:28
YouTube CourseWatch
Lecture 7: Relational Model Explained || DBMS for Placements
56:13
YouTube CourseWatch
Lecture 8: Transform ER Model to Relational Model || ER-Diagram to Tables
33:54
YouTube CourseWatch
Lecture 9: Complete SQL in 1 VIDEO
3:52:21
YouTube CourseWatch
Lecture 10: Common SQL Queries for Interviews
1:17:47
YouTube CourseWatch
Lecture 11: Why We Need Normalisation ? || DBMS Series for Placements
58:25
YouTube CourseWatch
Lecture 12: ACID Properties && Transactions in DBMS
36:39
YouTube CourseWatch
Lecture 13: How to Implement Atomicity and Durability? || DBMS Interview question
31:42
YouTube CourseWatch
Lecture 14: Why Indexing is important in Database Systems || DBMS Interview question
48:27
YouTube CourseWatch
Lecture 15: What are NoSQL Databases || SQL vs NoSQL
1:06:23
YouTube CourseWatch
Lecture 16: Types of Databases || DBMS for Placements
34:31
YouTube CourseWatch
Lecture 17: What is Clustering / Replication in DBMS || DBMS for Placements
16:21
YouTube CourseWatch
Lecture 18: What is Partitioning and Sharding in DBMS || DB Optimisation
31:25
YouTube CourseWatch
Lecture 19: Database Scaling Patterns | How to perform step by step scaling
1:00:35
YouTube CourseWatch
Lecture 20: CAP Theorem in DBMS || DBMS for Placements 2022
22:55
YouTube CourseWatch
Last Lecture: Master-Slave Architecture || DBMS for Placements
23:47
YouTube CourseWatch

CN Playlist

CS FundamentalsKunal Kushwaha

1 sequential lectures • Channel course track

Computer Networking Full Course - OSI Model Deep Dive with Real Life Examples
15:00
Kunal KushwahaWatch

System Design (Advanced)

System DesignJordan has no life

60 sequential lectures • Channel course track

What is Systems Design? | Systems Design Interview: 0 to 1 with Google Software Engineer
8:41
Jordan has no lifeWatch
Database Indexes: What do they do? | Systems Design Interview: 0 to 1 with Google Software Engineer
10:45
Jordan has no lifeWatch
How do Hash Indexes work? | Systems Design Interview: 0 to 1 with Google Software Engineer
13:35
Jordan has no lifeWatch
How do B-Tree Indexes work? | Systems Design Interview: 0 to 1 with Google Software Engineer
9:12
Jordan has no lifeWatch
LSM Tree + SSTable Database Indexes | Systems Design Interview: 0 to 1 with Google Software Engineer
15:35
Jordan has no lifeWatch
Indexes Concluded | Systems Design Interview: 0 to 1 with Google Software Engineer
7:02
Jordan has no lifeWatch
Intro to ACID Database Transactions | Systems Design Interview: 0 to 1 with Google Software Engineer
7:49
Jordan has no lifeWatch
Read Committed Isolation | Systems Design Interview: 0 to 1 with Google Software Engineer
9:31
Jordan has no lifeWatch
Snapshot Isolation | Systems Design Interview: 0 to 1 with Google Software Engineer
7:08
Jordan has no lifeWatch
Write Skew and Phantom Writes | Systems Design Interview: 0 to 1 with Google Software Engineer
6:38
Jordan has no lifeWatch
Achieving ACID: Serial Execution | Systems Design Interview: 0 to 1 with Google Software Engineer
6:05
Jordan has no lifeWatch
Database Internals: Two Phase Locking | Systems Design Interview: 0 to 1 with Ex-Google SWE
10:31
Jordan has no lifeWatch
Serializable Snapshot Isolation | Systems Design Interview: 0 to 1 with Ex-Google SWE
8:28
Jordan has no lifeWatch
Column Oriented Storage (with Parquet!) | Systems Design Interview: 0 to 1 with Ex-Google SWE
13:03
Jordan has no lifeWatch
Data Serialization Frameworks - You Should Be Using Them | Systems Design 0 to 1 with Ex-Google SWE
11:34
Jordan has no lifeWatch
Intro to Replication - Systems Design "Need to Knows" | Systems Design 0 to 1 with Ex-Google SWE
11:26
Jordan has no lifeWatch
Dealing with Stale Reads - Make Your App Better | Systems Design 0 to 1 with Ex-Google SWE
10:23
Jordan has no lifeWatch
Single Leader Replication - how it works | Systems Design 0 to 1 with Ex-Google SWE
12:09
Jordan has no lifeWatch
Multi Leader Replication - chaos | Systems Design 0 to 1 with Ex-Google SWE
13:38
Jordan has no lifeWatch
Dealing with Write Conflicts - What do you do? | Systems Design 0 to 1 with Ex-Google SWE
11:24
Jordan has no lifeWatch
CRDTs - Stop Worrying About Write Conflicts | Systems Design 0 to 1 with Ex-Google SWE
16:29
Jordan has no lifeWatch
Leaderless Replication Introduction | Systems Design 0 to 1 with Ex-Google SWE
10:51
Jordan has no lifeWatch
Quorums - Leaderless Replication Continued | Systems Design Interview 0 to 1 with Ex-Google SWE
10:50
Jordan has no lifeWatch
Replication Summarized in 9 Minutes | Systems Design Interview 0 to 1 with Ex-Google SWE
9:05
Jordan has no lifeWatch
Introduction to Partitioning | Systems Design Interview 0 to 1 with Ex-Google SWE
10:55
Jordan has no lifeWatch
Two Phase Commit - Distributed Transactions | Systems Design Interview 0 to 1 with Ex-Google SWE
8:19
Jordan has no lifeWatch
Consistent Hashing - Rebalancing Partitions | Systems Design Interview 0 to 1 with Ex-Google SWE
11:53
Jordan has no lifeWatch
Linearizable Databases | Systems Design Interview 0 to 1 with Ex-Google SWE
12:44
Jordan has no lifeWatch
Distributed Consensus - Raft Leader Election | Systems Design Interview 0 to 1 with Ex-Google SWE
8:37
Jordan has no lifeWatch
Distributed Consensus - Raft Writes | Systems Design Interview 0 to 1 with Ex-Google SWE
10:54
Jordan has no lifeWatch
What is ZooKeeper? - Coordination Services | Systems Design Interview 0 to 1 with Ex-Google SWE
7:32
Jordan has no lifeWatch
SQL vs NoSQL - Who Wins? | Systems Design Interview 0 to 1 with Ex-Google SWE
8:21
Jordan has no lifeWatch
MySQL vs PostgreSQL - Who Wins? | Systems Design Interview 0 to 1 with Ex-Google SWE
9:04
Jordan has no lifeWatch
What's VoltDb and Why Do We Care About It? | | Systems Design Interview 0 to 1 with Ex-Google SWE
8:14
Jordan has no lifeWatch
Is Google Spanner the BEST Database? | | Systems Design Interview 0 to 1 with Ex-Google SWE
12:49
Jordan has no lifeWatch
MongoDB vs. Apache Cassandra - Who Wins? | Systems Design Interview 0 to 1 with Ex-Google SWE
10:38
Jordan has no lifeWatch
WTF is Hadoop? | Systems Design Interview 0 to 1 with Ex-Google SWE
12:09
Jordan has no lifeWatch
What's HBase and how does it compare to Cassandra? | Systems Design 0 to 1 with Ex-Google SWE
13:45
Jordan has no lifeWatch
WTF is MapReduce?? [Batch Processing] | Systems Design Interview 0 to 1 with Ex-Google SWE
9:19
Jordan has no lifeWatch
The *Right* Way to do Batch Job Data Joins | Systems Design Interview 0 to 1 with Ex-Google SWE
11:02
Jordan has no lifeWatch
You Should Be Using Spark, Not MapReduce | Systems Design Interview 0 to 1 With Ex-Google SWE
11:04
Jordan has no lifeWatch
What's Stream Processing + When Do We Use It? | Systems Design Interview 0 to 1 with Ex-Google SWE
13:23
Jordan has no lifeWatch
Kafka vs. RabbitMQ - who wins and why? | Systems Design Interview 0 to 1 with Ex-Google SWE
11:36
Jordan has no lifeWatch
Stop messing up your stream processing joins! | Systems Design Interview 0 to 1 with Ex-Google SWE
12:02
Jordan has no lifeWatch
Apache Flink - A Must-Have For Your Streams | Systems Design Interview 0 to 1 With Ex-Google SWE
10:57
Jordan has no lifeWatch
Search Indexes - Why do we need them? | Systems Design Interview 0 to 1 with Ex-Google SWE
7:14
Jordan has no lifeWatch
What's ElasticSearch Used For? | Search Indexes | Systems Design Interview 0 to 1 with Ex-Google SWE
7:01
Jordan has no lifeWatch
How are Time Series Databases SO FAST? | Systems Design Interview 0 to 1 With Ex-Google SWE
8:06
Jordan has no lifeWatch
How are Graph Databases So Fast?? (Neo4j) | Systems Design Interview 0 to 1 with Ex-Google SWE
9:32
Jordan has no lifeWatch
GeoSpatial Indexes - Why You Need Them | Systems Design Interview 0 to 1 with Ex-Google SWE
12:23
Jordan has no lifeWatch
Introduction to Distributed Caching - Systems Design Interview 0 to 1 with Ex-Google SWE
10:55
Jordan has no lifeWatch
Distributed Cache Writes: What You Have To Know | Systems Design Interview 0 to 1 With Ex-Google SWE
12:01
Jordan has no lifeWatch
Cache Evictions: Don't Mess Them Up | Systems Design Interview 0 to 1 with Ex-Google SWE
7:51
Jordan has no lifeWatch
Redis vs. Memcached - Who Wins? | Systems Design Interview 0 to 1 With Ex-Google SWE
8:24
Jordan has no lifeWatch
Content Delivery Networks - You Need Them | Systems Design Interview 0 to 1 With Ex-Google SWE
8:21
Jordan has no lifeWatch
What Are Object Stores Used For? [S3] | Systems Design Interview 0 to 1 With Ex-Google SWE
8:06
Jordan has no lifeWatch
Load Balancing - The Right Way To Do It | Systems Design Interview 0 to 1 With Ex-Google SWE
10:19
Jordan has no lifeWatch
TCP vs. UDP in 12 minutes | Systems Design Interview 0 to 1 With Ex-Google SWE
11:42
Jordan has no lifeWatch
Long Polling, Websockets, Server Sent Events - Who Wins? | Systems Design with Ex-Google SWE
11:17
Jordan has no lifeWatch
Monolith Vs. Microservices + Docker + Kubernetes | Systems Design Interview with Ex-Google SWE
10:22
Jordan has no lifeWatch

Complete Javascript

Web DevAkshay Saini

26 sequential lectures • Channel course track

Namaste JavaScript 🙏 Course - JS Video Tutorials by Akshay Saini
10:00
Akshay SainiWatch
How JavaScript Works 🔥& Execution Context | Namaste JavaScript Ep.1
10:00
Akshay SainiWatch
How JavaScript Code is executed? ❤️& Call Stack | Namaste JavaScript Ep. 2
10:00
Akshay SainiWatch
Hoisting in JavaScript 🔥(variables & functions) | Namaste JavaScript Ep. 3
10:00
Akshay SainiWatch
How functions work in JS ❤️ & Variable Environment | Namaste JavaScript Ep. 4
10:00
Akshay SainiWatch
SHORTEST JS Program 🔥window & this keyword | Namaste JavaScript Ep. 5
10:00
Akshay SainiWatch
undefined vs not defined in JS 🤔 | Namaste JavaScript Ep. 6
10:00
Akshay SainiWatch
The Scope Chain, 🔥Scope & Lexical Environment | Namaste JavaScript Ep. 7
10:00
Akshay SainiWatch
let & const in JS 🔥Temporal Dead Zone | | Namaste JavaScript Ep. 8
10:00
Akshay SainiWatch
BLOCK SCOPE & Shadowing in JS 🔥| Namaste JavaScript 🙏 Ep. 9
10:00
Akshay SainiWatch
Closures in JS 🔥 | Namaste JavaScript Episode 10
10:00
Akshay SainiWatch
setTimeout + Closures Interview Question 🔥 | Namaste 🙏 JavaScript Ep. 11
10:00
Akshay SainiWatch
CRAZY JS INTERVIEW 🤯ft. Closures | Namaste 🙏 JavaScript Ep. 12
10:00
Akshay SainiWatch
FIRST CLASS FUNCTIONS 🔥ft. Anonymous Functions | Namaste JavaScript Ep. 13
10:00
Akshay SainiWatch
Callback Functions in JS ft. Event Listeners 🔥| Namaste JavaScript Ep. 14
10:00
Akshay SainiWatch
Asynchronous JavaScript & EVENT LOOP from scratch 🔥 | Namaste JavaScript Ep.15
10:00
Akshay SainiWatch
JS Engine EXPOSED 🔥 Google's V8 Architecture 🚀 | Namaste JavaScript Ep. 16
10:00
Akshay SainiWatch
TRUST ISSUES with setTimeout() | Namaste JavaScript Ep.17
10:00
Akshay SainiWatch
Higher-Order Functions ft. Functional Programming | Namaste JavaScript Ep. 18
10:00
Akshay SainiWatch
map, filter & reduce 🙏 Namaste JavaScript Ep. 19 🔥
10:00
Akshay SainiWatch
Callback Hell | Ep 01 Season 02 - Namaste JavaScript
10:00
Akshay SainiWatch
Promises | Ep 02 Season 02 - Namaste JavaScript
10:00
Akshay SainiWatch
Creating a Promise, Chaining & Error Handling | Ep 03 Season 02 Namaste JavaScript
10:00
Akshay SainiWatch
async await | Namaste JavaScript - Season 02 - Ep 04
10:00
Akshay SainiWatch
Promise APIs + Interview Questions 🔥 | S.02 Ep.05 - Namaste JavaScript | all, allSettled, race, any
10:00
Akshay SainiWatch
this keyword in JavaScript 🔥 | Ep.06 - Namaste JavaScript Season 2 🙏
10:00
Akshay SainiWatch

Java DSA Series

Data Structure & Algorithm (DSA)Love Babbar (Code Help)

122 sequential lectures • Channel course track

DSA Complete Series 🚀 : Data Structures & Algorithms || 150 day Challenge
9:09
Love Babbar (Code Help)Watch
Lecture 1: Flowchart & Pseudocode + Basics || DSA Series by Babbar || Java
1:16:09
Love Babbar (Code Help)Watch
Lecture 2: How a Java Program Run || DSA Series by Babbar
14:55
Love Babbar (Code Help)Watch
Lecture 3: IDE Setup for Coding || DSA Series by Babbar || Java
8:29
Love Babbar (Code Help)Watch
Lecture 4: Write your FIRST Java Program || DSA Series by Babbar
22:38
Love Babbar (Code Help)Watch
Lecture 5: VARIABLES in Java || DSA Series by Babbar
15:17
Love Babbar (Code Help)Watch
Lecture 6: DataTypes in Java || DSA Series by Babbar
27:37
Love Babbar (Code Help)Watch
Lecture 7: Operators in Java || DSA Series by Babbar
30:29
Love Babbar (Code Help)Watch
Lecture 8: Input/Output in Java || DSA Series by Babbar
12:01
Love Babbar (Code Help)Watch
Lecture 9: Conditionals in Java || DSA Series by Babbar
34:38
Love Babbar (Code Help)Watch
Lecture 10: Loops in Java || DSA Series by Babbar
1:08:59
Love Babbar (Code Help)Watch
Lecture 11: Solve any PATTERN Printing Problem using this TRICK || DSA Series by Babbar
2:06:33
Love Babbar (Code Help)Watch
Lecture 12: Methods in Java || DSA Series by Babbar
58:17
Love Babbar (Code Help)Watch
Lecture 13: Arrays in Java || DSA Series by Babbar
1:19:23
Love Babbar (Code Help)Watch
Lecture 14: Strings in Java || DSA Series by Babbar
1:06:44
Love Babbar (Code Help)Watch
Lecture 15: Basic Maths needed for DSA || DSA Series by Babbar
1:16:36
Love Babbar (Code Help)Watch
Lecture 16: Intro to OOPs Concepts || DSA Series by Babbar
44:10
Love Babbar (Code Help)Watch
Lecture 17: Classes, Objects, Constructors, Object Lifecycle in JAVA || DSA Series by Babbar
30:01
Love Babbar (Code Help)Watch
Lecture 18: Encapsulation in JAVA || DSA Series by Babbar
33:08
Love Babbar (Code Help)Watch
Lecture 19: Inheritance in Java || DSA Series by Babbar
1:35:58
Love Babbar (Code Help)Watch
Lecture 20: Polymorphism in Java || DSA Series by Babbar
38:10
Love Babbar (Code Help)Watch
Lecture 21: Abstraction in Java || DSA Series by Babbar
55:49
Love Babbar (Code Help)Watch
Lecture 22: Time & Space Complexity || DSA Series by Babbar
37:28
Love Babbar (Code Help)Watch
Lecture 23: Java Collection Framework ( Part-1 ) || DSA Series by Babbar
1:24:47
Love Babbar (Code Help)Watch
Lecture 24: Java Collection Framework ( Part-2 ) || DSA Series by Babbar
57:46
Love Babbar (Code Help)Watch
Lecture 25: Java Collection Framework ( Part-3 ) || DSA Series by Babbar
1:05:07
Love Babbar (Code Help)Watch
Lecture 26: Bitwise Operators in Java || DSA Series by Babbar
59:21
Love Babbar (Code Help)Watch
Lecture 27: Array Problem Solving Part-1 || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 28: Array Manipulation Problems || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 29: Array Problem Solving Part-3 || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 30: Array Problem Solving Part-4 || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 31: Missing Elements from an Array of Duplicates || Array Problem || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 32: Maximum Sum Contiguous SubArray || Kadane's Algorithm || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 33: Solving 2D Array Problems || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 34: Rotate and Spiral Print a Matrix || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 35: Sorting Algorithms || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 36: Binary Search in 1 Video || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 37: Upper/Lower Bound, Number of Occurrences Binary Search || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 38: Find PEAK of MOUNTAIN Array || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 39: Search in a Rotated Sorted Array || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 40: Binary Search on Answers PATTERN || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 41: Book Allocation Problem || Min-Max Binary Search Pattern || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 42: Painter's Partition Problem || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 43: Aggressive Cows Problem || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 44: EKO SPOJ Problem || Binary Search || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 45: ROTI PRATA SPOJ Problem || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 46: Search in Nearly Sorted Array || Binary Search || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 47: Find Single Non-Duplicate element using Binary Search || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 48: Search in 2D Matrix I and II (Binary Search) || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 49: Row with Maximum 1's || Binary Search || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 50: Unbounded Search using Binary Search Concept || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 51: Reverse Words in a Strings || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 52: String Interview Questions Part-2 || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 53: String Interview Problems Part-3 || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 54: Recursion Basics || Recursion Series Day-1 || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 55: Recursive Time & Space Complexity || Recursion Series Day-2 || DSA Series by Babbar
10:00
Love Babbar (Code Help)Watch
Lecture 56: Climbing Stairs problem || Recursion Series Day-3
10:00
Love Babbar (Code Help)Watch
Lecture 57: Recursion Basics || Recursion Day-4
10:00
Love Babbar (Code Help)Watch
Lecture 58: Recursive BINARY SEARCH || Recursion Day-5
10:00
Love Babbar (Code Help)Watch
Lecture 59: Subsequences of String || Recursion Series Day-6
10:00
Love Babbar (Code Help)Watch
Lecture 60: House Robber Problem || Recursion Series Day-7
10:00
Love Babbar (Code Help)Watch
Lecture 61: Coin Change 2 Problem || Recursion Series Day-8
10:00
Love Babbar (Code Help)Watch
Lecture 62: COin Change I Problem || Recursion Series Day-9
10:00
Love Babbar (Code Help)Watch
Lecture 64: Minimize the Difference Between Target and Chosen Elements || Recursion Series Day-11
10:00
Love Babbar (Code Help)Watch
Lecture 63: Partition Equal Subset Sum Problem || Recursion Series Day-10
10:00
Love Babbar (Code Help)Watch
Lecture 65: Jump Game Problem || Recursion Series Day-12
10:00
Love Babbar (Code Help)Watch
Lecture 66: Leetcode Triangle Problem || Recursive Series Day-13
10:00
Love Babbar (Code Help)Watch
Lecture 67: Subsequences with Sum K || Recursion Series Day-14
10:00
Love Babbar (Code Help)Watch
Lecture 68: Subsets 1 & Subsets II Problem || Recursion Series Day-15
10:00
Love Babbar (Code Help)Watch
Lecture 69: Combination Sum (All 3 *variants*) || Recursion Series Day-16
10:00
Love Babbar (Code Help)Watch
Lecture 70: Permutations of String || Recursion Series Day-17
10:00
Love Babbar (Code Help)Watch
Lecture 71: Intro to Backtracking || Recursion Series Day-18
10:00
Love Babbar (Code Help)Watch
Lecture 72: Phone Keypad Problem || Recursion Series Day-19
10:00
Love Babbar (Code Help)Watch
Lecture 73: N-Queen Problem || Recursion Series Day-20
10:00
Love Babbar (Code Help)Watch
Lecture 74: Sudoku Solver Problem || Recursion Series Day-21
10:00
Love Babbar (Code Help)Watch
Lecture 75: Merge Sort in 1 Video || Recursion Series Day-22
10:00
Love Babbar (Code Help)Watch
Lecture 76: Inversion Count in an Array || Recursion Day-23
10:00
Love Babbar (Code Help)Watch
Lecture 77: Quick Sort in 1 Video || Recursion Day - 24
10:00
Love Babbar (Code Help)Watch
Lecture 78: Starting Linked List Series || Day - 1
10:00
Love Babbar (Code Help)Watch
Lecture 79: All about Doubly Linked List || Linked List Series Day - 2
10:00
Love Babbar (Code Help)Watch
Lecture 80: Circular Linked List || Linked List Series Day-3
10:00
Love Babbar (Code Help)Watch
Lecture 81: Reverse a Linked List || Linked List Series Day-4
10:00
Love Babbar (Code Help)Watch
Lecture 82: Middle Node of Linked List || Linked List Series Day-5
10:00
Love Babbar (Code Help)Watch
Lecture 83: Check Palindrome Linked List || Linked List Series Day-6
10:00
Love Babbar (Code Help)Watch
Lecture 84: Check Cycle in Linked List || Linked List Series Day-7
10:00
Love Babbar (Code Help)Watch
Lecture 86: Remove Duplicate Nodes from LL || Linked List Series Day-9
10:00
Love Babbar (Code Help)Watch
Lecture 87: Kth node from end of LL || Linked List Series Day-10
10:00
Love Babbar (Code Help)Watch
Lecture 88: Odd-Even Linked List || Linked List Series Day-11
10:00
Love Babbar (Code Help)Watch
Lecture 89: Merge Nodes in between Zeroes || Linked List Series Day-12
10:00
Love Babbar (Code Help)Watch
Lecture 90: Add 1 to LL || Linked List Series Day-13
10:00
Love Babbar (Code Help)Watch
Lecture 91: Intersection of 2 Linked List || Linked List Series Day-14
10:00
Love Babbar (Code Help)Watch
Lecture 92: Rotate Linked List || Linked List Series Day-15
10:00
Love Babbar (Code Help)Watch
Lecture 93: Sort LL of 0's, 1's and 2's || Linked List Series Day-16
10:00
Love Babbar (Code Help)Watch
Lecture 94: Swap Nodes in LL || Linked List Series day-17
10:00
Love Babbar (Code Help)Watch
Lecture 95: Delete N Nodes After M Nodes || Linked List Series Day-18
10:00
Love Babbar (Code Help)Watch
Lecture 97: DETECT Starting Node of CYCLE in Linked List || LL Series Day-20
10:00
Love Babbar (Code Help)Watch
Lecture 98: Partition a Linked List || LL Series Day-22
10:00
Love Babbar (Code Help)Watch
Lecture 96: Add 2 numbers in Linked List || LL Series Day-19
10:00
Love Babbar (Code Help)Watch
Lecture 99: Split a LL into Parts || Linked List Series Day-22
10:00
Love Babbar (Code Help)Watch
Lecture 100: Reverse LL in Groups of K || Linked List Series Day-23
10:00
Love Babbar (Code Help)Watch
Lecture 101: Flatten a Multi-Level LL || Linked List Series Day-24
10:00
Love Babbar (Code Help)Watch
Lecture 102: Find Nodes between Critical Points || Linked List Series Day-25
10:00
Love Babbar (Code Help)Watch
Lecture 103: Double a Number in Linked List || Linked List Series Day-26
10:00
Love Babbar (Code Help)Watch
Lecture 104: Deep Copy a Linked List || Linked List Series Day-27
10:00
Love Babbar (Code Help)Watch
Lecture 105: Starting Stack Series || Day-1
10:00
Love Babbar (Code Help)Watch
Lecture 106: STACK warm-up Coding Problems || Day-2
10:00
Love Babbar (Code Help)Watch
Lecture 107: Check STACK is Sorted or Not || Stack Series Day-3
10:00
Love Babbar (Code Help)Watch
Lecture 108: Insert Element in a Sorted Stack || Stack Series Day-4
10:00
Love Babbar (Code Help)Watch
Lecture 109: Check String is VALID or NOT Stack Problem || Stack Series Day-5
10:00
Love Babbar (Code Help)Watch
Lecture 110: Min Addition to make Parentheses Valid || Stack Series Day-6
10:00
Love Babbar (Code Help)Watch
Lecture 111: Minimum Bracket Reversal || Stack Series Day-7
10:00
Love Babbar (Code Help)Watch
Lecture 113: Remove all Adjacent duplicates in String || Stack Series Day-9
10:00
Love Babbar (Code Help)Watch
Lecture 112: Longest Valid Parentheses || Stack Series Day-8
10:00
Love Babbar (Code Help)Watch
Lecture 114: Simplify Path || Stack Series Day-10
10:00
Love Babbar (Code Help)Watch
Lecture 115: Decode String || Stack Series Day-11
10:00
Love Babbar (Code Help)Watch
Lecture 116: Monotonic Stack Pattern Problem || Stack Series Day-12
10:00
Love Babbar (Code Help)Watch
Lecture 117: Stock Span Problem || Stack Series Day-13
10:00
Love Babbar (Code Help)Watch
Lecture 118: Next Greater Node in Linked List || Stack Series Day-14
10:00
Love Babbar (Code Help)Watch
Lecture 119: Remove K Digits Problem || Stack Series Day-15
10:00
Love Babbar (Code Help)Watch
Lecture 120: Celebrity Problem || Stack Series Day-16
10:00
Love Babbar (Code Help)Watch
Lecture 121: Design Browser History || Stack Series Day-17
10:00
Love Babbar (Code Help)Watch
Lecture 122: N Stacks in an Array || Stack Series Day-18
10:00
Love Babbar (Code Help)Watch

System Design (Advanced)

System DesignGaurav Sen

26 sequential lectures • Channel course track

System Design Primer ⭐️: How to start with distributed systems?
9:22
Gaurav SenWatch
System Design BASICS: Horizontal vs. Vertical Scaling
7:56
Gaurav SenWatch
What is LOAD BALANCING? ⚖️
13:50
Gaurav SenWatch
What is CONSISTENT HASHING and Where is it used?
10:50
Gaurav SenWatch
What is a MESSAGE QUEUE and Where is it used?
9:59
Gaurav SenWatch
What is a MICROSERVICE ARCHITECTURE and what are its advantages?
8:19
Gaurav SenWatch
What is DATABASE SHARDING?
8:56
Gaurav SenWatch
Caching in distributed systems: A friendly introduction
11:25
Gaurav SenWatch
How to avoid a single point of failure in distributed systems ✅
6:34
Gaurav SenWatch
What is a CDN (Content Delivery Network)?
5:43
Gaurav SenWatch
What is the Publisher Subscriber Model?
11:25
Gaurav SenWatch
What's an Event Driven System?
14:59
Gaurav SenWatch
Introduction to NoSQL databases
26:18
Gaurav SenWatch
What is an API and how do you design it? 🗒️✅
15:26
Gaurav SenWatch
System Design: TINDER as a microservice architecture
36:41
Gaurav SenWatch
Designing INSTAGRAM: System Design of News Feed
24:29
Gaurav SenWatch
WHATSAPP System Design: Chat Messaging Systems for Interviews
25:15
Gaurav SenWatch
How NETFLIX onboards new content: Video Processing at scale 🎥
10:44
Gaurav SenWatch
Capacity Planning and Estimation: How much data does YouTube store daily?
13:12
Gaurav SenWatch
How databases scale writes: The power of the log ✍️🗒️
17:22
Gaurav SenWatch
Distributed Consensus and Data Replication strategies on the server
15:48
Gaurav SenWatch
Designing a location database: QuadTrees and Hilbert Curves
22:22
Gaurav SenWatch
Data Consistency and Tradeoffs in Distributed Systems
25:42
Gaurav SenWatch
System Design Interview: TikTok architecture with @sudoCODE
45:35
Gaurav SenWatch
5 Tips for System Design Interviews
8:19
Gaurav SenWatch
System Design Walkthrough at InterviewReady - Designed for SDE 1 to SDE 3 Interview Preparation
4:55
Gaurav SenWatch

Chai aur Javascript

Web DevChai aur Code

51 sequential lectures • Channel course track

Javascript for beginners | chai aur #javascript
10:00
Chai aur CodeWatch
Setting up environment in local machine for Javascript | chai aur #javascript
10:00
Chai aur CodeWatch
Save and work on Github for Javascript | chai aur #javascript
10:00
Chai aur CodeWatch
Let, const and var ki kahani | chai aur #javascript
10:00
Chai aur CodeWatch
Datatypes and ECMA standards | chai aur #javascript
10:00
Chai aur CodeWatch
Datatype conversion confusion | chai aur #javascript
10:00
Chai aur CodeWatch
Why string to number conversion is confusing | chai aur #javascript
10:00
Chai aur CodeWatch
Comparison of datatypes in javascript | chai aur #javascript
10:00
Chai aur CodeWatch
Data types of javascript summary | chai aur #javascript
10:00
Chai aur CodeWatch
Stack and Heap memory in javascript
10:00
Chai aur CodeWatch
Strings in Javascript | chai aur #javascript
10:00
Chai aur CodeWatch
Number and Maths in Javascript | chai aur #javascript
10:00
Chai aur CodeWatch
Date and time in depth in javascript | chair aur #javascript
10:00
Chai aur CodeWatch
Array in Javascript | chai aur #javascript
10:00
Chai aur CodeWatch
Array part 2 in Javascript Hindi | chai aur #javascript
10:00
Chai aur CodeWatch
Objects in depth in javascript in hindi | chai aur #javascript
10:00
Chai aur CodeWatch
Objects in Javascript part 2 in Hindi | chai aur #javascript
10:00
Chai aur CodeWatch
Object de-structure and JSON API intro | chai aur #javascript
10:00
Chai aur CodeWatch
Functions and parameter in javascript | Hindi
10:00
Chai aur CodeWatch
Functions with objects and array in javascript | chai aur #javascript
10:00
Chai aur CodeWatch
Global and local scope in javascript | chai aur #javascript
10:00
Chai aur CodeWatch
Scope level and mini hoisting in javascript | chai aur #javascript
10:00
Chai aur CodeWatch
THIS and arrow function in javascript | chai aur #javascript
10:00
Chai aur CodeWatch
Immediately Invoked Function Expressions IIFE | chai aur #javascript
10:00
Chai aur CodeWatch
How does javascript execute code + call stack | chai aur #javascript
10:00
Chai aur CodeWatch
Control flow in javascript in 1 shot | chai aur #javascript
10:00
Chai aur CodeWatch
For loop with break and continue in javascript | chai aur #javascript
10:00
Chai aur CodeWatch
While and do while loop in Javascript | chai aur #javascript
10:00
Chai aur CodeWatch
High Order Array loops | chai aur #javascript
10:00
Chai aur CodeWatch
Filter map and reduce in javascript | chai aur #javascript
10:00
Chai aur CodeWatch
DOM introduction in javascript | chai aur #javascript
10:00
Chai aur CodeWatch
All DOM selectors NodeList and HTMLCollection | chai aur #javascript
10:00
Chai aur CodeWatch
How to create a new element in DOM | chai aur #javascript
10:00
Chai aur CodeWatch
Edit and remove elements in DOM | chai aur #javascript
10:00
Chai aur CodeWatch
Lets build 4 javascript projects for beginners | chai aur #javascript
10:00
Chai aur CodeWatch
Events in Javascript | chai aur #javascript
10:00
Chai aur CodeWatch
Async Javascript fundamentals | chai aur #javascript
10:00
Chai aur CodeWatch
2 projects with Async JS | chai aur #javascript
10:00
Chai aur CodeWatch
API request and V8 engine | chai aur #javascript
10:00
Chai aur CodeWatch
Promise in javascript | chai aur #javascript
10:00
Chai aur CodeWatch
Now you know fetch in javascript | chai aur #javascript
10:00
Chai aur CodeWatch
Object Oriented in Javascript | chai aur #javascript
10:00
Chai aur CodeWatch
Magic of Prototype in javascript | chai aur #javascript
10:00
Chai aur CodeWatch
Call and this in javascript | chai aur #javascript
10:00
Chai aur CodeWatch
Class constructor and static | chai aur #javascript
10:00
Chai aur CodeWatch
Bind in javascript | chai aur #javascript
10:00
Chai aur CodeWatch
Now you know Objects in Javascript | chai aur #javascript
10:00
Chai aur CodeWatch
Getter Setter and Stack Overflow | chai aur #javascript
10:00
Chai aur CodeWatch
Lexical scoping and Closure | chai aur #javascript
10:00
Chai aur CodeWatch
Javascript ends with a story | chai aur #javascript
10:00
Chai aur CodeWatch
You don't know array in javascript | PACKED vs HOLEY | JSVU | V8-debug
10:00
Chai aur CodeWatch

DSA Playlist

Data Structure & Algorithm (DSA)YouTube Playlist

193 sequential lectures • Channel course track

Two Sum | Leetcode 1 | Detailed Explanation | codestorywithMIK
12:24
YouTube PlaylistWatch
Two Sum II - Input Array Is Sorted : Explanation ➕ Live Coding 🧑🏻‍💻 (In Hinglish)
10:13
YouTube PlaylistWatch
3 SUM | Detailed Explanation | Leetcode 15 | codestorywithMIK
35:43
YouTube PlaylistWatch
Trapping Rain Water | without stack | Made Super Easy | Leetcode 42 | codestorywithMIK
20:00
YouTube PlaylistWatch
3Sum Closest - (Meta, Amazon, Microsoft, Oracle)➕Live Coding 🧑🏻‍💻
14:31
YouTube PlaylistWatch
Factorial Of Large Numbers - (Microsoft, MakeMyTrip, Adobe):Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻
17:17
YouTube PlaylistWatch
Next Permutation | Google | Microsoft | Amazon | Leetcode 31
25:45
YouTube PlaylistWatch
Rotate Image | Simplest Explanation | Detailed | Leetcode 48 | codestorywithMIK
10:00
YouTube PlaylistWatch
Container With Most Water | Detailed | With Dry Runs | Leetcode 11 | codestorywithMIK
10:00
YouTube PlaylistWatch
Spiral Matrix | Leetcode-54 | Amazon, Microsoft, Paytm | Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻
10:00
YouTube PlaylistWatch
Group Anagrams | using sorting | Google | Leetcode 49
10:00
YouTube PlaylistWatch
Group Anagrams | without sorting | Google | Leetcode 49
10:00
YouTube PlaylistWatch
Sort the Matrix Diagonally | Leetcode 1329 | Similar to Leetcode 498 | codestorywithMIK
10:00
YouTube PlaylistWatch
Diagonal Traverse | Leetcode 498 | Similar to Leetcode 1329 | codestorywithMIK
10:00
YouTube PlaylistWatch
Sort Colors | Easy Explanation | Amazon | codestorywithMIK
10:00
YouTube PlaylistWatch
Find Original Array From Doubled Array | Google | Easy Explanation | codestorywithMIK
10:00
YouTube PlaylistWatch
Sum of Even Numbers After Queries-(Asked in Indeed): Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻
10:00
YouTube PlaylistWatch
Find Pivot Index | Amazon | Adobe | Leetcode 724
10:00
YouTube PlaylistWatch
Increasing Triplet Subsequence -(Amazon, Walmart, Facebook): Explanation ➕ Live Coding 🧑🏻‍💻
10:00
YouTube PlaylistWatch
Largest Perimeter Triangle | Easy Explanation | Leetcode 976 | codestorywithMIK
10:00
YouTube PlaylistWatch
Contains Duplicate II -(Airbnb, Palantir Technologies): Explanation ➕ Live Coding 🧑🏻‍💻
10:00
YouTube PlaylistWatch
Set Mismatch | Better Approach | Amazon | Leetcode 645
10:00
YouTube PlaylistWatch
Continuous Subarray Sum | Clear Explanation | Leetcode 523 | codestorywithMIK
10:00
YouTube PlaylistWatch
Image Overlap | Easy Explanation | Leetcode 835 | codestorywithMIK
10:00
YouTube PlaylistWatch
Shortest Path in a Grid with Obstacles Elimination -(Google) : Explanation ➕ Live Coding
10:00
YouTube PlaylistWatch
Toeplitz Matrix -(Google, Meta, Apple) : Explanation ➕ Live Coding
10:00
YouTube PlaylistWatch
Where Will the Ball Fall -(Amazon) : Explanation ➕ Live Coding
10:00
YouTube PlaylistWatch
Valid Sudoku | 2 Approaches | Leetcode 36 | codestorywithMIK
10:00
YouTube PlaylistWatch
Minimum Average Difference | Made Easy | Leetcode 2256 | codestorywithMIK
10:00
YouTube PlaylistWatch
Longest Subsequence With Limited Sum : Explanation ➕ Live Coding👩🏻‍💻🧑🏻‍💻🤯😱
10:00
YouTube PlaylistWatch
Minimum Number of Arrows to Burst Balloons | Leetcode 452 | Google | codestorywithMIK
10:00
YouTube PlaylistWatch
Insert Interval | Brute Force | Optimal | Google | Apple | codestorywithMIK
10:00
YouTube PlaylistWatch
Maximum Sum Circular Subarray | With Proof | Leetcode 918 | codestorywithMIK
10:00
YouTube PlaylistWatch
Subarray Sums Divisible by K | Brute Force | Optimal | Easy Explanation | codestorywithMIK
10:00
YouTube PlaylistWatch
Find the Town Judge | 2 Approaches | Leetcode 997
10:00
YouTube PlaylistWatch
Snakes and Ladders | Detailed Reason | Leetcode 909 | codestorywithMIK
10:00
YouTube PlaylistWatch
Data Stream as Disjoint Intervals - (AMAZON) : Explanation ➕ Live Coding
10:00
YouTube PlaylistWatch
Jump Game IV | Leetcode 1345 | Detailed | Intuition | codestorywithMIK
10:00
YouTube PlaylistWatch
Can Place Flowers - (Leetcode - 605) - (GOOGLE) : Explanation ➕ Live Coding
10:00
YouTube PlaylistWatch
Number of Zero-Filled Subarrays | 2 Approaches | Leetcode 2348 | Meta | codestorywithMIK
10:00
YouTube PlaylistWatch
Number of Closed Islands | Story to code | Google | Leetcode 1254 | codestorywithMIK
10:00
YouTube PlaylistWatch
Number of Enclaves - (Leetcode - 1020) - (AMAZON) : Explanation ➕ Live Coding 🧑🏻‍💻👩🏻‍💻
10:00
YouTube PlaylistWatch
Kids With the Greatest Number of Candies - (Leetcode - 1431) - : Explanation ➕ Live Coding
10:00
YouTube PlaylistWatch
Spiral Matrix II | Leetcode-59 | Amazon, Microsoft, Paytm | Explanation ➕ Live Coding
10:00
YouTube PlaylistWatch
Shortest Bridge | Leetcode-934 | DFS + BFS | MICROSOFT | Explanation ➕ Live Coding
10:00
YouTube PlaylistWatch
Count Negative Numbers in a Sorted Matrix | Leetcode 1351 | 3 Approaches | codestorywithMIK
10:00
YouTube PlaylistWatch
Summary Ranges | Leetcode-228 | GOOGLE | Explanation ➕ Live Coding
10:00
YouTube PlaylistWatch
K Radius Subarray Averages | Leetcode-2090 | AMAZON | Explanation ➕ Live Coding
10:00
YouTube PlaylistWatch
Shortest Path to Get All Keys | Full Detail | Leetcode-864 | GOOGLE | Explanation ➕ Live Coding
10:00
YouTube PlaylistWatch
Put Marbles in Bags | Full Intuition | Dry Run | Leetcode 2551 | AMAZON | codestorywithMIK
10:00
YouTube PlaylistWatch
Non-overlapping Intervals | 2 Approaches | Intuition | Dry Run | Leetcode-435 | GOOGLE | Explanation
10:00
YouTube PlaylistWatch
Kth Largest Element in an Array | Quick Select | Time Complexity | MICROSOFT | Leetcode-215
10:00
YouTube PlaylistWatch
01 Matrix | Detailed Dry Run | Why BFS from 0s | GOOGLE | Leetcode - 542
10:00
YouTube PlaylistWatch
Minimum Penalty for a Shop | MULTIPLE APPROACHES | Dry Run | Leetcode 2483 | codestorywithMIK
10:00
YouTube PlaylistWatch
Pascal's Triangle | Simplest Approach | Application | DRY RUN | Adobe | Amazon | Leetcode - 118
10:00
YouTube PlaylistWatch
Group the People Given the Group Size They Belong To | Dry Run | LYFT | Leetcode - 1282
10:00
YouTube PlaylistWatch
The K Weakest Rows in a Matrix | 2 Approaches | Binary Search | Heap | Sorting | Leetcode - 1337
10:00
YouTube PlaylistWatch
Find the Duplicate Number | With Proof | Follow Up Qns | Hare And Tortoise | Leetcode - 287
10:00
YouTube PlaylistWatch
Minimum Operations to Reduce X to Zero | 2 Approaches | Recursion | Hashmap | Leetcode - 1658
10:00
YouTube PlaylistWatch
Median of Two Sorted Arrays | PART-1 | Brute Force | Better Approach | Google | Apple | Leetcode - 4
10:00
YouTube PlaylistWatch
Sort Array By Parity | 3 Approaches | Custom Comparator | META | Leetcode - 905
10:00
YouTube PlaylistWatch
Monotonic Array | Simple | Clean | META | Leetcode - 896 | Live Coding | Explanation
10:00
YouTube PlaylistWatch
Majority Element I | Majority Element II | Boyer-Moore | Made Simple | Leetcode 229 | Leetcode 169
10:00
YouTube PlaylistWatch
Minimum Number of Operations to Make Array Continuous | Brute Force | Optimal | Leetcode - 2009
10:00
YouTube PlaylistWatch
Pascal's Triangle II | Using Same Code of Pascal's Triangle I | AMAZON | Leetcode - 119
10:00
YouTube PlaylistWatch
Last Moment Before All Ants Fall Out of a Plank | Easy Explanation | GOOGLE | Leetcode - 1503
10:00
YouTube PlaylistWatch
Find the Winner of an Array Game | Simulation | Easy Explanation | GOOGLE | Leetcode - 1535
10:00
YouTube PlaylistWatch
Reduction Operations to Make the Array Elements Equal | Intuition | Leetcode-1887
10:00
YouTube PlaylistWatch
Minimum Amount of Time to Collect Garbage | Simple Clean | Leetcode-2391
10:00
YouTube PlaylistWatch
Diagonal Traverse II | 2 Approaches | Map | BFS | GOOGLE | Leetcode-1424
10:00
YouTube PlaylistWatch
Arithmetic Subarrays | 2 Approaches | Sorting | Without Sorting | Leetcode-1630
10:00
YouTube PlaylistWatch
Sum of Absolute Differences in a Sorted Array | Build Intuition | 2 Approaches | Leetcode - 1685
10:00
YouTube PlaylistWatch
Largest Submatrix With Rearrangements | Build Intuition | 3 Approaches | Leetcode 1727 | MIK
10:00
YouTube PlaylistWatch
Element Appearing More Than 25% In Sorted Array | 3 Approaches | Leetcode-1287
10:00
YouTube PlaylistWatch
Difference Between Ones and Zeros in Row and Column | Intuition | Leetcode-2482
10:00
YouTube PlaylistWatch
Image Smoother | 2 Simple Approaches | AMAZON | Leetcode-661
10:00
YouTube PlaylistWatch
Widest Vertical Area Between Two Points Containing No Points | Leetcode 1637
10:00
YouTube PlaylistWatch
Anti Diagonal Traversal of Matrix | Simplest Approach | GfG POTD
10:00
YouTube PlaylistWatch
Convert an Array Into a 2D Array With Conditions | With Dry Run | Leetcode 2610
10:00
YouTube PlaylistWatch
Number of Submatrices That Sum to Target | Subarray Sum Equals K | Leetcode 1074 | Leetcode 560
10:00
YouTube PlaylistWatch
Sequential Digits | 2 Approaches | Leetcode 1291 | codestorywithMIK
10:00
YouTube PlaylistWatch
Rearrange Array Elements by Sign | 2 Approaches | Why Order Preserve | Leetcode 2149
10:00
YouTube PlaylistWatch
Number of Subarrays That Match a Pattern | Brute Force | Optimal | KMP | Leetcode 3034 | 3036
10:00
YouTube PlaylistWatch
Meeting Rooms III | Detailed Intuition | Brute Force | Optimal | Leetcode 2402 | codestorywithMIK
10:00
YouTube PlaylistWatch
Product of Array Except Self | 4 Approaches | Detailed Explanation | Leetcode 238 | codestorywithMIK
10:00
YouTube PlaylistWatch
Contiguous Array | Using same Pattern Approach | Similar Problems | Leetcode 525
10:00
YouTube PlaylistWatch
Find All Duplicates in an Array | Clean | Easy | Leetcode 442 | codestorywithMIK
10:00
YouTube PlaylistWatch
First Missing Positive | In Depth Intuition | Clean Code | Leetcode 41 | codestorywithMIK
10:00
YouTube PlaylistWatch
Count Alternating Subarrays | Super Easy | Leetcode 3031 | Weekly Contest 391 | codestorywithMIK
10:00
YouTube PlaylistWatch
Island Perimeter | 3 Approaches | Google | Leetcode 463 | codestorywithMIK
10:00
YouTube PlaylistWatch
Number of Islands | DFS | BFS | Same as Island Perimeter | Leetcode 200 | codestorywithMIK
10:00
YouTube PlaylistWatch
Find All Groups of Farmland | DFS | BFS | Brute Force | Leetcode 1992 | codestorywithMIK
10:00
YouTube PlaylistWatch
Count Number of Nice Subarrays | 2 Approaches | Similar Concept | Leetcode 1248 | codestorywithMIK
10:00
YouTube PlaylistWatch
Minimum Number of K Consecutive Bit Flips | 3 Approaches | Leetcode 995 | 3191 | codestorywithMIK
10:00
YouTube PlaylistWatch
Minimum Difference Between Largest and Smallest Value in Three Moves | 2 Approaches | Leetcode 1509
10:00
YouTube PlaylistWatch
Average Waiting Time | Simple Simulation | Leetcode 1701 | codestorywithMIK
10:00
YouTube PlaylistWatch
Find Valid Matrix Given Row and Column Sums | Simple Approach | Leetcode 1605 | codestorywithMIK
10:00
YouTube PlaylistWatch
Minimum Operations to Make Array Equal to Target | Minimum Number of Increments|Leetcode 3229 & 1526
10:00
YouTube PlaylistWatch
Count Number of Teams | Simple thought process | Intuition | Leetcode 1395
10:00
YouTube PlaylistWatch
Spiral Matrix III | Simple Simulation | Made Easy | Leetcode 885 | codestorywithMIK
10:00
YouTube PlaylistWatch
Magic Squares In Grid | Simple Approach | Clean Code | Leetcode 840 | codestorywithMIK
10:00
YouTube PlaylistWatch
Regions Cut By Slashes | Already Studied Concept | Easy Code | Leetcode 959 | codestorywithMIK
10:00
YouTube PlaylistWatch
Minimum Number of Days to Disconnect Island | Studied Concept | Leetcode 1568 | codestorywithMIK
10:00
YouTube PlaylistWatch
Count Sub Islands | Easiest Thought Process | Leetcode 1905 | codestorywithMIK
10:00
YouTube PlaylistWatch
Find the Student that Will Replace the Chalk | 2 Ways | Leetcode 1894 | codestorywithMIK
10:00
YouTube PlaylistWatch
Walking Robot Simulation | Detailed Simulation | Leetcode 874 | codestorywithMIK
10:00
YouTube PlaylistWatch
Spiral Matrix IV | Same Concept Copy Paste | Dry Run | Leetcode 2326 | codestorywithMIK
10:00
YouTube PlaylistWatch
Longest Subarray With Maximum Bitwise AND | Simple Observation | Leetcode 2419 | codestorywithMIK
10:00
YouTube PlaylistWatch
Minimum Time Difference | Easy Approach | Detailed | Leetcode 539 | codestorywithMIK
10:00
YouTube PlaylistWatch
My Calendar I | Detailed Approach | Leetcode 729 | codestorywithMIK
10:00
YouTube PlaylistWatch
My Calendar II | Simplest Explanation | Full Dry Run | Leetcode 731 | codestorywithMIK
10:00
YouTube PlaylistWatch
Make Sum Divisible by P | Simplest Explanation | Full Dry Run | Leetcode 1590 | codestorywithMIK
10:00
YouTube PlaylistWatch
Divide Players Into Teams of Equal Skill | With Proof | Dry Run | Leetcode 2491 | codestorywithMIK
10:00
YouTube PlaylistWatch
The Number of the Smallest Unoccupied Chair | Brute Force | Optimal |Leetcode 1942 |codestorywithMIK
10:00
YouTube PlaylistWatch
Divide Intervals Into Minimum Number of Groups | Simple Intuition | Leetcode 2406 | codestorywithMIK
10:00
YouTube PlaylistWatch
Count Number of Maximum Bitwise-OR Subsets | Simplest Approach | Leetcode 2044 | codestorywithMIK
10:00
YouTube PlaylistWatch
Longest Square Streak in an Array | Detailed Approaches | Dry Run | Leetcode 2501 | codestorywithMIK
10:00
YouTube PlaylistWatch
Maximum Number of Moves in a Grid | Simplest Approach | Leetcode 2684 | codestorywithMIK
10:00
YouTube PlaylistWatch
Minimum Number of Removals to Make Mountain Array | Thought Process | Leetcode 1671|codestorywithMIK
10:00
YouTube PlaylistWatch
Find if Array Can Be Sorted | Detailed Approaches | Dry Runs | Leetcode 3011 | codestorywithMIK
10:00
YouTube PlaylistWatch
Prime Subtraction Operation | Straight Forward Approach | Leetcode 2601 | codestorywithMIK
10:00
YouTube PlaylistWatch
Shortest Subarray to be Removed to Make Array Sorted | Detailed | Leetcode 1574 | codestorywithMIK
10:00
YouTube PlaylistWatch
Count Unguarded Cells in the Grid | Simple Explanation | Leetcode 2257 | codestorywithMIK
10:00
YouTube PlaylistWatch
Flip Columns For Maximum Number of Equal Rows | 2 Approaches | Leetcode 1072 | codestorywithMIK
10:00
YouTube PlaylistWatch
Rotating the Box | Brute Force | Optimal | Leetcode 1861 | codestorywithMIK
10:00
YouTube PlaylistWatch
Maximum Matrix Sum | Simple Thought Process | Leetcode 1975 | codestorywithMIK
10:00
YouTube PlaylistWatch
Sliding Puzzle | Detailed for Beginners | Leetcode 773 | codestorywithMIK
10:00
YouTube PlaylistWatch
Two Best Non-Overlapping Events | Brute Force | Better | Leetcode 2054 | codestorywithMIK
10:00
YouTube PlaylistWatch
Special Array II | 3 Detailed Approaches | Beginners Alert | Leetcode 3152 | codestorywithMIK
10:00
YouTube PlaylistWatch
Maximum Beauty of an Array After Applying Operation | 3 Approaches | Leetcode 2779 |codestorywithMIK
10:00
YouTube PlaylistWatch
Max Chunks To Make Sorted | 3 Detailed Approaches | Leetcode 769 | codestorywithMIK
10:00
YouTube PlaylistWatch
Best Sightseeing Pair | 3 Approaches | Detailed For Beginners | Leetcode 1014 | codestorywithMIK
10:00
YouTube PlaylistWatch
Count Vowel Strings in Ranges | Simple Thought Process | Leetcode 2559 | codestorywithMIK
10:00
YouTube PlaylistWatch
Number of Ways to Split Array | Simple Thought Process | Leetcode 2270 | codestorywithMIK
10:00
YouTube PlaylistWatch
Find the Prefix Common Array of Two Arrays | 3 Detailed Approach | Leetcode 2657 | codestorywithMIK
10:00
YouTube PlaylistWatch
First Completely Painted Row or Column | 3 Approaches | Detailed | Leetcode 2661 | codestorywithMIK
10:00
YouTube PlaylistWatch
Grid Game | Detailed Explanation | Complete Ry Run | Leetcode 2017 | codestorywithMIK
10:00
YouTube PlaylistWatch
Make Lexicographically Smallest Array by Swapping Elements | Brute Force | Optimal | Leetcode 2948
10:00
YouTube PlaylistWatch
Count Servers that Communicate | 3 Detailed Approaches | Dry Runs | Leetcode 1267 | codestorywithMIK
10:00
YouTube PlaylistWatch
Tuple with Same Product | 4 Detailed Approaches | Dry Runs | Leetcode 1726 | codestorywithMIK
10:00
YouTube PlaylistWatch
Max Sum of a Pair With Equal Sum of Digits | 4 Approaches | Leetcode 2342 | codestorywithMIK
10:00
YouTube PlaylistWatch
Product of the Last K Numbers | Brute Force | Follow Up Optimal | Leetcode 1352 | codestorywithMIK
10:00
YouTube PlaylistWatch
Number of Sub-arrays With Odd Sum | Brute Force | Better | Optimal | Leetcode 1524 |codestorywithMIK
10:00
YouTube PlaylistWatch
Maximum Absolute Sum of Any Subarray | Kadane's Algorithm | Leetcode 1749 | codestorywithMIK
10:00
YouTube PlaylistWatch
Partition Array According to Given Pivot | Multiple Approaches | Leetcode 2161 | codestorywithMIK
10:00
YouTube PlaylistWatch
Count Days Without Meetings | Simplest Explanation | Leetcode 3169 | codestorywithMIK
10:00
YouTube PlaylistWatch
Check if Grid can be Cut into Sections | Merge Intervals | Leetcode 3394 | Leetcode 56 | Detailed
10:00
YouTube PlaylistWatch
Maximum Number of Points From Grid Queries | DFS | BFS | Optimal | Leetcode 2503 | codestorywithMIK
10:00
YouTube PlaylistWatch
Count of Interesting Subarrays | Using Studied Concept | Dry Run | Leetcode 2845 | codestorywithMIK
10:00
YouTube PlaylistWatch
Set Matrix Zeroes | Multiple Approaches | Leetcode 73 | codestorywithMIK
10:00
YouTube PlaylistWatch
Find the Maximum Length of Valid Subsequence I | Detailed Intuition | Leetcode 3201 | MIK
10:00
YouTube PlaylistWatch
Range Product Queries of Powers | Simple Explanation | Leetcode 2438 | codestorywithMIK
10:00
YouTube PlaylistWatch
Count Submatrices With All Ones | Detailed Explanation | Leetcode 1504 | codestorywithMIK
10:00
YouTube PlaylistWatch
Find the Minimum Area to Cover All Ones I | Simple Explanation | Leetcode 3195 | codestorywithMIK
10:00
YouTube PlaylistWatch
Find the Minimum Area to Cover All Ones II | Detailed Explanation | Leetcode 3197 | codestorywithMIK
10:00
YouTube PlaylistWatch
Sort Matrix by Diagonals | 2 Approaches | Without Map | Leetcode 3446 | codestorywithMIK
10:00
YouTube PlaylistWatch
Find the Number of Ways to Place People I | 2 Detailed Approaches | Leetcode 3025 | codestorywithMIK
10:00
YouTube PlaylistWatch
Find the Number of Ways to Place People II | Same as Part I | Leetcode 3027 | codestorywithMIK
10:00
YouTube PlaylistWatch
Minimum Operations to Make Array Elements Zero | Detailed Deep Dive | Leetcode 3495 | MIK
10:00
YouTube PlaylistWatch
Valid Triangle Number | 3 Approaches | Detailed | Leetcode 611 | codestorywithMIK
10:00
YouTube PlaylistWatch
Find Triangular Sum of an Array | 2 Approaches | Constant Space | Leetcode 2221 | codestorywithMIK
10:00
YouTube PlaylistWatch
Water Bottles II | 2 Approaches | Sridharacharya formula | Leetcode 3100 | codestorywithMIK
10:00
YouTube PlaylistWatch
Pacific Atlantic Water Flow | Detailed | Brute Force | Optimal | Leetcode 417 | codestorywithMIK
10:00
YouTube PlaylistWatch
Find the Minimum Amount of Time to Brew Potions | Deep Dive | Leetcode 3494 | codestorywithMIK
10:00
YouTube PlaylistWatch
Adjacent Increasing Subarrays Detection II | Same as Part I | Leetcode 3350 | codestorywithMIK
10:00
YouTube PlaylistWatch
Maximum Frequency of an Element After Performing Operations I | Made Easy | Leetcode 3346
10:00
YouTube PlaylistWatch
Maximum Subarray Sum With Length Divisible by K | Simplified Kadane's Algo | Leetcode 3381 | MIK
10:00
YouTube PlaylistWatch
Number of Smooth Descent Periods of a Stock | Simple Approach | Leetcode 2110 | codestorywithMIK
10:00
YouTube PlaylistWatch
Maximize Area of Square Hole in Grid | Detailed Intuition | Leetcode 2943 | codestorywithMIK
10:00
YouTube PlaylistWatch
Largest Magic Square | Simplified Explanation | Leetcode 1895 | codestorywithMIK
10:00
YouTube PlaylistWatch
Maximum Side Length of a Square with Sum Less than or Equal to Threshold | 2 Ways | Leetcode 1292
10:00
YouTube PlaylistWatch
Minimum Swaps to Arrange a Binary Grid | Intuition | Dry Run | Leetcode 1536 | codestorywithMIK
10:00
YouTube PlaylistWatch
Get Biggest Three Rhombus Sums in a Grid | Brute Force | Optimal | Leetcode 1878 | codestorywithMIK
10:00
YouTube PlaylistWatch
Count Submatrices with Top-Left Element and Sum Less Than k | Brute Force | Optimal | Leetcode 3070
10:00
YouTube PlaylistWatch
Count Submatrices With Equal Frequency of X and Y | Using Same Pattern Concept | Leetcode 3212 | MIK
10:00
YouTube PlaylistWatch
Minimum Absolute Difference in Sliding Submatrix | Straight Forward | Leetcode 3567 | MIK
10:00
YouTube PlaylistWatch
Construct Product Matrix | Simplified Approach | Dry Run | Leetcode 2906 | codestorywithMIK
10:00
YouTube PlaylistWatch
Equal Sum Grid Partition I | Simplified Approach | Dry Run | Leetcode 3546 | codestorywithMIK
10:00
YouTube PlaylistWatch
Equal Sum Grid Partition II | Detailed | Simplified Approach | Leetcode 3548 | codestorywithMIK
10:00
YouTube PlaylistWatch
Sum of Distances | Detailed | From Brute Force | Dry Runs | Leetcode 2615 | codestorywithMIK
10:00
YouTube PlaylistWatch
Rotate Function | Detailed with Proof | Leetcode 396 | codestorywithMIK
10:00
YouTube PlaylistWatch
Jump Game IX | Detailed Minute Points | Dry Run | Leetcode 3660 | codestorywithMIK
10:00
YouTube PlaylistWatch
Cyclically Rotating a Grid | Simplified and Easy | Dry Run | Leetcode 1914 | codestorywithMIK
10:00
YouTube PlaylistWatch
Jump Game III | Simple and Easy | Leetcode 1306 | codestorywithMIK
10:00
YouTube PlaylistWatch
Earliest Finish Time for Land and Water Rides I and II | Story To Code | Leetcode 3633 & 3635 | MIK
10:00
YouTube PlaylistWatch
Count Subarrays With Majority Element I and II | 5 Approaches | Leetcode 3737 and 3739 | MIK
10:00
YouTube PlaylistWatch
Concatenate Non-Zero Digits and Multiply by Sum II | Detailed | Simplified | Leetcode 3756 | MIK
10:00
YouTube PlaylistWatch
Rotate Array | Shift 2D Grid | Smart Approach | Leetcode 189 | Leetcode 1260 | codestorywithMIK
10:00
YouTube PlaylistWatch
Maximum Sum of Two Non-Overlapping Subarrays | Online Assessment | Sprinkler | Leetcode 1031 | MIK
10:00
YouTube PlaylistWatch
Minimum Cost Homecoming of a Robot in a Grid | Juspay Online Assessment | Leetcode 2087 | MIK
10:00
YouTube PlaylistWatch
Removing Minimum and Maximum From Array | Simple Observation | Leetcode 2091 | codestorywithMIK
10:00
YouTube PlaylistWatch
Minimum Moves to Clean the Classroom | Deep Dive | Intuition | Leetcode 3568 | codestorywithMIK
10:00
YouTube PlaylistWatch
Minimum Operations to Sort a Permutation | Deep Dive | Clear Intuition | Proof | Leetcode 3942 | MIK
10:00
YouTube PlaylistWatch

OOPS

CS Fundamentals

16 sequential lectures • Channel course track

Lecture 70: Object Oriented Programming in C++
1:12:23
YouTube CourseWatch
OOP 1 | Introduction & Concepts - Classes, Objects, Constructors, Keywords
1:42:27
YouTube CourseWatch
Complete C++ OOPS in 1 Shot
15:00
YouTube CourseWatch
OOP 2 | Packages, Static, Singleton Class, In-built Methods
1:19:13
YouTube CourseWatch
Lecture 71: Constructor and Destructor in C++
1:03:30
YouTube CourseWatch
OOP 3 | Principles - Inheritance, Polymorphism, Encapsulation, Abstraction
2:12:51
YouTube CourseWatch
Lecture 72: Object Oriented Programming: Static data Member and Function | Encapsulation
1:07:28
YouTube CourseWatch
Lecture 73: Inheritance | Access Modifier | Real Life Example
50:17
YouTube CourseWatch
OOP 4 | Access Control, In-built Packages, Object Class
50:45
YouTube CourseWatch
Lecture 74: Type of Inheritance in C++ | Single Inheritance | Multiple | Hybrid | Multipath
1:11:20
YouTube CourseWatch
OOP 5 | Abstract Classes, Interfaces, Annotations
1:10:42
YouTube CourseWatch
Lecture 75: Polymorphism and Virtual Function in C++
56:32
YouTube CourseWatch
OOP 6 | Generics, Custom ArrayList, Lambda Expressions, Exception Handling, Object Cloning
1:31:53
YouTube CourseWatch
OOP 7 | Collections Framework, Vector Class, Enums in Java
26:40
YouTube CourseWatch
Lecture 76: Exception Handling in C++
1:00:37
YouTube CourseWatch
Lecture 77: File Handling in C++
30:41
YouTube CourseWatch

All In One (OS+DBMS+OOPS+CN)

CS FundamentalsDev. Shivansh Vasu

1 sequential lectures • Channel course track

OS + CN + OOPS + DBMS : Core CS Fundamentals in 1 Video | Concepts, Notes, Questions, Interview Prep
15:00
Dev. Shivansh VasuWatch

System Design (Interview)

System DesignHello Interview

17 sequential lectures • Channel course track

System Design Interview: Design Ticketmaster w/ a Ex-Meta Staff Engineer
58:39
Hello InterviewWatch
Design Uber w/ a Ex-Meta Staff Engineer: System Design Interview breakdown
1:03:05
Hello InterviewWatch
Design Dropbox or Google Drive w/ a Ex-Meta Staff Engineer System Design Interview
58:08
Hello InterviewWatch
Beginner System Design Interview: Design Bitly w/ a Ex-Meta Staff Engineer
59:30
Hello InterviewWatch
Design Whatsapp: System Design Interview w/ a Ex-Meta Senior Manager
58:12
Hello InterviewWatch
System Design Interview Walkthrough: Design Twitter
23:04
Hello InterviewWatch
Design a Distributed Rate Limiter w/ a Ex-Meta Staff Engineer: System Design Breakdown
55:58
Hello InterviewWatch
Design an Ad Click Aggregator w/ a Ex-Meta Staff Engineer System Design Interview
1:02:22
Hello InterviewWatch
System Design Interview: Design YouTube
42:39
Hello InterviewWatch
Design a Web Crawler System Design Interview w/ a Ex-Meta Staff Engineer
1:05:04
Hello InterviewWatch
System Design Interview: Design LeetCode (Online Judge) w/ a Ex-Meta Staff Engineer
1:03:34
Hello InterviewWatch
System Design Interview: Design Tinder w/ a Ex-Meta Staff Engineer
1:13:22
Hello InterviewWatch
System Design Interview: Design Live Comments w/ a Ex-Meta Staff Engineer
56:15
Hello InterviewWatch
Design FB News Feed System Design Interview w/ ex: Meta Senior Manager
26:12
Hello InterviewWatch
Top-K System Design Interview Breakdown w/ Ex-Meta Senior Manager
1:31:38
Hello InterviewWatch
Design FB Post Search: System Design Interview breakdown w/ ex Meta Interviewer
1:08:27
Hello InterviewWatch
System Design Interview: Design an Ad Click Aggregator w/ a Ex-Meta Staff Engineer (old)
56:03
Hello InterviewWatch

Course Series

System DesignSystem Design Interview

6 sequential lectures • Channel course track

System Design Interview - Distributed Message Queue
15:00
System Design InterviewWatch
System Design Interview – Step By Step Guide
15:00
System Design InterviewWatch
System Design Interview - Top K Problem (Heavy Hitters)
15:00
System Design InterviewWatch
System Design Interview - Distributed Cache
15:00
System Design InterviewWatch
System Design Interview - Rate Limiting (local and distributed)
15:00
System Design InterviewWatch
System Design Interview - Notification Service
15:00
System Design InterviewWatch