Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Maximum in array which is at-least twice of other elements

  • Difficulty Level : Easy
  • Last Updated : 09 Apr, 2021

Given an array of integers of length n. Our task is to return the index of the max element if the it is at least twice as much as every other number in the array. If the max element does not satisfy the condition return -1.
Examples: 
 

Input : arr = {3, 6, 1, 0}
Output : 1
Here, 6 is the largest integer, and for 
every other number in the array x, 6 is 
more than twice as big as x. The index of
value 6 is 1, so we return 1.

Input : arr = {1, 2, 3, 4}
Output : -1
4 isn't at least as big as twice the value
of 3, so we return -1.

 

Approach : Scan through the array to find the unique largest element m, keeping track of it’s index maxIndex. Scan through the array again. If we find some x != m with m < 2*x, we should return -1. Otherwise, we should return maxIndex.
 

C++




// CPP program for Maximum of
// the array which is at least
// twice of other elements of
// the array.
#include<bits/stdc++.h>
using namespace std;
     
// Function to find the
// index of Max element
// that satisfies the
// condition
int findIndex(int arr[], int len) {
     
    // Finding index of
    // max of the array
    int maxIndex = 0;
    for (int i = 0; i < len; ++i)
        if (arr[i] > arr[maxIndex])
            maxIndex = i;
     
    // Returns -1 if the
    // max element is not
    // twice of the i-th
    // element.
    for (int i = 0; i < len; ++i)            
        if (maxIndex != i &&
            arr[maxIndex] < 2 * arr[i])
            return -1;
     
    return maxIndex;
}
     
// Driver function
int main(){
    int arr[] = {3, 6, 1, 0};
    int len = sizeof(arr) / sizeof(arr[0]);
     
    cout<<(findIndex(arr, len));
}
 
// This code is contributed by Smitha Dinesh Semwal
Java



// Java program for Maximum of the array
// which is at least twice of other elements
// of the array.
import java.util.*;
import java.lang.*;
 
class GfG {
     
    // Function to find the index of Max element
    // that satisfies the condition
    public static int findIndex(int[] arr) {       
         
        // Finding index of max of the array
        int maxIndex = 0;
        for (int i = 0; i < arr.length; ++i)
            if (arr[i] > arr[maxIndex])
                maxIndex = i;
         
        // Returns -1 if the max element is not
        // twice of the i-th element.       
        for (int i = 0; i < arr.length; ++i)            
            if (maxIndex != i && arr[maxIndex] < 2 * arr[i])
                return -1;
         
        return maxIndex;
    }
     
    // Driver function
    public static void main(String argc[]){
        int[] arr = new int[]{3, 6, 1, 0};
        System.out.println(findIndex(arr));
    }
}
Python3



# Python 3 program for Maximum of
# the array which is at least twice 
# of other elements of the array.
 
# Function to find the index of Max
# element that satisfies the condition
def findIndex(arr):
         
    # Finding index of max of the array
    maxIndex = 0
    for i in range(0,len(arr)):
        if (arr[i] > arr[maxIndex]):
            maxIndex = i
     
    # Returns -1 if the max element is not
    # twice of the i-th element.    
    for i in range(0,len(arr)):    
        if (maxIndex != i and
                arr[maxIndex] < (2 * arr[i])):
            return -1
         
    return maxIndex
     
     
# Driver code
arr = [3, 6, 1, 0]
print(findIndex(arr))
 
# This code is contributed by Smitha Dinesh Semwal
C#



// C# program for Maximum of the array
// which is at least twice of other elements
// of the array.
using System;
 
class GfG {
     
    // Function to find the index of Max element
    // that satisfies the condition
    public static int findIndex(int[] arr) {    
         
        // Finding index of max of the array
        int maxIndex = 0;
        for (int i = 0; i < arr.Length; ++i)
            if (arr[i] > arr[maxIndex])
                maxIndex = i;
         
        // Returns -1 if the max element is not
        // twice of the i-th element.
        for (int i = 0; i < arr.Length; ++i)        
            if (maxIndex != i && arr[maxIndex] < 2 * arr[i])
                return -1;
         
        return maxIndex;
    }
     
