Climbing Stairs - Dynamic Programming - Leetcode 70 - Python
🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews
🐦 Twitter: / neetcode1
🥷 Discord: / discord
🐮 Support the channel: / neetcode
Twitter: / neetcode1
Discord: / discord
⭐ BLIND-75 SPREADSHEET: https://docs.google.com/spreadsheets/...
💡 CODING SOLUTIONS: • Coding Interview Solutions
💡 DYNAMIC PROGRAMMING PLAYLIST: • House Robber - Leetcode 198 - Python...
🌲 TREE PLAYLIST: • Invert Binary Tree - Depth First Sear...
💡 GRAPH PLAYLIST: • Course Schedule - Graph Adjacency Lis...
💡 BACKTRACKING PLAYLIST: • Word Search - Backtracking - Leetcode...
💡 LINKED LIST PLAYLIST: • Reverse Linked List - Iterative AND R...
Problem Link: https://neetcode.io/problems/climbing...
0:00 - Read the problem
3:55 - Brute Force
8:00 - Memoization
11:05 - Dynamic Programming
16:49 - Coding DP
leetcode 70
This question was identified as an amazon interview question from here: https://github.com/xizhengszhang/Leet...
#dynamic #programming #python
Disclosure: Some of the links above may be affiliate links, from which I may earn a small commission.