<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	>
<channel>
	<title>Comments on: Amazon SDE in-person interview</title>
	<atom:link href="http://www.oliyiptong.com/blog/2006/05/30/amazon-sde-in-person-interview/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.oliyiptong.com/blog/2006/05/30/amazon-sde-in-person-interview/</link>
	<description></description>
	<pubDate>Thu, 04 Dec 2008 17:24:59 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6.2</generator>
		<item>
		<title>By: oli</title>
		<link>http://www.oliyiptong.com/blog/2006/05/30/amazon-sde-in-person-interview/#comment-69203</link>
		<dc:creator>oli</dc:creator>
		<pubDate>Mon, 11 Aug 2008 19:57:38 +0000</pubDate>
		<guid isPermaLink="false">http://www.oliyiptong.com/blog/?p=9#comment-69203</guid>
		<description>Assuming there are no duplicates, a tradeoff between space and running time can be made:

Make an array that can contains enough space for the difference between the largest and the smallest integer.
For 1 million integers, that makes it a minimum of 1 million bits.

We only need to store a bit of information, just 0 or 1.

Iterate through the list of integers, store a '1' bit to the corresponding index in the array.
When done, iterate through the array, and for each index, if the resulting bit is not 0, output the index.

Voilà!

If duplicates are in the mix, just store more than a bit...</description>
		<content:encoded><![CDATA[<p>Assuming there are no duplicates, a tradeoff between space and running time can be made:</p>
<p>Make an array that can contains enough space for the difference between the largest and the smallest integer.<br />
For 1 million integers, that makes it a minimum of 1 million bits.</p>
<p>We only need to store a bit of information, just 0 or 1.</p>
<p>Iterate through the list of integers, store a &#8216;1&#8242; bit to the corresponding index in the array.<br />
When done, iterate through the array, and for each index, if the resulting bit is not 0, output the index.</p>
<p>Voilà!</p>
<p>If duplicates are in the mix, just store more than a bit&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: David</title>
		<link>http://www.oliyiptong.com/blog/2006/05/30/amazon-sde-in-person-interview/#comment-66809</link>
		<dc:creator>David</dc:creator>
		<pubDate>Wed, 06 Aug 2008 12:54:53 +0000</pubDate>
		<guid isPermaLink="false">http://www.oliyiptong.com/blog/?p=9#comment-66809</guid>
		<description>Can you share the answer of Interview 3? You can send it to my email @ davylw@gmail.com.

I appreciate it.</description>
		<content:encoded><![CDATA[<p>Can you share the answer of Interview 3? You can send it to my email @ <a href="mailto:davylw@gmail.com">davylw@gmail.com</a>.</p>
<p>I appreciate it.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: oli</title>
		<link>http://www.oliyiptong.com/blog/2006/05/30/amazon-sde-in-person-interview/#comment-121</link>
		<dc:creator>oli</dc:creator>
		<pubDate>Mon, 07 Aug 2006 23:49:49 +0000</pubDate>
		<guid isPermaLink="false">http://www.oliyiptong.com/blog/?p=9#comment-121</guid>
		<description>i wish you good luck in your endeavours =)</description>
		<content:encoded><![CDATA[<p>i wish you good luck in your endeavours =)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mr Fuji</title>
		<link>http://www.oliyiptong.com/blog/2006/05/30/amazon-sde-in-person-interview/#comment-120</link>
		<dc:creator>Mr Fuji</dc:creator>
		<pubDate>Mon, 07 Aug 2006 22:16:12 +0000</pubDate>
		<guid isPermaLink="false">http://www.oliyiptong.com/blog/?p=9#comment-120</guid>
		<description>I had my 2nd phone interview over a week ago and no response whatsoever

they asked me some questions on design patterns and a data structure problem that had to deal with counting the number of times a word occurs in a file... he also asked me about a lot of terminology i don't remember from college.

oh wells time to move on</description>
		<content:encoded><![CDATA[<p>I had my 2nd phone interview over a week ago and no response whatsoever</p>
<p>they asked me some questions on design patterns and a data structure problem that had to deal with counting the number of times a word occurs in a file&#8230; he also asked me about a lot of terminology i don&#8217;t remember from college.</p>
<p>oh wells time to move on</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: oli</title>
		<link>http://www.oliyiptong.com/blog/2006/05/30/amazon-sde-in-person-interview/#comment-106</link>
		<dc:creator>oli</dc:creator>
		<pubDate>Thu, 27 Jul 2006 19:40:06 +0000</pubDate>
		<guid isPermaLink="false">http://www.oliyiptong.com/blog/?p=9#comment-106</guid>
		<description>I think it isn't mandatory to have a 2nd phone interview. Those interviews are screeners, to sift through people to find people interesting to them. So you must've been of some interest =). I wouldn't worry too much about the comment. Let me know how it goes and best of luck!</description>
		<content:encoded><![CDATA[<p>I think it isn&#8217;t mandatory to have a 2nd phone interview. Those interviews are screeners, to sift through people to find people interesting to them. So you must&#8217;ve been of some interest =). I wouldn&#8217;t worry too much about the comment. Let me know how it goes and best of luck!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mr Fuji</title>
		<link>http://www.oliyiptong.com/blog/2006/05/30/amazon-sde-in-person-interview/#comment-105</link>
		<dc:creator>Mr Fuji</dc:creator>
		<pubDate>Thu, 27 Jul 2006 08:06:48 +0000</pubDate>
		<guid isPermaLink="false">http://www.oliyiptong.com/blog/?p=9#comment-105</guid>
		<description>Well i had a phone interview today and they asked me similar questions which dealt with using hash tables and o notation stuff... among other few questions. i felt that i did about 50-60% ok, didn't know a lot of things. then the HR person calls me about an hour later and schedules a 2nd phone interview. is it amazon's policy to have a mandatory 2nd phone interview or do you think the first guy gave me the goahead for a 2nd one? he even implied i did not have enough experience for what his team was looking for.</description>
		<content:encoded><![CDATA[<p>Well i had a phone interview today and they asked me similar questions which dealt with using hash tables and o notation stuff&#8230; among other few questions. i felt that i did about 50-60% ok, didn&#8217;t know a lot of things. then the HR person calls me about an hour later and schedules a 2nd phone interview. is it amazon&#8217;s policy to have a mandatory 2nd phone interview or do you think the first guy gave me the goahead for a 2nd one? he even implied i did not have enough experience for what his team was looking for.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: oli</title>
		<link>http://www.oliyiptong.com/blog/2006/05/30/amazon-sde-in-person-interview/#comment-85</link>
		<dc:creator>oli</dc:creator>
		<pubDate>Sun, 23 Jul 2006 17:16:02 +0000</pubDate>
		<guid isPermaLink="false">http://www.oliyiptong.com/blog/?p=9#comment-85</guid>
		<description>hello mark, thanks for the comments =)

Alpha is the distance from the centre point to the first intersection of the perpendicular line. So Beta is the radius, going all the way to the circle from the centre point.

They don't time for a question and they usually try to find if you have some sense of things. You shouldn't worry about it too much! :) And don't get stuck thinking silently... always voice out what you're thinking about.
One interview takes a bit less than an hour, being 30 to 45 mins depending on what you talk about.

Good luck!
let me know how it goes!

Olivier</description>
		<content:encoded><![CDATA[<p>hello mark, thanks for the comments =)</p>
<p>Alpha is the distance from the centre point to the first intersection of the perpendicular line. So Beta is the radius, going all the way to the circle from the centre point.</p>
<p>They don&#8217;t time for a question and they usually try to find if you have some sense of things. You shouldn&#8217;t worry about it too much! <img src='http://www.oliyiptong.com/blog/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> And don&#8217;t get stuck thinking silently&#8230; always voice out what you&#8217;re thinking about.<br />
One interview takes a bit less than an hour, being 30 to 45 mins depending on what you talk about.</p>
<p>Good luck!<br />
let me know how it goes!</p>
<p>Olivier</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mark</title>
		<link>http://www.oliyiptong.com/blog/2006/05/30/amazon-sde-in-person-interview/#comment-84</link>
		<dc:creator>Mark</dc:creator>
		<pubDate>Sun, 23 Jul 2006 09:17:41 +0000</pubDate>
		<guid isPermaLink="false">http://www.oliyiptong.com/blog/?p=9#comment-84</guid>
		<description>Dude, Going through your interview questions in my leisure was fantastic!

I've got a phone interview with Amazon soon, I had no idea what to expect and I've garbage collected (in my brain) all that good stuff that they seem to be asking.

Thanks a ton for putting up this experience, really refreshed my mind about solving these trickly little algorithms. I'm sure these dudes don't ask the same thing twice, but good to know the style of questions sure gives me a heads up.

For the circle question, isn't both alpha and beta the radius, if the centre point is where it's supposed to be? unless beta is the angle, in which case that leaves only alpha.

Supposing the center point is shifted a bit elsewhere, neither alpha nor beta would be radius.

How much time did you have for each of those questions by the way?

Crossing the fingers for my own little phone interview.

-Mark

P.S. You are a good man for putting this online!</description>
		<content:encoded><![CDATA[<p>Dude, Going through your interview questions in my leisure was fantastic!</p>
<p>I&#8217;ve got a phone interview with Amazon soon, I had no idea what to expect and I&#8217;ve garbage collected (in my brain) all that good stuff that they seem to be asking.</p>
<p>Thanks a ton for putting up this experience, really refreshed my mind about solving these trickly little algorithms. I&#8217;m sure these dudes don&#8217;t ask the same thing twice, but good to know the style of questions sure gives me a heads up.</p>
<p>For the circle question, isn&#8217;t both alpha and beta the radius, if the centre point is where it&#8217;s supposed to be? unless beta is the angle, in which case that leaves only alpha.</p>
<p>Supposing the center point is shifted a bit elsewhere, neither alpha nor beta would be radius.</p>
<p>How much time did you have for each of those questions by the way?</p>
<p>Crossing the fingers for my own little phone interview.</p>
<p>-Mark</p>
<p>P.S. You are a good man for putting this online!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: oli</title>
		<link>http://www.oliyiptong.com/blog/2006/05/30/amazon-sde-in-person-interview/#comment-27</link>
		<dc:creator>oli</dc:creator>
		<pubDate>Sun, 04 Jun 2006 04:07:46 +0000</pubDate>
		<guid isPermaLink="false">http://www.oliyiptong.com/blog/?p=9#comment-27</guid>
		<description>yep i did!
unfortunately I didn't get the job =(
I don't feel so bad though, it appears i didn't have enough experience.
I have some good news though, I have an offer for here in TO and possibly more coming =)</description>
		<content:encoded><![CDATA[<p>yep i did!<br />
unfortunately I didn&#8217;t get the job =(<br />
I don&#8217;t feel so bad though, it appears i didn&#8217;t have enough experience.<br />
I have some good news though, I have an offer for here in TO and possibly more coming =)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Calvin</title>
		<link>http://www.oliyiptong.com/blog/2006/05/30/amazon-sde-in-person-interview/#comment-26</link>
		<dc:creator>Calvin</dc:creator>
		<pubDate>Sat, 03 Jun 2006 19:25:20 +0000</pubDate>
		<guid isPermaLink="false">http://www.oliyiptong.com/blog/?p=9#comment-26</guid>
		<description>Hehe... so did you get back the results of the interview?</description>
		<content:encoded><![CDATA[<p>Hehe&#8230; so did you get back the results of the interview?</p>
]]></content:encoded>
	</item>
</channel>
</rss>

<!-- Dynamic Page Served (once) in 1.982 seconds -->
<!-- Cached page served by WP-Cache -->
