Welcome to the Lounge

int[] data = new int[] { 1, 9, 8, 4, 0, 0, 2, 7, 0, 6, 0 };
int y = 0;
var result = data.OrderBy(d => d == 0 ? int.MaxValue : y++);

List<int> a = new List<int>( new int[] { 1, 9, 8, 4, 0, 0, 2, 7, 0, 6, 0 } );

int count = a.RemoveAll( i => i== 0 );
a.AddRange( new int[ count ] );

var data = [ 1, 9, 8, 4, 0, 0, 2, 7, 0, 6, 0 ];
var sorted = data.sort( (a, b) => a == 0 ? 1 : (b == 0 ? -1 : 0) );   // First attempt
var sorted = data.sort( (a, b) => a ? (b ? 0 : -1 ) : 1 );  // Exploits 0 == false, non-zero == true
alert(sorted);

int[] data = new int[] { 1, 9, 8, 4, 0, 0, 2, 7, 0, 6, 0 };
int outp = 0;
for (int inp = 0; inp < data.Length; inp++)
    {
    int d = data[inp];
    if (d != 0)
        {
        data[outp++] = d;
        }
    }
while (outp < data.Length)
    {
    data[outp++] = 0;
    }

var data = [ 1, 9, 8, 4, 0, 0, 2, 7, 0, 6, 0 ];

for (var x = 0;x<data.length;x++){
   if (data[x] == 0){
      data.splice(x,1);
      data.push(0);
   } 
}

Daniel Pfeffer wrote:

If I were the interviewer, I would ask if you can see a problem with this solution, and then ask you for a more efficient (O(N)) solution.

Jeremy Falcon wrote:

And while you're at, can you stop space and time and develop the first programming language used on Mars and feed that back to us?

//int [] data = {1, 9, 8, 4, 0, 0, 2, 7, 0, 6, 0};
	//int [] data = {0,0,0,0};
	//int [] data = {0,1,2,0,0,0,0,0};
	int [] data = {0,1,2,0,0,0,0,0,5};
	List<int> allData = new List<int>(data);
	var originalSize = allData.Count;
	var counter=0;
	for (int x =0;counter<=originalSize;x++){
		if (allData[x]== 0){
			Console.WriteLine($"got 0 : {x}");
			allData.RemoveAt(x--);
			allData.Add(0);
		}
		counter++;
	}
	data = allData.ToArray();
	Console.WriteLine(data);

OriginalGriff wrote:

That's probably even less efficient than my Linq code!

rnbergren wrote:

But would that ever happen in a real life work environment?

a = 15
b = 5
a = a^b
b = b^a
a = a^b