ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

9 results

codestorywithMIK
Minimum Time to Complete Trips | Leetcode 2187 | Detailed | codestorywithMIK

Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A This Qn was recently asked by ...

27:07
Minimum Time to Complete Trips | Leetcode 2187 | Detailed | codestorywithMIK

12,994 views

2 years ago

codestorywithMIK
Minimum Difficulty of a Job Schedule | Recursion | Memoization | Amazon | Leetcode 1335

Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A This is the 1st Video of our Playlist ...

30:52
Minimum Difficulty of a Job Schedule | Recursion | Memoization | Amazon | Leetcode 1335

76,975 views

3 years ago

codestorywithMIK
Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Broken in Steps | Leetcode-1489

Prerequisite - (Kruskal's Algorithm) ...

49:10
Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Broken in Steps | Leetcode-1489

8,105 views

2 years ago

codestorywithMIK
Reconstruct Itinerary | Clean | Simple | Intuitive | GOOGLE | Leetcode-332 | Live Code

This is the 35th Video on our Graph Playlist. In this video we will try to solve a very good Graph Problem "Reconstruct ...

29:10
Reconstruct Itinerary | Clean | Simple | Intuitive | GOOGLE | Leetcode-332 | Live Code

11,735 views

2 years ago

MIT OpenCourseWare
Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths

MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: http://ocw.mit.edu/6-006F11 Instructor: Erik Demaine ...

51:47
Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths

2,881,103 views

12 years ago

Abdul Bari
4.9 Longest Common Subsequence (LCS)  - Recursion and Dynamic Programming

Longest Common Subsequence Problem using 1. Recursion 2. Memoization 3. Dynamic Programming PATREON ...

23:35
4.9 Longest Common Subsequence (LCS) - Recursion and Dynamic Programming

1,427,798 views

7 years ago

codestorywithMIK
Count Unreachable Pairs of Nodes in an Undirected Graph |  DSU | Leetcode 2316  | Graph Concepts- 23

Hi Everyone, this is the 23rd video of our Playlist "Graph Concepts & Qns". In video-18, and video-19, we understood a very ...

23:16
Count Unreachable Pairs of Nodes in an Undirected Graph | DSU | Leetcode 2316 | Graph Concepts- 23

14,654 views

2 years ago

DhuniTech
Design Snake and Ladder || Low Level Design || Machine Coding Round

Design Snake and Ladder || Low Level Design || Machine Coding Round.

24:10
Design Snake and Ladder || Low Level Design || Machine Coding Round

220 views

3 years ago

VLSI Physical Design
Detailed Routing (Part 2)

... ട്രാക്ക് സൊല്യൂഷൻ (minimum track solution) ഉണ്ടാക്കുമെന്ന് ഉറപ്പുനൽകുന്നു.

29:00
Detailed Routing (Part 2)

16,970 views

8 years ago