I have passed one phone interview and two onsite technical interviews.

The last person I spoke with was the department director, some Indian guy with a lot of complexes.

He kept saying how it is important to be a hard worker and that being only smart is not enough.

He pointed out a few times that he doesn't care about my past experiences in Armenia.

I would have left the interview before it finished, but a friend of mine was also working there, so I had to stay and enjoy the performance :)

It is funny to see such a big name as Cisco having such mean directors.

P.S. They even checked my background before talking with the Indian guy.

The Longest Increasing Subsequence (LIS) problem is to find the length of the longest subsequence of a given sequence such that all elements of the subsequence are sorted in increasing order. For example, the length of the LIS for {10, 22, 9, 33, 21, 50, 41, 60, 80} is 6, and the LIS is {10, 22, 33, 50, 60, 80}.

This mainly involves implementing some well-known algorithms on the board, such as:

• Binary search
• Tree traversal problems