Minimum Falling Path Sum - Dynamic Programming - Two Solutions - Python

Minimum Falling Path Sum
Leetcode 931
Topics Covered: Dynamic Programming, Memoization, Top-Down, Bottom-Up
Leetcode Medium
Top 50 Amazon Interview Questions
Python

Buy Me a Coffee: www.buymeacoffee.com/cheatcodeninja

CHAPTERS
00:00 Problem Description
00:51 Example
01:33 Brute Force Intuition
04:48 Memoization Intuition
09:53 Dynamic Programming Intuition
11:20 Time & Space Complexity
11:49 Memoization Coding Solution
13:38 Dynamic Programming Coding Solution

Problem Link: leetcode.com/problems/minimum-falling-path-sum/

Patreon: www.patreon.com/cheatcodeninja
Discord: discord.gg/f6sTwcSr2z

Equipment I use to make these videos:
Mic: amzn.to/3kb97AK
Writing Pad: amzn.to/3IIYlfi

Leetcode Hard Playlist:    • Leetcode Hard  
HashMap Playlist:    • HashMap  
Graph Playlist:    • Graph  
Heap Playlist:    • Heap  
Stack Playlist:    • Stack  
Binary Tree Playlist:    • Binary Tree  
Dynamic Programming Playlist:    • Dynamic Programming  
LinkedList Playlist:    • Linked List  
Greedy Playlist:    • Greedy  

#leetcode
#faang
#programming
#binarysearch
#heap
#bfs
#stack
#hashmap
#dfs
#binarysearchtree
#prims
#codinginterviews
#codinginterviewquestions
#codinginterview
#codeforces
#placement