Repeat and Missing Number Array - The Coding Shala

Home >> Interview Questions >> Repeat and missing Number Array

Repeat and Missing Number Array Solution

Problem Statement::
You are given a read-only array of n integers from 1 to n.
Each integer appears exactly once except A which appears twice and B which is missing.
Return A and B.
Note that in your output A should precede B.

Repeat and Missing Number Array Java - The Coding Shala
Input:[3 1 2 5 3] 

Output:[3, 4] 

A = 3, B = 4
Solution 1: (Java)

public class Solution {
    public ArrayList<Integer> repeatedNumber(final List<Integer> A) {
        int n = A.size();
        ArrayList<Integer> C=new ArrayList<Integer>();
        int[] arr=new int[n+1];
       for(int i=0;i<n+1;i++) arr[i]=0;
        for(int i=0;i<A.size();i++) arr[A.get(i)]++;
        int A1=0,B=0;
        for(int i=1;i<n+1;i++){
            if(arr[i]>1) A1 = i;
            if(arr[i]==0) B=i;
        return C;

Other Posts You May Like
Please leave a comment below if you like this post or found some error, it will help me to improve my content.


Popular Posts from this Blog

LeetCode - Crawler Log Folder Solution - The Coding Shala

Richest Customer Wealth LeetCode Solution - The Coding Shala

Shell Script to find sum, product and average of given numbers - The Coding Shala

First Unique Character in a String Java - The Coding Shala

Add two numbers in Scala - The Coding Shala