<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" media="screen" href="/~d/styles/rss2full.xsl"?><?xml-stylesheet type="text/css" media="screen" href="http://feeds.feedburner.com/~d/styles/itemcontent.css"?><rss xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:media="http://search.yahoo.com/mrss/" xmlns:yt="http://gdata.youtube.com/schemas/2007" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:feedburner="http://rssnamespace.org/feedburner/ext/1.0" version="2.0">
   <channel>
      <title>CareerCup RSS Feed</title>
      <description>Pipes Output</description>
      <link>http://pipes.yahoo.com/pipes/pipe.info?_id=9cdd4e106d25e5cec09be2b8953faf1e</link>
      <atom:link rel="next" href="http://pipes.yahoo.com/pipes/pipe.run?_id=9cdd4e106d25e5cec09be2b8953faf1e&amp;_render=rss&amp;page=2" />
      <pubDate>Wed, 22 May 2013 04:26:06 +0000</pubDate>
      <generator>http://pipes.yahoo.com/pipes/</generator>
      <atom10:link xmlns:atom10="http://www.w3.org/2005/Atom" rel="self" type="application/rss+xml" href="http://feeds.feedburner.com/Careercup" /><feedburner:info uri="careercup" /><atom10:link xmlns:atom10="http://www.w3.org/2005/Atom" rel="hub" href="http://pubsubhubbub.appspot.com/" /><feedburner:emailServiceId>Careercup</feedburner:emailServiceId><feedburner:feedburnerHostname>http://feedburner.google.com</feedburner:feedburnerHostname><feedburner:feedFlare href="http://add.my.yahoo.com/rss?url=http%3A%2F%2Ffeeds.feedburner.com%2FCareercup" src="http://us.i1.yimg.com/us.yimg.com/i/us/my/addtomyyahoo4.gif">Subscribe with My Yahoo!</feedburner:feedFlare><feedburner:feedFlare href="http://www.newsgator.com/ngs/subscriber/subext.aspx?url=http%3A%2F%2Ffeeds.feedburner.com%2FCareercup" src="http://www.newsgator.com/images/ngsub1.gif">Subscribe with NewsGator</feedburner:feedFlare><feedburner:feedFlare href="http://www.bloglines.com/sub/http://feeds.feedburner.com/Careercup" src="http://www.bloglines.com/images/sub_modern11.gif">Subscribe with Bloglines</feedburner:feedFlare><feedburner:feedFlare href="http://www.netvibes.com/subscribe.php?url=http%3A%2F%2Ffeeds.feedburner.com%2FCareercup" src="http://www.netvibes.com/img/add2netvibes.gif">Subscribe with Netvibes</feedburner:feedFlare><feedburner:feedFlare href="http://fusion.google.com/add?feedurl=http%3A%2F%2Ffeeds.feedburner.com%2FCareercup" src="http://buttons.googlesyndication.com/fusion/add.gif">Subscribe with Google</feedburner:feedFlare><feedburner:feedFlare href="http://www.pageflakes.com/subscribe.aspx?url=http%3A%2F%2Ffeeds.feedburner.com%2FCareercup" src="http://www.pageflakes.com/ImageFile.ashx?instanceId=Static_4&amp;fileName=ATP_blu_91x17.gif">Subscribe with Pageflakes</feedburner:feedFlare><item>
         <title>CareerCup: New Interview Question for 
            Akamai</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/gWcXVWplGfc/question</link>
         <description>&lt;div style="border:1px solid #656E72;width:600px;"&gt;
			&lt;div style="border-bottom:1px dotted #656E72;padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com"&gt;&lt;img src="http://www.careercup.com/images/logo.gif" style="border:0;"&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18471684" style="text-decoration:none;"&gt;&lt;span style="color:#1E6CB6;font-weight:bold;font-size:18px;"&gt;Interview Question for 
	            Akamai
	            
	            
	            &lt;/span&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;p&gt; You are given a long list of integers, so long that you can not fit the entire list into memory, implement an algorithm to get the max 100 elements in the list. &lt;/p&gt; &lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18471684"&gt;View &amp;raquo;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="font-size:10px;padding:10px;"&gt;
				Posted by markus.schal on May 21, 2013
			&lt;/div&gt;
		&lt;/div&gt;</description>
         <guid isPermaLink="false">http://www.careercup.com/question?id=18471684</guid>
      <feedburner:origLink>http://www.careercup.com/question?id=18471684</feedburner:origLink></item>
      <item>
         <title>CareerCup: New Interview Question for</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/mcs4IeduY3U/question</link>
         <description>&lt;div style="border:1px solid #656E72;width:600px;"&gt;
			&lt;div style="border-bottom:1px dotted #656E72;padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com"&gt;&lt;img src="http://www.careercup.com/images/logo.gif" style="border:0;"&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18753666" style="text-decoration:none;"&gt;&lt;span style="color:#1E6CB6;font-weight:bold;font-size:18px;"&gt;Interview Question for 
	            
	            &lt;/span&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;p&gt;Given these 4 commands :increment, zero, assign, loop. Define these 4 function: Decrement, Divide, test If equal (pseudo code).&lt;/p&gt; &lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18753666"&gt;View &amp;raquo;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="font-size:10px;padding:10px;"&gt;
				Posted by Sam on May 21, 2013
			&lt;/div&gt;
		&lt;/div&gt;</description>
         <guid isPermaLink="false">http://www.careercup.com/question?id=18753666</guid>
      <feedburner:origLink>http://www.careercup.com/question?id=18753666</feedburner:origLink></item>
      <item>
         <title>CareerCup: New Interview Question for 
            Amazon</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/_B9xdraZ2dw/question</link>
         <description>&lt;div style="border:1px solid #656E72;width:600px;"&gt;
			&lt;div style="border-bottom:1px dotted #656E72;padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com"&gt;&lt;img src="http://www.careercup.com/images/logo.gif" style="border:0;"&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18536687" style="text-decoration:none;"&gt;&lt;span style="color:#1E6CB6;font-weight:bold;font-size:18px;"&gt;Interview Question for 
	            Amazon
	            
	            
	            &lt;/span&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;p&gt;You have an array of binary numbers as &amp;quot;00001101000001010100000...&amp;quot;... We need to find the First occurrence of 1 in this series.. using binary search. &lt;/p&gt;

&lt;p&gt;we need to design an algorithm  of complexity less than O(n).. and we need to use binary search strictly..&lt;/p&gt; &lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18536687"&gt;View &amp;raquo;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="font-size:10px;padding:10px;"&gt;
				Posted by imvrajendra on May 21, 2013
			&lt;/div&gt;
		&lt;/div&gt;</description>
         <guid isPermaLink="false">http://www.careercup.com/question?id=18536687</guid>
      <feedburner:origLink>http://www.careercup.com/question?id=18536687</feedburner:origLink></item>
      <item>
         <title>CareerCup: New Interview Question for</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/mfFDTMn6xP4/question</link>
         <description>&lt;div style="border:1px solid #656E72;width:600px;"&gt;
			&lt;div style="border-bottom:1px dotted #656E72;padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com"&gt;&lt;img src="http://www.careercup.com/images/logo.gif" style="border:0;"&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18716668" style="text-decoration:none;"&gt;&lt;span style="color:#1E6CB6;font-weight:bold;font-size:18px;"&gt;Interview Question for 
	            
	            &lt;/span&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;p&gt;Using these 3 functions:&lt;br /&gt;{{{&lt;br /&gt;INCREMENT:&lt;br /&gt;    READ N1&lt;br /&gt;    WRITE N1 + 1&lt;/p&gt;

&lt;p&gt;MINUS:&lt;br /&gt;    READ N1, N2&lt;br /&gt;    WRITE N1 - N2&lt;/p&gt;

&lt;p&gt;MULTIPLY:&lt;br /&gt;    READ N1,N2&lt;br /&gt;    WRITE N1*N2&lt;br /&gt;}}}&lt;/p&gt;

