Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Largest value of K such that both K and -K exist in Array in given index range [L, R]

  • Last Updated : 30 Nov, 2021

Given an array, arr[] of N integers and 2 integers L and R, the task is to return the largest integer K greater than 0 and L<=K<=R, such that both values K and -K exist in array arr[]. If there is no such integer, then return 0. 

Examples:

Input: N = 5, arr[] = {3, 2, -2, 5, -3},  L = 2, R = 3
Output: 3
Explanation: The largest value of K in the range [2, 3] such that both K and -K exist in the array is 3 as 3 is present at arr[0] and -3 is present at arr[4].

Input: N = 4, arr[] = {1, 2, 3, -4},  L = 1, R = 4
Output: 0

 

Approach: The idea is to traverse the array and add the element into the Set and simultaneously check for the negative of it i.e, arr[i]*-1 into the Set. If it is found then push it into the vector possible[]. Follow the steps below to solve the problem:

  • Initialize an unordered_set<int> s[] to store the elements.
  • Initialize a vector possible[] to store the possible answers.
  • Iterate over the range [0, N) using the variable i and perform the following steps:
  • Initialize a variable ans as 0 to store the answer.
  • Iterate over the range [0, size) where size is the size of the vector possible[], using the variable i and perform the following steps:
    • If possible[i] is greater than equal to L and less than equal to R, then update the value of ans as the max of ans or possible[i].
  • After performing the above steps, print the value of ans as the answer.

Below is the implementation of the above approach.

C++14




// C++ program for the above approach
#include <bits/stdc++.h>
using namespace std;
 
// Function to find the maximum value of K
int findMax(int N, int arr[], int L, int R)
{
 
    // Using a set to store the elements
    unordered_set<int> s;
 
    // Vector to store the possible answers
    vector<int> possible;
 
    // Store the answer
    int ans = 0;
 
    // Traverse the array
    for (int i = 0; i < N; i++) {
 
        // If set has it's negation,
        // check if it is max
        if (s.find(arr[i] * -1) != s.end())
            possible.push_back(abs(arr[i]));
        else
            s.insert(arr[i]);
    }
 
    // Find the maximum possible answer
    for (int i = 0; i < possible.size(); i++) {
        if (possible[i] >= L and possible[i] <= R)
            ans = max(ans, possible[i]);
    }
 
    return ans;
}
 
// Driver Code
int main()
{
 
    int arr[] = { 3, 2, -2, 5, -3 },
        N = 5, L = 2, R = 3;
 
    int max = findMax(N, arr, L, R);
 
    // Display the output
    cout << max << endl;
 
    return 0;
}
Java



// Java program for the above approach
import java.util.*;
 
public class GFG
{
   
// Function to find the maximum value of K
static int findMax(int N, int []arr, int L, int R)
{
 
    // Using a set to store the elements
    HashSet<Integer> s = new HashSet<Integer>();
   
    // ArrayList to store the possible answers
    ArrayList<Integer> possible
            = new ArrayList<Integer>();
 
    // Store the answer
    int ans = 0;
 
    // Traverse the array
    for (int i = 0; i < N; i++) {
 
        // If set has it's negation,
        // check if it is max
        if (s.contains(arr[i] * -1))
            possible.add(Math.abs(arr[i]));
        else
            s.add(arr[i]);
    }
 
    // Find the maximum possible answer
    for (int i = 0; i < possible.size(); i++) {
        if (possible.get(i) >= L && possible.get(i) <= R) {
            ans = Math.max(ans, possible.get(i));
        }
    }
 
    return ans;
}
 
// Driver Code
public static void main(String args[])
{
 
    int []arr = { 3, 2, -2, 5, -3 };
    int N = 5, L = 2, R = 3;
 
    int max = findMax(N, arr, L, R);
 
    // Display the output
    System.out.println(max);
 
}
}
 
// This code is contributed by Samim Hossain Mondal.
Python3



# Python3 program for the above approach
 
# Function to find the maximum value of K
def findMax(N, arr, L, R) :
 
    # Using a set to store the elements
    s = set();
 
    # Vector to store the possible answers
    possible = [];
 
    # Store the answer
    ans = 0;
 
    # Traverse the array
    for i in range(N) :
 
        # If set has it's negation,
        # check if it is max
        if arr[i] * -1 in s  :
            possible.append(abs(arr[i]));
        else :
            s.add(arr[i]);
 
    # Find the maximum possible answer
    for i in range(len(possible)) :
        if (possible[i] >= L and possible[i] <= R) :
            ans = max(ans, possible[i]);
 
    return ans;
 
# Driver Code
if __name__ ==  "__main__" :
 
    arr = [ 3, 2, -2, 5, -3 ];
    N = 5; L = 2; R = 3;
 
    Max = findMax(N, arr, L, R);
 
    # Display the output
    print(Max);
 
    # This code is contributed by Ankthon
C#



