Find Maximum Subarray Divide and Conquer in DSA C# - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is the main idea behind the Divide and Conquer approach for finding the maximum subarray?

The array is split into two halves, then the maximum subarray is found in the left half, right half, and the subarray crossing the middle. The overall maximum is the largest of these three.

intermediate

In the Divide and Conquer method, how do we find the maximum subarray crossing the middle point?

We find the maximum sum starting from the middle and expanding to the left, and the maximum sum starting from the middle+1 and expanding to the right, then add these two sums.

intermediate

What is the time complexity of the Divide and Conquer algorithm for maximum subarray?

The time complexity is O(n log n) because the array is divided into halves recursively and the crossing sum is found in linear time at each level.

beginner

Why can't we just use the maximum of left and right halves to find the maximum subarray?

Because the maximum subarray might cross the middle point, so we must also consider subarrays that span both halves.

beginner

What are the three parts considered in the Divide and Conquer maximum subarray algorithm?

1. Maximum subarray in the left half, 2. Maximum subarray in the right half, 3. Maximum subarray crossing the middle point.

What does the Divide and Conquer algorithm do first when finding the maximum subarray?

A Splits the array into two halves

B Finds the maximum element in the array

C Sorts the array

D Calculates the sum of all elements

The algorithm splits the array into two halves to solve smaller problems recursively.

How is the maximum crossing subarray sum found?

A By summing all elements in the array

B By comparing only the first and last elements

C By sorting the array and picking the largest elements

D By finding max sum from middle to left and middle+1 to right and adding them

The crossing subarray sum is the sum of the max left part ending at middle and max right part starting at middle+1.

What is the overall time complexity of the Divide and Conquer maximum subarray algorithm?

A O(n log n)

B O(n^2)

C O(n)

D O(log n)

The algorithm divides the array recursively (log n levels) and does linear work at each level, resulting in O(n log n).

Which of these is NOT a part of the Divide and Conquer maximum subarray approach?

A Maximum subarray in right half

B Sorting the array

C Maximum subarray crossing the middle

D Maximum subarray in left half

Sorting is not involved in the maximum subarray divide and conquer algorithm.

Why do we need to consider the crossing subarray in the Divide and Conquer method?

A Because the maximum element is always in the middle

B Because the array might be unsorted

C Because the maximum subarray might be split across the middle

D Because the array size is always even

The maximum subarray can cross the middle point, so we must check the crossing subarray.

Explain the steps of the Divide and Conquer algorithm to find the maximum subarray.

Think about splitting, solving smaller problems, and combining results.

Describe how to find the maximum subarray crossing the middle point in the Divide and Conquer approach.

Focus on sums expanding from the middle to both sides.

Practice

1. What is the main idea behind the Divide and Conquer approach to find the maximum subarray sum?

easy

A. Calculate sum of all subarrays and pick the maximum

B. Sort the array and pick the largest element as max subarray sum

C. Use a sliding window to find the max sum subarray in one pass

D. Split the array into two halves, find max subarray in left, right, and crossing middle, then combine results

Solution

1. Step 1: Understand divide and conquer strategy

   The array is split into two halves recursively to simplify the problem.

2. Step 2: Combine results from subproblems

   Find max subarray in left half, right half, and crossing the middle, then take the maximum of these three.

3. Final Answer:

   Split array, find max left, right, crossing, then combine -> Option D

4. Quick Check:

   Divide and conquer = split and combine max subarrays [OK]

Hint: Divide array, conquer halves, combine max sums [OK]

Common Mistakes:

• Thinking sorting helps find max subarray sum
• Using brute force sum of all subarrays
• Confusing divide and conquer with sliding window

2. Which of the following is the correct base case condition in the divide and conquer method for maximum subarray?

easy

A. If the array length is 0, return 0

B. If the array length is 1, return the single element

C. If the array length is 2, return the sum of both elements

D. If the array length is 1, return 0

Solution

1. Step 1: Identify base case for recursion

   When the array has only one element, that element itself is the max subarray sum.

2. Step 2: Return the single element value

   Return the value of that single element as the maximum sum.

3. Final Answer:

   Return single element when array length is 1 -> Option B

4. Quick Check:

   Base case = single element value [OK]

Hint: Base case: single element returns itself [OK]

Common Mistakes:

