Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Find the only positive or only negative number in the given Array

  • Last Updated : 16 Dec, 2021

Given an array arr[] of either entirely positive integers or entirely negative integers except for one number. The task is to find that number.

 Examples:

Input: arr[] = {3, 5, 2, 8, -7, 6, 9}
Output: -7
Explanation: Except -7 all the numbers in arr[] are posisitve integers. 

Input: arr[] = {-3,  5,  -9}
Output: 5

 

Approach: The given problem can be solved by just comparing the first three numbers of arr[]. After that apply Linear Search and find the number. Follow the steps below to solve the problem. 

  • If the size of arr[] is smaller than 3, then return 0.
  • Initialize the variables Cp and Cn.
  • Where Cp = Count of positive integers and Cn = Count of negative integers.
  • Iterate over the first 3 element
    • If (arr[i]>0), Increment Cp by 1.
    • Else Increment Cn by 1.
  • Cp can be 2 or 3 and similarly, Cn can also either 2 or 3.
  • If Cp<Cn, then the single element is positive, apply linear search and find it.
  • If Cn<Cp, then the single element is negative, apply linear search and find it.

Below is the implementation of the above approach: 

C++




// C++ program for the above approach
#include <iostream>
using namespace std;
 
// Function to return the single element
int find(int* a, int N)
{
    // Size can not be smaller than 3
    if (N < 3)
        return 0;
 
    // Initialize the variable
    int i, Cp = 0, Cn = 0;
 
    // Check the single element is
    // positive or negative
    for (i = 0; i < 3; i++) {
 
        if (a[i] > 0)
            Cp++;
        else
            Cn++;
    }
 
    // Check for positive single element
    if (Cp < Cn) {
        for (i = 0; i < N; i++)
            if (a[i] > 0)
                return a[i];
    }
 
    // Check for negative single element
    else {
        for (i = 0; i < N; i++)
            if (a[i] < 0)
                return a[i];
    }
}
 
// Driver Code
int main()
{
    int arr[] = { 3, 5, 2, 8, -7, 6, 9 };
    int N = sizeof(arr) / sizeof(arr[0]);
 
    cout << find(arr, N);
}
Java



// Java program for the above approach
import java.util.*;
public class GFG {
 
// Function to return the single element
static int find(int []a, int N)
{
    // Size can not be smaller than 3
    if (N < 3)
        return 0;
 
    // Initialize the variable
    int i, Cp = 0, Cn = 0;
 
    // Check the single element is
    // positive or negative
    for (i = 0; i < 3; i++) {
 
        if (a[i] > 0)
            Cp++;
        else
            Cn++;
    }
 
    // Check for positive single element
    if (Cp < Cn) {
        for (i = 0; i < N; i++)
            if (a[i] > 0)
                return a[i];
    }
 
    // Check for negative single element
    else {
        for (i = 0; i < N; i++)
            if (a[i] < 0)
                break;
    }
    return a[i];
}
 
// Driver Code
public static void main(String args[])
{
    int []arr = { 3, 5, 2, 8, -7, 6, 9 };
    int N = arr.length;
    System.out.println(find(arr, N));
}
}
 
// This code is contributed by Samim Hossain Mondal.
Python3



# python program for the above approach
 
# Function to return the single element
def find(a, N):
 
    # Size can not be smaller than 3
    if (N < 3):
        return 0
 
    # Initialize the variable
    Cp = 0
    Cn = 0
 
    # Check the single element is
    # positive or negative
    for i in range(0, 3):
 
        if (a[i] > 0):
            Cp += 1
        else:
            Cn += 1
 
        # Check for positive single element
    if (Cp < Cn):
        for i in range(0, N):
            if (a[i] > 0):
                return a[i]
 
        # Check for negative single element
    else:
        for i in range(0, N):
            if (a[i] < 0):
                return a[i]
 
# Driver Code
if __name__ == "__main__":
 
    arr = [3, 5, 2, 8, -7, 6, 9]
    N = len(arr)
 
    print(find(arr, N))
 
    # This code is contributed by rakeshsahni
C#