    // Driver function
    public static void Main()
    {
        int[] arr = new int[]{3, 6, 1, 0};
        Console.WriteLine(findIndex(arr));
    }
}
 
// This code is contributed by vt_m.
PHP



<?php
// PHP program for Maximum of
// the array which is at least
// twice of other elements of
// the array.
 
// Function to find the
// index of Max element
// that satisfies the
// condition
function findIndex($arr, $len)
{
     
    // Finding index of
    // max of the array
    $maxIndex = 0;
    for ( $i = 0; $i < $len; ++$i)
        if ($arr[$i] > $arr[$maxIndex])
            $maxIndex = $i;
     
    // Returns -1 if the
    // max element is not
    // twice of the i-th
    // element.
    for ($i = 0; $i < $len; ++$i)            
        if ($maxIndex != $i and
            $arr[$maxIndex] < 2 * $arr[$i])
            return -1;
     
    return $maxIndex;
}
     
// Driver Code
$arr = array(3, 6, 1, 0);
$len = count($arr);
 
echo findIndex($arr, $len);
 
// This code is contributed by anuj_67.
?>
Javascript



<script>
    // Javascript program for Maximum of
    // the array which is at least
    // twice of other elements of
    // the array.
     
    // Function to find the
    // index of Max element
    // that satisfies the
    // condition
    function findIndex(arr, len) {
 
        // Finding index of
        // max of the array
        let maxIndex = 0;
        for (let i = 0; i < len; ++i)
            if (arr[i] > arr[maxIndex])
                maxIndex = i;
 
        // Returns -1 if the
        // max element is not
        // twice of the i-th
        // element.
        for (let i = 0; i < len; ++i)            
            if (maxIndex != i &&
                arr[maxIndex] < 2 * arr[i])
                return -1;
 
        return maxIndex;
    }
     
    let arr = [3, 6, 1, 0];
    let len = arr.length;
       
    document.write(findIndex(arr, len));
     
    // This code is contributed by divyeshrabadiya07.
</script>
Output: 
 
1
Time Complexity: O(n)  
 

My Personal Notes
arrow_drop_up
Previous
Find k maximum elements of array in original order
Next

Consecutive steps to roof top
Recommended Articles
Page :
Find the element that appears once in an array where every other element appears twice
22, Mar 17
Maximum subsequence sum with adjacent elements having atleast K difference in index
07, Feb 20
Count of Array elements greater than or equal to twice the Median of K trailing Array elements
05, Aug 20
Maximum average of a subarray of size of atleast X and atmost Y
08, Mar 19
Sum of maximum of all subarrays by adding even frequent maximum twice
20, Dec 20
Number of ways to select equal sized subarrays from two arrays having atleast K equal pairs of elements
06, May 20
Count of elements to be inserted to make Array sum twice the XOR of Array
10, Jun 20
Generate an N-length array with sum equal to twice the sum of its absolute difference with same-indexed elements of given array
17, Jan 21
Maximum possible sum of a window in an array such that elements of same window in other array are unique
04, Aug 17
Find the last player to be able to remove a string from an array which is not already removed from other array
03, Feb 21
Find the number of points that have atleast 1 point above, below, left or right of it
06, Feb 19
Find the smallest subarray having atleast one duplicate
09, Jan 20
NFA to accept strings that has atleast one character occurring in a multiple of 3
05, Mar 20
Minimum window size containing atleast P primes in every window of given range
08, Apr 20
Count of numbers whose difference with Fibonacci count upto them is atleast K
09, Apr 20
Leftmost Column with atleast one 1 in a row-wise sorted binary matrix
07, May 20
Leftmost Column with atleast one 1 in a row-wise sorted binary matrix | Set 2
09, May 20
Count subarrays of atleast size 3 forming a Geometric Progression (GP)
16, Oct 20
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
Maximum cost path in an Undirected Graph such that no edge is visited twice in a row
03, Jul 20
Maximum profit by buying and selling a stock at most twice | Set 2
15, Jul 20
Find original array from encrypted array (An array of sums of other elements)
12, Apr 17
Count subarrays having exactly K elements occurring at least twice
03, Mar 21
Count of subarrays with largest element at least twice the largest of remaining elements
23, Jun 21
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
Sagar Shukla
@Sagar Shukla
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!