<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en-GB">
	<id>https://wiki.kram.nz/index.php?action=history&amp;feed=atom&amp;title=SE701%3ARedundant_detector</id>
	<title>SE701:Redundant detector - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.kram.nz/index.php?action=history&amp;feed=atom&amp;title=SE701%3ARedundant_detector"/>
	<link rel="alternate" type="text/html" href="https://wiki.kram.nz/index.php?title=SE701:Redundant_detector&amp;action=history"/>
	<updated>2026-06-30T07:40:17Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.45.3</generator>
	<entry>
		<id>https://wiki.kram.nz/index.php?title=SE701:Redundant_detector&amp;diff=121&amp;oldid=prev</id>
		<title>Mark: New page: * Description: implement a redundancy detector. Design and implement an algorithm for finding the longest repeated sequence in a long string of characters. For example, abra is the longest...</title>
		<link rel="alternate" type="text/html" href="https://wiki.kram.nz/index.php?title=SE701:Redundant_detector&amp;diff=121&amp;oldid=prev"/>
		<updated>2008-02-15T20:20:29Z</updated>

		<summary type="html">&lt;p&gt;New page: * Description: implement a redundancy detector. Design and implement an algorithm for finding the longest repeated sequence in a long string of characters. For example, abra is the longest...&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;* Description: implement a redundancy detector. Design and implement an algorithm for finding the longest repeated sequence in a long string of characters. For example, abra is the longest repeated sequence in the string abracadabra.&lt;br /&gt;
&lt;br /&gt;
Another algorithm related topic.&lt;br /&gt;
&lt;br /&gt;
More info: http://www.cs.princeton.edu/courses/archive/spring03/cs226/assignments/redundant.html&lt;/div&gt;</summary>
		<author><name>Mark</name></author>
	</entry>
</feed>