How it is dynamic programming as their is no optimal substructure and overlapping subproblem

#1

it is simply an implementation of kadanes algo

#2

the brute force approach involves solving for each subarray and if you consider each subarray offcourse there are overlapping substructure and kadane’s algo follows dynamic programming paradigm.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.