No.

At http://InterviewKickstart.com, we believe that most engineers are smart, but they often fail technical interviews, simply because they chronically underestimate the amount of intense preparation required to crack into stellar companies.

While one session here is probably not enough prep to get into Google (or maybe it is, who knows?), we'll make the best of what we have, and go thru a rapid-fire round of short technical questions that are popular in the valley today.

It'll be fun.

Some examples:

1. What is the space complexity of recursion?
2. What is the time complexity of following code? (shown on the screen)
3. What are the three fundamentally different ways to solve the 2Sum problem?
4. When merging sorted arrays, why do we prefer heap sort?
5. Why shouldn't we use Substring() when recursing (or recurring) on a string?
6. LRU cache: Why are linked lists the best data-structure to use here?

Come hungry.