Added unique-substrings test

unique-substrings/README.md

@@ -0,0 +1,12 @@
+Unique substrings
+=================
+
+Given a string, find the number of unique substrings in it. The string will contain a maximum of 1000 characters and each character will be in the range 'a' - 'z' or 'A' - 'Z'. A substring is a contiguous set of characters. 
+
+Sample input
+abababababababababababababababababab
+
+Sample output
+71
+
+Read the string from STDIN and output to STDOUT

unique-substrings/input00.txt

@@ -0,0 +1 @@
+abababababababababababababababababab

unique-substrings/output00.txt

@@ -0,0 +1 @@
+71

unique-substrings/unique_substrings.py

@@ -0,0 +1,22 @@
+#!/usr/bin/env python
+
+__author__ = "Alonso Vidales"
+__email__ = "alonso.vidales@tras2.es"
+__date__ = "2013-03-21"
+
+class UniqueSubstrings:
+    def resolve(self):
+        # Will contain all the possible substrings
+        substrings = set()
+
+        # Get all the possible substrings from the main string
+        for count in xrange(0, len(self.string)):
+            for subStrLen in xrange(0, len(self.string) - count):
+                substrings.add(self.string[count:count + subStrLen + 1])
+
+        return len(substrings)
+
+    def __init__(self, inStr):
+        self.string = inStr
+
+print UniqueSubstrings(raw_input()).resolve()