• Returning 0 for single element array
• Returning sum of two elements as base case
• Not defining a base case causing infinite recursion

3. What will be the output of the following C# code snippet using divide and conquer to find max subarray sum?

int[] arr = { -2, 1, -3, 4, -1, 2, 1, -5, 4 };
int maxSum = FindMaxSubarray(arr, 0, arr.Length - 1);
Console.WriteLine(maxSum);

int FindMaxSubarray(int[] a, int left, int right) {
    if (left == right) return a[left];
    int mid = (left + right) / 2;
    int leftMax = FindMaxSubarray(a, left, mid);
    int rightMax = FindMaxSubarray(a, mid + 1, right);
    int crossMax = FindMaxCrossingSubarray(a, left, mid, right);
    return Math.Max(Math.Max(leftMax, rightMax), crossMax);
}

int FindMaxCrossingSubarray(int[] a, int left, int mid, int right) {
    int leftSum = int.MinValue, sum = 0;
    for (int i = mid; i >= left; i--) {
        sum += a[i];
        if (sum > leftSum) leftSum = sum;
    }
    int rightSum = int.MinValue;
    sum = 0;
    for (int j = mid + 1; j <= right; j++) {
        sum += a[j];
        if (sum > rightSum) rightSum = sum;
    }
    return leftSum + rightSum;
}

medium

A. 6

B. 7

C. 5

D. 4

Solution

1. Step 1: Identify the maximum subarray sum

   The array is [-2, 1, -3, 4, -1, 2, 1, -5, 4]. The subarray [4, -1, 2, 1] (indices 3-6) sums to 6, which is the maximum.

2. Step 2: Trace the code execution

   Split at mid=4: leftMax (0-4) = 4, rightMax (5-8) = 4, crossMax = 6 ([3-6]). Returns Math.Max(4, 4, 6) = 6.

3. Final Answer:

   6 -> Option A

4. Quick Check:

   max(leftMax=4, rightMax=4, crossMax=6) = 6 [OK]

Hint: Trace subarray sums carefully to find max [OK]

Common Mistakes:

• Miscomputing crossing sum
• Confusing max subarray with max element
• Ignoring negative numbers impact

4. Identify the bug in this divide and conquer max subarray code snippet:

int FindMaxCrossingSubarray(int[] a, int left, int mid, int right) {
    int leftSum = 0, sum = 0;
    for (int i = mid; i >= left; i--) {
        sum += a[i];
        if (sum > leftSum) leftSum = sum;
    }
    int rightSum = 0;
    sum = 0;
    for (int j = mid + 1; j <= right; j++) {
        sum += a[j];
        if (sum > rightSum) rightSum = sum;
    }
    return leftSum + rightSum;
}

medium

A. leftSum and rightSum should be initialized to int.MinValue, not 0

B. The loops should run from left to mid and mid+1 to right respectively

C. sum variable should not be reset between loops

D. The function should return max of leftSum and rightSum, not their sum

Solution

1. Step 1: Check initialization of leftSum and rightSum

   They are initialized to 0, which fails if all numbers are negative because max sum could be less than 0.

2. Step 2: Correct initialization to int.MinValue

   Initialize leftSum and rightSum to int.MinValue to correctly track max sums even if negative.

3. Final Answer:

   Initialize leftSum and rightSum to int.MinValue -> Option A

4. Quick Check:

   Init max sums to int.MinValue to handle negatives [OK]

Hint: Init max sums to int.MinValue to handle negatives [OK]

Common Mistakes:

• Initializing max sums to 0 causing wrong results
• Resetting sum incorrectly between loops
• Returning sum instead of max in crossing function

5. Given an array int[] arr = { -1, -2, -3, -4 }, what will the divide and conquer algorithm return as the maximum subarray sum?

hard

A. -4

B. 0

C. -1

D. -10

Solution

1. Step 1: Analyze array with all negative numbers

   All elements are negative, so max subarray is the single largest element.

2. Step 2: Identify largest element

   The largest element is -1, which is the max subarray sum.

3. Final Answer:

   -1 -> Option C

4. Quick Check:

   Max subarray in negatives = max element [OK]

Hint: Max subarray in all negatives is max element [OK]

Common Mistakes:

• Returning 0 instead of max negative element
• Summing all negatives incorrectly
• Assuming empty subarray sum is allowed