A little problem (inspired by CodeChef) for the coffee break.
A friend give you an array of size n-1 integers and these integers are in the range of 1 to n. There are no duplicates in array, but one of the integers is missing. Write efficient code to find the missing integer.
Nice problem !!
1786 Solvers
1401 Solvers
Replace NaNs with the number that appears to its left in the row.
1711 Solvers
165 Solvers
214 Solvers