Please answer this is php or javascript $,$c# C$,$ java, python $,$c$++$

Move zero values

An array arr oftype int is given as an argument of solution function.

Write a program that returns an array of type int, where all zero values in arr are moved to the end of the array while preserving the order of non$-$zero values.

Try to implement the program as fast as possible, so that reduces the amount of calculation even when len$($arr$)$becomes large

$2$

Division and Array Subsets

Explanation

In the solution function, a different number of integer array nums and integer value target were given as arguments.

Please write a program to return the maximum value of the subset as the return value of the solution function injinteger that satisfies the conditions where the elements of nums array are combined and the sum of any two numbers is not divisible$$by$$target$.$However, a subset consisting of a single element must satisfy the above$$condition