Techdose course watch online

play_arrow
71K
1K

9:08

Course Schedule | Deadlock detection | Graph coloring | Leetcode #207

Course Schedule | Deadlock detection | Graph coloring | Leetcode #207

Techdose

This video explains a very important programming interview problem which is, given a course schedule with prerequisites for each ...

play_arrow
2K
0

12:56

TechDose DSA course review | Surya Pratap Kahar |  DSA with Java tutorial crash course

TechDose DSA course review | Surya Pratap Kahar | DSA with Java tutorial crash course

Shailesh Kumar

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 ...

play_arrow
7K
273

3:11:08

Kafka System Design | Full Course | Design & Architecture

Kafka System Design | Full Course | Design & Architecture

Techdose AI & System Design

This video explains the design and architecture of Kafka with detailed analysis with proper real-life use cases.

play_arrow
96K
2K

12:52

Topological sort | Course schedule 2 | Leetcode #210

Topological sort | Course schedule 2 | Leetcode #210

Techdose

This video explains a very important programming interview concept which is based on graph algorithm and is known as ...

play_arrow
35K
810

17:45

Kahn's algorithm | Topological sort | Course schedule 2 | Leetcode #210

Kahn's algorithm | Topological sort | Course schedule 2 | Leetcode #210

Techdose

This video explains an important programming interview problem which is to find the topological sort of a given graph.In this video ...

play_arrow
4K
146

14:56

Find the Maximum Length of Valid Subsequence I | Leetcode 3201

Find the Maximum Length of Valid Subsequence I | Leetcode 3201

Techdose

This video explains Find the Maximum Length of Valid Subsequence I using the most optimal single parse counting approach.

play_arrow
2K
44

4:01

Special Array I | Leetcode 3151

Special Array I | Leetcode 3151

Techdose

This video explains Special Array I using the most optimal single parse approach.

play_arrow
799
18

3:37:44

Matrix Exponentiation | Number Theory LIVE

Matrix Exponentiation | Number Theory LIVE

Techdose

This video explains Matrix Exponentiation in depth using proof and formulation to code and examples like fibonacci and domino ...

play_arrow
2K
59

18:23

Find the Power of K Size Subarrays I | Leetcode 3254

Find the Power of K Size Subarrays I | Leetcode 3254

Techdose

This video explains Find the Power of K Size Subarrays I problem using the most optimal sliding window with ordering using ...

play_arrow
76K
1K

18:25

Top K Frequent Elements | Leetcode #347 | Heap | Hashmap

Top K Frequent Elements | Leetcode #347 | Heap | Hashmap

Techdose

This video explains a very important programming interview problem which is to find the top k frequent elements in a given array.

play_arrow
10K
473

1:44

Find algorithm to any problem

Find algorithm to any problem

Techdose

This video explains how to find the algorithm for any problem by just reading the problem statement. You can filter out the most ...

play_arrow
4K
96

25:04

All O`one Data Structure

All O`one Data Structure

Techdose

This video explains implementing all O one data structure using doubly linked list and unordered map. The APIs implemented are ...

play_arrow
7K
166

25:28

META offer | Techdose Alumni | SDE-2

META offer | Techdose Alumni | SDE-2

Techdose

This video is about sharing an interview experience and preparation strategy about Techdose Alumni who recently cleared META ...

play_arrow
44K
995

18:03

01 Knapsack using Memoization | Concept of Memoization

01 Knapsack using Memoization | Concept of Memoization

Techdose

In this video, I have explained the basic concepts of memoization using 01 knapsack as an example.I have already explained the ...

play_arrow
3K
96

10:27

Minimum Recolors to Get K Consecutive Black Blocks | Leetcode 2379

Minimum Recolors to Get K Consecutive Black Blocks | Leetcode 2379

Techdose

This video explains Minimum Recolors to Get K Consecutive Black Blocks using the most optimal sliding window approach.

play_arrow
11K
115

7:32

Selection sort algorithm

Selection sort algorithm

Techdose

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 ...

play_arrow
3K
59

7:30

Maximum Ascending Subarray Sum | Leetcode 1800

Maximum Ascending Subarray Sum | Leetcode 1800

Techdose

This video explains Maximum Ascending Subarray Sum using the most optimal single parse solution.

play_arrow
4K
78

17:14

My Calendar I | Leetcode 729

My Calendar I | Leetcode 729

Techdose

This video explains the My Calender 1 problem which is from leetcode 729. I have shared 3 approaches starting from bruteforce to ...

play_arrow
64K
1K

18:34

01 Knapsack Tabulation Dynamic Programming | How to build DP table

01 Knapsack Tabulation Dynamic Programming | How to build DP table

Techdose

This video explains the concept about how to approach a dynamic programming problem to solve using tabular DP.

play_arrow
2K
56

13:56

Max Difference You Can Get From Changing an Integer | Leetcode 1432

Max Difference You Can Get From Changing an Integer | Leetcode 1432

Techdose

This video explains Max Difference You Can Get From Changing an Integer using the most optimal greedy math approach.


More than 70 videos have been found for your query Techdose course you can watch them online on your computer, phone, tablet and other devices. We also recommend watching the online video Course Schedule | Deadlock detection | Graph coloring | Leetcode #207 which was uploaded by the user Techdose 01 January 1970 with a duration of 9 hours 08 minute second, which has 56 views and 2 thousand likes, for free in excellent quality.