<?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>GeeksforGeeks</title>
	<atom:link href="http://www.geeksforgeeks.org/feed" rel="self" type="application/rss+xml" />
	<link>http://www.geeksforgeeks.org</link>
	<description>A computer science portal for geeks</description>
	<lastBuildDate>Fri, 18 May 2012 06:17:03 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.2</generator>
		<item>
		<title>Longest Monotonically Increasing Subsequence Size (N log N)</title>
		<link>http://www.geeksforgeeks.org/archives/9591?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=longest-monotonically-increasing-subsequence-size-n-log-n</link>
		<comments>http://www.geeksforgeeks.org/archives/9591#comments</comments>
		<pubDate>Fri, 18 May 2012 04:12:57 +0000</pubDate>
		<dc:creator>Venki</dc:creator>
				<category><![CDATA[Arrays]]></category>

		<guid isPermaLink="false">http://geeksforgeeks.org/?p=9591</guid>
		<description><![CDATA[After few months of gap posting an algo. The current post is pending from long time, and many readers (e.g. here, here, here may be few more, I am not keeping track of all) are posting requests for explanation of the below problem. Given an array of random numbers. Find longest monotonically increasing subsequence (LIS) in the array. [...]]]></description>
		<wfw:commentRss>http://www.geeksforgeeks.org/archives/9591/feed</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<item>
		<title>Dynamic Programming &#124; Set 14 (Maximum Sum Increasing Subsequence)</title>
		<link>http://www.geeksforgeeks.org/archives/19248?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=dynamic-programming-set-14-maximum-sum-increasing-subsequence</link>
		<comments>http://www.geeksforgeeks.org/archives/19248#comments</comments>
		<pubDate>Tue, 15 May 2012 16:46:41 +0000</pubDate>
		<dc:creator>GeeksforGeeks</dc:creator>
				<category><![CDATA[Misc]]></category>
		<category><![CDATA[Dynamic Programming]]></category>

		<guid isPermaLink="false">http://www.geeksforgeeks.org/?p=19248</guid>
		<description><![CDATA[Given an array of n positive integers. Write a program to find the sum of maximum sum subsequence of the given array such that the intgers in the subsequence are sorted in increasing order. For example, if input is {1, 101, 2, 3, 100, 4, 5}, then output should be 106 (1 + 2 + [...]]]></description>
		<wfw:commentRss>http://www.geeksforgeeks.org/archives/19248/feed</wfw:commentRss>
		<slash:comments>4</slash:comments>
		</item>
		<item>
		<title>Find subarray with given sum</title>
		<link>http://www.geeksforgeeks.org/archives/19267?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=find-subarray-with-given-sum</link>
		<comments>http://www.geeksforgeeks.org/archives/19267#comments</comments>
		<pubDate>Sun, 13 May 2012 08:57:33 +0000</pubDate>
		<dc:creator>GeeksforGeeks</dc:creator>
				<category><![CDATA[Arrays]]></category>

		<guid isPermaLink="false">http://www.geeksforgeeks.org/?p=19267</guid>
		<description><![CDATA[Given an unsorted array of nonnegative integers, find a continous subarray which adds to a given number. Examples: Input: arr[] = {1, 4, 20, 3, 10, 5}, sum = 33 Ouptut: Sum found between indexes 2 and 4 Input: arr[] = {1, 4, 0, 0, 3, 10, 5}, sum = 7 Ouptut: Sum found between [...]]]></description>
		<wfw:commentRss>http://www.geeksforgeeks.org/archives/19267/feed</wfw:commentRss>
		<slash:comments>18</slash:comments>
		</item>
		<item>
		<title>Dynamic Programming &#124; Set 13 (Cutting a Rod)</title>
		<link>http://www.geeksforgeeks.org/archives/19208?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=dynamic-programming-set-13-cutting-a-rod</link>
		<comments>http://www.geeksforgeeks.org/archives/19208#comments</comments>
		<pubDate>Fri, 11 May 2012 02:52:21 +0000</pubDate>
		<dc:creator>GeeksforGeeks</dc:creator>
				<category><![CDATA[Misc]]></category>
		<category><![CDATA[Dynamic Programming]]></category>

		<guid isPermaLink="false">http://www.geeksforgeeks.org/?p=19208</guid>
		<description><![CDATA[Given a rod of length n inches and an array of prices that contains prices of all pieces of size smaller than n. Determine the maximum value obtainable by cutting up the rod and selling the pieces. For example, if length of the rod is 8 and the values of different pieces are given as [...]]]></description>
		<wfw:commentRss>http://www.geeksforgeeks.org/archives/19208/feed</wfw:commentRss>
		<slash:comments>5</slash:comments>
		</item>
		<item>
		<title>Dynamic Programming &#124; Set 12 (Longest Palindromic Subsequence)</title>
		<link>http://www.geeksforgeeks.org/archives/19155?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=dynamic-programming-set-12-longest-palindromic-subsequence</link>
		<comments>http://www.geeksforgeeks.org/archives/19155#comments</comments>
		<pubDate>Tue, 08 May 2012 13:58:34 +0000</pubDate>
		<dc:creator>GeeksforGeeks</dc:creator>
				<category><![CDATA[Misc]]></category>
		<category><![CDATA[Dynamic Programming]]></category>

		<guid isPermaLink="false">http://www.geeksforgeeks.org/?p=19155</guid>
		<description><![CDATA[Given a sequence, find the length of the longest palindromic subsequence in it. For example, if the given sequence is &#8220;BBABCBCAB&#8221;, then the output should be 7 as &#8220;BABCBAB&#8221; is the longest palindromic subseuqnce in it. &#8220;BBBBB&#8221; and &#8220;BBCBB&#8221; are also palindromic subsequences of the given sequence, but not the longest ones. The naive solution [...]]]></description>
		<wfw:commentRss>http://www.geeksforgeeks.org/archives/19155/feed</wfw:commentRss>
		<slash:comments>11</slash:comments>
		</item>
		<item>
		<title>Scansets in C</title>
		<link>http://www.geeksforgeeks.org/archives/19140?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=scansets-in-c</link>
		<comments>http://www.geeksforgeeks.org/archives/19140#comments</comments>
		<pubDate>Sun, 06 May 2012 16:31:03 +0000</pubDate>
		<dc:creator>GeeksforGeeks</dc:creator>
				<category><![CDATA[C/C++ Puzzles]]></category>

		<guid isPermaLink="false">http://www.geeksforgeeks.org/?p=19140</guid>
		<description><![CDATA[scanf family functions support scanset specifiers which are represented by %[]. Inside scanset, we can specify single character or range of characters. While processing scanset, scanf will process only those characters which are part of scanset. We can define scanset by putting characters inside squre brackets. Please note that the scansets are case-sensitive. Let us [...]]]></description>
		<wfw:commentRss>http://www.geeksforgeeks.org/archives/19140/feed</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<item>
		<title>Backtracking &#124; Set 6 (Hamiltonian Cycle)</title>
		<link>http://www.geeksforgeeks.org/archives/19092?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=backtracking-set-7-hamiltonian-cycle</link>
		<comments>http://www.geeksforgeeks.org/archives/19092#comments</comments>
		<pubDate>Fri, 04 May 2012 06:59:37 +0000</pubDate>
		<dc:creator>GeeksforGeeks</dc:creator>
				<category><![CDATA[Misc]]></category>
		<category><![CDATA[Backtracking]]></category>

		<guid isPermaLink="false">http://www.geeksforgeeks.org/?p=19092</guid>
		<description><![CDATA[Hamiltonian Path in an undirected graph is a path that visits each vertex exactly once. A Hamiltonian cycle (or Hamiltonian circuit) is a Hamiltonian Path such that there is an edge (in graph) from the last vertex to the first vertex of the Hamiltonian Path. Determine whether a given graph contains Hamiltonian Cycle or not. [...]]]></description>
		<wfw:commentRss>http://www.geeksforgeeks.org/archives/19092/feed</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Pattern Searching &#124; Set 6 (Efficient Constructtion of Finite Automata)</title>
		<link>http://www.geeksforgeeks.org/archives/18902?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=pattern-searching-set-5-efficient-constructtion-of-finite-automata</link>
		<comments>http://www.geeksforgeeks.org/archives/18902#comments</comments>
		<pubDate>Wed, 02 May 2012 03:54:25 +0000</pubDate>
		<dc:creator>GeeksforGeeks</dc:creator>
				<category><![CDATA[Misc]]></category>
		<category><![CDATA[Pattern Searching]]></category>

		<guid isPermaLink="false">http://www.geeksforgeeks.org/?p=18902</guid>
		<description><![CDATA[In the previous post, we discussed Finite Automata based pattern searching algorithm. The FA (Finite Automata) construction method discussed in previous post takes O((m^3)*NO_OF_CHARS) time. FA can be constructed in O(m*NO_OF_CHARS) time. In this post, we will discuss the O(m*NO_OF_CHARS) algorithm for FA construction. The idea is similar to lps (longest prefix suffix) array construction [...]]]></description>
		<wfw:commentRss>http://www.geeksforgeeks.org/archives/18902/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Backttracking &#124; Set 5 (m Coloring Problem)</title>
		<link>http://www.geeksforgeeks.org/archives/19042?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=backttracking-set-5-m-coloring-problem</link>
		<comments>http://www.geeksforgeeks.org/archives/19042#comments</comments>
		<pubDate>Tue, 01 May 2012 09:31:57 +0000</pubDate>
		<dc:creator>GeeksforGeeks</dc:creator>
				<category><![CDATA[Misc]]></category>
		<category><![CDATA[Backtracking]]></category>

		<guid isPermaLink="false">http://www.geeksforgeeks.org/?p=19042</guid>
		<description><![CDATA[Given an undirected graph and a number m, determine if the graph can be colored with at most m colors such that no two adjacent vertices of the graph are colored with same color. Here coloring of a graph means assignment of colors to all vertices. Input: 1) A 2D array graph[V][V] where V is [...]]]></description>
		<wfw:commentRss>http://www.geeksforgeeks.org/archives/19042/feed</wfw:commentRss>
		<slash:comments>8</slash:comments>
		</item>
		<item>
		<title>G-Fact 92</title>
		<link>http://www.geeksforgeeks.org/archives/18912?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=g-fact-92</link>
		<comments>http://www.geeksforgeeks.org/archives/18912#comments</comments>
		<pubDate>Sun, 29 Apr 2012 22:54:27 +0000</pubDate>
		<dc:creator>GeeksforGeeks</dc:creator>
				<category><![CDATA[GFacts]]></category>

		<guid isPermaLink="false">http://www.geeksforgeeks.org/?p=18912</guid>
		<description><![CDATA[The C99 standard allows variable sized arrays (see this). But, unlike the normal arrays, variable sized arrays cannot be initialized. For example, the following program compiles and runs fine on a C99 compatible compiler. Output: 0 0 0 0 But the following fails with compilation error. Output: Compiler Error: variable-sized object may not be initialized [...]]]></description>
		<wfw:commentRss>http://www.geeksforgeeks.org/archives/18912/feed</wfw:commentRss>
		<slash:comments>6</slash:comments>
		</item>
		<item>
		<title>Swap bits in a given number</title>
		<link>http://www.geeksforgeeks.org/archives/18977?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=swap-bits-in-a-given-number</link>
		<comments>http://www.geeksforgeeks.org/archives/18977#comments</comments>
		<pubDate>Thu, 26 Apr 2012 18:49:19 +0000</pubDate>
		<dc:creator>GeeksforGeeks</dc:creator>
				<category><![CDATA[Bit Magic]]></category>

		<guid isPermaLink="false">http://www.geeksforgeeks.org/?p=18977</guid>
		<description><![CDATA[Given a number x and two positions (from right side) in binary representation of x, write a function that swaps n bits at given two positions and returns the result. It is also given that the two sets of bits do not overlap. Examples: Let p1 and p2 be the two given positions. Example 1 [...]]]></description>
		<wfw:commentRss>http://www.geeksforgeeks.org/archives/18977/feed</wfw:commentRss>
		<slash:comments>6</slash:comments>
		</item>
		<item>
		<title>Searching for Patterns &#124; Set 5 (Finite Automata)</title>
		<link>http://www.geeksforgeeks.org/archives/18919?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=searching-for-patterns-set-5-finite-automata</link>
		<comments>http://www.geeksforgeeks.org/archives/18919#comments</comments>
		<pubDate>Tue, 24 Apr 2012 17:42:25 +0000</pubDate>
		<dc:creator>GeeksforGeeks</dc:creator>
				<category><![CDATA[Misc]]></category>
		<category><![CDATA[Pattern Searching]]></category>

		<guid isPermaLink="false">http://www.geeksforgeeks.org/?p=18919</guid>
		<description><![CDATA[Given a text txt[0..n-1] and a pattern pat[0..m-1], write a function search(char pat[], char txt[]) that prints all occurrences of pat[] in txt[]. You may assume that n > m. Examples: 1) Input: txt[] = "THIS IS A TEST TEXT" pat[] = "TEST" Output: Pattern found at index 10 2) Input: txt[] = "AABAACAADAABAAABAA" pat[] [...]]]></description>
		<wfw:commentRss>http://www.geeksforgeeks.org/archives/18919/feed</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Dynamic Programming &#124; Set 11 (Egg Dropping Puzzle)</title>
		<link>http://www.geeksforgeeks.org/archives/18812?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=dynamic-programming-set-11-egg-dropping-puzzle</link>
		<comments>http://www.geeksforgeeks.org/archives/18812#comments</comments>
		<pubDate>Tue, 17 Apr 2012 12:20:32 +0000</pubDate>
		<dc:creator>GeeksforGeeks</dc:creator>
				<category><![CDATA[Misc]]></category>
		<category><![CDATA[Dynamic Programming]]></category>

		<guid isPermaLink="false">http://www.geeksforgeeks.org/?p=18812</guid>
		<description><![CDATA[The following is a description of the instance of this famous puzzle involving n=2 eggs and a building with k=36 floors. Suppose that we wish to know which stories in a 36-story building are safe to drop eggs from, and which will cause the eggs to break on landing. We make a few assumptions: &#8230;..An [...]]]></description>
		<wfw:commentRss>http://www.geeksforgeeks.org/archives/18812/feed</wfw:commentRss>
		<slash:comments>10</slash:comments>
		</item>
	</channel>
</rss>

<!-- Dynamic page generated in 5.569 seconds. -->
<!-- Cached page generated by WP-Super-Cache on 2012-05-19 02:53:33 -->

