Given an array, move all the zeros to the end and return the number of nonzero elements in the array

Question

Sigiloso · Accepted Answer

int lo=0;
int hi=arr.length-1;
while(lo

Sigiloso · Answer

int zeroP = 0;
		
		for (int i=0; i

Python answer · Answer

def move_zeroes_end(num_list):
    if len(num_list) == 0:
        return num_list

    end_pos = len(num_list)-1
    while end_pos > 0 and num_list[end_pos] == 0:
        end_pos -= 1

    i = 0
    while i  0 and num_list[end_pos] == 0:
                end_pos -= 1
        i += 1

    if num_list[end_pos] != 0:
        end_pos += 1
    return end_pos, num_list

print move_zeroes_end([1, 0, 9, 7, 5, 0, 2, 1])
print move_zeroes_end([1, 0, 9, 7, 5, 0, 0, 1])
print move_zeroes_end([])
print move_zeroes_end([0])
print move_zeroes_end([0, 0])
print move_zeroes_end([1, 2])

Sigiloso · Answer

public int returnNonZeros(int[] arr) {
    int result = arr.length;
    for (int i = 0; i < result;) {
        if (arr[i] == 0) {
            int temp = arr[i];
            arr[i] = arr[result-1];
            arr[result-1] = temp;
            result--;
        }
        else {
            i++;
        }
    }
    return result;
}

Sigiloso · Answer

public int moveZero(int[] a) {
        int l=0;
        int r=a.length-1;
        while(l

Meta

Pergunta de entrevista da empresa Meta

Respostas da entrevista

Empresas seguidas

Buscas de vagas