&lt;p&gt;Define these four functions: Greater than, Equality, Nonequality, Divide.&lt;/p&gt; &lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18716668"&gt;View &amp;raquo;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="font-size:10px;padding:10px;"&gt;
				Posted by Sam on May 21, 2013
			&lt;/div&gt;
		&lt;/div&gt;</description>
         <guid isPermaLink="false">http://www.careercup.com/question?id=18716668</guid>
      <feedburner:origLink>http://www.careercup.com/question?id=18716668</feedburner:origLink></item>
      <item>
         <title>CareerCup: New Interview Question for</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/7SIZ51Grf1g/question</link>
         <description>&lt;div style="border:1px solid #656E72;width:600px;"&gt;
			&lt;div style="border-bottom:1px dotted #656E72;padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com"&gt;&lt;img src="http://www.careercup.com/images/logo.gif" style="border:0;"&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18717665" style="text-decoration:none;"&gt;&lt;span style="color:#1E6CB6;font-weight:bold;font-size:18px;"&gt;Interview Question for 
	            
	            &lt;/span&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;p&gt;How can you implement multiplication operator using increment operator (No arithmetic operation is allowed)?&lt;/p&gt; &lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18717665"&gt;View &amp;raquo;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="font-size:10px;padding:10px;"&gt;
				Posted by Sam on May 21, 2013
			&lt;/div&gt;
		&lt;/div&gt;</description>
         <guid isPermaLink="false">http://www.careercup.com/question?id=18717665</guid>
      <feedburner:origLink>http://www.careercup.com/question?id=18717665</feedburner:origLink></item>
      <item>
         <title>CareerCup: New Interview Question for 
            Expedia</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/ZiIKw7Jk8P4/question</link>
         <description>&lt;div style="border:1px solid #656E72;width:600px;"&gt;
			&lt;div style="border-bottom:1px dotted #656E72;padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com"&gt;&lt;img src="http://www.careercup.com/images/logo.gif" style="border:0;"&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18716666" style="text-decoration:none;"&gt;&lt;span style="color:#1E6CB6;font-weight:bold;font-size:18px;"&gt;Interview Question for 
	            Expedia
	            
	            
	            &lt;/span&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;p&gt;Write a function to evaluate a string that has only integers, and operators &amp;#39;+&amp;#39; &amp;amp; &amp;#39;*&amp;#39;. The evaluation should be done in a single pass.  For example passing &amp;quot;3*2+5*6&amp;quot; should result in this function returning 36.&lt;/p&gt; &lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18716666"&gt;View &amp;raquo;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="font-size:10px;padding:10px;"&gt;
				Posted by jyothiprasadb on May 21, 2013
			&lt;/div&gt;
		&lt;/div&gt;</description>
         <guid isPermaLink="false">http://www.careercup.com/question?id=18716666</guid>
      <feedburner:origLink>http://www.careercup.com/question?id=18716666</feedburner:origLink></item>
      <item>
         <title>CareerCup: New Interview Question for 
            Expedia</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/-BMkfGrMUCE/question</link>
         <description>&lt;div style="border:1px solid #656E72;width:600px;"&gt;
			&lt;div style="border-bottom:1px dotted #656E72;padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com"&gt;&lt;img src="http://www.careercup.com/images/logo.gif" style="border:0;"&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18717664" style="text-decoration:none;"&gt;&lt;span style="color:#1E6CB6;font-weight:bold;font-size:18px;"&gt;Interview Question for 
	            Expedia
	            
	            
	            &lt;/span&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;p&gt;Write a function fix a loop in the linked list based on the assumption that the linked list is sorted. &lt;/p&gt; &lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18717664"&gt;View &amp;raquo;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="font-size:10px;padding:10px;"&gt;
				Posted by jyothiprasadb on May 21, 2013
			&lt;/div&gt;
		&lt;/div&gt;</description>
         <guid isPermaLink="false">http://www.careercup.com/question?id=18717664</guid>
      <feedburner:origLink>http://www.careercup.com/question?id=18717664</feedburner:origLink></item>
      <item>
         <title>CareerCup: New Interview Question for 
            Expedia</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/qaGLL4kX0yQ/question</link>
         <description>&lt;div style="border:1px solid #656E72;width:600px;"&gt;
			&lt;div style="border-bottom:1px dotted #656E72;padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com"&gt;&lt;img src="http://www.careercup.com/images/logo.gif" style="border:0;"&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18484666" style="text-decoration:none;"&gt;&lt;span style="color:#1E6CB6;font-weight:bold;font-size:18px;"&gt;Interview Question for 
	            Expedia
	            
	            
	            &lt;/span&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;p&gt;How would you find if a linked list has a loop? How would you do it without using additional memory, if the linked list is sorted. &lt;/p&gt; &lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18484666"&gt;View &amp;raquo;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="font-size:10px;padding:10px;"&gt;
				Posted by jyothiprasadb on May 21, 2013
			&lt;/div&gt;
		&lt;/div&gt;</description>
         <guid isPermaLink="false">http://www.careercup.com/question?id=18484666</guid>
      <feedburner:origLink>http://www.careercup.com/question?id=18484666</feedburner:origLink></item>
      <item>
         <title>CareerCup: New Interview Question for 
            Oracle</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/q5PFpOOydTs/question</link>
         <description>&lt;div style="border:1px solid #656E72;width:600px;"&gt;
			&lt;div style="border-bottom:1px dotted #656E72;padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com"&gt;&lt;img src="http://www.careercup.com/images/logo.gif" style="border:0;"&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18723662" style="text-decoration:none;"&gt;&lt;span style="color:#1E6CB6;font-weight:bold;font-size:18px;"&gt;Interview Question for 
	            Oracle
	            
	            
	            &lt;/span&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;p&gt;Write a function to find a key in Hash map if the value associated to that key is given as input. As a followup, swap key &amp;amp; value assuming that value is not equal to any of the existing keys.&lt;/p&gt; &lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18723662"&gt;View &amp;raquo;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="font-size:10px;padding:10px;"&gt;
				Posted by jyothiprasadb on May 21, 2013
			&lt;/div&gt;
		&lt;/div&gt;</description>
         <guid isPermaLink="false">http://www.careercup.com/question?id=18723662</guid>
      <feedburner:origLink>http://www.careercup.com/question?id=18723662</feedburner:origLink></item>
      <item>
         <title>CareerCup: New Interview Question for 
            Oracle</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/L6VZKF7h824/question</link>
         <description>&lt;div style="border:1px solid #656E72;width:600px;"&gt;
			&lt;div style="border-bottom:1px dotted #656E72;padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com"&gt;&lt;img src="http://www.careercup.com/images/logo.gif" style="border:0;"&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18722662" style="text-decoration:none;"&gt;&lt;span style="color:#1E6CB6;font-weight:bold;font-size:18px;"&gt;Interview Question for 
	            Oracle
	            
	            
	            &lt;/span&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;p&gt;Write a function to perform string replace without using any inbuilt functions.&lt;/p&gt; &lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18722662"&gt;View &amp;raquo;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="font-size:10px;padding:10px;"&gt;
				Posted by jyothiprasadb on May 21, 2013
			&lt;/div&gt;
		&lt;/div&gt;</description>
         <guid isPermaLink="false">http://www.careercup.com/question?id=18722662</guid>
      <feedburner:origLink>http://www.careercup.com/question?id=18722662</feedburner:origLink></item>
      <item>
         <title>CareerCup: New Interview Question for</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/dNe9941KaEU/question</link>
         <description>&lt;div style="border:1px solid #656E72;width:600px;"&gt;
			&lt;div style="border-bottom:1px dotted #656E72;padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com"&gt;&lt;img src="http://www.careercup.com/images/logo.gif" style="border:0;"&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18536673" style="text-decoration:none;"&gt;&lt;span style="color:#1E6CB6;font-weight:bold;font-size:18px;"&gt;Interview Question for 
	            
	            &lt;/span&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;p&gt;// Given two lists of strings build a new list that has all strings that appear in both the original lists. If the same string appears more than once output it as many times as it appears in both lists&lt;br /&gt;// &lt;br /&gt;// Example:&lt;br /&gt;// &amp;quot;dog&amp;quot;, &amp;quot;bird&amp;quot;, &amp;quot;elephant&amp;quot;, &amp;quot;dog&amp;quot;, &amp;quot;dog&amp;quot;, &amp;quot;cat&amp;quot;&lt;br /&gt;// &amp;quot;cat&amp;quot;, &amp;quot;dog&amp;quot;, &amp;quot;dog&amp;quot;, &amp;quot;cat&amp;quot;, &amp;quot;cat&amp;quot;, &amp;quot;fish&amp;quot;&lt;br /&gt;// Result (order doesn&amp;#39;t matter)&lt;br /&gt;// &amp;quot;dog&amp;quot;, &amp;quot;dog&amp;quot;, &amp;quot;cat&amp;quot;&lt;/p&gt; &lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18536673"&gt;View &amp;raquo;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="font-size:10px;padding:10px;"&gt;
				Posted by Sonia on May 20, 2013
			&lt;/div&gt;
		&lt;/div&gt;</description>
         <guid isPermaLink="false">http://www.careercup.com/question?id=18536673</guid>
      <feedburner:origLink>http://www.careercup.com/question?id=18536673</feedburner:origLink></item>
      <item>
         <title>CareerCup: New Interview Question for</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/OLPP2rB7o6I/question</link>
         <description>&lt;div style="border:1px solid #656E72;width:600px;"&gt;
			&lt;div style="border-bottom:1px dotted #656E72;padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com"&gt;&lt;img src="http://www.careercup.com/images/logo.gif" style="border:0;"&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18529667" style="text-decoration:none;"&gt;&lt;span style="color:#1E6CB6;font-weight:bold;font-size:18px;"&gt;Interview Question for 
	            
	            &lt;/span&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;p&gt;//Given an array of NxN, print its diagonals from top-right to bottom-left.&lt;/p&gt;

