<?xml version="1.0" encoding="UTF-8"?><rss version="0.92">
<channel>
	<title>China Cat</title>
	<link>http://www.chinacatblog.com</link>
	<description>my RAM</description>
	<lastBuildDate>Thu, 02 Sep 2010 21:40:58 +0000</lastBuildDate>
	<docs>http://backend.userland.com/rss092</docs>
	<language>en</language>
	<!-- generator="WordPress/3.0.1" -->

	<item>
		<title>I overthunk it</title>
		<description><![CDATA[I got seriously duped today by an age-old logic question... A co-worker of mine asked me and another co-worker the following question: Question: If there's 3 light switches in 1 room and 3 light bulbs in a different room downstairs. With only taking 1 trip to the room with the light bulbs, how can you [...]]]></description>
		<link>http://www.chinacatblog.com/2010/09/02/i-overthunk-it/</link>
			</item>
	<item>
		<title>Subset Sum with a negative number</title>
		<description><![CDATA[Problem: Given a sorted array say int num[10]={-5,1,6,7,9,9,20,25,31,45}, write a function void findsum(int [],int x) that can print out all possible pair of elements in array that can make a sum equal to x. For example if value of x is 26, then function should print {1,25}, {25,1}, {-5,31}, {31,-5}. private static void findSumFunction() { [...]]]></description>
		<link>http://www.chinacatblog.com/2010/07/08/subset-sum-with-negative-2/</link>
			</item>
	<item>
		<title>Singly Linked List &#8211; remove element</title>
		<description><![CDATA[Problem: Given a singly linked list, write a function void DeleteBefore(node **head, data). For example, if the list has values 1->3->6->7->8->9->13, if data is 7, then element with data = 6 will be removed. As I've said before, Java's LinkedList, which is an implementation of a doubly linked list, would make solving this problem trivial, [...]]]></description>
		<link>http://www.chinacatblog.com/2010/07/08/singly-linked-list-remove/</link>
			</item>
	<item>
		<title>Singly Linked List &#8211; mth to the last element</title>
		<description><![CDATA[Example Problem: Given a singly-linked list, devise a time- and space-efficient algorithm to find the mth-to-last element of the list. Implement your algorithm, taking care to handle relevant error conditions. Define mth to last such that when m = 0, the last element of the list is returned. 1->3->6->7->8->9->13 Java's LinkedList class, which is an [...]]]></description>
		<link>http://www.chinacatblog.com/2010/07/08/mth-to-the-last-element/</link>
			</item>
	<item>
		<title>The Big O (&#8230;not that kind of O)</title>
		<description><![CDATA[I got this list from a Princeton site, but here's my condensed, I-wasn't-smart-or-rich-enough-for-Princeton version. O(1): constant Running time is the same no matter how many inputs you have (N). O(log N): logarithmic Gets slightly slower as N grows. When N doubles, the running time increases by a constant. Example: Binary search, insert/delete on heap or [...]]]></description>
		<link>http://www.chinacatblog.com/2010/07/08/bigo/</link>
			</item>
</channel>
</rss>
