Skip to main content
Medium Prefix Sum Low frequency

Minimum Average Difference

Open on LeetCode

Approach Summary

Precompute total sum. For each split point i, left avg = prefixSum[i] / (i+1), right avg = (total - prefixSum[i]) / (n-i-1). Track minimum diff.

How to Recognize This Pattern

  • Compare left and right averages at each split
  • Prefix sum enables O(1) average computation per index

Complexity Analysis

Time Complexity

O(n)

Space Complexity

O(1)

Tags

Array Prefix Sum

This site is free. If these guides are helping your prep, consider buying me a coffee. ☕

Support →
Buy me a coffee