// C# program for the above approach
using System;
class GFG {
 
// Function to return the single element
static int find(int []a, int N)
{
    // Size can not be smaller than 3
    if (N < 3)
        return 0;
 
    // Initialize the variable
    int i, Cp = 0, Cn = 0;
 
    // Check the single element is
    // positive or negative
    for (i = 0; i < 3; i++) {
 
        if (a[i] > 0)
            Cp++;
        else
            Cn++;
    }
 
    // Check for positive single element
    if (Cp < Cn) {
        for (i = 0; i < N; i++)
            if (a[i] > 0)
                return a[i];
    }
 
    // Check for negative single element
    else {
        for (i = 0; i < N; i++)
            if (a[i] < 0)
                break;
    }
    return a[i];
}
 
// Driver Code
public static void Main()
{
    int []arr = { 3, 5, 2, 8, -7, 6, 9 };
    int N = arr.Length;
    Console.Write(find(arr, N));
}
}
 
// This code is contributed by Samim Hossain Mondal.
Javascript



<script>
// Javascript program for the above approach
 
// Function to return the single element
function find(a, N)
{
    // Size can not be smaller than 3
    if (N < 3)
        return 0;
 
    // Initialize the variable
    let i, Cp = 0, Cn = 0;
 
    // Check the single element is
    // positive or negative
    for (i = 0; i < 3; i++) {
 
        if (a[i] > 0)
            Cp++;
        else
            Cn++;
    }
 
    // Check for positive single element
    if (Cp < Cn) {
        for (i = 0; i < N; i++)
            if (a[i] > 0)
                return a[i];
    }
 
    // Check for negative single element
    else {
        for (i = 0; i < N; i++)
            if (a[i] < 0)
                return a[i];
    }
}
 
// Driver Code
let arr = [ 3, 5, 2, 8, -7, 6, 9 ];
let N = arr.length;
 
document.write(find(arr, N));
 
// This code is contributed Samim Hossain Mondal.
</script>
Output
-7
Time Complexity: O(N) 
Auxiliary Space: O(1)
 

My Personal Notes
arrow_drop_up
Previous
Minimum number of days in which no task is performed
Next

Count of moves to escape given Matrix from given position based on given conditions
Recommended Articles
Page :
Only integer with positive value in positive negative value in array
08, Nov 17
Find ratio of zeroes, positive numbers and negative numbers in the Array
19, Apr 20
Find the maximum among the count of positive or negative integers in the array
07, Oct 21
Largest number having both positive and negative values present in the array
17, Jun 21
Find the last positive element remaining after repeated subtractions of smallest positive element from all Array elements
10, Sep 21
Generate an array with K positive numbers such that arr[i] is either -1 or 1 and sum of the array is positive
16, May 21
Program to check if a number is Positive, Negative, Odd, Even, Zero
01, Dec 17
C program to Check Whether a Number is Positive or Negative or Zero
05, Oct 18
Maximum sum subset having equal number of positive and negative elements
07, May 20
Minimum number of changes such that elements are first Negative and then Positive
08, Apr 19
Check if array elements are consecutive in O(n) time and O(1) space (Handles Both Positive and negative numbers)
15, Jul 17
C program to count Positive and Negative numbers in an Array
21, Apr 20
Maximum sum of array after removing a positive or negative subarray
16, Jun 21
Split array into three continuous subarrays with negative, 0 and positive product respectively
18, May 21
Rearrange array in alternating positive & negative items with O(1) extra space | Set 2
21, May 16
Rearrange array in alternating positive & negative items with O(1) extra space | Set 1
24, Aug 14
Pairs of Positive Negative values in an array
20, Oct 17
Move all negative numbers to beginning and positive to end with constant extra space
06, Sep 17
Positive elements at even and negative at odd positions (Relative order not maintained)
12, Sep 17
Rearrange positive and negative numbers using inbuilt sort function
25, Oct 17
Lambda expression in Python to rearrange positive and negative numbers
27, Oct 17
Longest alternating (positive and negative) subarray starting at every index
09, Dec 17
Make three non-empty sets with negative, positive and 0 products
14, Nov 17
Partition negative and positive without comparison with 0
05, Jun 18
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
akashjha2671
@akashjha2671
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!