ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

24 results

Brute To Best
LeetCode #322: Coin Change, Bottom-Up Dynamic Programming

Problem #322 of the Brute To Best series: Coin Change. You're given an array of coin denominations and a target amount. Return ...

13:28
LeetCode #322: Coin Change, Bottom-Up Dynamic Programming

1 view

8h ago

Brute To Best
LeetCode #313: Super Ugly Number, K Pointers Dynamic Programming

Problem #313 of the Brute To Best series: Super Ugly Number. A super ugly number is a positive integer whose prime factors all ...

13:28
LeetCode #313: Super Ugly Number, K Pointers Dynamic Programming

0 views

12h ago

Brute To Best
LeetCode #312: Burst Balloons, Interval DP by Choosing the Last Balloon

Problem #312 of the Brute To Best series: Burst Balloons. You're given n balloons in a row, each painted with a number in nums.

18:02
LeetCode #312: Burst Balloons, Interval DP by Choosing the Last Balloon

4 views

12h ago

Brute To Best
LeetCode #309: Stock With Cooldown, the Hold, Sold, Rest State Machine

Problem #309 of the Brute To Best series: Best Time to Buy and Sell Stock with Cooldown. You're given an array prices, where ...

13:02
LeetCode #309: Stock With Cooldown, the Hold, Sold, Rest State Machine

1 view

15h ago

AlgorithmicIQ
Leetcode 2800  Shortest String That Contains Three Strings

Java Interview Preparation / Coding Questions and Answers / Interview Questions #coding #softwareengineer #Leetcode ...

16:03
Leetcode 2800 Shortest String That Contains Three Strings

2 views

7h ago

ARKAPRAVA CHAKRABORTY
Counting Bits | Dynamic Programming + Bit Manipulation | LeetCode | DSA Day 86

Welcome to Day 86 of my DSA Journey! Today, I'm solving Counting Bits — an interesting problem that combines Dynamic ...

27:55
Counting Bits | Dynamic Programming + Bit Manipulation | LeetCode | DSA Day 86

1 view

16h ago

StackedAkash
Best Time to Buy and Sell Stock with Cooldown | LeetCode 309 | Recursion & Memoization | Java | 4K

Master LeetCode 309: Best Time to Buy and Sell Stock with Cooldown using a Top-Down Dynamic Programming (Recursion + ...

27:40
Best Time to Buy and Sell Stock with Cooldown | LeetCode 309 | Recursion & Memoization | Java | 4K

0 views

9h ago

BomsamdiDev
Maximum Subarray — LeetCode 53 in Swift

One of the few problems where the optimal answer is shorter than the naive one. Trying every subarray is quadratic. Kadane's ...

2:27
Maximum Subarray — LeetCode 53 in Swift

0 views

10h ago

Kumar K [Amazon]
Google shocks🤯 innocent candidate in PhoneScreen DSA Interview with HARD DP Question!!(65LPA SWE)

Google PhoneScreen DSA Interview (₹65 Lakhs CTC) – Hard Grid DP Solved By FAANG SDE (Kumar K) Code + Doc Link ...

21:56
Google shocks🤯 innocent candidate in PhoneScreen DSA Interview with HARD DP Question!!(65LPA SWE)

1,615 views

10h ago

Coding practice
Maximum Height Disc Stack | DP + Fenwick Tree | 3 Approaches (Brute → O(N²) → O(N log N))

Learn the Maximum Height Disc Stack problem from GeeksforGeeks (GFG) / LeetCode in this detailed DSA tutorial. Fenwick Tree: ...

34:36
Maximum Height Disc Stack | DP + Fenwick Tree | 3 Approaches (Brute → O(N²) → O(N log N))

186 views

23h ago

BomsamdiDev
Maximum Subarray — LeetCode 53 in Kotlin

One of the few problems where the optimal answer is shorter than the naive one. Trying every subarray is quadratic. Kadane's ...

3:02
Maximum Subarray — LeetCode 53 in Kotlin

2 views

21h ago

Brute To Best
LeetCode #329: Longest Increasing Path in a Matrix, DFS With Memoization

Problem #329 of the Brute To Best series: Longest Increasing Path in a Matrix. Given an m × n integer matrix, return the length of ...

15:26
LeetCode #329: Longest Increasing Path in a Matrix, DFS With Memoization

1 view

4h ago

Shivam Gupta
Maximum Height Disc Stack | GFG POTD

Welcome to the explanation of GFG POTD ( problem of the day)! In this video, we have discussed the strategies, ideas, and ...

44:33
Maximum Height Disc Stack | GFG POTD

345 views

18h ago

Mymagicpencil- AI Teacher
The Trick That Kills Nested Loops | Sliding Window | #DSA #5

Turn a slow O(n^2) brute force into a clean O(n) solution. The sliding window is one of the most loved interview techniques - and ...

1:23
The Trick That Kills Nested Loops | Sliding Window | #DSA #5

3 views

13h ago

Mymagicpencil- AI Teacher
When Being Greedy Is Actually Optimal | Greedy Algorithms | DSA #8

Sometimes grabbing the best option right now gives the perfect answer - and sometimes it fails badly. Lesson 8 of Advanced DSA ...

1:58
When Being Greedy Is Actually Optimal | Greedy Algorithms | DSA #8

4 views

13h ago

Harsh Kumar Singh
CF 815C | Karen and Supermarket | Subtree-Bounded Vector Merging + 2-Universe Tree Knapsack DP

How does Subtree-Bounded Vector Merging shatter the O(N³) TLE Trap in Tree Knapsack DP? In this video, we break down the ...

50:44
CF 815C | Karen and Supermarket | Subtree-Bounded Vector Merging + 2-Universe Tree Knapsack DP

7 views

6h ago

Code With Abhishek
DSA LIVE 🔥 | Solving LeetCode Problems in C++ | Trees, DP, Graphs & Greedy | Placement Prep 🚀

Welcome to my LIVE DSA Problem-Solving Session! Join me as I solve LeetCode problems in C++ and strengthen my Data ...

2:13:18
DSA LIVE 🔥 | Solving LeetCode Problems in C++ | Trees, DP, Graphs & Greedy | Placement Prep 🚀

52 views

Streamed 12h ago

Data Strcutures and Algorithms
02. Types of Arrays in Java 1D & 2D Arrays Explained #Java #JavaProgramming #coding #array #leetcode
6:10
02. Types of Arrays in Java 1D & 2D Arrays Explained #Java #JavaProgramming #coding #array #leetcode

0 views

0

Data Strcutures and Algorithms
16. Subset Sum Problem Recursive Solution
10:53
16. Subset Sum Problem Recursive Solution

0 views

0

Data Strcutures and Algorithms
17. How to Print All Permutations in Java | Recursion Explained #trailingzero #recursion #javadsa
11:10
17. How to Print All Permutations in Java | Recursion Explained #trailingzero #recursion #javadsa

0 views

0