Given an array arr[] of N integers. The task is to find the sum of elements till the smallest index such that there are no even elements to the right of the index. Note that the array will have at least one even element.
Examples:
Input: arr[] = {2, 3, 5, 6, 3, 3}
Output: 16
2 + 3 + 5 + 6 = 16Input: arr[] = {3, 4}
Output: 7
3 + 4 = 7
Approach: Find the index of the rightmost even element from the array and return the sum of all the elements starting from index 0 till the found index.
Below is the implementation of the above approach:
C++
// C++ implementation of the approach #include <bits/stdc++.h> using namespace std; // Function to return the required sum int smallestIndexsum(int arr[], int n) { // Starting from the last index int i = n - 1; // Skip all odd elements and find the // index of the righmost even element while (i >= 0 && arr[i] % 2 == 1) i--; // To store the requried sum int sum = 0; for (int j = 0; j <= i; j++) sum += arr[j]; return sum; } // Driver code int main() { int arr[] = { 2, 3, 5, 6, 3, 3 }; int n = sizeof(arr) / sizeof(arr[0]); cout << smallestIndexsum(arr, n); return 0; } |
Java
// Java implementation of the approach class GFG { // Function to return the required sum static int smallestIndexsum(int arr[], int n) { // Starting from the last index int i = n - 1; // Skip all odd elements and find the // index of the righmost even element while (i >= 0 && arr[i] % 2 == 1) i--; // To store the requried sum int sum = 0; for (int j = 0; j <= i; j++) sum += arr[j]; return sum; } // Driver code public static void main(String[] args) { int arr[] = { 2, 3, 5, 6, 3, 3 }; int n = arr.length; System.out.println(smallestIndexsum(arr, n)); } } // This code is contributed by 29AjayKumar |
Python3
# Python3 implementation of the approach # Function to return the required sum def smallestIndexsum(arr, n): # Starting from the last index i = n - 1; # Skip all odd elements and find the # index of the righmost even element while (i >= 0 and arr[i] % 2 == 1): i -= 1; # To store the requried sum sum = 0; for j in range(0, i + 1): sum += arr[j]; return sum; # Driver code if __name__ == '__main__': arr = [ 2, 3, 5, 6, 3, 3 ]; n = len(arr); print(smallestIndexsum(arr, n)); # This code is contributed by PrinciRaj1992 |
C#
// C# implementation of the approach using System; class GFG { // Function to return the required sum static int smallestIndexsum(int []arr, int n) { // Starting from the last index int i = n - 1; // Skip all odd elements and find the // index of the righmost even element while (i >= 0 && arr[i] % 2 == 1) i--; // To store the requried sum int sum = 0; for (int j = 0; j <= i; j++) sum += arr[j]; return sum; } // Driver code static public void Main () { int []arr = { 2, 3, 5, 6, 3, 3 }; int n = arr.Length; Console.Write(smallestIndexsum(arr, n)); } } // This code is contributed by ajit. |
16
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
Recommended Posts:
- Queries for number of distinct elements from a given index till last index in an array
- Sort Array such that smallest is at 0th index and next smallest it at last index and so on
- Find index i such that prefix of S1 and suffix of S2 till i form a palindrome when concatenated
- Find the k smallest numbers after deleting given elements
- Rearrange array such that even index elements are smaller and odd index elements are greater
- Number of permutations such that sum of elements at odd index and even index are equal
- Check if every index i has an index j such that sum of elements in both directions are equal
- Smallest index such that there are no 0 or 1 to its right
- Minimum elements to change so that for an index i all elements on the left are -ve and all elements on the right are +ve
- Find the smallest and second smallest elements in an array
- Smallest index in the given array that satisfies the given condition
- Smallest index in given range of indices which is not equal to X
- Average of remaining elements after removing K largest and K smallest elements from array
- Index of the elements which are equal to the sum of all succeeding elements
- Count smaller elements on right side and greater elements on left side using Binary Index Tree
- Even numbers at even index and odd numbers at odd index
- Sum of the elements from index L to R in an array when arr[i] = i * (-1)^i
- Array Index with same count of even or odd numbers on both sides
- Count of index pairs with equal elements in an array
- Count of index pairs with equal elements in an array | Set 2
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
