Search results

121. Best Time to Buy and Sell Stock

arrayAn array is stored such that the position of each element can be computed from its index An array is stored such that the position of each element can be computed from its index

dynamic programmingoptimal substructure and overlapping sub-problem are two key attributes for dynamic programming. optimal substructure and overlapping sub-problem are two key attributes for dynamic programming.

EasyCoefficient of difficulty easy Coefficient of difficulty easy

Status: Merged (completed).

keep-practicing/leetcode-gonumber 21

#21 In keep-practicing/leetcode-go;

· by zwfang was closed on Dec 28, 2018

· Updated on Dec 28, 2018

53. Maximum Subarray

arrayAn array is stored such that the position of each element can be computed from its index An array is stored such that the position of each element can be computed from its index

dynamic programmingoptimal substructure and overlapping sub-problem are two key attributes for dynamic programming. optimal substructure and overlapping sub-problem are two key attributes for dynamic programming.

EasyCoefficient of difficulty easy Coefficient of difficulty easy

Status: Merged (completed).

keep-practicing/leetcode-gonumber 36

#36 In keep-practicing/leetcode-go;

· by zwfang was closed on Jan 2, 2019

· Updated on Jan 2, 2019

304. Range Sum Query 2D - Immutable

dynamic programmingoptimal substructure and overlapping sub-problem are two key attributes for dynamic programming. optimal substructure and overlapping sub-problem are two key attributes for dynamic programming.

MediumCoefficient of difficulty medium Coefficient of difficulty medium

Status: Merged (completed).

keep-practicing/leetcode-gonumber 77

#77 In keep-practicing/leetcode-go;

· by zwfang was closed on Feb 27, 2019

· Updated on Feb 27, 2019