Comments on: Google Phone Interview (Part 2) http://haroonsaeed.wordpress.com/2006/07/19/google-phone-interview-part-2/ Why am I fighting to live, if I am living to die ? Fri, 23 Oct 2009 07:18:39 +0000 http://wordpress.com/ hourly 1 By: RISTLTMB- Redux « No really- we are still trying to get pregnant. http://haroonsaeed.wordpress.com/2006/07/19/google-phone-interview-part-2/#comment-27581 RISTLTMB- Redux « No really- we are still trying to get pregnant. Tue, 16 Dec 2008 12:13:22 +0000 https://haroonsaeed.wordpress.com/2006/07/19/google-phone-interview-part-2/#comment-27581 [...] Maybe you will know. [...] [...] Maybe you will know. [...]

]]> By: Osama http://haroonsaeed.wordpress.com/2006/07/19/google-phone-interview-part-2/#comment-27576 Osama Mon, 15 Dec 2008 23:15:16 +0000 https://haroonsaeed.wordpress.com/2006/07/19/google-phone-interview-part-2/#comment-27576 I have a phone interview tomorrow I applied for an internship. Do you think that the questions will be hard. i have a very small experience in java. I am scared to death that i will screw up. I have a phone interview tomorrow
I applied for an internship.
Do you think that the questions will be hard. i have a very small experience in java. I am scared to death that i will screw up.

]]> By: Phil http://haroonsaeed.wordpress.com/2006/07/19/google-phone-interview-part-2/#comment-24922 Phil Mon, 28 Jan 2008 16:33:54 +0000 https://haroonsaeed.wordpress.com/2006/07/19/google-phone-interview-part-2/#comment-24922 great post haroon! good for other people preparing for phone screens. Raghavendra your solution is just the greedy solution. In your example, try 1786. The best solution is {529,529,728}, but your algorithm won't find that. Dynamic Programming isn't just jargon. It's a technique for solving problems like this. You should read up on it for your next interview :) great post haroon! good for other people preparing for phone screens.

Raghavendra your solution is just the greedy solution. In your example, try 1786. The best solution is {529,529,728}, but your algorithm won’t find that.

Dynamic Programming isn’t just jargon. It’s a technique for solving problems like this. You should read up on it for your next interview :)

]]> By: Raghavendra Anahosur http://haroonsaeed.wordpress.com/2006/07/19/google-phone-interview-part-2/#comment-24477 Raghavendra Anahosur Fri, 28 Dec 2007 18:03:54 +0000 https://haroonsaeed.wordpress.com/2006/07/19/google-phone-interview-part-2/#comment-24477 Regarding the coin denomination problem, I have got a solution which is faster than the dynamic programming one. Here is my solution: For each of the denomination index from 1 to max(index), calculate how many coins are needed where the coins are from index to n. Then calculate for this loop which was the lowest by having a temporary counter. not sure if the above is clear. here it goes. suppose the coins are 1,17, 201,529, 728 (just being hypothetical) The maxchange is 10000000. Here is how we have to loop thru 728,529,201,17,1 1. Take all of the coins and arrive at the solution so divide 10000000 by 728. The remainder will be divided by 529. The remainder will be divided 201, and so on. The total number of coins is the sum of all the integer divisions ie (10000000/728) + (remainder / 529) + (remainder / 201) .... 2. Take all the coins from 529 thru 1 (exclude the first one - 728) find out the total number of coins. 3. Take all the coins from 201 thru 1 (exclude the first one and second one) find out the total number of coins 4. and so on, finally we will have only one coin - 1 to consider and number of coins will be 10000000. Have a minCoins variable with Integer.MAX_VALUE. For each of above iterations above, change value of minCoins to the total number of coins found in each of scenario. The main advantage of this solution is, looping is only for the number of denominations not for the amount. In the dynamic programming solution (which is a big jargon) we loop thru the amount. This is under the assumption that the denominations will always be less in number, the amount can be higher (which is a good assumption to make. I dont think anyone will face a situation where coins are 1, 5,15,21, 56 and amount is like 10 or 15) I have seen that my solution works much faster for higher amount when compared with dynamic programming concept. Regarding the coin denomination problem, I have got a solution which is faster than the dynamic programming one.

Here is my solution:

For each of the denomination index from 1 to max(index),
calculate how many coins are needed where the coins are from index to n.
Then calculate for this loop which was the lowest by having a temporary counter.

not sure if the above is clear. here it goes.

suppose the coins are 1,17, 201,529, 728 (just being hypothetical)
The maxchange is 10000000.

Here is how we have to loop thru 728,529,201,17,1

1. Take all of the coins and arrive at the solution
so divide 10000000 by 728.
The remainder will be divided by 529. The remainder will be divided 201, and so on.
The total number of coins is the sum of all the integer divisions ie (10000000/728) + (remainder / 529) + (remainder / 201) ….

2. Take all the coins from 529 thru 1 (exclude the first one – 728)
find out the total number of coins.
3. Take all the coins from 201 thru 1 (exclude the first one and second one)
find out the total number of coins
4. and so on, finally we will have only one coin – 1 to consider and number of coins will be 10000000.

Have a minCoins variable with Integer.MAX_VALUE. For each of above iterations above, change value of minCoins to the total number of coins found in each of scenario.

