feat: implement tasks

test_skeleton.rb

@@ -10,7 +10,7 @@ class TestSkeleton
   # TestSkeleton.new.even_or_odd(0) should return "even"
   # TestSkeleton.new.even_or_odd(-42) should return "even"
   def even_or_odd(number)
-    # Your solution should be here
+    number.even? ? "even" : "odd"
   end
 
   # https://www.codewars.com/kata/5583090cbe83f4fd8c000051
@@ -21,7 +21,7 @@ def even_or_odd(number)
   # TestSkeleton.new.reverse_array(348597) should return [7,9,5,8,4,3]
   # TestSkeleton.new.reverse_array(0) should return [0]
   def reverse_array(number)
-    # Your solution should be here
+    number.to_s.split('').reverse.map { |el| el.to_i }
   end
 
   # https://www.codewars.com/kata/554b4ac871d6813a03000035
@@ -36,7 +36,9 @@ def reverse_array(number)
   # There will always be at least one number in the input string.
   # Output string must be two numbers separated by a single space, and highest number is first.
   def high_and_low(test_string)
-    # Your solution should be here
+    raw = test_string.split(' ').map { |el| el.to_i }
+
+    "#{raw.max} #{raw.min}"
   end
 
   # https://www.codewars.com/kata/5b16490986b6d336c900007d
@@ -49,7 +51,14 @@ def high_and_low(test_string)
   # TestSkeleton.new.my_languages({"Hindi" => 60, "Dutch" => 93, "Greek" => 71}) should return ["Dutch", "Greek", "Hindi"]
   # TestSkeleton.new.my_languages({"C++" => 50, "ASM" => 10, "Haskell" => 20}) should return [] 
   def my_languages(hash)
-    # Your solution should be here
+    result = []
+
+    hash.select { |val, key| key >= 60 }
+        .values
+        .sort { |x,y| y <=> x }
+        .each { |el| result << hash.key(el) }
+
+    result
   end
 
   # https://www.codewars.com/kata/563089b9b7be03472d00002b
@@ -62,7 +71,9 @@ def my_languages(hash)
   # values_list = [1, 3, 4, 2]
   # TestSkeleton.new.remove_array_elements(integer_list, values_list) should return [5, 6 ,7 ,8]
   def remove_array_elements(source_array, values_array)
-    # Your solution should be here
+    values_array.each { |el| source_array.delete el  }
+
+    source_array
   end
 
   # https://www.codewars.com/kata/5b39e91ee7a2c103300018b3
@@ -72,7 +83,22 @@ def remove_array_elements(source_array, values_array)
   # string = "alpha beta beta gamma gamma gamma delta alpha beta beta gamma gamma gamma delta"
   # TestSkeleton.new.consecutive_duplicates(string) should return "alpha beta gamma delta alpha beta gamma delta"
   def consecutive_duplicates(string)
-    # Your solution should be here
+    arr = string.split(' ')
+    result = []
+    i = 0
+    pointer = arr[0]
+
+    while i < arr.size 
+
+      if pointer != arr[i+1] 
+        result << arr[i]
+        pointer = arr[i+1]
+      end
+
+      i += 1
+    end
+
+    result.join(' ')
   end
 
   # https://www.codewars.com/kata/56747fd5cb988479af000028
@@ -90,6 +116,8 @@ def consecutive_duplicates(string)
   # Output:
   # The middle character(s) of the word represented as a string.
   def middle_chars(test_string)
-    # Your solution should be here
+    middle = test_string.size / 2
+
+    test_string.size.odd? ? test_string[middle] : test_string[middle - 1] + test_string[middle]
   end
 end