Can Anyone Please tell me the backtracking approach to find the largest sum contigous subarray?
I know the Kadane’s Algorithm Approach and the Divide and Conquer approach.
Please help me with a backtracking based solution.
1 Like
You can refer to the below link for more info:-
1 Like
@saurabhshadow I need to know the backtracking based approach.
I know the best way for this is kadane which will do this in O(n) but my college assignment wants a backtracking based approach.