Graduate Interview Questions

I answered them that I have no idea. (lolz)

BTW,what's the content roughly of 1:1 basics coding exercise.

If you ask ROUGHLY, it's like a list of incomplete small programs you need to complete/solve. Like a in-class CA. The purpose of this is to understand how you solve problem (logical thinking stuffs).

This was more of a pair programming styled interview. Very nice and collaborative.

public class Words { public static String[] dic = new String[80368]; public static void split(String head, String in) { // head + " " + in is a segmentation String segment = head + " " + in; // count number of dictionary words int count = 0; Scanner phraseScan = new Scanner(segment); while (phraseScan.hasNext()) { String word = phraseScan.next(); for (int i=0; i

I passed my exam in 2006 & I have B Tech ( Hons ) Degree

I got my DAE Diploma ( Civil ) In 1996 at First Division

I told my Visa status, but she has informed me that the company can't support my Visa after one year extension. I think the interviewer should have asked these details before taking the interview through emails. I am sure if she has asked me those details before then it has saved time for both of us.

Hi, Is it possible to have more details about your interview ?

I would call a coffee break and address each of the colleagues separately to try to determine the root of the problem. I would then set up a resolution discussion in a bid to resolve it.

Hi, Thank you for sharing your interview experience. As a small team of ex-Google employees, we have recently launched interviewjoy.com, a career consultancy community, where users can buy/sell services that provide job interview experiences/insights. Posting an interview consultancy service is totally free & anonymous. Create a service in 2 minutes and earn money by sharing your experience with other candidates over the phone or via a document you created. Users already started making money on the website by sharing their experiences. You are kindly invited to interviewjoy.com to check it out. Thanks!

There is no efficient solution, just focus on solving the problem first. Use a hashtable to keep track of values above and to the left, then have a while loop that finds the lowest value.

Assume it's a 3x3 matrix, start filling the matrix from 9 to 1 from left to right. |9 8 7| |6 5 4| |3 2 1| If it was a 4x4 array, start from 16 to 1.

This was fine, I nailed this one pretty much, apart from some minor slip ups. Although the interviewer went into a LOT of detail on some parts of this, which was annoying, because I had displayed I knew the answer already. Not sure what they were looking for there.

To find largest k values from array of size N, there are two approaches: Efficient Sort: O(NlogN + k) Max Heap: O(N + klogN) Quickselect: O(kN) For k=1, quickselect wins. Otherwise Max heap probability wins.