Merge pull request ashutosh97#107 from maryheng/master

Added Get Longest Sorted Sequence question.

Author: ashutosh97

Get Longest Sorted Sequence/answer.py

@@ -0,0 +1,40 @@
+def get_longest_sorted_sequence(words):
+    count = 1
+    total_letters = 0
+    current = 0
+    increasing_sum = 0
+    is_sequence = True
+
+    if len(words) == 0:
+        return 0
+    else:
+        current = len(words[0])
+
+    for i in range (1, len(words)):
+        next = len(words[i])
+        if current == next-1:
+            print(current)
+            # in sequence
+            count += 1
+            current = len(words[i])
+            print(current)
+        else:
+            current = len(words[i])
+
+    return count
+
+
+# test cases
+print ('Actual  :' + str(get_longest_sorted_sequence(['a', 'is', 'ape', 'in'])))
+print ()
+
+
+print ('Actual  :' + str(get_longest_sorted_sequence(['apple', 'in', 'has', 'wed', 'code', 'rocks', 'bee'])))
+print ()
+
+
+print ('Actual  :' + str(get_longest_sorted_sequence(['apple'])))
+print ()
+
+print ('Actual  :' + str(get_longest_sorted_sequence([])))
+print ()

Get Longest Sorted Sequence/problem.txt

@@ -0,0 +1,3 @@
+The function takes in as its parameter a list called words that contains strings. This function first calculates the length of each word, and then returns the count whereby the sequence formed by the length of the words is in increasing order.
+
+The function calculates the length of every string in the list. It has to then generate a sequence of numbers that are of increasing numberical value and return the length of the longest such sequence generated.