Junior .NET Developer interview questions (alghoritms)
1) Given two arrays, A and B.
Array A consists of a sequence (ex. [1,2,3,4,5,6]) and array B consists of a sequence (ex. [2,4,3,1,_, 6]).
Q: Find the missing element in the array B, no more than one pass of iteration. You can use an array A.

2) Given one array (ex. [2,5,4,1,3,6).
Q: Sort this array, no more than one pass of iteration.

I failed :(
Junior .NET Developer interview questions (alghoritms)
===

1) Given two arrays, A and B.
Array A consists of a sequence (ex. [1,2,3,4,5,6]) and array B consists of a sequence (ex. [2,4,3,1,_, 6]).
Q: Find the missing element in the array B, no more than one pass of iteration. You can use an array A.

2) Given one array (ex. [2,5,4,1,3,6).
Q: Sort this array, no more than one pass of iteration.

I failed :(