Add longest increasing subseq challenge

recursion_dynamic/longest_inc_subseq/test_longest_increasing_subseq.py

@@ -0,0 +1,22 @@
+from nose.tools import assert_equal, assert_raises
+
+
+class TestLongestIncreasingSubseq(object):
+
+    def test_longest_increasing_subseq(self):
+        subseq = Subsequence()
+        assert_raises(TypeError, subseq.longest_inc_subseq, None)
+        assert_equal(subseq.longest_inc_subseq([]), [])
+        seq = [3, 4, -1, 0, 6, 2, 3]
+        expected = [-1, 0, 2, 3]
+        assert_equal(subseq.longest_inc_subseq(seq), expected)
+        print('Success: test_longest_increasing_subseq')
+
+
+def main():
+    test = TestLongestIncreasingSubseq()
+    test.test_longest_increasing_subseq()
+
+
+if __name__ == '__main__':
+    main()