Skip to content
Related Articles

Related Articles

Find closest greater value for every element in array
  • Difficulty Level : Medium
  • Last Updated : 23 Sep, 2019

Given an array of integers, find the closest greater element for every element. If there is no greater element then print -1

Examples:

Input : arr[] = {10, 5, 11, 6, 20, 12}
Output : 11 6 12 10 -1 20

Input : arr[] = {10, 5, 11, 10, 20, 12}
Output : 11 10 12 11 -1 20

A simple solution is to run two nested loops. We pick an outer element one by one. For every picked element, we traverse remaining array and find closest greater element. Time complexity of this solution is O(n*n)



A better solution is to use sorting. We sort all elements, then for every element, traverse toward right until we find a greater element (Note that there can be multiple occurrences of an element).

An efficient solution is to use Self Balancing BST (Implemented as set in C++ and TreeSet in Java). In a Self Balancing BST, we can do both insert and closest greater operations in O(Log n) time.

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ program to find closest greater value 
// for every array element
#include <bits/stdc++.h>
using namespace std;
  
void closetGreater(int arr[], int n)
{
    // Insert all array elements into a Set
    set<int> ts;
    for (int i = 0; i < n; i++)
        ts.insert(arr[i]);
  
    // Find smallest greater element for 
    // every array element
    for (int i = 0; i < n; i++)
    {
        auto greater = ts.upper_bound(arr[i]);
  
        if (greater == ts.end())
            cout << -1 << " ";
        else
            cout << *greater << " ";
    }
}
  
// Driver code
int main(int argc, char const *argv[])
{
    int arr[] = {10, 5, 11, 10, 20, 12};
    int n = sizeof(arr) / sizeof(arr[0]);
    closetGreater(arr, n);
    return 0;
}
  
// This code is contributed by
// sanjeev2552

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java program to find closest greater value for
// every array element
import java.util.*;
  
class TreeSetDemo {
    public static void closestGreater(int[] arr)
    {
        // Insert all array elements into a TreeSet
        TreeSet<Integer> ts = new TreeSet<Integer>();
        for (int i = 0; i < arr.length; i++)
            ts.add(arr[i]);
  
        // Find smallest greater element for every
        // array element
        for (int i = 0; i < arr.length; i++) {
            Integer greater = ts.higher(arr[i]);
            if (greater == null)
                System.out.print(-1 + " ");
            else
                System.out.print(greater + " ");
        }
    }
  
    public static void main(String[] args)
    {
        int[] arr = { 10, 5, 11, 10, 20, 12};
        closestGreater(arr);
    }
}

chevron_right


Output:

11 10 12 11 -1 20

Time Complexity : O(n Log n)

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.

My Personal Notes arrow_drop_up
Recommended Articles
Page :