Partion of string into four parts such that their sum is maximum possible.
general
ad-hoc
,
algorithm
,
dynamic-programming
aamir_911
September 19, 2018, 11:21am
#1
I have tried this question and haven’t been able to solve it. So I need a help or a hint maybe.
//