<?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/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
	>

<channel>
	<title>Avi Dullu&#039;s Code Arena</title>
	<atom:link href="http://avidullu.wordpress.com/feed/" rel="self" type="application/rss+xml" />
	<link>http://avidullu.wordpress.com</link>
	<description>A repertoire of programming and algorithms</description>
	<lastBuildDate>Mon, 23 Jan 2012 05:29:12 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
<cloud domain='avidullu.wordpress.com' port='80' path='/?rsscloud=notify' registerProcedure='' protocol='http-post' />
<image>
		<url>http://s2.wp.com/i/buttonw-com.png</url>
		<title>Avi Dullu&#039;s Code Arena</title>
		<link>http://avidullu.wordpress.com</link>
	</image>
	<atom:link rel="search" type="application/opensearchdescription+xml" href="http://avidullu.wordpress.com/osd.xml" title="Avi Dullu&#039;s Code Arena" />
	<atom:link rel='hub' href='http://avidullu.wordpress.com/?pushpress=hub'/>
		<item>
		<title>The Just Shall Live By Faith :D</title>
		<link>http://avidullu.wordpress.com/2011/11/04/the-just-shall-live-by-faith-d/</link>
		<comments>http://avidullu.wordpress.com/2011/11/04/the-just-shall-live-by-faith-d/#comments</comments>
		<pubDate>Fri, 04 Nov 2011 19:03:56 +0000</pubDate>
		<dc:creator>Avi Dullu</dc:creator>
				<category><![CDATA[Solutions]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[Programming]]></category>

		<guid isPermaLink="false">http://avidullu.wordpress.com/?p=541</guid>
		<description><![CDATA[I had posted something about fast encoding and decoding of integer array previously here. So here is something (maybe) more frequently used. A fast way to save space when you need to store large number of unsigned integers. I came up with two methods, one the evil but faster (exploiting the C features of C++) [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=avidullu.wordpress.com&amp;blog=4653213&amp;post=541&amp;subd=avidullu&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://avidullu.wordpress.com/2011/11/04/the-just-shall-live-by-faith-d/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/ff17ee8387bae26b357306da53ecd500?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">Naughty</media:title>
		</media:content>
	</item>
		<item>
		<title>Sayings of Chanakya</title>
		<link>http://avidullu.wordpress.com/2011/11/02/sayings-of-chanakya/</link>
		<comments>http://avidullu.wordpress.com/2011/11/02/sayings-of-chanakya/#comments</comments>
		<pubDate>Wed, 02 Nov 2011 07:14:38 +0000</pubDate>
		<dc:creator>Avi Dullu</dc:creator>
				<category><![CDATA[Was ich denke]]></category>

		<guid isPermaLink="false">http://avidullu.wordpress.com/?p=537</guid>
		<description><![CDATA[Wanted to log these hence posting here. A brilliant collection. 1) &#8220;Learn from the mistakes of others&#8230; you can&#8217;t live long enough to make them all yourselves!!&#8221; 2)&#8221;A person should not be too honest. Straight trees are cut first and Honest people are screwed first.&#8221; 3)&#8221;Even if a snake is not poisonous, it should pretend [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=avidullu.wordpress.com&amp;blog=4653213&amp;post=537&amp;subd=avidullu&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://avidullu.wordpress.com/2011/11/02/sayings-of-chanakya/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/ff17ee8387bae26b357306da53ecd500?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">Naughty</media:title>
		</media:content>
	</item>
		<item>
		<title>A night out after long :)</title>
		<link>http://avidullu.wordpress.com/2011/10/28/a-night-out-after-long/</link>
		<comments>http://avidullu.wordpress.com/2011/10/28/a-night-out-after-long/#comments</comments>
		<pubDate>Fri, 28 Oct 2011 23:08:39 +0000</pubDate>
		<dc:creator>Avi Dullu</dc:creator>
				<category><![CDATA[Programming]]></category>

		<guid isPermaLink="false">http://avidullu.wordpress.com/?p=530</guid>
		<description><![CDATA[So found the following question here (Antonio is awesum ) and worked out a O(n) time solution BUT with O(n) space. I claim the space usage can be brought down to O(1). Anyone game enough to post the O(1) space version? Problem: Given an array A of numbers, find a pair of numbers A[i] and [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=avidullu.wordpress.com&amp;blog=4653213&amp;post=530&amp;subd=avidullu&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://avidullu.wordpress.com/2011/10/28/a-night-out-after-long/feed/</wfw:commentRss>
		<slash:comments>4</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/ff17ee8387bae26b357306da53ecd500?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">Naughty</media:title>
		</media:content>
	</item>
		<item>
		<title>जाग तुझको दूर जाना!</title>
		<link>http://avidullu.wordpress.com/2011/10/26/%e0%a4%9c%e0%a4%be%e0%a4%97-%e0%a4%a4%e0%a5%81%e0%a4%9d%e0%a4%95%e0%a5%8b-%e0%a4%a6%e0%a5%82%e0%a4%b0-%e0%a4%9c%e0%a4%be%e0%a4%a8%e0%a4%be/</link>
		<comments>http://avidullu.wordpress.com/2011/10/26/%e0%a4%9c%e0%a4%be%e0%a4%97-%e0%a4%a4%e0%a5%81%e0%a4%9d%e0%a4%95%e0%a5%8b-%e0%a4%a6%e0%a5%82%e0%a4%b0-%e0%a4%9c%e0%a4%be%e0%a4%a8%e0%a4%be/#comments</comments>
		<pubDate>Wed, 26 Oct 2011 11:23:57 +0000</pubDate>
		<dc:creator>Avi Dullu</dc:creator>
				<category><![CDATA[My Favourite Poems]]></category>

		<guid isPermaLink="false">http://avidullu.wordpress.com/?p=526</guid>
		<description><![CDATA[An awesome composition by a Hindi poet, महादेवी वर्मा चिर सजग आँखें उनींदी आज कैसा व्यस्त बाना! जाग तुझको दूर जाना! अचल हिमगिरि के हॄदय में आज चाहे कम्प हो ले! या प्रलय के आँसुओं में मौन अलसित व्योम रो ले; आज पी आलोक को ड़ोले तिमिर की घोर छाया जाग या विद्युत शिखाओं में [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=avidullu.wordpress.com&amp;blog=4653213&amp;post=526&amp;subd=avidullu&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://avidullu.wordpress.com/2011/10/26/%e0%a4%9c%e0%a4%be%e0%a4%97-%e0%a4%a4%e0%a5%81%e0%a4%9d%e0%a4%95%e0%a5%8b-%e0%a4%a6%e0%a5%82%e0%a4%b0-%e0%a4%9c%e0%a4%be%e0%a4%a8%e0%a4%be/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/ff17ee8387bae26b357306da53ecd500?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">Naughty</media:title>
		</media:content>
	</item>
		<item>
		<title>Finally I did it !!</title>
		<link>http://avidullu.wordpress.com/2011/07/21/finally-i-did-it/</link>
		<comments>http://avidullu.wordpress.com/2011/07/21/finally-i-did-it/#comments</comments>
		<pubDate>Thu, 21 Jul 2011 00:17:00 +0000</pubDate>
		<dc:creator>Avi Dullu</dc:creator>
				<category><![CDATA[Programming]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[google interview questions]]></category>
		<category><![CDATA[interview questions]]></category>
		<category><![CDATA[programming problems]]></category>

		<guid isPermaLink="false">http://avidullu.wordpress.com/?p=522</guid>
		<description><![CDATA[A friend of mine referred me to a problem from my own blog (i.e. here ) and I must say I enjoyed every aspect of the problem. From designing its awesum O(nlogn) solution to coding it with handling all the minor details. It&#8217;s about to be 6 A.M. now and I can&#8217;t sleep without posting [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=avidullu.wordpress.com&amp;blog=4653213&amp;post=522&amp;subd=avidullu&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://avidullu.wordpress.com/2011/07/21/finally-i-did-it/feed/</wfw:commentRss>
		<slash:comments>6</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/ff17ee8387bae26b357306da53ecd500?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">Naughty</media:title>
		</media:content>
	</item>
		<item>
		<title>Zero sum sub-array</title>
		<link>http://avidullu.wordpress.com/2011/07/18/zero-sum-sub-array/</link>
		<comments>http://avidullu.wordpress.com/2011/07/18/zero-sum-sub-array/#comments</comments>
		<pubDate>Mon, 18 Jul 2011 20:13:21 +0000</pubDate>
		<dc:creator>Avi Dullu</dc:creator>
				<category><![CDATA[Solutions]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[interview questions]]></category>
		<category><![CDATA[programming problems]]></category>

		<guid isPermaLink="false">http://avidullu.wordpress.com/?p=520</guid>
		<description><![CDATA[Question: There is an array consisting of postive and negative integers. find the subarray whose sum is 0. Solution: Filed under: Solutions<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=avidullu.wordpress.com&amp;blog=4653213&amp;post=520&amp;subd=avidullu&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://avidullu.wordpress.com/2011/07/18/zero-sum-sub-array/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/ff17ee8387bae26b357306da53ecd500?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">Naughty</media:title>
		</media:content>
	</item>
		<item>
		<title>Truth beind Engineering</title>
		<link>http://avidullu.wordpress.com/2011/07/04/truth-beind-engineering/</link>
		<comments>http://avidullu.wordpress.com/2011/07/04/truth-beind-engineering/#comments</comments>
		<pubDate>Mon, 04 Jul 2011 09:30:44 +0000</pubDate>
		<dc:creator>Avi Dullu</dc:creator>
				<category><![CDATA[Random]]></category>
		<category><![CDATA[fun]]></category>
		<category><![CDATA[interesting explorations]]></category>
		<category><![CDATA[punch lines]]></category>

		<guid isPermaLink="false">http://avidullu.wordpress.com/?p=515</guid>
		<description><![CDATA[When you&#8217;re working with TBs and PBs of data you get some serious realizations. Beautifully put forth in the penultimate slide of this presentation. All engineering solutions are transient. Nothing&#8217;s perfect but some solutions are good enough for a while. Scalability solutions aren&#8217;t magic. They involve partitioning, indexing and replication. All data for real-time queries [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=avidullu.wordpress.com&amp;blog=4653213&amp;post=515&amp;subd=avidullu&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://avidullu.wordpress.com/2011/07/04/truth-beind-engineering/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/ff17ee8387bae26b357306da53ecd500?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">Naughty</media:title>
		</media:content>
	</item>
		<item>
		<title>Interview Problems 25</title>
		<link>http://avidullu.wordpress.com/2011/07/03/interview-problems-25/</link>
		<comments>http://avidullu.wordpress.com/2011/07/03/interview-problems-25/#comments</comments>
		<pubDate>Sun, 03 Jul 2011 00:06:10 +0000</pubDate>
		<dc:creator>Avi Dullu</dc:creator>
				<category><![CDATA[Programming]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[interview questions]]></category>
		<category><![CDATA[programming problems]]></category>

		<guid isPermaLink="false">http://avidullu.wordpress.com/?p=509</guid>
		<description><![CDATA[1. Given a set of KEY-&#62;VALUE pairs such that each KEY is unique, describe a method of storing these pairs on disk, and a method for accessing the corresponding VALUE given a KEY. Assume that RAM is fixed at 1gb and the set of pairs requires 40gb. 2. Consider there is an array with duplicates [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=avidullu.wordpress.com&amp;blog=4653213&amp;post=509&amp;subd=avidullu&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://avidullu.wordpress.com/2011/07/03/interview-problems-25/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/ff17ee8387bae26b357306da53ecd500?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">Naughty</media:title>
		</media:content>
	</item>
		<item>
		<title>Interview Problems 24</title>
		<link>http://avidullu.wordpress.com/2011/07/02/interview-problems-24/</link>
		<comments>http://avidullu.wordpress.com/2011/07/02/interview-problems-24/#comments</comments>
		<pubDate>Sat, 02 Jul 2011 23:45:29 +0000</pubDate>
		<dc:creator>Avi Dullu</dc:creator>
				<category><![CDATA[Programming]]></category>
		<category><![CDATA[google interview questions]]></category>
		<category><![CDATA[interview questions]]></category>
		<category><![CDATA[programming problems]]></category>

		<guid isPermaLink="false">http://avidullu.wordpress.com/?p=507</guid>
		<description><![CDATA[1. Given a linked list structure where every node represents a linked list and contains two pointers of its type: (i) pointer to next node in the main list. (ii) pointer to a linked list where this node is head. Write a C function to flatten the list into a single linked list. (from here) [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=avidullu.wordpress.com&amp;blog=4653213&amp;post=507&amp;subd=avidullu&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://avidullu.wordpress.com/2011/07/02/interview-problems-24/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/ff17ee8387bae26b357306da53ecd500?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">Naughty</media:title>
		</media:content>
	</item>
		<item>
		<title>Zeros and Ones .. One Pass</title>
		<link>http://avidullu.wordpress.com/2011/06/05/zeros-and-ones-one-pass/</link>
		<comments>http://avidullu.wordpress.com/2011/06/05/zeros-and-ones-one-pass/#comments</comments>
		<pubDate>Sun, 05 Jun 2011 22:12:27 +0000</pubDate>
		<dc:creator>Avi Dullu</dc:creator>
				<category><![CDATA[Programming]]></category>
		<category><![CDATA[Solutions]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[interview questions]]></category>
		<category><![CDATA[programming problems]]></category>

		<guid isPermaLink="false">http://avidullu.wordpress.com/?p=501</guid>
		<description><![CDATA[Have heard this question a lot and wanted to code it. I initially always used the version 1 (described below) of this code to form solutions, but I figured an optimization and the version 2 is actually a one-pass algorithm. Version 1: ( debatable one pass) Version 2: Definitely one &#8211; pass Finally I coded [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=avidullu.wordpress.com&amp;blog=4653213&amp;post=501&amp;subd=avidullu&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://avidullu.wordpress.com/2011/06/05/zeros-and-ones-one-pass/feed/</wfw:commentRss>
		<slash:comments>14</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/ff17ee8387bae26b357306da53ecd500?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">Naughty</media:title>
		</media:content>
	</item>
	</channel>
</rss>
