Scribd Logo
Upload

Welcome to Scribd!

  • This Is A Demo Task

    Uploaded by

    Estera Robu
    12 views7 pages
    The document describes a function that takes an integer array as input and returns the smallest positive integer that is not present in the array. It provides examples where the array is [1, 3, 6, 4, 1, 2] and it should return 5, and where the array is [1, 2, 3] and it should return 4. The function needs to have an efficient algorithm to handle arrays with up to 100,000 integers between -1,000,000 and 1,000,000.

    Original Description:

    demo task

    Original Title

    This is a demo task

    Copyright

    © © All Rights Reserved

    Available Formats

    ODT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes a function that takes an integer array as input and returns the smallest positive integer that is not present in the array. It provides examples where the array is [1, 3, 6, 4, 1, 2] and it should return 5, and where the array is [1, 2, 3] and it should return 4. The function needs to have an efficient algorithm to handle arrays with up to 100,000 integers between -1,000,000 and 1,000,000.

    Copyright:

    © All Rights Reserved
    Download as ODT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    12 views7 pages

    This Is A Demo Task

    Uploaded by

    Estera Robu
    The document describes a function that takes an integer array as input and returns the smallest positive integer that is not present in the array. It provides examples where the array is [1, 3, 6, 4, 1, 2] and it should return 5, and where the array is [1, 2, 3] and it should return 4. The function needs to have an efficient algorithm to handle arrays with up to 100,000 integers between -1,000,000 and 1,000,000.

    Copyright:

    © All Rights Reserved
    Download as ODT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 7

    This is a demo task.

    Write a function:

    class Solution { public int solution(int[] A); }

    that, given an array A of N integers, returns the smallest positive integer


    (greater than 0) that does not occur in A.

    For example, given A = [1, 3, 6, 4, 1, 2], the function should return 5.

    Given A = [1, 2, 3], the function should return 4.

    Given A = [−1, −3], the function should return 1.

    Write an efficient algorithm for the following assumptions:


     N is an integer within the range [1..100,000];

     each element of array A is an integer within the


    range [−1,000,000..1,000,000].
     for(int i:X){
    //if(X[i]<0)
    if(maxX<Math.abs(i))
    maxX=i;}
    for(int i:Y){
    if(maxX<Math.abs(i))
    maxY=i;}
    if(maxX<maxY)
    maxX=maxY;
    else maxY=maxX;
    for()
    map.put(new Integer(X[i]), new Integer(Y[i]));
    }
     1, -1, -2
     1, -1, -2

    You might also like