
# Documentation

## Find Missing And Repeating

<a><img src= "https://img.shields.io/badge/-Amazon-blue" height="25">&nbsp;&nbsp;<img src= "https://img.shields.io/badge/-Goldman Sachs-orange" height="25">&nbsp;&nbsp;<img src= "https://img.shields.io/badge/-Samsung-red" height="25">&nbsp;&nbsp;<img src= "https://img.shields.io/badge/-Python-brightgreen"></a>

#### Problem Statement

Given an unsorted array of size N of positive integers. One number 'A' from set {1, 2, …N} is missing and one number 'B' occurs twice in array. Find these two numbers.

Note: If you find multiple answers then print the Smallest number found. Also, expected solution is O(n) time and constant extra space.

    Example 1:

    Input:
    2
    2
    2 2
    3 
    1 3 3

    Output:
    2 1
    3 2







#### Solution

To be added soon ... .. ...


