Gave Google Interview today. Question was to find longest increasing subsequece with difference being exactly one. Solved it in O(n) but messed up with code in Google docs due to lack of time. Is it too bad? Do they scan entire code to check its accuracy?Please answer my concern if anyone has any idea :(
Thnaks