diff --git a/test_skeleton.rb b/test_skeleton.rb
index 8f3e6f5..8d78138 100644
--- a/test_skeleton.rb
+++ b/test_skeleton.rb
@@ -10,7 +10,9 @@ 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'
+    # return 'odd' if number % 2 == 1
+    # return 'even'
   end
 
   # https://www.codewars.com/kata/5583090cbe83f4fd8c000051
@@ -21,7 +23,13 @@ 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
+    result = []
+    while number >= 10 do
+      digit = number % 10
+      result << digit
+      number = (number - digit) / 10
+    end
+    result << number
   end
 
   # https://www.codewars.com/kata/554b4ac871d6813a03000035
@@ -36,7 +44,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
+    digits = test_string.split.map { |char| char.to_i}
+    digits.sort!
+    "#{digits[digits.length-1]} #{digits[0]}"
   end
 
   # https://www.codewars.com/kata/5b16490986b6d336c900007d
@@ -49,7 +59,12 @@ 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 = []
+    sorted = hash.sort_by { |language, score| -score }
+    sorted.each do |language, score|    
+      result << language if score >= 60
+    end
+    result
   end
 
   # https://www.codewars.com/kata/563089b9b7be03472d00002b
@@ -62,7 +77,11 @@ 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
+    result = []
+    source_array.each do |num|
+      result << num unless values_array.include?(num)
+    end
+    result
   end
 
   # https://www.codewars.com/kata/5b39e91ee7a2c103300018b3
@@ -72,7 +91,14 @@ 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
+    result = []
+    words = string.split
+    previous_word = nil
+    words.each do |word|
+      result << word if word != previous_word
+      previous_word = word
+    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
+    length = test_string.length
+    return test_string if length <= 2
+    length.even? ? test_string[length / 2 - 1, 2] : test_string[(length - 1) / 2]
   end
 end