📚 dsaflash.cards
Problems
Log in
Sign up
Home
/
Dynamic Programming
/
Linear DP and Counting
Linear DP and Counting
Question 1 of 6
In Kadane's algorithm, what decision is made at each index i?
A
Whether the maximum subarray is to the left or right of index i
B
Whether to extend the subarray ending at i-1 by including arr[i], or start a new subarray beginning at arr[i]
C
Whether to include index i in the global maximum or skip it
D
Whether to use the element at i as the start or the end of the subarray
← Back to categories