Minimum Falling Path Sum II (LeetCode 1289)(DP HARD) (Optimal Solution)
Watch at 1.25x or 1.5x
Solution and Explaination of Leetcode POTD:
Question: https://leetcode.com/problems/minimum-falling-path-sum-ii/
Recursion+ Memoization
Solution1: https://leetcode.com/problems/minimum-falling-path-sum-ii/submissions/1242294615/
Bottom_Up (Iterative) (TC - O(N^3))
Solution2: https://leetcode.com/problems/minimum-falling-path-sum-ii/submissions/1242302048/
Optimal Solution (TC- O(N^2))
Solution3: https://leetcode.com/problems/minimum-falling-path-sum-ii/submissions/1242405727/
0:00 Understanding the question
03:50 Why DP ?
06:00 Intution
12:15 Top-down (Recursive approach)
16:20 Recursion
20:35 Memoization
23:05 Time and Space Complexity
26:01 Bottom-Up (Iterative)
27:40 Implementation
33:52 Time and Space Complexity
34:40 Optimal solution
43:00 Implementation
48:45 Success 🎉
50:00 Analyzing Time and Space complexity
51:00 Space Optimization discussion
#dp #recursion #dsa #leetcodehard #leetcode #array #dynamicprogramming #leetcodepotd #leetcode #MinimumFallingPathSumII #leetcodesolutions #LeetCode1289 @CodeWithARB
Видео Minimum Falling Path Sum II (LeetCode 1289)(DP HARD) (Optimal Solution) канала CodeWithARB
Solution and Explaination of Leetcode POTD:
Question: https://leetcode.com/problems/minimum-falling-path-sum-ii/
Recursion+ Memoization
Solution1: https://leetcode.com/problems/minimum-falling-path-sum-ii/submissions/1242294615/
Bottom_Up (Iterative) (TC - O(N^3))
Solution2: https://leetcode.com/problems/minimum-falling-path-sum-ii/submissions/1242302048/
Optimal Solution (TC- O(N^2))
Solution3: https://leetcode.com/problems/minimum-falling-path-sum-ii/submissions/1242405727/
0:00 Understanding the question
03:50 Why DP ?
06:00 Intution
12:15 Top-down (Recursive approach)
16:20 Recursion
20:35 Memoization
23:05 Time and Space Complexity
26:01 Bottom-Up (Iterative)
27:40 Implementation
33:52 Time and Space Complexity
34:40 Optimal solution
43:00 Implementation
48:45 Success 🎉
50:00 Analyzing Time and Space complexity
51:00 Space Optimization discussion
#dp #recursion #dsa #leetcodehard #leetcode #array #dynamicprogramming #leetcodepotd #leetcode #MinimumFallingPathSumII #leetcodesolutions #LeetCode1289 @CodeWithARB
Видео Minimum Falling Path Sum II (LeetCode 1289)(DP HARD) (Optimal Solution) канала CodeWithARB
Комментарии отсутствуют
Информация о видео
26 апреля 2024 г. 16:01:08
00:54:56
Другие видео канала
Most Profit Assigning Work (LeetCode 826) (2 Approaches) (Heap, Sorting, Two Pointer)
Number of Steps to Reduce a Number in Binary Representation to One (LeetCode 1404) (Bits)
Find the Winner of the Circular Game (LeetCode 1823) (3 Approaches) (Recursion, Maths)
Build a Matrix With Conditions (LeetCode 2392) (Hard) (Graph) (Kahn's Algorithm) (Topological Sort)
Evaluate Boolean Binary Tree (LeetCode 2331) (PreOrder Traversal)
Find the City With the Smallest Number of Neighbors at a Threshold Distance (LeetCode 1334) (Graph)
Student Attendance Record II (LeetCode 552) (Hard) (DP)
Lexicographically Minimum String After Removing Stars (LeetCode 3170) (Weekly Contest 400) (Heap)
Frustration is real 🥲 #coding #Contest #viralshorts #memes #dsa
Combination Sum II (LeetCode 40) (Recursion, Backtracking)
200 Days Completed. More to go 🔥🔥 #leetcode #leetcodesolution #dsa #consistency
XOR Queries of a Subarray (LeetCode 1310) (Bit Manipulation)
Sort Colors (LeetCode 75) (Intution Explained) (DNF) (3 Approaches)
Linked List in Binary Tree (LeetCode 1367) (DFS, Tree)
Spiral Matrix III (LeetCode 885) (Easily Explained)
Product of Array Except Self (LeetCode 238) (3 Approaches) (Optimal solution, O(1) Space, O(N) Time)
Get Equal Substrings Within Budget (LeetCode 1208) (Sliding Window)
Sum of Square Numbers (LeetCode 633) (Maths) (Two Pointer Approach)
Intersection of Two Arrays II (LeetCode 350) (HashMap, Two Pointer)
Consistency is the key 🔑 #consistency #consistencyiskey #leetcode #dsa #coding @CodeWithARB
Subarrays with K Different Integers (LeetCode 992) (Sliding Window) (Time-O(N))