&lt;p&gt;//Sample Input: &lt;br /&gt;//        [[1, 2, 3],&lt;br /&gt;//         [4, 5, 6],&lt;br /&gt;//         [7, 8, 9]]&lt;/p&gt;

&lt;p&gt;//Sample Output: &lt;br /&gt;//1, &lt;br /&gt;//2, 4, &lt;br /&gt;//3, 5, 7, &lt;br /&gt;//6, 8, &lt;br /&gt;//9&lt;/p&gt; &lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18529667"&gt;View &amp;raquo;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="font-size:10px;padding:10px;"&gt;
				Posted by Sonia on May 20, 2013
			&lt;/div&gt;
		&lt;/div&gt;</description>
         <guid isPermaLink="false">http://www.careercup.com/question?id=18529667</guid>
      <feedburner:origLink>http://www.careercup.com/question?id=18529667</feedburner:origLink></item>
      <item>
         <title>CareerCup: New Interview Question for 
            Palantir Technology</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/bP2d2EQR3BU/question</link>
         <description>&lt;div style="border:1px solid #656E72;width:600px;"&gt;
			&lt;div style="border-bottom:1px dotted #656E72;padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com"&gt;&lt;img src="http://www.careercup.com/images/logo.gif" style="border:0;"&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18517665" style="text-decoration:none;"&gt;&lt;span style="color:#1E6CB6;font-weight:bold;font-size:18px;"&gt;Interview Question for 
	            Palantir Technology
	            
	            
	            &lt;/span&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;p&gt;Given an array of values, design and code an algorithm that returns whether there are two duplicates within k indices of each other? k indices and within plus or minus l (value) of each other? Do all, even the latter, in O(n) running time and O(k) space. &lt;/p&gt; &lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18517665"&gt;View &amp;raquo;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="font-size:10px;padding:10px;"&gt;
				Posted by fbrubacher on May 19, 2013
			&lt;/div&gt;
		&lt;/div&gt;</description>
         <guid isPermaLink="false">http://www.careercup.com/question?id=18517665</guid>
      <feedburner:origLink>http://www.careercup.com/question?id=18517665</feedburner:origLink></item>
      <item>
         <title>CareerCup: New Interview Question for 
            HCL</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/aAkkAMsPD4o/question</link>
         <description>&lt;div style="border:1px solid #656E72;width:600px;"&gt;
			&lt;div style="border-bottom:1px dotted #656E72;padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com"&gt;&lt;img src="http://www.careercup.com/images/logo.gif" style="border:0;"&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18601675" style="text-decoration:none;"&gt;&lt;span style="color:#1E6CB6;font-weight:bold;font-size:18px;"&gt;Interview Question for 
	            HCL
	            
	            
	            &lt;/span&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;p&gt;Give three Hash tables has some values.you need compare three hash tables and store the common values in fourth hash table?&lt;/p&gt; &lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18601675"&gt;View &amp;raquo;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="font-size:10px;padding:10px;"&gt;
				Posted by amit.grynch on May 19, 2013
			&lt;/div&gt;
		&lt;/div&gt;</description>
         <guid isPermaLink="false">http://www.careercup.com/question?id=18601675</guid>
      <feedburner:origLink>http://www.careercup.com/question?id=18601675</feedburner:origLink></item>
      <item>
         <title>CareerCup: New Interview Question for 
            Google</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/gmhfwKBcttE/question</link>
         <description>&lt;div style="border:1px solid #656E72;width:600px;"&gt;
			&lt;div style="border-bottom:1px dotted #656E72;padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com"&gt;&lt;img src="http://www.careercup.com/images/logo.gif" style="border:0;"&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18460667" style="text-decoration:none;"&gt;&lt;span style="color:#1E6CB6;font-weight:bold;font-size:18px;"&gt;Interview Question for 
	            Google
	            
	            
	            &lt;/span&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;p&gt;Eliminate all ‘b’ and ‘ac’ in an array of characters, you have to replace them in-place, and you are only allowed to iterate over the char array once.&lt;/p&gt;

