Skip to content

DynamicProgramming

Directory actions

More options

Directory actions

More options

Latest commit

 

History

History

DynamicProgramming

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
practice
practice
 
 
README.md
README.md
 
 
climb_stairs.py
climb_stairs.py
 
 
coin_change.py
coin_change.py
 
 
coin_change_dp_greedy_hybrid.py
coin_change_dp_greedy_hybrid.py
 
 
edit_distance.py
edit_distance.py
 
 
edit_distance_optimized.py
edit_distance_optimized.py
 
 
fibonacci_number.py
fibonacci_number.py
 
 
hanoi.py
hanoi.py
 
 
house_robber.py
house_robber.py
 
 
house_robber_2.py
house_robber_2.py
 
 
house_robber_bottom_up.py
house_robber_bottom_up.py
 
 
kadane_max_stock_profit.py
kadane_max_stock_profit.py
 
 
kadane_max_subarray.py
kadane_max_subarray.py
 
 
knapsack.py
knapsack.py
 
 
longest_common_subsequence.py
longest_common_subsequence.py
 
 
pascal_triangle.py
pascal_triangle.py
 
 
pascal_triangle_II.py
pascal_triangle_II.py
 
 
pascals_triangle_III.md
pascals_triangle_III.md
 
 

README.md

Practice Orders

509. Fibonacci Number: f(n) = f(n-1) + f(n-2)
70. Climbing Stairs: climb(n) = climb(n-1) + climb(n-2)

118. Pascal's Triangle: p(r, c) = p(r-1, c-1) + p(r-1, c)
119. Pascal's Triangle II

##. Cutting Rod

##. 0/1 Knapsack Problem
1143. Longest Common Subsequence
72. Edit Distance:
 edit_distance(str1, str2) = edit_distance(str1[1:], str2[1:]) if str1[0] == str2[0] else min(I, U, D) +1
 I: edit_distance(str1, str2[1:])
 U: edit_distance(str1[1:], str2[1:])
 D: edit_distance(str1[1:], str2)

322. Coin Change (Medium)

../Graph

743. Network Delay Time