ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

3,156 results

Nikhil Lohia
Trapping Rain Water (LeetCode 42) | Interview Essential | Full visual solution

Super helpful resources: https://nikoo28.github.io/all-my-links/ Actual Problem: ...

21:01
Trapping Rain Water (LeetCode 42) | Interview Essential | Full visual solution

1,550 views

9 days ago

Developer Coder
Minimize Maximum Pair Sum in Array | LeetCode 1877 | Sorting | Java Code | Developer Coder

Welcome back to Developer Coder In this video, we explore LeetCode 1877 – Minimize Maximum Pair Sum in Array, a popular ...

7:20
Minimize Maximum Pair Sum in Array | LeetCode 1877 | Sorting | Java Code | Developer Coder

198 views

12 days ago

Alpha-Code
Mock Meta DSA Interview With Senior Swe - Medium Difficulty - Lean No Hire

This is a mock with a senior practicing for Meta. This was right on the border for me between weak hire and weak no hire. 00:00:00 ...

53:55
Mock Meta DSA Interview With Senior Swe - Medium Difficulty - Lean No Hire

32,220 views

3 weeks ago

Developer Coder
Minimum Difference Between Highest and Lowest of K Scores | LeetCode 1984 | Java | Developer Coder

Welcome to Developer Coder ‍ In this video, we explore the LeetCode 1984 problem using an industry-relevant approach ...

7:44
Minimum Difference Between Highest and Lowest of K Scores | LeetCode 1984 | Java | Developer Coder

295 views

11 days ago

Developer Coder
Maximize Area of Square Hole in Grid | LeetCode 2943 | Sorting | Java Code | Developer Coder

Welcome to Developer Coder In this video, we dive into LeetCode 2943 – Maximize Area of Square Hole in Grid, a problem ...

22:18
Maximize Area of Square Hole in Grid | LeetCode 2943 | Sorting | Java Code | Developer Coder

209 views

3 weeks ago

Developer Coder
Smallest Subtree with all the Deepest Nodes | LeetCode 865 | DFS | Java Code | Developer Coder

Welcome to Developer Coder ‍ In this video, we explore LeetCode 865 – Smallest Subtree with all the Deepest Nodes, ...

13:07
Smallest Subtree with all the Deepest Nodes | LeetCode 865 | DFS | Java Code | Developer Coder

279 views

3 weeks ago

Developer Coder
Construct the Minimum Bitwise Array I | LeetCode 3314 | Java Code | Developer Coder

Welcome to Developer Coder In this video, we deep dive into LeetCode 3314 – Construct the Minimum Bitwise Array I, ...

24:40
Construct the Minimum Bitwise Array I | LeetCode 3314 | Java Code | Developer Coder

252 views

2 weeks ago

Developer Coder
Minimum Pair Removal to Sort Array II | LeetCode 3510 | Java Code | Developer Coder

Welcome to Developer Coder In this video, we deep-dive into LeetCode 3510 – Minimum Pair Removal to Sort Array II, ...

58:03
Minimum Pair Removal to Sort Array II | LeetCode 3510 | Java Code | Developer Coder

156 views

12 days ago

Developer Coder
Minimum Absolute Difference | LeetCode 1200 | Sorting | Java Code | Developer Coder

Welcome to Developer Coder ‍ In this video, we focus on the LeetCode 1200 – Minimum Absolute Difference problem ...

4:59
Minimum Absolute Difference | LeetCode 1200 | Sorting | Java Code | Developer Coder

169 views

10 days ago

Developer Coder
Separate Squares I | LeetCode 3453 | Binary Search On Answer | Java Code | Developer Code

In this video on Developer Coder, we dive into LeetCode 3453 – Separate Squares I, a mathematically rich and interview-oriented ...

25:01
Separate Squares I | LeetCode 3453 | Binary Search On Answer | Java Code | Developer Code

311 views

3 weeks ago

Developer Coder
Maximum Square Area by Removing Fences From a Field | LeetCode 2975 | Java Code | Developer Coder

In this video on Developer Coder, we explore the LeetCode 2975 – Maximum Square Area by Removing Fences From a Field ...

23:57
Maximum Square Area by Removing Fences From a Field | LeetCode 2975 | Java Code | Developer Coder

152 views

2 weeks ago

Developer Coder
Minimum Cost Path with Edge Reversals | LeetCode 3650 | Dijkstra | Java Code | Developer Coder

