Graduate Interview Questions

Assumptions: You have three inputs: X, Y, Z with two possible states (0,1). You have three outputs: A,B,C with two possible states (0,1). The inputs and outputs are independent of each other, but one input should be matched to one output. For example, if X --> A, then X(1) --> A(1). Note: we don't actually know whether the normal state of the switch is open or closed. For our purposes 0 is normal state, 1 is abnormal state. You have one chance to observe the outputs. You could flip one of the switches and observe, but this will only tell you about one of the connections and leave two unknowns. You could flip two switches, but this still leaves two unknowns. You could flip all three, but this leaves three unknowns. You could flip none of them, but that leaves three unknowns. Another possibility is to McGyver the light switches by placing three resistors of different values in series with the switch, verifying the switch is closed, and then observe the relative brightnesses of the bulbs. More creatively, you could use your one trip to leave the room to find the documentation and/or the persons responsible for this cruel experiment. I am sure this is wrong, but I was never a math or CS major. =D

(I mean you would put one resistor in series with each of the three switches, obviously; the greatest value resistor would result in the most dimming).

My answer to this is: Assign a value to each light switch (A,B,C) Start a timer for 3 minutes Flip switch A and B on After the 3 minutes is up, flip B off again. Go into the other room. The lighting bulb belongs to switch A The the other two light bulbs (one will be hot and one will be cold) The hot bulb belongs to switch B The cold bulb belongs to switch C.

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.

Implement a way of iterating through an array of integers and returning only duplicate values within the array, wasn't able to answer this one but did give me a hint abut using hashmaps to do it

import java.util.*; public class GetDuplicates { public static void main(String args[]){ // get input Scanner sc = new Scanner(System.in); ArrayList nums = new ArrayList(); while(sc.hasNext()) { String num = sc.next().trim(); if (num.equals("q")) break; nums.add(Integer.parseInt(num)); } Set set = new HashSet(); for(int n : nums) { if(set.contains(n)) { System.out.print(n + " "); } else { set.add(n); } } } }