<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>csTechie &#187; Google</title>
	<atom:link href="http://cstechie.com/category/job-interviews/google/feed/" rel="self" type="application/rss+xml" />
	<link>http://cstechie.com</link>
	<description>Just another WordPress weblog</description>
	<lastBuildDate>Sun, 02 May 2010 16:05:45 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.5</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>Maximum rectangle inside a Histogram</title>
		<link>http://cstechie.com/maximum-rectangle-inside-a-histogram/</link>
		<comments>http://cstechie.com/maximum-rectangle-inside-a-histogram/#comments</comments>
		<pubDate>Fri, 13 Nov 2009 02:25:39 +0000</pubDate>
		<dc:creator>syam</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Amazon]]></category>
		<category><![CDATA[Google]]></category>

		<guid isPermaLink="false">http://cstechie.com/?p=116</guid>
		<description><![CDATA[Find the maximum rectangle completely contained inside a histogram where each bars has a width of 1 unit. The heights of the bars of the histograms are given in an array e.g. {4,2,10,8,12,13,15,8,6} and they have a fixed width w = 1, say. The rectangles formed here are: 4X1, 2X9, 10X1, 8X6, 12X3, 13X2, 15X1, [...]]]></description>
			<content:encoded><![CDATA[<p>Find the maximum rectangle completely contained inside a histogram where each bars has a width of 1 unit. The heights of the bars of the histograms are given in an array e.g. {4,2,10,8,12,13,15,8,6} and they have a fixed width w = 1, say. The rectangles formed here are: 4X1, 2X9, 10X1, 8X6, 12X3, 13X2, 15X1, 8X6, 6X7 Thus, max-area rectangle = 8X6 = 48</p>
]]></content:encoded>
			<wfw:commentRss>http://cstechie.com/maximum-rectangle-inside-a-histogram/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Find the longest palindrome</title>
		<link>http://cstechie.com/find-the-longest-palindrome/</link>
		<comments>http://cstechie.com/find-the-longest-palindrome/#comments</comments>
		<pubDate>Thu, 12 Nov 2009 16:14:38 +0000</pubDate>
		<dc:creator>syam</dc:creator>
				<category><![CDATA[Amazon]]></category>
		<category><![CDATA[Google]]></category>
		<category><![CDATA[Interview Questions]]></category>

		<guid isPermaLink="false">http://cstechie.com/?p=112</guid>
		<description><![CDATA[Find the longest palindrome in a given string
]]></description>
			<content:encoded><![CDATA[<p>Find the longest palindrome in a given string</p>
]]></content:encoded>
			<wfw:commentRss>http://cstechie.com/find-the-longest-palindrome/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Find Median of 2 Sorted Arrays</title>
		<link>http://cstechie.com/find-median-of-2-sorted-arrays/</link>
		<comments>http://cstechie.com/find-median-of-2-sorted-arrays/#comments</comments>
		<pubDate>Tue, 10 Nov 2009 14:10:49 +0000</pubDate>
		<dc:creator>syam</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Amazon]]></category>
		<category><![CDATA[Google]]></category>

		<guid isPermaLink="false">http://cstechie.com/?p=84</guid>
		<description><![CDATA[Find Median of 2 sorted arrays
]]></description>
			<content:encoded><![CDATA[<p>Find Median of 2 sorted arrays</p>
]]></content:encoded>
			<wfw:commentRss>http://cstechie.com/find-median-of-2-sorted-arrays/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Kth Smallest element of a Binary Search Tree</title>
		<link>http://cstechie.com/kth-smallest-element-of-a-binary-search-tree/</link>
		<comments>http://cstechie.com/kth-smallest-element-of-a-binary-search-tree/#comments</comments>
		<pubDate>Sun, 08 Nov 2009 12:55:52 +0000</pubDate>
		<dc:creator>syam</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Amazon]]></category>
		<category><![CDATA[Google]]></category>
		<category><![CDATA[Microsoft]]></category>
		<category><![CDATA[Yahoo]]></category>

		<guid isPermaLink="false">http://cstechie.com/?p=68</guid>
		<description><![CDATA[Given a Binary Search Tree, write a program to print the kth smallest element
]]></description>
			<content:encoded><![CDATA[<p>Given a Binary Search Tree, write a program to print the kth smallest element</p>
]]></content:encoded>
			<wfw:commentRss>http://cstechie.com/kth-smallest-element-of-a-binary-search-tree/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<item>
		<title>Find the missing number</title>
		<link>http://cstechie.com/find-the-missing-number/</link>
		<comments>http://cstechie.com/find-the-missing-number/#comments</comments>
		<pubDate>Sat, 07 Nov 2009 05:50:25 +0000</pubDate>
		<dc:creator>syam</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Amazon]]></category>
		<category><![CDATA[Google]]></category>
		<category><![CDATA[Microsoft]]></category>
		<category><![CDATA[Yahoo]]></category>

		<guid isPermaLink="false">http://cstechie.com/?p=55</guid>
		<description><![CDATA[This is a very common interview questions and comes in various forms. The most common one is of the following format
Problem 1
Given an array of 999 distinct integers ranging from 1 to 1000 including. Find which number is missing. Restrictions: loop over the array only once, can&#8217;t allocate an additional array.
Another version of the problem [...]]]></description>
			<content:encoded><![CDATA[<p>This is a very common interview questions and comes in various forms. The most common one is of the following format<br />
<strong>Problem 1</strong><br />
Given an array of 999 distinct integers ranging from 1 to 1000 including. Find which number is missing. Restrictions: loop over the array only once, can&#8217;t allocate an additional array.</p>
<p>Another version of the problem is where 2 numbers are missing.<br />
<strong>Problem 2</strong><br />
Given an array of 998 distinct integers ranging from 1 to 1000 including. Find which 2 numbers are missing.</p>
<p>Restrictions: loop over the array only once, can&#8217;t allocate an additional array.</p>
]]></content:encoded>
			<wfw:commentRss>http://cstechie.com/find-the-missing-number/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Algorithm to Shuffle a Deck of Cards</title>
		<link>http://cstechie.com/algorithm-to-shuffle-a-deck-of-cards/</link>
		<comments>http://cstechie.com/algorithm-to-shuffle-a-deck-of-cards/#comments</comments>
		<pubDate>Tue, 03 Nov 2009 18:09:15 +0000</pubDate>
		<dc:creator>syam</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Amazon]]></category>
		<category><![CDATA[Google]]></category>
		<category><![CDATA[Microsoft]]></category>
		<category><![CDATA[Yahoo]]></category>

		<guid isPermaLink="false">http://cstechie.com/?p=24</guid>
		<description><![CDATA[Write an algorithm to shuffle an array of 52 integers so that each number has equal probability to be in any of the 52 positions.
]]></description>
			<content:encoded><![CDATA[<p>Write an algorithm to shuffle an array of 52 integers so that each number has equal probability to be in any of the 52 positions.</p>
]]></content:encoded>
			<wfw:commentRss>http://cstechie.com/algorithm-to-shuffle-a-deck-of-cards/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
	</channel>
</rss>
