-
Notifications
You must be signed in to change notification settings - Fork 46
Pull requests: keep-practicing/leetcode-go
Pull requests list
53. Maximum Subarray
array
An array is stored such that the position of each element can be computed from its index
dynamic programming
optimal substructure and overlapping sub-problem are two key attributes for dynamic programming.
Easy
Coefficient of difficulty easy
#36
by zwfang
was merged Jan 2, 2019
Loading...
304. Range Sum Query 2D - Immutable
dynamic programming
optimal substructure and overlapping sub-problem are two key attributes for dynamic programming.
Medium
Coefficient of difficulty medium
#77
by zwfang
was merged Feb 27, 2019
Loading...
121. Best Time to Buy and Sell Stock
array
An array is stored such that the position of each element can be computed from its index
dynamic programming
optimal substructure and overlapping sub-problem are two key attributes for dynamic programming.
Easy
Coefficient of difficulty easy
#21
by zwfang
was merged Dec 28, 2018
Loading...
ProTip!
no:milestone will show everything without a milestone.