<?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; Microsoft</title>
	<atom:link href="http://cstechie.com/category/job-interviews/microsoft/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>Merge 2 Binary Search Trees</title>
		<link>http://cstechie.com/merge-2-binary-search-trees/</link>
		<comments>http://cstechie.com/merge-2-binary-search-trees/#comments</comments>
		<pubDate>Sat, 21 Nov 2009 14:07:38 +0000</pubDate>
		<dc:creator>syam</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Interview Questions]]></category>
		<category><![CDATA[Microsoft]]></category>

		<guid isPermaLink="false">http://cstechie.com/?p=140</guid>
		<description><![CDATA[Write a program to merge  two binary search trees, in O(n) time with O(1) space
]]></description>
			<content:encoded><![CDATA[<p>Write a program to merge  two binary search trees, in O(n) time with O(1) space</p>
]]></content:encoded>
			<wfw:commentRss>http://cstechie.com/merge-2-binary-search-trees/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Least Common Ancestor in a Tree with only Parent pointers</title>
		<link>http://cstechie.com/least-common-ancestor-in-a-tree-with-only-parent-pointers/</link>
		<comments>http://cstechie.com/least-common-ancestor-in-a-tree-with-only-parent-pointers/#comments</comments>
		<pubDate>Tue, 17 Nov 2009 18:54:15 +0000</pubDate>
		<dc:creator>syam</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Microsoft]]></category>

		<guid isPermaLink="false">http://cstechie.com/?p=137</guid>
		<description><![CDATA[Given a tree with only children pointing to the parents, find the least  common ancestor of 2 nodes.
]]></description>
			<content:encoded><![CDATA[<p>Given a tree with only children pointing to the parents, find the least  common ancestor of 2 nodes.</p>
]]></content:encoded>
			<wfw:commentRss>http://cstechie.com/least-common-ancestor-in-a-tree-with-only-parent-pointers/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Find a cycle in a linked list</title>
		<link>http://cstechie.com/find-a-cycle-in-a-linked-list/</link>
		<comments>http://cstechie.com/find-a-cycle-in-a-linked-list/#comments</comments>
		<pubDate>Sat, 14 Nov 2009 17:32:54 +0000</pubDate>
		<dc:creator>syam</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Microsoft]]></category>

		<guid isPermaLink="false">http://cstechie.com/?p=134</guid>
		<description><![CDATA[How would you find a cycle in a linked list? Optimize for speed.
]]></description>
			<content:encoded><![CDATA[<p>How would you find a cycle in a linked list? Optimize for speed.</p>
]]></content:encoded>
			<wfw:commentRss>http://cstechie.com/find-a-cycle-in-a-linked-list/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Find Lowest Common Ancestor of 2 nodes</title>
		<link>http://cstechie.com/find-lowest-common-ancestor-of-2-nodes/</link>
		<comments>http://cstechie.com/find-lowest-common-ancestor-of-2-nodes/#comments</comments>
		<pubDate>Fri, 13 Nov 2009 13:40:27 +0000</pubDate>
		<dc:creator>syam</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Microsoft]]></category>
		<category><![CDATA[Yahoo]]></category>

		<guid isPermaLink="false">http://cstechie.com/?p=118</guid>
		<description><![CDATA[One of the common, yet tricky interview question is to find the lowest common ancestor node for given 2 nodes in
A. Binary Tree
B. N-ary tree
]]></description>
			<content:encoded><![CDATA[<p>One of the common, yet tricky interview question is to find the lowest common ancestor node for given 2 nodes in</p>
<p>A. Binary Tree</p>
<p>B. N-ary tree</p>
]]></content:encoded>
			<wfw:commentRss>http://cstechie.com/find-lowest-common-ancestor-of-2-nodes/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Find all valid words in a string</title>
		<link>http://cstechie.com/find-all-valid-words-in-a-string/</link>
		<comments>http://cstechie.com/find-all-valid-words-in-a-string/#comments</comments>
		<pubDate>Wed, 11 Nov 2009 17:01:47 +0000</pubDate>
		<dc:creator>syam</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Interview Questions]]></category>
		<category><![CDATA[Microsoft]]></category>

		<guid isPermaLink="false">http://cstechie.com/?p=97</guid>
		<description><![CDATA[Given a String, find out all the valid dictionary words contained in the string.
]]></description>
			<content:encoded><![CDATA[<p>Given a String, find out all the valid dictionary words contained in the string.</p>
]]></content:encoded>
			<wfw:commentRss>http://cstechie.com/find-all-valid-words-in-a-string/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Reverse Linked List</title>
		<link>http://cstechie.com/reverse-linked-list/</link>
		<comments>http://cstechie.com/reverse-linked-list/#comments</comments>
		<pubDate>Tue, 10 Nov 2009 16:34:43 +0000</pubDate>
		<dc:creator>syam</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Microsoft]]></category>
		<category><![CDATA[Yahoo]]></category>

		<guid isPermaLink="false">http://cstechie.com/?p=95</guid>
		<description><![CDATA[Write a program to reverse a linked list
1. With recursion
2. Without Recursion
]]></description>
			<content:encoded><![CDATA[<p>Write a program to reverse a linked list</p>
<p>1. With recursion</p>
<p>2. Without Recursion</p>
]]></content:encoded>
			<wfw:commentRss>http://cstechie.com/reverse-linked-list/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Sort an array of 0&#8217;s , 1&#8217;s and 2&#8217;s</title>
		<link>http://cstechie.com/sort-an-array-of-0s-1s-and-2s/</link>
		<comments>http://cstechie.com/sort-an-array-of-0s-1s-and-2s/#comments</comments>
		<pubDate>Tue, 10 Nov 2009 15:41:02 +0000</pubDate>
		<dc:creator>syam</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Amazon]]></category>
		<category><![CDATA[Microsoft]]></category>

		<guid isPermaLink="false">http://cstechie.com/?p=91</guid>
		<description><![CDATA[Given a array of 0&#8217;s,1&#8217;s and 2&#8217;s. Sort the array.
]]></description>
			<content:encoded><![CDATA[<p>Given a array of 0&#8217;s,1&#8217;s and 2&#8217;s. Sort the array.</p>
]]></content:encoded>
			<wfw:commentRss>http://cstechie.com/sort-an-array-of-0s-1s-and-2s/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Write a program to say whether a string is a rotation of another</title>
		<link>http://cstechie.com/write-a-program-to-say-whether-a-string-is-a-rotation-of-another/</link>
		<comments>http://cstechie.com/write-a-program-to-say-whether-a-string-is-a-rotation-of-another/#comments</comments>
		<pubDate>Sun, 08 Nov 2009 17:59:55 +0000</pubDate>
		<dc:creator>syam</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Microsoft]]></category>

		<guid isPermaLink="false">http://cstechie.com/?p=81</guid>
		<description><![CDATA[Given a string s1 and a string s2, write  a snippet to say whether s2 is a rotation of s1. example if S1=ABCD then BCDA,CDAB etc are rotations of S1.
]]></description>
			<content:encoded><![CDATA[<p>Given a string s1 and a string s2, write  a snippet to say whether s2 is a rotation of s1. example if S1=ABCD then BCDA,CDAB etc are rotations of S1.</p>
]]></content:encoded>
			<wfw:commentRss>http://cstechie.com/write-a-program-to-say-whether-a-string-is-a-rotation-of-another/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>2</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>
	</channel>
</rss>
