ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

1,153 results

Sanyam IIT Guwahati
Number of Ways to Paint N × 3 Grid | LeetCode 1411 | Dynamic Programming

Number of Ways to Paint N × 3 Grid | LeetCode 1411 | Dynamic Programming | Leetcode POTD Connect with me: ...

16:12
Number of Ways to Paint N × 3 Grid | LeetCode 1411 | Dynamic Programming

3,740 views

2 weeks ago

CodeLucky
Longest Palindromic Subsequence - Dynamic Programming (LeetCode/GeeksforGeeks)

Learn how to solve the Longest Palindromic Subsequence problem using Dynamic Programming! In this video, we break down ...

4:13
Longest Palindromic Subsequence - Dynamic Programming (LeetCode/GeeksforGeeks)

3 views

11 days ago

impoldev
Max Dot Product of Two Subsequences | LeetCode 1458 - Python

LinkedIn: https://www.linkedin.com/in/pabloolle/ Discord: https://discord.gg/d3AxpBe9eD This video is not affiliated with or ...

12:50
Max Dot Product of Two Subsequences | LeetCode 1458 - Python

175 views

12 days ago

Programming Live with Larry
Daily Leetcode #2104: Jan 03, 2026 - 1411. Number of Ways to Paint N × 3 Grid

Larry solves and analyzes this Leetcode problem as both an interviewer and an interviewee. This is a live recording of a real ...

15:39
Daily Leetcode #2104: Jan 03, 2026 - 1411. Number of Ways to Paint N × 3 Grid

1,207 views

2 weeks ago

CodeLucky
Minimum Path Sum in Grid - Dynamic Programming (LeetCode 64)

Learn how to solve the Minimum Path Sum problem using Dynamic Programming! In this video, we break down the classic grid ...

3:48
Minimum Path Sum in Grid - Dynamic Programming (LeetCode 64)

0 views

8 days ago

CodeLucky
Stone Game - Optimal Strategy & Dynamic Programming (LeetCode 877)

Learn how to solve the Stone Game problem using Game Theory and Dynamic Programming! In this video, we break down the ...

4:03
Stone Game - Optimal Strategy & Dynamic Programming (LeetCode 877)

5 views

8 days ago

CodeLucky
Minimum Cost to Merge Stones - Dynamic Programming (LeetCode 1000)

Learn how to solve the 'Minimum Cost to Merge Stones' problem using Interval Dynamic Programming! This video breaks ...

3:44
Minimum Cost to Merge Stones - Dynamic Programming (LeetCode 1000)

1 view

8 days ago

CodeLucky
House Robber II (Circular Array) - LeetCode Dynamic Programming Solution Explained

Learn how to solve the House Robber II problem (LeetCode Medium) with this clear, step-by-step visual explanation. This ...

4:01
House Robber II (Circular Array) - LeetCode Dynamic Programming Solution Explained

0 views

8 days ago

CodeLucky
Delete And Earn - LeetCode 740 - Dynamic Programming Pattern Explained

Learn how to solve the 'Delete And Earn' problem (LeetCode 740) using Dynamic Programming! In this video, we break down ...

3:57
Delete And Earn - LeetCode 740 - Dynamic Programming Pattern Explained

0 views

8 days ago

Walt Grace
Solving a Grid Dynamic Programming Question on Leetcode LIVE !
24:33
Solving a Grid Dynamic Programming Question on Leetcode LIVE !

19 views

Streamed 2 weeks ago

CodeLucky
Min Cost Climbing Stairs - Dynamic Programming (LeetCode 746) Explained

Learn how to solve the Min Cost Climbing Stairs problem (LeetCode 746) using Dynamic Programming! In this video, we break ...

3:45
Min Cost Climbing Stairs - Dynamic Programming (LeetCode 746) Explained

0 views

8 days ago

CodeLucky
Word Break Problem - Dynamic Programming LeetCode Solution Explained

Learn how to solve the classic Word Break problem using Dynamic Programming! In this video, we break down one of the most ...

4:19
Word Break Problem - Dynamic Programming LeetCode Solution Explained

0 views

11 days ago

codestorywithMIK
Construct the Minimum Bitwise Array I & II | Brute Force | Optimal | Leetcode 3314 & 3315 | MIK

Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A Hi Everyone, this is the 28th video ...

35:50
Construct the Minimum Bitwise Array I & II | Brute Force | Optimal | Leetcode 3314 & 3315 | MIK

8,203 views

1 day ago

CodeLucky
Climbing Stairs (LeetCode 70) - Dynamic Programming Explained

In this video, we break down the classic Climbing Stairs problem (LeetCode 70), a fundamental interview question for testing ...

4:24
Climbing Stairs (LeetCode 70) - Dynamic Programming Explained

5 views

8 days ago

Programming Live with Larry
Daily Leetcode #2112: Jan 11, 2026 - 85. Maximal Rectangle

Larry solves and analyzes this Leetcode problem as both an interviewer and an interviewee. This is a live recording of a real ...

21:08
Daily Leetcode #2112: Jan 11, 2026 - 85. Maximal Rectangle

578 views

10 days ago

codestorywithMIK
Number of Ways to Paint N × 3 Grid | Hard Made Easy | Simple Story To Code | Leetcode 1411 | MIK

Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A Hard Version of this problem - Leetcode ...

24:15
Number of Ways to Paint N × 3 Grid | Hard Made Easy | Simple Story To Code | Leetcode 1411 | MIK

12,430 views

2 weeks ago

CodeLucky
Word Break II - LeetCode Hard - Dynamic Programming & Backtracking Explanation

Learn how to solve the Word Break II coding problem efficiently! In this video, we tackle a popular 'Hard' level interview ...

3:28
Word Break II - LeetCode Hard - Dynamic Programming & Backtracking Explanation

2 views

11 days ago

JustCode
Dynamic Programming questions | GFG160 | LeetCode | Study With Me | #18

Hey everyone! I'm learning Data Structures & Algorithms by solving LeetCode problems live — starting from absolute basics ...

21:08
Dynamic Programming questions | GFG160 | LeetCode | Study With Me | #18

7 views

Streamed 2 weeks ago

Daily Dose Of LeetCode
DP on Strings | Minimum ASCII Delete Sum for Two Strings | LeetCode 712

In this video, we solve LeetCode 712. Minimum ASCII Delete Sum for Two Strings using a clean Dynamic Programming approach.

26:08
DP on Strings | Minimum ASCII Delete Sum for Two Strings | LeetCode 712

79 views

11 days ago

Daily Dose Of LeetCode
Why Only 2 Patterns Matter | Number of Ways to Paint N × 3 Grid | LeetCode 1411

In this video, we solve LeetCode 1411. Number of Ways to Paint N × 3 Grid using a clean intuitive Dynamic Programming ...

24:22
Why Only 2 Patterns Matter | Number of Ways to Paint N × 3 Grid | LeetCode 1411

138 views

2 weeks ago