Assignment Content Given an array of integers Arr, calculate the pivot index of this array. The pivot index is the index where the sum of all the numbers strictly to the left of the index is equal to the sum of all the numbers strictly to the index's right. If the index is on the left edge of the array, then the left sum is 0 because there are no elements to the left. This also applies to the right edge of the array. Return the leftmost pivot index. If no such index exists, return -1.

EBK JAVA PROGRAMMING
9th Edition
ISBN:9781337671385
Author:FARRELL
Publisher:FARRELL
Chapter8: Arrays
Section: Chapter Questions
Problem 10RQ
icon
Related questions
Question
Assignment Content
Given an array of integers Arr, calculate the pivot
index of this array.
The pivot index is the index where the sum of all the
numbers strictly to the left of the index is equal to the
sum of all the numbers strictly to the index's right.
If the index is on the left edge of the array, then the
left sum is 0 because there are no elements to the left.
This also applies to the right edge of the array.
Return the leftmost pivot index. If no such index exists,
return -1.
Transcribed Image Text:Assignment Content Given an array of integers Arr, calculate the pivot index of this array. The pivot index is the index where the sum of all the numbers strictly to the left of the index is equal to the sum of all the numbers strictly to the index's right. If the index is on the left edge of the array, then the left sum is 0 because there are no elements to the left. This also applies to the right edge of the array. Return the leftmost pivot index. If no such index exists, return -1.
Example 1:
Input: Arr= [1,7,3,6,5,6]
Output: 3
Explanation:
The pivot index is 3.
Left sum = Arr [0] + Arr[1] + Arr [2] = 1
+ 7 + 3 = 11
Right sum= Arr [4] + Arr [5] = 5 + 6 =
11
Example 2:
Input: Arr [1,2,3]
Output: -1
Explanation:
There is no index that satisfies the
conditions in the problem statement.
Example 3:
Input: Arr [2,1,-1]
Output: 0
Explanation:
The pivot index is 0.
Left sum = 0 (no elements to the left
of index 0)
Right sum= Arr [1] + Arr [2] = 1 + 1 =
0
Save and Close
Submit
Transcribed Image Text:Example 1: Input: Arr= [1,7,3,6,5,6] Output: 3 Explanation: The pivot index is 3. Left sum = Arr [0] + Arr[1] + Arr [2] = 1 + 7 + 3 = 11 Right sum= Arr [4] + Arr [5] = 5 + 6 = 11 Example 2: Input: Arr [1,2,3] Output: -1 Explanation: There is no index that satisfies the conditions in the problem statement. Example 3: Input: Arr [2,1,-1] Output: 0 Explanation: The pivot index is 0. Left sum = 0 (no elements to the left of index 0) Right sum= Arr [1] + Arr [2] = 1 + 1 = 0 Save and Close Submit
Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Knowledge Booster
Quicksort
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
EBK JAVA PROGRAMMING
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
Programming Logic & Design Comprehensive
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
Microsoft Visual C#
Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,
Programming with Microsoft Visual Basic 2017
Programming with Microsoft Visual Basic 2017
Computer Science
ISBN:
9781337102124
Author:
Diane Zak
Publisher:
Cengage Learning