// Java program for the above approach
using System;
using System.Collections;
using System.Collections.Generic;
 
public class GFG
{
// Function to find the maximum value of K
static int findMax(int N, int []arr, int L, int R)
{
 
    // Using a set to store the elements
    HashSet<int> s = new HashSet<int>();
   
    // ArrayList to store the possible answers
    ArrayList possible = new ArrayList();
 
    // Store the answer
    int ans = 0;
 
    // Traverse the array
    for (int i = 0; i < N; i++) {
 
        // If set has it's negation,
        // check if it is max
        if (s.Contains(arr[i] * -1))
            possible.Add(Math.Abs(arr[i]));
        else
            s.Add(arr[i]);
    }
 
    // Find the maximum possible answer
    for (int i = 0; i < possible.Count; i++) {
        if ((int)possible[i] >= L && (int)possible[i] <= R) {
            ans = Math.Max(ans, (int)possible[i]);
        }
    }
 
    return ans;
}
 
// Driver Code
public static void Main()
{
 
    int []arr = { 3, 2, -2, 5, -3 };
    int N = 5, L = 2, R = 3;
 
    int max = findMax(N, arr, L, R);
 
    // Display the output
    Console.Write(max);;
 
}
}
 
// This code is contributed by Samim Hossain Mondal.
Javascript



<script>
 
        // JavaScript Program to implement
        // the above approach
 
        // Function to find the maximum value of K
        function findMax(N, arr, L, R) {
 
            // Using a set to store the elements
            let s = new Set();
 
            // Vector to store the possible answers
            let possible = [];
 
            // Store the answer
            let ans = 0;
 
            // Traverse the array
            for (let i = 0; i < N; i++) {
 
                // If set has it's negation,
                // check if it is max
                if (s.has(arr[i] * -1))
                    possible.push(Math.abs(arr[i]));
                else
                    s.add(arr[i]);
            }
 
            // Find the maximum possible answer
            for (let i = 0; i < possible.length; i++) {
                if (possible[i] >= L && possible[i] <= R)
                    ans = Math.max(ans, possible[i]);
            }
 
            return ans;
        }
 
        // Driver Code
        let arr = [3, 2, -2, 5, -3];
        let N = 5, L = 2, R = 3;
 
        let max = findMax(N, arr, L, R);
 
        // Display the output
        document.write(max + '<br');
 
    // This code is contributed by Potta Lokesh
    </script>
Output
3
Time Complexity: O(N)
Auxiliary Space: O(N)

My Personal Notes
arrow_drop_up
Previous
Find the equation of the straight line passing through the given points
Next

How to check whether an array includes a particular value or not in JavaScript ?
Recommended Articles
Page :
Remove minimum number of elements such that no common element exist in both array
23, Sep 17
Check if every index i has an index j such that sum of elements in both directions are equal
04, Oct 18
Minimize operations to make both arrays equal by decrementing a value from either or both
16, Nov 21
Count of Pairs in given Array having both even or both odd or sum as K
11, Jan 22
Reduce Binary Array by replacing both 0s or both 1s pair with 0 and 10 or 01 pair with 1
14, Dec 21
Length of longest subarray for each index in Array where element at that index is largest
28, Jun 21
Sort Array such that smallest is at 0th index and next smallest it at last index and so on
08, Jul 20
Largest number having both positive and negative values present in the array
17, Jun 21
Find Permutation of N numbers in range [1, N] such that K numbers have value same as their index
29, Dec 21
Array Index with same count of even or odd numbers on both sides
12, Feb 18
Rearrange array such that even index elements are smaller and odd index elements are greater
08, Oct 17
Check if it is possible to reach to the index with value K when start index is given
25, Jun 20
Count pairs (i, j) from an array such that |arr[i]| and |arr[j]| both lies between |arr[i] - arr[j]| and |arr[i] + arr[j]|
12, Mar 21
Count of index range [L, R] in Array such that removing all its instances sorts the Array
30, Jul 21
Range Query on array whose each element is XOR of index value and previous element
24, Dec 17
Number of permutations such that sum of elements at odd index and even index are equal
02, Jul 18
Queries for elements having values within the range A to B in the given index range using Segment Tree
27, Apr 20
Farthest index that can be reached from the Kth index of given array by given operations
02, Dec 20
Count pairs in an array such that both elements has equal set bits
16, Nov 18
Divide array in two Subsets such that sum of square of sum of both subsets is maximum
07, Feb 20
Partition an array of non-negative integers into two subsets such that average of both the subsets is equal
11, Jul 19
Maximum range subarray for each index in Array such that A[i] = min(A[L], A[L+1], … A[R])
28, Jun 21
Count of positions j in Array such that arr[i] is maximum in index range [i, j] with end points as same
01, Jul 21
Queries for number of distinct elements from a given index till last index in an array
17, Jun 19
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
bhukyavasanthkumar
@bhukyavasanthkumar
Vote for difficulty





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!