We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Waiter
  2. Discussions

Waiter

Sort by

recency

|

64 Discussions

|

  • chris_shumaker
     + 0 comments

    This is truly an exercise in clarifying requirements and a bit of computer science trivia. Great for competitive coders, questionable for interview prep. Not impossible that someone will interview with this problem but very rarely would this be an appropriate measure of problem solving and job fit.

    Go ahead and try it to familiarize with the problem but if you get stuck, just start reading instead. You'll learn more than by thinking in circles.

    I also really appreciate the amount of thoughtful responses here instead of mindlessly posting solutions!!! Way to go HackerRank community!!!

  • engnr_plusplus
     + 0 comments

    ths one is all over the place. It mixes metaphors; goes back and forth between stating the problem and instructing how to implement solution. Are talkng stacks of plates? Why is it telling me to create arrays?

    You know, problems are supposed to be difficult to solve. Not difficult to understand what meant to say the AI that wrote it.

  • engelbertteh_dev
     + 1 comment

    Typescript

    function isPrime(num:number){
    if(num<2)return false;
    for(let i=2; i<=Math.sqrt(num); i++){
        if(num%i===0){
            return false;
        }
    }
        return true;
}

    function waiter(number: number[], q: number): number[] {

    const primeArr = (()=>{
    let primes : number[] = [];
    let num = 2;
    while(primes.length < q){
        if(isPrime(num)){
            primes.push(num);
        }
        num++;
    }
    return primes;
})()

let rem :number[] = number;
let ans : number[] = [];

for(let i=0; i<q; i++){

         let temp =[];
        for(let k=0; k<rem.length; k++){
            if(rem[k]%primeArr[i]===0){
                ans.push(rem[k]);
            }
            else {
                temp.unshift(rem[k])
            }
        }
        rem = [...temp];

}
for(let i=rem.length-1; i>=0; i--){
    ans.push(rem[i]);
}
return ans;

    }

  • hs8436686
     + 0 comments

    Java Solution:- 

    public static List<Integer> waiter(List<Integer> number, int q) {
        List<Integer> results = new ArrayList<>();
        int max = number.stream().max( Integer::compareTo ).orElse(2) ;
        List<Integer> primes = sieveOfAtkin( max ) ;
        Stack<Integer> ai = new Stack<>();
        Stack<Integer> bi = new Stack<>();
        for(int k=0; k<q; ++k ) {
            if (k<primes.size()) {
                Integer prime = primes.get(k);
                System.out.println("prime: "+prime) ;
                while(!number.isEmpty()) {
                    Integer value = number.remove(number.size()-1);
                    if (value%prime == 0)
                        bi.push(value);
                    else
                        ai.push( value );
                }
                stackToList(bi,results );
                number.addAll(ai) ;
                ai.clear();
            } else {
                if ( (q-k)/2 == 0 )
                    Collections.reverse(number);
                break;
            }
        }
        Collections.reverse(number);
        results.addAll(number);
        
        return results;
    }
    private static void stackToList(Stack<Integer> stack, List<Integer> list) {
        while(!stack.isEmpty()) {
            list.add(stack.pop()) ;
        }
    }
    private static List<Integer> sieveOfAtkin( final int limit ) {
        List<Integer> primes = new ArrayList<>();
        boolean[] sieve = new boolean[limit+1] ;
        if ( sieve.length > 2 )
            sieve[2] = true;
        if ( sieve.length > 3 )
            sieve[3] = true;
        for ( int x=1; x*x <= limit; ++x ) {
            for ( int y=1; y*y <=limit; ++y ) {
                int xx = x*x;
                int yy = y*y;
                int n = (4*xx)+yy;
                if (n<=limit && ( n % 12==1 || n % 12==5 ))
                    sieve[n] ^= true;
                n = (3*xx)+yy;
                if (n<=limit && ( n % 12==7 ))
                    sieve[n] ^= true;
                n = (3*xx)-yy ;
                if ( x > y && n <= limit && n % 12 == 11 )
                    sieve[n] ^= true;
            }
        }
        for ( int r = 5; r*r <=limit; ++r ) {
            if (sieve[r]) {
                for ( int i = r*r; i<= limit; i += r*r ) {
                    sieve[i] = false;
                }
            }
        }
        
        for ( int i = 2; i <= limit; ++i ) {
            if (sieve[i])
                primes.add(i) ;
        }
        
        return primes;
    }

    }

  • egaus
     + 0 comments

    This is silly.