Leaves - Raisah V.

lib/practice_exercises.rb

@@ -1,13 +1,35 @@
-
-# Time Complexity: ?
-# Space Complexity: ?
+# Time Complexity: The time complexity is O(n) because the algorithms time varies linearly with the length of the list array.
+# Space Complexity: O(n) where n is the length of the array. The space complexity varies with the length of the array.
 def remove_duplicates(list)
-  raise NotImplementedError, "Not implemented yet"
+  return list if list.length == 1 || list.length == 0
+
+  list.length.times do |i|
+    if list[i] == list [i - 1]
+      list.delete_at(i)
+    end
+  end
+
+  return list
 end
 
-# Time Complexity: ?
-# Space Complexity: ?
+# Time Complexity: The time complexity is O(nm) because in the worst case scenario the time that the algorithm takes can change linearly based on the length of the first string in the array passed AND the length of the array itself.
+# Space Complexity: O(1) because the space complexity is constant even as the array and string sizes change.
 def longest_prefix(strings)
-  raise NotImplementedError, "Not implemented yet"
+  common_prefix = ""
+  i = 0
+  match = true
+
+  while match == true
+    value = strings[0][i]
+    strings.each do |s|
+      if s[i] != value || s[i] == nil
+        match = false
+      end
+    end
+
+    common_prefix += value if match == true
+    i += 1
+  end
+
+  return common_prefix
 end
-

test/practice_exercises_test.rb

@@ -9,34 +9,45 @@
     it "works for empty arrays" do
       expect(remove_duplicates([])).must_equal []
     end
-
+    
     it "will remove duplicates for longer arrays" do
       expect(remove_duplicates([1, 2, 2, 3, 3, 4])).must_equal [1, 2, 3, 4]
     end
   end
-
+  
   describe "Longest valid substring" do
     it "will work for the README strings" do
       strings = ["flower","flow","flight"]
-
+      
       output = longest_prefix(strings)
-
+      
       expect(output).must_equal "fl"
     end
-
+    
     it "will work for the strings with the common prefix in the rear" do
       strings = ["flower","flow","flight", "fpastafl"]
-
+      
       output = longest_prefix(strings)
-
+      
       expect(output).must_equal "f"
     end
-
+
+    it "will work for the strings the same value" do
+      strings = ["flower","flower","flower"]
+
+      output = longest_prefix(strings)
+
+      expect(output).must_equal "flower"      
+      output = longest_prefix(strings)
+
+      expect(output).must_equal "flower"
+    end
+
     it "will work for the README strings" do
       strings = ["dog","racecar","car"]
-
+      
       output = longest_prefix(strings)
-
+      
       expect(output).must_equal ""
     end
   end