<?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: The Amazon SDE Phone Interview</title>
	<atom:link href="http://www.oliyiptong.com/blog/2006/05/21/the-amazon-phone-interview/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.oliyiptong.com/blog/2006/05/21/the-amazon-phone-interview/</link>
	<description></description>
	<pubDate>Thu, 04 Dec 2008 19:31:43 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6.2</generator>
		<item>
		<title>By: nav</title>
		<link>http://www.oliyiptong.com/blog/2006/05/21/the-amazon-phone-interview/#comment-31295</link>
		<dc:creator>nav</dc:creator>
		<pubDate>Sun, 28 Oct 2007 07:51:54 +0000</pubDate>
		<guid isPermaLink="false">http://www.oliyiptong.com/blog/?p=5#comment-31295</guid>
		<description>Hey Oli,

hope u r doing great at amazon... but can u please tell me....
what are the answers for the database cant do more than 2000 concurrent queries.. and webserver to support more than the number of concurrent requests it could do...questions please...</description>
		<content:encoded><![CDATA[<p>Hey Oli,</p>
<p>hope u r doing great at amazon&#8230; but can u please tell me&#8230;.<br />
what are the answers for the database cant do more than 2000 concurrent queries.. and webserver to support more than the number of concurrent requests it could do&#8230;questions please&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: oli</title>
		<link>http://www.oliyiptong.com/blog/2006/05/21/the-amazon-phone-interview/#comment-12399</link>
		<dc:creator>oli</dc:creator>
		<pubDate>Wed, 16 May 2007 02:09:25 +0000</pubDate>
		<guid isPermaLink="false">http://www.oliyiptong.com/blog/?p=5#comment-12399</guid>
		<description>Hello Ariana,

The solution to the O(n) array sorting problem is to be using a memory trade off for running time. You should check out bucket sort as well.
For solutions, please check out the comments in the article with the questions at http://www.oliyiptong.com/blog/2006/05/30/amazon-sde-in-person-interview/#comments</description>
		<content:encoded><![CDATA[<p>Hello Ariana,</p>
<p>The solution to the O(n) array sorting problem is to be using a memory trade off for running time. You should check out bucket sort as well.<br />
For solutions, please check out the comments in the article with the questions at <a href="http://www.oliyiptong.com/blog/2006/05/30/amazon-sde-in-person-interview/#comments" rel="nofollow" >http://www.oliyiptong.com/blog/2006/05/30/amazon-sde-in-person-interview/#comments</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ariana</title>
		<link>http://www.oliyiptong.com/blog/2006/05/21/the-amazon-phone-interview/#comment-10415</link>
		<dc:creator>Ariana</dc:creator>
		<pubDate>Thu, 03 May 2007 17:57:23 +0000</pubDate>
		<guid isPermaLink="false">http://www.oliyiptong.com/blog/?p=5#comment-10415</guid>
		<description>What is the solution to question on interview 3 related to sorting the array on o(n)?What about the one with the file?</description>
		<content:encoded><![CDATA[<p>What is the solution to question on interview 3 related to sorting the array on o(n)?What about the one with the file?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: joseph</title>
		<link>http://www.oliyiptong.com/blog/2006/05/21/the-amazon-phone-interview/#comment-10</link>
		<dc:creator>joseph</dc:creator>
		<pubDate>Wed, 24 May 2006 06:29:35 +0000</pubDate>
		<guid isPermaLink="false">http://www.oliyiptong.com/blog/?p=5#comment-10</guid>
		<description>I enjoyed visting your blog. Happy to learn about WEB 2.0.Nous parfois blier ki Amazon evoque ene la jungle a decouvrir avec boucoup possiblite tout en etant sauvage....un monde a decouvrir et a exploiter...
To blog tout en etant neat et sombre dans l ambiance, donc conservateur, contient pas sujet a la page!
bonne continuation...</description>
		<content:encoded><![CDATA[<p>I enjoyed visting your blog. Happy to learn about WEB 2.0.Nous parfois blier ki Amazon evoque ene la jungle a decouvrir avec boucoup possiblite tout en etant sauvage&#8230;.un monde a decouvrir et a exploiter&#8230;<br />
To blog tout en etant neat et sombre dans l ambiance, donc conservateur, contient pas sujet a la page!<br />
bonne continuation&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: oli</title>
		<link>http://www.oliyiptong.com/blog/2006/05/21/the-amazon-phone-interview/#comment-9</link>
		<dc:creator>oli</dc:creator>
		<pubDate>Tue, 23 May 2006 07:27:23 +0000</pubDate>
		<guid isPermaLink="false">http://www.oliyiptong.com/blog/?p=5#comment-9</guid>
		<description>heh good news i got the 2nd interview for next wednesday. I'll post the questions then! =)

Thanks for the comments, it feels nice!</description>
		<content:encoded><![CDATA[<p>heh good news i got the 2nd interview for next wednesday. I&#8217;ll post the questions then! =)</p>
<p>Thanks for the comments, it feels nice!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Eddy Young</title>
		<link>http://www.oliyiptong.com/blog/2006/05/21/the-amazon-phone-interview/#comment-8</link>
		<dc:creator>Eddy Young</dc:creator>
		<pubDate>Mon, 22 May 2006 21:01:16 +0000</pubDate>
		<guid isPermaLink="false">http://www.oliyiptong.com/blog/?p=5#comment-8</guid>
		<description>Have you considered registering your blog on Mauritius Blog Tracker? 

Anyway, I hope you get called for a second interview.</description>
		<content:encoded><![CDATA[<p>Have you considered registering your blog on Mauritius Blog Tracker? </p>
<p>Anyway, I hope you get called for a second interview.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ian C</title>
		<link>http://www.oliyiptong.com/blog/2006/05/21/the-amazon-phone-interview/#comment-7</link>
		<dc:creator>Ian C</dc:creator>
		<pubDate>Mon, 22 May 2006 05:25:25 +0000</pubDate>
		<guid isPermaLink="false">http://www.oliyiptong.com/blog/?p=5#comment-7</guid>
		<description>Nice work Olivier, hope you get the job.  If not, you can always fall back as a pro gamer ;)

-Ian</description>
		<content:encoded><![CDATA[<p>Nice work Olivier, hope you get the job.  If not, you can always fall back as a pro gamer <img src='http://www.oliyiptong.com/blog/wp-includes/images/smilies/icon_wink.gif' alt=';)' class='wp-smiley' /> </p>
<p>-Ian</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Pat</title>
		<link>http://www.oliyiptong.com/blog/2006/05/21/the-amazon-phone-interview/#comment-6</link>
		<dc:creator>Pat</dc:creator>
		<pubDate>Mon, 22 May 2006 02:18:57 +0000</pubDate>
		<guid isPermaLink="false">http://www.oliyiptong.com/blog/?p=5#comment-6</guid>
		<description>Yo Oli ki p dir... to banes interviews la parete mari tough! Congrats pou to graduation... pane trop gagne l'occasion coz ar toi online, travail p casse fesse, mais mo esperer tou corek cot toi... Bon courage et bonne chance pou to banes interviews!

Cheers!

Pat (o kas to pa p coner ki Pat sa, mo singapour la...:p)</description>
		<content:encoded><![CDATA[<p>Yo Oli ki p dir&#8230; to banes interviews la parete mari tough! Congrats pou to graduation&#8230; pane trop gagne l&#8217;occasion coz ar toi online, travail p casse fesse, mais mo esperer tou corek cot toi&#8230; Bon courage et bonne chance pou to banes interviews!</p>
<p>Cheers!</p>
<p>Pat (o kas to pa p coner ki Pat sa, mo singapour la&#8230;:p)</p>
]]></content:encoded>
	</item>
</channel>
</rss>

<!-- Dynamic Page Served (once) in 2.814 seconds -->