Welcome to Developer Coder ‍ ✨ In this video, we deep-dive into LeetCode 3650 – Minimum Cost Path with Edge Reversals, ...

31:34
Minimum Cost Path with Edge Reversals | LeetCode 3650 | Dijkstra | Java Code | Developer Coder

178 views

9 days ago

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

elcome to Developer Coder In this video, we deep-dive into LeetCode 712 – Minimum ASCII Delete Sum for Two Strings, ...

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

142 views

3 weeks ago

Developer Coder
Minimum Time Visiting All Points | LeetCode 1266 | Java Code | Developer Coder

Welcome to Developer Coder In this video, we focus on LeetCode 1266 – Minimum Time Visiting All Points, implemented using ...

15:34
Minimum Time Visiting All Points | LeetCode 1266 | Java Code | Developer Coder

487 views

3 weeks ago

Developer Coder
Largest Magic Square | LeetCode 1895 | Java Code | Developer Coder

Welcome to Developer Coder! In this video, we dive into LeetCode 1895 - Largest Magic Square using Java. This tutorial is ...

24:45
Largest Magic Square | LeetCode 1895 | Java Code | Developer Coder

163 views

2 weeks ago

Developer Coder
Minimum Cost Path with Teleportations | LeetCode 3651 | DP | Java Code | Developer Coder

Welcome to Developer Coder In this video, we deep-dive into LeetCode 3651 – Minimum Cost Path with Teleportations, ...

36:12
Minimum Cost Path with Teleportations | LeetCode 3651 | DP | Java Code | Developer Coder

450 views

8 days ago

Developer Coder
Maximum Product of Splitted Binary Tree | LeetCode 1339 | DFS | Java Code | Developer Coder

Welcome to Developer Coder In this video, we explore LeetCode 1339 – Maximum Product of Splitted Binary Tree using DFS ...

17:18
Maximum Product of Splitted Binary Tree | LeetCode 1339 | DFS | Java Code | Developer Coder

316 views

4 weeks ago

Developer Coder
Construct the Minimum Bitwise Array II | LeetCode 3315 | Bitwise | Java Code | Developer Coder

Welcome to Developer Coder In this video, we deep dive into LeetCode 3315 – Construct the Minimum Bitwise Array II, ...

6:12
Construct the Minimum Bitwise Array II | LeetCode 3315 | Bitwise | Java Code | Developer Coder

266 views

2 weeks ago

codestorywithMIK
Separate Squares I | Understand WHY behind everything | Intuition | Leetcode 3453 | codestorywithMIK

Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A Primality Check | Sieve of Eratosthenes ...

41:43
Separate Squares I | Understand WHY behind everything | Intuition | Leetcode 3453 | codestorywithMIK

13,736 views

3 weeks ago

codestorywithMIK
Trionic Array II | Simplest Approach | Detailed Intuition | Leetcode 3640 | codestorywithMIK

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

36:45
Trionic Array II | Simplest Approach | Detailed Intuition | Leetcode 3640 | codestorywithMIK

10,789 views

1 day ago

ExpertFunda
Leetcode 1292 Explained | Maximum Side Length Square with Prefix Sum & Binary Search

Today Leetcode Daily Practice:- Struggling with Leetcode 1292? This video explains Maximum Side Length of a Square with Sum ...

19:55
Leetcode 1292 Explained | Maximum Side Length Square with Prefix Sum & Binary Search

177 views

2 weeks ago

Smart Programming
3Sum Problem Explained | Brute Force → Optimized Solution | LeetCode 15 (Java)

In this video, we will solve the 3 Sum Problem (LeetCode 15) using Java with complete clarity. I have explained Brute Force, ...

32:20
3Sum Problem Explained | Brute Force → Optimized Solution | LeetCode 15 (Java)

744 views

2 weeks ago

Developer Coder
Minimum Cost to Convert String II | LeetCode 2977 | Trie | DP | Java Code | Developer Coder

Welcome to Developer Coder In this video, we deep-dive into LeetCode 2977 – Minimum Cost to Convert String II, a high-level ...

56:58
Minimum Cost to Convert String II | LeetCode 2977 | Trie | DP | Java Code | Developer Coder

69 views

5 days 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

202 views

3 weeks ago

codestorywithMIK
Trionic Array I | Simple Intuition | Dry Run | Leetcode 3637 | codestorywithMIK

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

11:07
Trionic Array I | Simple Intuition | Dry Run | Leetcode 3637 | codestorywithMIK

6,555 views

2 days ago