Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Find last remaining element after reducing the Array

  • Difficulty Level : Easy
  • Last Updated : 19 May, 2021

Given an array arr[] of size N and an integer K. The task is to find the last remaining element in the array after reducing the array. The rules for reducing the array are: 
 

  • The first and last element say X and Y are chosen and removed from the array arr[].
  • The values X and Y are added. Z = X + Y.
  • Insert the value of Z % K into the array arr[] at the position ((N/2) + 1)th position, where N denotes the current length of the array.

Examples: 
 

Input: N = 5, arr[] = {1, 2, 3, 4, 5}, K = 7 
Output: 1 
Explanation: 
The given array arr[] reduces as follows: 
{1, 2, 3, 4, 5} -> {2, 6, 3, 4} 
{2, 6, 3, 4} -> {6, 6, 3} 
{6, 6, 3} -> {2, 6} 
{2, 6} -> {1} 
The last element of A is 1.
Input: N = 5, arr[] = {2, 4, 7, 11, 3}, K = 12 
Output: 3 
Explanation: 
The given array arr[] reduces as follows: 
{2, 4, 7, 11, 3} -> {4, 5, 7, 11} 
{4, 5, 7, 11} -> {5, 3, 7} 
{5, 3, 7} -> {0, 3} 
{0, 3} -> {3} 
The last element of A is 3. 
 

 

Naive approach: The naive approach for this problem is that at every step, find the first element and last element in the array and compute (X + Y) % K where X is the first element and Y is the last element of the array at every step. After computing this value, insert this value at the given position. 
Time Complexity: O(N2)
Efficient Approach: 
 

  • On observing carefully, it can be said that the sum of the elements of the array modulo K is never changed in the array throughout.
  • This is because we are basically inserting the value X + Y % K back into the array.
  • Therefore, this problem can be solved in linear time by directly finding the sum of the array and finding the value sum % K.

Below is the implementation of the above approach:
 

C++




// C++ program to find the value of the
// reduced Array by reducing the array
// based on the given conditions
 
#include <iostream>
using namespace std;
 
// Function to find the value of the
// reduced Array by reducing the array
// based on the given conditions
int find_value(int a[], int n, int k)
{
    // Variable to store the sum
    int sum = 0;
 
    // For loop to iterate through the
    // given array and find the sum
    for (int i = 0; i < n; i++) {
        sum += a[i];
    }
 
    // Return the required value
    return sum % k;
}
 
// Driver code
int main()
{
    int n = 5, k = 3;
    int a[] = { 12, 4, 13, 0, 5 };
    cout << find_value(a, n, k);
    return 0;
}
Java



// Java program to find the value of the
// reduced Array by reducing the array
// based on the given conditions
 
public class GFG {
 
    // Function to find the value of the
    // reduced Array by reducing the array
    // based on the given conditions
    public static int find_value(int a[], int n, int k)
    {
        // Variable to store the sum
        int sum = 0;
 
        // For loop to iterate through the
        // given array and find the sum
        for (int i = 0; i < n; i++) {
            sum += a[i];
        }
 
        // Return the required value
        return sum % k;
    }
 
    // Driver code
    public static void main(String[] args)
    {
        int n = 5, k = 3;
        int a[] = { 12, 4, 13, 0, 5 };
        System.out.println(find_value(a, n, k));
    }
}
Python3



# Python3 program to find the value of the
# reduced Array by reducing the array
# based on the given conditions
 
# Function to find the value of the
# reduced Array by reducing the array
# based on the given conditions
def find_value(a, n, k):
 
    # Variable to store the sum
    sum = 0
 
    # For loop to iterate through the
    # given array and find the sum
    for i in range(n):
        sum += a[i]
 
    # Return the required value
    return sum % k
 
# Driver code
if __name__ == "__main__":
    n, k = 5, 3;
    a = [12, 4, 13, 0, 5];
    print(find_value(a, n, k))
C#



// C# program to find the value of the
// reduced Array by reducing the array
// based on the given conditions
using System;
 
class GFG {
 
    // Function to find the value of the
    // reduced Array by reducing the array
    // based on the given conditions
    public static int find_value(int []a, int n, int k)
    {
        // Variable to store the sum
        int sum = 0;
 
        // For loop to iterate through the
        // given array and find the sum
        for (int i = 0; i < n; i++) {
            sum += a[i];
        }
 
        // Return the required value
        return sum % k;
    }
 
    // Driver code
    public static void Main(string[] args)
    {
        int n = 5, k = 3;
        int []a = { 12, 4, 13, 0, 5 };
        Console.WriteLine(find_value(a, n, k));
    }
}
 
// This code is contributed  by AnkitRai01
Javascript



<script>
 
 
// Js program to find the value of the
// reduced Array by reducing the array
// based on the given conditions
 
// Function to find the value of the
// reduced Array by reducing the array
// based on the given conditions
function find_value( a, n, k)
{
    // Variable to store the sum
    let sum = 0;
 
    // For loop to iterate through the
    // given array and find the sum
    for (let i = 0; i < n; i++) {
        sum += a[i];
    }
 
    // Return the required value
    return sum % k;
}
 
// Driver code
let n = 5, k = 3;
    let a = [ 12, 4, 13, 0, 5 ];
document.write(find_value(a, n, k));
 
 
</script>
Output: 
1
 
Time Complexity: O(N)
 

My Personal Notes
arrow_drop_up
Next

Find the last remaining element after repeated removal of odd and even indexed elements alternately
Recommended Articles
Page :
Remaining array element after repeated removal of last element and subtraction of each element from next adjacent element
23, Feb 21
Find maximum value of the last element after reducing the array with given operations
19, Jun 19
Find the last remaining element after repeated removal of an element from pairs of increasing adjacent array elements
01, Feb 21
Find the last positive element remaining after repeated subtractions of smallest positive element from all Array elements
10, Sep 21
Find the last remaining element after repeated removal of odd and even indexed elements alternately
27, Sep 20
Last element remaining after repeated removal of Array elements at perfect square indices
25, Aug 21
Last remaining element after repeated removal of odd indexed elements
03, Aug 21
Find last two remaining elements after removing median of any 3 consecutive elements repeatedly
09, Jan 20
Sum of Array maximums after K operations by reducing max element to its half
07, Jan 22
Find last remaining Array element by multiplying boundary elements based on given rules
26, Dec 21
Remaining array element after repeated removal of the smallest element from pairs with absolute difference of 2 or 0
09, Feb 21
Find all possible unique indices after reducing the array based on given conditions
10, Sep 21
Modify given array by reducing each element by its next smaller element
02, Dec 20
Count remaining array elements after reversing binary representation of each array element
16, Feb 21
Find last element after deleting every second element in array of n integers
30, Dec 17
Last element of an array after repeatedly removing the first element and appending it to the end of the array twice exactly K times
27, Jun 21
Last element remaining by deleting two largest elements and replacing by their absolute difference if they are unequal
16, Jun 20
Check if sum of array can be reduced to zero by repetitively reducing array element by their index value
06, Oct 20
Find the last element after repeatedly removing every second element from either end alternately
14, Apr 21
Maximize the value left after reducing the Arrays based on given conditions
05, Jan 22
Find the last remaining Character in the Binary String according to the given conditions
26, Feb 20
Rank of remaining numbers in Array by replacing first and last with max and min alternatively
11, Jan 22
Minimum operations for reducing Array to 0 by subtracting smaller element from a pair repeatedly
22, Oct 21
Largest Array minimum in N-1 operations by reducing each element by minimum
07, Jan 22
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
jrishabh99
@jrishabh99
Vote for difficulty
Current difficulty :
Easy





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!