&lt;p&gt;Examples:&lt;br /&gt;abc -&amp;gt; ac&lt;br /&gt;ac-&amp;gt;&amp;#39;&amp;#39;&lt;br /&gt;react-&amp;gt;rt &lt;br /&gt;&lt;/p&gt; &lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18460667"&gt;View &amp;raquo;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="font-size:10px;padding:10px;"&gt;
				Posted by jeso on May 18, 2013
			&lt;/div&gt;
		&lt;/div&gt;</description>
         <guid isPermaLink="false">http://www.careercup.com/question?id=18460667</guid>
      <feedburner:origLink>http://www.careercup.com/question?id=18460667</feedburner:origLink></item>
      <item>
         <title>CareerCup: New Interview Question for 
            Infosys</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/pRsYMXEylHQ/question</link>
         <description>&lt;div style="border:1px solid #656E72;width:600px;"&gt;
			&lt;div style="border-bottom:1px dotted #656E72;padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com"&gt;&lt;img src="http://www.careercup.com/images/logo.gif" style="border:0;"&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18591663" style="text-decoration:none;"&gt;&lt;span style="color:#1E6CB6;font-weight:bold;font-size:18px;"&gt;Interview Question for 
	            Infosys
	            
	            
	            &lt;/span&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;p&gt;The bin packing problem is an example of a wide set of problems. The task is to find how many set sized bins are required to hold a number of differently sized boxes. How many bins (10 units high) are required to contain the following boxes (1,3,4 and 5 units high)?&lt;/p&gt; &lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18591663"&gt;View &amp;raquo;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="font-size:10px;padding:10px;"&gt;
				Posted by vari007 on May 18, 2013
			&lt;/div&gt;
		&lt;/div&gt;</description>
         <guid isPermaLink="false">http://www.careercup.com/question?id=18591663</guid>
      <feedburner:origLink>http://www.careercup.com/question?id=18591663</feedburner:origLink></item>
      <item>
         <title>CareerCup: New Interview Question for 
            Infosys</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/izwnqBBmMCA/question</link>
         <description>&lt;div style="border:1px solid #656E72;width:600px;"&gt;
			&lt;div style="border-bottom:1px dotted #656E72;padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com"&gt;&lt;img src="http://www.careercup.com/images/logo.gif" style="border:0;"&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18582672" style="text-decoration:none;"&gt;&lt;span style="color:#1E6CB6;font-weight:bold;font-size:18px;"&gt;Interview Question for 
	            Infosys
	            
	            
	            &lt;/span&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;p&gt;Write a program to calculate the Loan Balance, where a person borrows an amount A and in return he/she agrees to make N payments per year, each of amount P. While the person is repaying the loan, interest will accumulate at an annual percentage rate of R, and this interest will be compounded N times a year (along with each payment). Therefore, the person must continue paying these installments of amount P until the original amount and any accumulated interest is repaid.&lt;/p&gt;

