Find Duplicate

 

You have been given an integer array/list(ARR) of size N which contains numbers from 0 to (N - 2). Each number is present at least once. That is, if N = 5, the array/list constitutes values ranging from 0 to 3 and among these, there is a single integer value that is present twice. You need to find and return that duplicate number present in the array.

Sample Input 1:
9
0 7 2 5 4 7 1 3 6
Sample Output 1:
7

public class Solution{  
    
    public static int duplicateNumber(int arr[]) {
  
        for(int i=0;i<arr.length;i++)
        {
            for(int j=0;j<arr.length;j++)
            {
                if(i!=j && arr[i]==arr[j])
                {
                    return arr[i];
                }
            }
        }
        return -1;
    }
}

Comments

Post a Comment

Popular posts from this blog

Remove character

  For a given a string(str) and a character X, write a function to remove all the occurrences of X from the given string. Sample Input 1: aabccbaa a Sample Output 1: bccb public class Solution { public static String removeAllOccurrencesOfChar(String str, char ch) { int l=str.length(); String s=""; for(int i=0;i<l;i++) { char c = str.charAt(i); if(ch!=c) { s=s+c; } } return s; } }
Read more

All Prime Numbers

  Given an integer N, print all the prime numbers that lie in the range 2 to N (both inclusive). Sample Input 1: 9 Sample Output 1: 2 3 5 7 import java.util.Scanner; public class Solution { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); for( int i=2;i<=n;i++) { int c=0; for(int j=1;j<=i;j++) { if(i%j==0) { c++; } } if(c==2) { System.out.println(i); } } } }
Read more

Minimum Length Word

  Given a string S (that can contain multiple words), you need to find the word which has minimum length. Sample Input 1 : this is test string Sample Output 1 : is public class Solution { public static String minLengthWord(String input){ String[] arr=input.split(" "); int i=0; int minlength; minlength=Integer.MAX_VALUE; String smallest; smallest = ""; for(i=0;i<arr.length;i++) { if(arr[i].length() < minlength) { smallest=arr[i]; minlength=arr[i].length(); } } return smallest; } }
Read more