Partition an array such that all non-zero values are at the beginning.

Question

Anonymous · Accepted Answer

By i++ and j++, I think you mean —

Anonymous · Answer

This is an interesting read:

bit.ly/faang100

Anonymous · Answer

int j = numbers1.length-1;
        for(int i=0;i!=j;i++){
            while(numbers1[j] == 0) {
                j--;
            }
            if(i==j)break;
            if(numbers1[i] == 0){
                numbers1[i] = numbers1[j];
                numbers1[j] = 0;
                j--;
            }
        }
        return numbers1;

Hey! · Answer

Doable

Meta

Meta Interview Question

Interview Answers

Followed companies

Job searches

Bowls

Want the inside scoop on your own company?