Interview Round: Technical Round – 1
He asked about the projects I mentioned in resume.
He asked some easy questions like reversal of linked list without extra space etc.. Also the following questions
1) Given an array in which all numbers except two are repeated once. (i.e. we have 2n+2 numbers and n numbers are occurring twice and remaining two have occurred once). Find those two numbers in the most efficient way. https://www.w3wiki.org/find-two-non-repeating-elements-in-an-array-of-repeating-elements/
2)Given a value N, if we want to make change for N cents, and we have infinite supply of each of S = { S1, S2, .. , Sm} valued coins, how many ways can we make the change? The order of coins doesn’t matter. https://www.w3wiki.org/coin-change-dp-7/