ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

624 results

GeeksforGeeks
DSA In Java | DP 01 | Java in One Shot | DP ( Dynamic Programming ) in Java

90% Fee Refund Offer Active on all Online, LIVE & Offline Courses : https://geeksforgeeks.org/courses/ We cover DSA in Java ...

5:55:38
DSA In Java | DP 01 | Java in One Shot | DP ( Dynamic Programming ) in Java

269 views

57 minutes ago

Developer Coder
Number of Ways to Paint N × 3 Grid | LeetCode 1411 | Java Code | Developer Coder

... Java Java Algorithms Interview LeetCode Step By Step Dynamic Programming Grid Problems LeetCode Java Deep Dive Paint ...

32:28
Number of Ways to Paint N × 3 Grid | LeetCode 1411 | Java Code | Developer Coder

280 views

10 days ago

Mayank Modi
Number of Ways to Paint N×3 Grid | Solution Walkthrough | Dynamic Programming | Java | LeetCode 1411

In this video, we break down LeetCode 1411 – Number of Ways to Paint an N × 3 Grid from absolute basics. This explanation is ...

19:37
Number of Ways to Paint N×3 Grid | Solution Walkthrough | Dynamic Programming | Java | LeetCode 1411

84 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,116 views

10 days ago

Komal Vhanmane
Leetcode | 3573  Best Time to Buy and Sell Stock V  | Java |  Dynamic Programming | Recursion | Memo

3573 Best Time to Buy and Sell Stock V Using Java Dynamic Programming where to find leetcode daily challenge leetcode ...

29:48
Leetcode | 3573 Best Time to Buy and Sell Stock V | Java | Dynamic Programming | Recursion | Memo

138 views

3 weeks ago

Developer Coder
Maximum Profit from Trading Stocks with Discounts | LeetCode 3562 | Java Code | Developer Coder

... Interview Problem Java Tree Traversal DP Stock Trading With Hierarchy Dynamic Programming Mastery Problem Tree DP Core ...

1:25:05
Maximum Profit from Trading Stocks with Discounts | LeetCode 3562 | Java Code | Developer Coder

201 views

4 weeks 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

137 views

10 days ago

Developer Coder
Delete Columns to Make Sorted III | LeetCode 960 | Java Code | Developer Coder

Welcome to Developer Coder In this video, we dive into LeetCode Problem 960 – Delete Columns to Make Sorted III, ...

27:02
Delete Columns to Make Sorted III | LeetCode 960 | Java Code | Developer Coder

116 views

3 weeks ago

Developer Coder
Best Time to Buy and Sell Stock V | LeetCode 3573 | Memoization Search | Java Code | Developer Coder

Welcome to Developer Coder ‍ In this video, we deep dive into LeetCode 3573 – Best Time to Buy and Sell Stock V, ...

53:00
Best Time to Buy and Sell Stock V | LeetCode 3573 | Memoization Search | Java Code | Developer Coder

136 views

3 weeks ago

NullPointer
Count Pairs whose sum is less than target | Two Pointer Technique | Java

... #Recursion #DynamicProgramming coding, dsa, data structures and algorithms, competitive programming, problem solving, ...

9:47
Count Pairs whose sum is less than target | Two Pointer Technique | Java

10 views

6 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,196 views

10 days ago

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,700 views

10 days ago

ExpertFunda
LeetCode 3573 Explained | Best Time to Buy and Sell Stock V | DP with Long & Short Selling

Learn how to solve LeetCode 3573: Best Time to Buy and Sell Stock V using Dynamic Programming. This video explains long and ...

34:59
LeetCode 3573 Explained | Best Time to Buy and Sell Stock V | DP with Long & Short Selling

41 views

3 weeks ago

Parikh Jain
Stop Forgetting DSA! Try this NOW

In this video, I have talked about right way to learn DSA so that you will never forget. I have discussed why people are not ...

11:53
Stop Forgetting DSA! Try this NOW

8,055 views

4 weeks ago

Developer Coder
Max Dot Product of Two Subsequences | LeetCode 1458 | 2 approaches| DP | Java Code | Developer Coder

In this video on Developer Coder, we deep dive into LeetCode 1458 – Max Dot Product of Two Subsequences, focusing purely on ...

36:56
Max Dot Product of Two Subsequences | LeetCode 1458 | 2 approaches| DP | Java Code | Developer Coder

195 views

5 days ago

CodeLucky
Maximum Path Sum in a Grid - Dynamic Programming | Coding Interview Problem

Learn how to solve the Maximum Path Sum in a Grid problem using Dynamic Programming! In this video, we break down one ...

4:47
Maximum Path Sum in a Grid - Dynamic Programming | Coding Interview Problem

1 view

21 hours ago

Codelogix
DSA Problems in Java | Leetcode | DSA with Ashok

DSA Problems in Java | Leetcode | DSA with Ashok LeetCode DSA in Java Playlist This is a long-term, consistency-focused ...

2:58
DSA Problems in Java | Leetcode | DSA with Ashok

22 views

6 days ago

Komal Vhanmane
Leetcode | 3562  Maximum Profit from Trading Stocks With Discounts    | Java |  Dynamic Programming

3562 Maximum Profit from Trading Stocks With Discounts Using Java Dynamic Programming where to find leetcode daily ...

44:50
Leetcode | 3562 Maximum Profit from Trading Stocks With Discounts | Java | Dynamic Programming

235 views

4 weeks ago

CodeLucky
Cherry Pickup Algorithm - Hard Dynamic Programming Problem Explained

Master the Cherry Pickup problem (LeetCode 741) with this step-by-step visual guide! In this video, we break down one of the ...

4:37
Cherry Pickup Algorithm - Hard Dynamic Programming Problem Explained

0 views

20 hours ago

Developer Coder
Minimum ASCII Delete Sum for Two Strings | LeetCode 712 | Java Code | Developer Coder

... Java Coding DP LeetCode Preparation Java Dynamic Programming Concepts DP Problem Solving Java LeetCode Explained ...

41:16
Minimum ASCII Delete Sum for Two Strings | LeetCode 712 | Java Code | Developer Coder

142 views

3 days ago