Welcome to the Lounge

Jeremy Falcon wrote:

Anyone else agree this is fundamentally broken?

Charles Caleb Colton, (1780- 1832):

Examinations are formidable even to the best prepared, for the greatest fool may ask more than the wisest man can answer.

raddevus wrote:

Finally, they hit on a topic I didn't have experience with and I said so and they went cold.

raddevus wrote:

The thing is you could literally ask Einstein a particular question that even he didn't have experience with.

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.