9:08
Course Schedule | Deadlock detection | Graph coloring | Leetcode #207
This video explains a very important programming interview problem which is, given a course schedule with prerequisites for each ...
12:56
TechDose DSA course review | Surya Pratap Kahar | DSA with Java tutorial crash course
Hey Folks, In this video I tried to share my experience of joining the DSA course by Tech Dose and why I have to left it in between ...
3:11:08
Kafka System Design | Full Course | Design & Architecture
This video explains the design and architecture of Kafka with detailed analysis with proper real-life use cases.
12:52
Topological sort | Course schedule 2 | Leetcode #210
This video explains a very important programming interview concept which is based on graph algorithm and is known as ...
17:45
Kahn's algorithm | Topological sort | Course schedule 2 | Leetcode #210
This video explains an important programming interview problem which is to find the topological sort of a given graph.In this video ...
14:56
Find the Maximum Length of Valid Subsequence I | Leetcode 3201
This video explains Find the Maximum Length of Valid Subsequence I using the most optimal single parse counting approach.
4:01
Special Array I | Leetcode 3151
This video explains Special Array I using the most optimal single parse approach.
3:37:44
Matrix Exponentiation | Number Theory LIVE
This video explains Matrix Exponentiation in depth using proof and formulation to code and examples like fibonacci and domino ...
18:23
Find the Power of K Size Subarrays I | Leetcode 3254
This video explains Find the Power of K Size Subarrays I problem using the most optimal sliding window with ordering using ...
18:25
Top K Frequent Elements | Leetcode #347 | Heap | Hashmap
This video explains a very important programming interview problem which is to find the top k frequent elements in a given array.
1:44
This video explains how to find the algorithm for any problem by just reading the problem statement. You can filter out the most ...
25:04
This video explains implementing all O one data structure using doubly linked list and unordered map. The APIs implemented are ...
25:28
META offer | Techdose Alumni | SDE-2
This video is about sharing an interview experience and preparation strategy about Techdose Alumni who recently cleared META ...
18:03
01 Knapsack using Memoization | Concept of Memoization
In this video, I have explained the basic concepts of memoization using 01 knapsack as an example.I have already explained the ...
10:27
Minimum Recolors to Get K Consecutive Black Blocks | Leetcode 2379
This video explains Minimum Recolors to Get K Consecutive Black Blocks using the most optimal sliding window approach.
7:32
This video explains the selection sort algorithm which is used to get elements of an array sorted. This is one of the most basic and ...
7:30
Maximum Ascending Subarray Sum | Leetcode 1800
This video explains Maximum Ascending Subarray Sum using the most optimal single parse solution.
17:14
This video explains the My Calender 1 problem which is from leetcode 729. I have shared 3 approaches starting from bruteforce to ...
18:34
01 Knapsack Tabulation Dynamic Programming | How to build DP table
This video explains the concept about how to approach a dynamic programming problem to solve using tabular DP.
13:56
Max Difference You Can Get From Changing an Integer | Leetcode 1432
This video explains Max Difference You Can Get From Changing an Integer using the most optimal greedy math approach.