Practice Find the Middle Index in Array
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Given a 0-indexed integer array nums, find the leftmost middleIndex (i.e., the smallest amongst all the possible ones). A middleIndex is an index where nums[0] + nums[1] + ... + nums[middleIndex-1] == nums[middleIndex+1] + nums[middleIndex+2] + ... + nums[nums.length-1]. If middleIndex == 0, the left side sum is considered to be 0. Similarly, if middleIndex == nums.length - 1, the right side sum is considered to be 0. Return the leftmost middleIndex that satisfies the condition, or -1 if there is no such index. Example 1: Example 2: Example 3: Constraints: Note: This question is the same as 724: https://leetcode.com/problems/find-pivot-index/
Source: Find the Middle Index in Array on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
nums = [2,3,-1,8,4]
3
# Example 2
nums = [1,-1,4]
2
# Example 3
nums = [2,5]
-1
Constraints
Related LeetCode Problems
Practice more problems similar to Find the Middle Index in Array.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.