My Current exp: 2.5years

Round 1: Coding Round

The interviewer first asked me a graph problem, which I was unable to solve. After struggling with it for a while, I requested to move on to the next question. At that point, I felt that I might have already been rejected.

Since there was still time left, the interviewer asked me to rotate the array from right to left k times, which I solved successfully. After that, I was given a string problem: finding the length of the longest substring without repeating characters. I was able to solve that as well.

However, I believe that my inability to solve the first graph question was the main reason I was not selected.

Thanks!