Longest repeated substring problem: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

14 November 2014

  • curprev 20:0720:07, 14 November 2014en>Anurag.x.singh 1,406 bytes +367 Added External link for C implementation of Longest Repeated Substring using Suffix Tree

26 October 2013

5 December 2011