&lt;p&gt;NOTE: The formula to calculate the amount that the person needs to repay after T years is -&lt;br /&gt;Balance Amount after T years = A[(1+R/N)^NT]-P&lt;/p&gt; &lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18582672"&gt;View &amp;raquo;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="font-size:10px;padding:10px;"&gt;
				Posted by vari007 on May 18, 2013
			&lt;/div&gt;
		&lt;/div&gt;</description>
         <guid isPermaLink="false">http://www.careercup.com/question?id=18582672</guid>
      <feedburner:origLink>http://www.careercup.com/question?id=18582672</feedburner:origLink></item>
      <item>
         <title>CareerCup: New Interview Question for 
            Microsoft</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/3KuChTfJEFY/question</link>
         <description>&lt;div style="border:1px solid #656E72;width:600px;"&gt;
			&lt;div style="border-bottom:1px dotted #656E72;padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com"&gt;&lt;img src="http://www.careercup.com/images/logo.gif" style="border:0;"&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18582668" style="text-decoration:none;"&gt;&lt;span style="color:#1E6CB6;font-weight:bold;font-size:18px;"&gt;Interview Question for 
	            Microsoft
	            
	            
	            &lt;/span&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;p&gt;Code to check if a given short string is a substring of a main string. Can you get a linear solution (O(n)) if possible?&lt;/p&gt; &lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18582668"&gt;View &amp;raquo;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="font-size:10px;padding:10px;"&gt;
				Posted by jeanclaude on May 18, 2013
			&lt;/div&gt;
		&lt;/div&gt;</description>
         <guid isPermaLink="false">http://www.careercup.com/question?id=18582668</guid>
      <feedburner:origLink>http://www.careercup.com/question?id=18582668</feedburner:origLink></item>
      <item>
         <title>CareerCup: New Interview Question for 
            Microsoft</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/cH3VgqJnNFU/question</link>
         <description>&lt;div style="border:1px solid #656E72;width:600px;"&gt;
			&lt;div style="border-bottom:1px dotted #656E72;padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com"&gt;&lt;img src="http://www.careercup.com/images/logo.gif" style="border:0;"&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18488671" style="text-decoration:none;"&gt;&lt;span style="color:#1E6CB6;font-weight:bold;font-size:18px;"&gt;Interview Question for 
	            Microsoft
	            
	            
	            &lt;/span&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;p&gt;Given a circular linked list, find the mid element of the linked list.&lt;/p&gt; &lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18488671"&gt;View &amp;raquo;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="font-size:10px;padding:10px;"&gt;
				Posted by nightingale on May 17, 2013
			&lt;/div&gt;
		&lt;/div&gt;</description>
         <guid isPermaLink="false">http://www.careercup.com/question?id=18488671</guid>
      <feedburner:origLink>http://www.careercup.com/question?id=18488671</feedburner:origLink></item>
      <item>
         <title>CareerCup: New Interview Question for 
            Palantir Technology</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/FZEaWyMRWUY/question</link>
         <description>&lt;div style="border:1px solid #656E72;width:600px;"&gt;
			&lt;div style="border-bottom:1px dotted #656E72;padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com"&gt;&lt;img src="http://www.careercup.com/images/logo.gif" style="border:0;"&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18479662" style="text-decoration:none;"&gt;&lt;span style="color:#1E6CB6;font-weight:bold;font-size:18px;"&gt;Interview Question for 
	            Palantir Technology
	            
	            
	            &lt;/span&gt;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="padding:10px;"&gt;
				&lt;p&gt;Explain how you would implement a multi-map in Java without using any collections? &lt;/p&gt; &lt;a rel="nofollow" target="_blank" href="http://www.careercup.com/question?id=18479662"&gt;View &amp;raquo;&lt;/a&gt;
			&lt;/div&gt;
			&lt;div style="font-size:10px;padding:10px;"&gt;
				Posted by fbrubacher on May 17, 2013
			&lt;/div&gt;
		&lt;/div&gt;</description>
         <guid isPermaLink="false">http://www.careercup.com/question?id=18479662</guid>
      <feedburner:origLink>http://www.careercup.com/question?id=18479662</feedburner:origLink></item>
      <item>
         <title>How Long Do You Have to Solve Technical Questions?</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/kqo4AnfuhxU/</link>
         <description>Before telling you how long you have to solve technical questions, let me ask you a question. Your math teacher assigns you a problem. It takes you 5 minutes to solve it. Is that quick or slow? Hopefully, you&amp;#8217;re looking at this question confused. 5 minutes might be unacceptably long to compute, say, the square [...]</description>
         <guid isPermaLink="false">http://blog.careercup.com/?p=177</guid>
         <pubDate>Mon, 14 Nov 2011 07:52:10 +0000</pubDate>
         <content:encoded><![CDATA[<p>Before telling you how long you have to solve technical questions, let me ask <em>you </em>a question.</p>
<p><strong>Your math teacher assigns you a problem. It takes you 5 minutes to solve it. Is that quick or slow?</strong></p>
<p>Hopefully, you&#8217;re looking at this question confused. 5 minutes might be unacceptably long to compute, say, the square root of 16, but extremely quick to solve a more complex proof. I didn&#8217;t tell you what the question is, so how can you tell me if 5 minutes is quick or slow?</p>
<p><strong>So how long do you have to solve technical questions?</strong></p>
<p>As in the above situation, it totally depends on the complexity of the question. A simple factual question might take seconds. A reasonably straightforward algorithm question might take a couple minutes. But a complex algorithm could take 30 minutes or more to solve.</p>
<p>That said, in a technical typical interview, a candidate typically solves one or two coding / algorithm questions. That&#8217;s an average though, over typical questions; be very careful about thinking, &#8220;gee, I solved three questions, I must have done great!&#8221; Solving ten questions does not mean that you&#8217;ve done well, if they were easy questions. Likewise, you might have done extremely well without even finishing one question.</p>
<p><strong>So how do you know how well you&#8217;ve done?</strong></p>
<p>You don&#8217;t (really, really, I promise you, you don&#8217;t!). <a rel="nofollow" target="_blank" href="http://www.technologywoman.com/2011/03/31/why-your-interview-performance-is-impossible-to-judge/">Your interview performance is impossible to judge.</a></p>]]></content:encoded>
         <category>Uncategorized</category>
      <feedburner:origLink>http://blog.careercup.com/2011/11/how-long-do-you-have-to-solve-technical-questions/</feedburner:origLink></item>
      <item>
         <title>Signed copies of Cracking the Coding Interview v5 – this week only!</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/RWoI98ZTPtY/</link>
         <description>By popular demand, for a very limited time, we will be offering signed copies of Cracking the Coding Interview, 5th Edition. The copies can either be shipped to you (via standard US mail) or picked up directly in Palo Alto. Day-of pick ups are available. Buy your copy at the top of CareerCup.com.</description>
         <guid isPermaLink="false">http://blog.careercup.com/?p=156</guid>
         <pubDate>Mon, 12 Sep 2011 22:13:46 +0000</pubDate>
         <content:encoded><![CDATA[<p><a rel="nofollow" target="_blank" href="http://www.amazon.com/gp/product/1466208686/ref=as_li_ss_il?ie=UTF8&amp;tag=care01-20&amp;linkCode=as2&amp;camp=217145&amp;creative=399373&amp;creativeASIN=1466208686"><img class="alignright" style="border:0px initial initial;" src="http://ws.assoc-amazon.com/widgets/q?_encoding=UTF8&amp;Format=_SL110_&amp;ASIN=1466208686&amp;MarketPlace=US&amp;ID=AsinImage&amp;WS=1&amp;tag=care01-20&amp;ServiceVersion=20070822" border="0" alt="" width="74" height="110"/></a><img style="float:right;border:none !important;margin:0px !important;" src="http://www.assoc-amazon.com/e/ir?t=&amp;l=as2&amp;o=1&amp;a=1466208686&amp;camp=217145&amp;creative=399373" border="0" alt="" width="1" height="1"/>By popular demand, for a <em>very </em>limited time, we will be offering signed copies of <a rel="nofollow" target="_blank" href="http://www.amazon.com/gp/product/1466208686/ref=as_li_ss_tl?ie=UTF8&amp;tag=care01-20&amp;linkCode=as2&amp;camp=217145&amp;creative=399373&amp;creativeASIN=1466208686">Cracking the Coding Interview, 5th Edition</a>.</p>
<p>The copies can either be shipped to you (via standard US mail) or picked up directly in Palo Alto. Day-of pick ups are available.</p>
<p>Buy your copy at the top of <a rel="nofollow" target="_blank" href="http://www.careercup.com">CareerCup.com</a>.</p>]]></content:encoded>
         <category>Uncategorized</category>
      <feedburner:origLink>http://blog.careercup.com/2011/09/signed-copies-of-cracking-the-coding-interview-v5-this-week-only/</feedburner:origLink></item>
      <item>
         <title>Okay, folks, here’s how the Google interview process really works</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/rwd_bz1uaEk/</link>
         <description>Somehow, many candidates have gotten the impression that the interview process is some elaborate system, and if their process is different from their friend’s, it must be a reason for it. The truth is so much more straightforward than that, and once you get, everything will make sense. Or that’s my hope, anyway. Here’s how [...]</description>
         <guid isPermaLink="false">http://blog.careercup.com/?p=153</guid>
         <pubDate>Wed, 07 Sep 2011 07:09:22 +0000</pubDate>
         <content:encoded><![CDATA[<p>Somehow, many candidates have gotten the impression that the interview process is some elaborate system, and if their process is different from their friend’s, it must be a reason for it.</p>
<p>The truth is so much more straightforward than that, and once you get, everything will make sense. Or that’s my hope, anyway.</p>
<p><strong>Here’s how the process works at Google for software engineers</strong>. We’ll look at this from the interviewer’s side and from the recruiter’s side. Although this is technically just about Google and Software Engineering, the advice / structure is largely universal across tech companies.</p>
<p><a rel="nofollow" target="_blank" href="http://www.technologywoman.com/2011/09/07/okay-folks-heres-how-the-google-interview-process-really-works/">Read the rest at technologywoman.com</a>.</p>
<p>&nbsp;</p>]]></content:encoded>
         <category>Uncategorized</category>
      <feedburner:origLink>http://blog.careercup.com/2011/09/okay-folks-here%e2%80%99s-how-the-google-interview-process-really-works/</feedburner:origLink></item>
      <item>
         <title>Officially on sale! Cracking the Coding Interview, 5th Edition</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/sen6yze9T1I/</link>
         <description>The 5th edition of the best-selling programming interview prep book, Cracking the Coding Interview: 150 Programming Interview Questions and Solutions, is officially on sale. And even better &amp;#8211; Amazon is currently running a 20% sale on the book! Now, I know you&amp;#8217;re used to new editions being a couple little fixes here, packaged in a [...]</description>
         <guid isPermaLink="false">http://blog.careercup.com/?p=148</guid>
         <pubDate>Wed, 31 Aug 2011 21:19:09 +0000</pubDate>
         <content:encoded><![CDATA[<div id="attachment_458" class="wp-caption alignright" style="width:160px;"><a rel="nofollow" target="_blank" href="http://www.amazon.com/dp/1466208686/ref=as_li_ss_til?tag=careercup02-20&amp;camp=213381&amp;creative=390973&amp;linkCode=as4&amp;creativeASIN=1466208686&amp;adid=073MCDQM0MS2GQHR92FA&amp;"><img class="size-medium wp-image-458  " title="Cracking the Coding Interview" src="http://www.technologywoman.com/wp-content/uploads/2011/03/CtCI_book_stack-300x300.png" alt="" width="150" height="150"/></a><p class="wp-caption-text">Above image not to scale. The 3D book making software does not understand book length.</p></div>
<p>The 5th edition of the best-selling programming interview prep book, <a rel="nofollow" target="_blank" href="http://www.amazon.com/dp/1466208686/ref=as_li_ss_til?tag=careercup02-20&amp;camp=213381&amp;creative=390973&amp;linkCode=as4&amp;creativeASIN=1466208686&amp;adid=1FSB4912ZJTA8HJX4BXF&amp;">Cracking the Coding Interview: 150 Programming Interview Questions and Solutions</a>, is officially on sale. And even better &#8211; Amazon is currently running a <strong>20% sale</strong> on the book!</p>
<p>Now, I know you&#8217;re used to new editions being a couple little fixes here, packaged in a shiny new edition probably for no other reason than to get you to buy your own copy rather than borrow your friend&#8217;s. That is not what this is.</p>
<p>The fifth edition of <a rel="nofollow" target="_blank" href="http://www.amazon.com/dp/1466208686/ref=as_li_ss_til?tag=careercup02-20&amp;camp=213381&amp;creative=390973&amp;linkCode=as4&amp;creativeASIN=1466208686&amp;adid=073MCDQM0MS2GQHR92FA&amp;">Cracking the Coding Interview</a> is a massive expansion of the fourth edition. It added 200 pages of content, growing the length of the book from 308 pages to 508. A more complete description of the many, many changes are below.</p>
<p>As before, Cracking the Coding Interview focuses on software engineering interviews. If you&#8217;re looking for a start-to-end guide on how to get a job a tech company, pick up my second book, <a rel="nofollow" target="_blank" href="http://www.amazon.com/dp/0470927623?tag=care02-20&amp;camp=213381&amp;creative=390973&amp;linkCode=as4&amp;creativeASIN=0470927623&amp;adid=1VAM51100FM0N4AFAXN1&amp;">The Google Resume: How to Prepare for a Career and Land a Job at Apple, Microsoft, Google, or any Top Tech Company</a>. The book is rated 4.5 stars after 22 reviews and can be purchased from <a rel="nofollow" target="_blank" href="http://www.amazon.com/dp/0470927623?tag=care02-20&amp;camp=213381&amp;creative=390973&amp;linkCode=as4&amp;creativeASIN=0470927623&amp;adid=1VAM51100FM0N4AFAXN1&amp;">Amazon</a> or any <a rel="nofollow" target="_blank" href="http://www.barnesandnoble.com/w/google-resume-gayle-laakmann-mcdowell/1100320174">Barnes and Noble store</a>.</p>
<div><strong>Massive Expansion of Introductory Chapters</strong></div>
<div>The book opens with about 70 pages of content you need to know before diving into an interview question. This includes:</div>
<div>
<ul>
<li>How do companies evaluate you?</li>
<li>How do you prepare for behavioral questions?</li>
<li>What happens behind the scenes at Microsoft, Amazon, Google, Yahoo, Apple and Facebook? How does the process work? Who is evaluating you?</li>
<li>How do you write a great resume?</li>
<li>How do you tackle tricky technical questions?</li>
<li>What happens when you get a question wrong?</li>
<li>What should you evaluate in an offer?</li>
<li>How do you negotiate an offer?</li>
</ul>
<div><strong>Expanded Chapter Intros</strong></div>
<p>Each chapter opens with a discussion of core skills and technique for solving each type of question. This ranges from 3 to 10 pages, depending on the complexity of the topic. As always, we assume that you know the really basic stuff, so you don&#8217;t need to wade through stuff like what a tree is.</p>
<p><strong>Rewritten Solutions (+ 24 new questions)</strong><br />
Every questions has been carefully reviewed and the vast majority have been partially or fully re-written. New solutions were added to existing problems, and 24 new questions were also added.</p>
</div>
<div>
<p>As before, fully compilable Java solutions (ready for import into Eclipse) can be downloaded. The download is hosted on <a rel="nofollow" target="_blank" href="http://www.CrackingTheCodingInterview.com">CrackingTheCodingInterview.com</a>.</p>
</div>
<div><strong>Website / Forum (CrackingTheCodingInterview.com)</strong></div>
<div>Interview problems are best with some discussion, so we&#8217;ve created a website / forum built around the book. If you have questions or additional solutions you&#8217;d like to consider, post them there to discuss them with other readers. The java solutions can also be downloaded from there.</div>
<div><strong>Buy it now:<br />
</strong>&nbsp;
<ul>
<li><a rel="nofollow" target="_blank" href="http://www.amazon.com/dp/1466208686/ref=as_li_ss_til?tag=careercup02-20&amp;camp=213381&amp;creative=390973&amp;linkCode=as4&amp;creativeASIN=1466208686&amp;adid=05CVR75H45G966VQ3Q7C&amp;">Cracking the Coding Interview, v5 [Amazon]</a></li>
<li><a rel="nofollow" target="_blank" href="http://www.amazon.com/dp/0470927623?tag=care02-20&amp;camp=213381&amp;creative=390973&amp;linkCode=as4&amp;creativeASIN=0470927623&amp;adid=1E2YWSNC16R6NRVVKS4T&amp;">The Google Resume [Amazon]</a></li>
<li><a rel="nofollow" target="_blank" href="http://pothi.com/pothi/book/gayle-laakmann-mcdowell-cracking-coding-interview-5th-edition">Cracking the Coding Interview, v5 [India / Pothi]</a></li>
<li><a rel="nofollow" target="_blank" href="http://www.flipkart.com/books/0470927623?_l=CJHVEqJO3veuHytbACc9dw--&amp;_r=RrmKPzNOo2Tc1H70b0J15A--&amp;ref=5d540a4d-ed6f-4201-b4a5-a299d2a2218e&amp;pid=0xw3f9n15t">The Google Resume [India / Flipkart]</a></li>
</ul>
</div>]]></content:encoded>
         <category>Uncategorized</category>
      <feedburner:origLink>http://blog.careercup.com/2011/08/officially-on-sale-cracking-the-coding-interview-5th-edition/</feedburner:origLink></item>
      <item>
         <title>Ask Gayle: How do you negotiate offers for the big companies?</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/3MjdBKXBBz8/</link>
         <description>Gayle, I recently got an offer from a major software company, but it&amp;#8217;s not quite what I was hoping for. How can I negotiate my offer? ~ PV First of all, you&amp;#8217;re off to a great start by just trying to negotiate. Most people don&amp;#8217;t even do that. Much of the standard negotiation advice applies [...]</description>
         <guid isPermaLink="false">http://blog.careercup.com/?p=146</guid>
         <pubDate>Thu, 21 Apr 2011 21:12:42 +0000</pubDate>
         <content:encoded><![CDATA[<blockquote><p>Gayle,</p>
<p>I recently got an offer from a major software company, but it&#8217;s not quite what I was hoping for. How can I negotiate my offer?</p>
<p>~ PV</p></blockquote>
<p>First of all, you&#8217;re off to a great start by just trying to negotiate. Most people don&#8217;t even do that.</p>
<p>Much of the standard negotiation advice applies here:</p>
<ul>
<li>Having competing offers will give you leverage</li>
<li>Know what you can get an other companies (goes back to the competing offers thing)</li>
<li>Being able to quantify your value to the company &#8211; what can you do for them?</li>
<li>Think big picture. Maybe you can&#8217;t get a salary bump, but perhaps you can get a better signing bonus. Or maybe you can get relocation in cash, instead of the company directly paying for it. Or, perhaps you can get an agreement for an earlier review or opportunity for promotion.</li>
</ul>
<p>One thing to note with big companies like Microsoft is that they often have &#8220;levels&#8221; for employees, with a small salary range for anyone at that level. You have some wiggle room within that range, but larger bumps may require jumping up to the next level. You&#8217;ll need to understand what you need to demonstrate to reach that level, and use examples from your past to demonstrate that you have these qualities.</p>]]></content:encoded>
      <feedburner:origLink>http://blog.careercup.com/2011/04/ask-gayle-how-do-you-negotiate-offers-for-the-big-companies/</feedburner:origLink></item>
      <item>
         <title>Interested in Amazon Montreal? Special offer for CareerCup users</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/VSXCaqzJo4s/</link>
         <description>Hey Montreal folk - Interested in Amazon and looking for a way in? We&amp;#8217;ve got a great offer just for CareerCup users. Amazon is conducting a Hiring Event (mostly last Week of April, Thu Apr 28, Fri Apr 29 ) for software design engineers. The best part? No phone interviews. Interviews will be conducted in person [...]</description>
         <guid isPermaLink="false">http://blog.careercup.com/?p=139</guid>
         <pubDate>Wed, 06 Apr 2011 03:59:51 +0000</pubDate>
         <content:encoded><![CDATA[<p>Hey Montreal folk -</p>
<p>Interested in Amazon and looking for a way in? We&#8217;ve got a great offer just for CareerCup users.</p>
<p>Amazon is conducting a Hiring Event (mostly last Week of April, Thu Apr 28, Fri Apr 29 ) for software design engineers. The best part? No phone interviews. Interviews will be conducted in person in Montreal, with a decision typically in 2-3 days (often same day).</p>
<p>Take advantage of this by emailing your resume&#8217;s to rh2010 &lt;at&gt; amazon.com. The subject line of your email should <strong>CareerCup.com Montreal</strong>.</p>]]></content:encoded>
         <category>Uncategorized</category>
      <feedburner:origLink>http://blog.careercup.com/2011/04/interested-in-amazon-montreal-special-offer-for-careercup-users/</feedburner:origLink></item>
      <item>
         <title>Why You Got Rejected — Even Though You Thought You Did Well</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/FasgFORCgug/</link>
         <description>Ever walk out an interview thinking &amp;#8220;I nailed that!&amp;#8221;, only to discover that you got rejected? Or, conversely, think you bombed, but then you proceed to the next round anyway? The truth is that it&amp;#8217;s incredibly hard to gauge your own performance in an interview. Usually, when you attempt this, you&amp;#8217;re looking at one of [...]</description>
         <guid isPermaLink="false">http://blog.careercup.com/?p=134</guid>
         <pubDate>Sat, 02 Apr 2011 04:40:17 +0000</pubDate>
         <content:encoded><![CDATA[<p>Ever walk out an interview thinking &#8220;I nailed that!&#8221;, only to discover that you got rejected? Or, conversely, think you bombed, but then you proceed to the next round anyway?</p>
<p>The truth is that it&#8217;s incredibly hard to gauge your own performance in an interview. Usually, when you attempt this, you&#8217;re looking at one of two factors: the interviewer&#8217;s attitude, or how many mistakes you made.</p>
<p>Read on for why this doesn&#8217;t work: <a rel="nofollow" target="_blank" href="http://www.technologywoman.com/2011/03/31/why-your-interview-performance-is-impossible-to-judge/">Why Your Interview Performance is Impossible to Judge</a></p>]]></content:encoded>
         <category>Uncategorized</category>
      <feedburner:origLink>http://blog.careercup.com/2011/04/why-you-got-rejected-even-though-you-thought-you-did-well/</feedburner:origLink></item>
      <item>
         <title>More than a number: How much does Google care about GPA?</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/9VzIkWHn9MA/</link>
         <description>Gayle, I&amp;#8217;m currently a junior at Cal Poly, and my GPA isn&amp;#8217;t great. I estimate when I graduate it&amp;#8217;ll be between a 2.7 and 3.1. Will that put me out of the running for Google and Microsoft? Do those companies really have a minimum GPA requirement? Is there anything I can do to offset my low [...]</description>
         <guid isPermaLink="false">http://blog.careercup.com/?p=118</guid>
         <pubDate>Sat, 22 Jan 2011 22:02:16 +0000</pubDate>
         <content:encoded><![CDATA[<blockquote><p>Gayle,</p>
<p>I&#8217;m currently a junior at Cal Poly, and my GPA isn&#8217;t great. I estimate when I graduate it&#8217;ll be between a 2.7 and 3.1. Will that put me out of the running for Google and Microsoft? Do those companies really have a minimum GPA requirement? Is there anything I can do to offset my low GPA to increase my chances of getting hired?</p>
<p>~ Alex</p></blockquote>
<p>Not only is there not GPA requirement, but you don&#8217;t even necessarily need to have gone to college. I worked with a number of people at Google who had dropped out of college. Does that mean GPA doesn&#8217;t matter? Not quite.</p>
<p>Both Google and Microsoft will try to use any available metrics to predict whether or not you&#8217;d be a successful employee. Once you&#8217;ve interviewed, your interview performance matters much, much more than anything on your resume. In fact, I never even remember GPA being discussed after someone&#8217;s interview.</p>
<p>In the resume selection process, GPA can certainly have an impact, but it&#8217;s not the only factor. Ultimately, companies are looking for a &#8220;track record of achievement,&#8221; or signs that you&#8217;re smart and that you can code. That can be one or more of these factors:</p>
<ul>
<li>Attending a good school</li>
<li>Internships / jobs at other &#8220;good&#8221; companies</li>
<li>A strong GPA (above 3.0)</li>
<li>Big / cool projects (course projects, open source work, things you&#8217;ve done &#8216;for fun&#8217;)</li>
<li>Other technical work: TAing, etc</li>
</ul>
<p>If you don&#8217;t have a great GPA, that&#8217;s okay. Many people get interviewed with low GPAs, but they compensate with other projects and work. In fact, that&#8217;s exactly what I did (my GPA varied between a 3.0 and a 3.3).</p>
<p>One final thing: if you&#8217;re trying to compensate for a lower GPA with other projects, the quality of your resume tends to make a bigger difference. After all, if the numbers are telling a great story, it&#8217;s that much more important that you learn how to.</p>
<p>Read our resume tips on the links below, or check out <a rel="nofollow" target="_blank" href="http://www.careercup.com/resumereview">CareerCup&#8217;s professional resume review service</a>.</p>
<ul>
<li><a rel="nofollow" target="_blank" href="http://blog.careercup.com/2008/06/great-resumes-for-software-engineers/">Great Resumes for Software Engineers</a></li>
<li><a rel="nofollow" target="_blank" href="http://blog.careercup.com/2008/06/great-resumes-for-software-engineers/"></a><a rel="nofollow" target="_blank" href="http://blog.careercup.com/2011/01/eight-reasons-why-you-need-a-one-page-resume/">Less Is More: Eight Reasons Why You Need a One Page Resume</a></li>
<li><a rel="nofollow" target="_blank" href="http://blog.careercup.com/2011/01/eight-reasons-why-you-need-a-one-page-resume/"></a><a rel="nofollow" target="_blank" href="http://blog.careercup.com/2011/01/less-is-more-how-i-cut-my-resume-to-one-page/">Less Is More: How I Cut My Resume To One Page</a></li>
</ul>]]></content:encoded>
      <feedburner:origLink>http://blog.careercup.com/2011/01/more-than-a-number-how-much-does-google-care-about-gpa/</feedburner:origLink></item>
      <item>
         <title>What’s the “Right” Programming Language for an Interview?</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/apYCy5EtHic/</link>
         <description>Hi Gayle, Does it matter what language you use in an interview with Google/Facebook/Amazon? Most of my recent experience has been with C# and thats the language I&amp;#8217;m most comfortable with. I do have prior experience with C and C++ although in an interview would prefer to use C#. I&amp;#8217;m not sure if that would [...]</description>
         <guid isPermaLink="false">http://blog.careercup.com/?p=114</guid>
         <pubDate>Wed, 19 Jan 2011 17:39:16 +0000</pubDate>
         <content:encoded><![CDATA[<blockquote><p>Hi Gayle,</p>
<p>Does it matter what language you use in an interview with Google/Facebook/Amazon? Most of my recent experience has been with C# and thats the language I&#8217;m most comfortable with. I do have prior experience with C and C++ although in an interview would prefer to use C#. I&#8217;m not sure if that would be seen as a negative.</p>
<p>~ Nick</p></blockquote>
<p>Like most things in interviews, <a rel="nofollow" target="_blank" href="http://blog.careercup.com/2010/07/the-interview-factory-where-do-questions-come-from-and-who-picks-them/">it depends on your interviewer</a>. Theoretically, as long as your resume lists C / C++, your interviewer could ask you to code in those.  And they might, if they happen to have a favorite question that involved C or C++.</p>
<p>However, in general, that doesn&#8217;t happen. Most candidates code in Java, and most interviewers are fine with that. C# is pretty close to Java &#8211; so close that your interviewers may not notice or care about your coding C#.</p>
<p>Still, I&#8217;d recommend that you brush up a bit on the few syntactical differences between C# and Java, so that you can code in Java for your interviews.  Just explain to your interviewers the situation &#8211; most wouldn&#8217;t care.</p>
<p>What do you all think? Does the language matter?</p>]]></content:encoded>
         <category>Ask Gayle</category>
      <feedburner:origLink>http://blog.careercup.com/2011/01/whats-the-right-programming-language-for-an-interview/</feedburner:origLink></item>
      <item>
         <title>Less Is More: How I Cut My Resume To One Page</title>
         <link>http://feedproxy.google.com/~r/Careercup/~3/YTJXMfU3Q4U/</link>
         <description>I (very) recently wrote about Eight Reasons Why You Need a One Page Resume.  As an example of how you can cut down your resume, I wanted to provide an illustration of how you can, in fact, fit a lot of content on one page &amp;#8211; without making your margins tiny. Here’s what I manage to [...]</description>
         <guid isPermaLink="false">http://blog.careercup.com/?p=106</guid>
         <pubDate>Mon, 03 Jan 2011 22:13:15 +0000</pubDate>
         <content:encoded><![CDATA[<p>I (very) recently wrote about <a rel="nofollow" target="_blank" href="http://blog.careercup.com/2011/01/eight-reasons-why-you-need-a-one-page-resume/">Eight Reasons Why You Need a One Page Resume</a>.  As an example of how you can cut down your resume, I wanted to provide an illustration of how you can, in fact, fit a lot of content on one page &#8211; without making your margins tiny.</p>
<p>Here’s what I manage to fit on one page of my resume (view <a rel="nofollow" target="_blank" href="https://docs.google.com/viewer?url=http%3A%2F%2Fblog.careercup.com%2Fwp-content%2Fuploads%2F2010%2F12%2FGayle-Laakmann-Wharton.doc">here</a>):</p>
<ol>
<li>Three internships at Microsoft</li>
<li>One internship at Apple</li>
<li>Three years at Google</li>
<li>One year at a start-up</li>
<li>Founder / CEO of <a rel="nofollow" target="_blank" href="http://www.careercup.com/">CareerCup</a></li>
<li>Founder / Co-CEO of <a rel="nofollow" target="_blank" href="http://www.seattleantifreeze.com/">Seattle Anti-Freeze</a></li>
<li>Author of <a rel="nofollow" target="_blank" href="http://www.amazon.com/Cracking-Coding-Interview-Fourth-Programming/dp/145157827X/ref=sr_1_1?ie=UTF8&amp;s=books&amp;qid=1293801670&amp;sr=8-1">Cracking the Coding Interview</a></li>
<li>Author of <a rel="nofollow" target="_blank" href="http://www.amazon.com/Google-Resume-Prepare-Microsoft-Company/dp/0470927623/ref=ntt_at_ep_dpt_2">The Google Resume</a></li>
<li>Masters in CS from UPenn</li>
<li>BSE in CS from UPenn</li>
<li>Minor in Mathematics</li>
<li>MBA from Wharton</li>
<li>Former instructor for 1 CS course as an undergrad at UPenn</li>
<li>Former instructor for 2 CS courses at the University of Washington</li>
<li>Various activities: Principal at <a rel="nofollow" target="_blank" href="http://www.whartonventures.net/">Wharton Ventures</a> (VC Group), Yearbook Chair, Social chair of cohort, Finalist in venture capital competition</li>
</ol>
<p>How did I fit all this on my resume?  By being very, very selective:</p>
<ul>
<li>CUT: College projects.  They’re coding projects.  I’ve demonstrated that I’m highly technical by having other software engineering positions.  It just doesn’t matter any more – particularly as I’m not applying for coding jobs.</li>
<li>CUT: TA / Head TA at Penn for 4 years.  While being a TA / Head TA does show some valuable communication and other skills, I have already demonstrated that through other activities (such as being an instructor at UPenn / UW).</li>
<li>CUT: Hobbies.  It’s not that <em>no one</em> would care that, say, I enjoy playing squash, but a lot more people will care about almost anything else still on my resume.  Any that goes for most people - <a rel="nofollow" target="_blank" href="http://blog.careercup.com/2010/12/why-hobbies-are-not-resume-material/">don’t waste time with your hobbies</a>.</li>
<li>CUT: Advisor to various start-ups.  Again, it’s not that it doesn’t matter at all, but it doesn’t matter as much as other stuff.</li>
<li>REDUCED: Microsoft and Apple jobs.  Although I’ve already demonstrated technical skills through my position with Google, there is something compelling about the fact that I’ve worked at Microsoft, Apple and Google.  I don’t need to spend a ton of time discussing these jobs.  Just listing them is enough.  I put one bullet under each company, <em>covering four internships total</em>, and that’s enough.</li>
</ul>
<blockquote><p>See my “one pager” resume: <a rel="nofollow" target="_blank" href="https://docs.google.com/viewer?url=http%3A%2F%2Fblog.careercup.com%2Fwp-content%2Fuploads%2F2011%2F01%2FGayle-Laakmann-College-Resume.doc">Technical College Resume (2005)</a>; <a rel="nofollow" target="_blank" href="https://docs.google.com/viewer?url=http%3A%2F%2Fblog.careercup.com%2Fwp-content%2Fuploads%2F2010%2F12%2FGayle-Laakmann-Wharton.doc">Non-Technical Professional Resume (2011)</a></p></blockquote>
<p>Sure, it hurt a bit to cut that stuff.  But by removing or reducing those less impressive accomplishments / roles, <strong>I ensure that everyone who glances at my resume will see the most impressive things</strong>.</p>
<p>Again, if you need more convincing if you aren&#8217;t convinced of why you can and should have a one page resume, read this post <a rel="nofollow" target="_blank" href="http://blog.careercup.com/2011/01/eight-reasons-why-you-need-a-one-page-resume/">Eight Reasons Why You Need a One Page Resume</a>.</p>]]></content:encoded>
      <feedburner:origLink>http://blog.careercup.com/2011/01/less-is-more-how-i-cut-my-resume-to-one-page/</feedburner:origLink></item>
   </channel>
</rss><!-- fe4.yql.bf1.yahoo.com compressed/chunked Wed May 22 04:26:02 UTC 2013 -->
