Google interview questions

  How to design better algorithms ? This is one of the basic questions that haunt every programmer. Even software designers want better algorithms. But how do we say that one algorithm is better than the other? Is it not sufficient that the work is done, and the problem is solved? Not always. Suppose I can solve the problem in 5 years and somebody else comes with a solution in 5 minutes, whom will you prefer? It is not a question of fast computers, but fast algorithms.   The fastness of an algorithm is measured in terms of its complexity. An algorithm with logarithmic time complexity is considered better than an algorithm with polynomial time complexity and so on. We will not dwell in the forests of complexity here, may be in another article.   Here the point is, for designing better algorithms, powerful data structures are needed. They organize the data in optimal ways and allow access to this data in easy ways.   Most commonly used data structures are arrays, stac

  Any software company even half-serious about the kind of programmers and software engineers it hires has at least one round of tech interviews, or technical interviews as they are properly called, for any job candidate . Usually, there are more than one tech interview rounds - and in each round, the candidate is interviewed by a different interviewer, or a different group of interviewers. Some technical interviews go on for a full day, leaving you tired at the end of the day. To save traveling and time, companies like Google, Microsoft and even smaller companies start their interview process by a phone technical interview.   I appeared for a technical interview by phone for Google for a development job, and was asked questions about algorithms and data structures for more than an hour . Your own interview or the general technical interview questions you may be asked depend on the domain or type of job you are appearing for. For example, if you are appearing as a da