The main advantage of this solution is, looping is only for the number of denominations not for the amount. In the dynamic programming solution (which is a big jargon) we loop thru the amount.

This is under the assumption that the denominations will always be less in number, the amount can be higher (which is a good assumption to make. I dont think anyone will face a situation where coins are 1, 5,15,21, 56 and amount is like 10 or 15)

I have seen that my solution works much faster for higher amount when compared with dynamic programming concept.

]]> By: bhavin patel http://haroonsaeed.wordpress.com/2006/07/19/google-phone-interview-part-2/#comment-23305 bhavin patel Fri, 02 Nov 2007 01:07:02 +0000 https://haroonsaeed.wordpress.com/2006/07/19/google-phone-interview-part-2/#comment-23305 I finished my phone interview with google. They asked me following questions: 1. What is the best successful project you have done in your career. explain 2. How would u define variables in VBA and how would u release the value. 3. How many mcDonalds are there in Australia. 4. Imagine you have 10000 computer network and you are the admin of this network. how would you monitor the performance and how would you rectify the problem. thanks bhavin I finished my phone interview with google. They asked me following questions:
1. What is the best successful project you have done in your career. explain
2. How would u define variables in VBA and how would u release the value.
3. How many mcDonalds are there in Australia.
4. Imagine you have 10000 computer network and you are the admin of this network. how would you monitor the performance and how would you rectify the problem.

thanks
bhavin

]]> By: bhavin patel http://haroonsaeed.wordpress.com/2006/07/19/google-phone-interview-part-2/#comment-22806 bhavin patel Mon, 15 Oct 2007 02:23:21 +0000 https://haroonsaeed.wordpress.com/2006/07/19/google-phone-interview-part-2/#comment-22806 i have a phone interview this friday about database administrator. i have no idea how to prepare for the interview.. any idea freinds? i have a phone interview this friday about database administrator. i have no idea how to prepare for the interview.. any idea freinds?

]]> By: Preguntas curiosas que te pueden hacer durante una entrevista en Google http://haroonsaeed.wordpress.com/2006/07/19/google-phone-interview-part-2/#comment-21625 Preguntas curiosas que te pueden hacer durante una entrevista en Google Wed, 12 Sep 2007 12:30:53 +0000 https://haroonsaeed.wordpress.com/2006/07/19/google-phone-interview-part-2/#comment-21625 [...] preguntas como las que se comentan en algunos blogs y medios convencionales ([1], [2], [3], [4], [5], [6], [...] [...] preguntas como las que se comentan en algunos blogs y medios convencionales ([1], [2], [3], [4], [5], [6], [...]

]]> By: Bitacora del Destino » Preguntas curiosas que te pueden hacer durante una entrevista en Google http://haroonsaeed.wordpress.com/2006/07/19/google-phone-interview-part-2/#comment-21559 Bitacora del Destino » Preguntas curiosas que te pueden hacer durante una entrevista en Google Mon, 10 Sep 2007 14:34:03 +0000 https://haroonsaeed.wordpress.com/2006/07/19/google-phone-interview-part-2/#comment-21559 [...] preguntas como las que se comentan en algunos blogs y medios convencionales ([1], [2], [3], [4], [5], [6], [...] [...] preguntas como las que se comentan en algunos blogs y medios convencionales ([1], [2], [3], [4], [5], [6], [...]

]]> By: tanay http://haroonsaeed.wordpress.com/2006/07/19/google-phone-interview-part-2/#comment-21557 tanay Mon, 10 Sep 2007 14:05:37 +0000 https://haroonsaeed.wordpress.com/2006/07/19/google-phone-interview-part-2/#comment-21557 Hi i have a telefone interview of gppgle next week.....i have applied for a Soft Engg,I have applied for freshers graduate, what typical questions they can ask on the telephone?? Hi i have a telefone interview of gppgle next week…..i have applied for a Soft Engg,I have applied for freshers graduate, what typical questions they can ask on the telephone??

]]> By: Karthik Upadrasta http://haroonsaeed.wordpress.com/2006/07/19/google-phone-interview-part-2/#comment-20698 Karthik Upadrasta Sat, 18 Aug 2007 14:31:20 +0000 https://haroonsaeed.wordpress.com/2006/07/19/google-phone-interview-part-2/#comment-20698 Thank you Thank you

]]> By: Deepak http://haroonsaeed.wordpress.com/2006/07/19/google-phone-interview-part-2/#comment-336 Deepak Mon, 04 Sep 2006 16:59:10 +0000 https://haroonsaeed.wordpress.com/2006/07/19/google-phone-interview-part-2/#comment-336 Hey kart, what questions were u asked for ur interviews...I have a Google phone interview coming up next week for a software Engineer position... Hey kart,
what questions were u asked for ur interviews…I have a Google phone interview coming up next week for a software Engineer position…

]]> By: Kart http://haroonsaeed.wordpress.com/2006/07/19/google-phone-interview-part-2/#comment-263 Kart Fri, 04 Aug 2006 08:19:20 +0000 https://haroonsaeed.wordpress.com/2006/07/19/google-phone-interview-part-2/#comment-263 Very good post. Even I attended a phone interview and waiting for the second round. Any updates on ur interview results? Very good post.
Even I attended a phone interview and waiting for the second round. Any updates on ur interview results?

]]>