diff --git a/test/exercise/arrays/solution.rb b/test/exercise/arrays/solution.rb
index a7d518fc..235d0703 100644
--- a/test/exercise/arrays/solution.rb
+++ b/test/exercise/arrays/solution.rb
@@ -2,11 +2,18 @@ module Exercise
   module Arrays
     class << self
       def replace(array)
-        array
+        max_value = array[0]
+        array.each { |element| max_value = element if element > max_value }
+        array.map { |element| element.positive? ? max_value : element }
       end
 
-      def search(_array, _query)
-        0
+      def search(array, query, left = 0, right = array.length - 1)
+        return -1 if left > right || query < array[left] || query > array[right]
+
+        mid = (left + right) / 2
+        return mid if array[mid] == query
+
+        array[mid] > query ? search(array, query, left, mid - 1) : search(array, query, mid + 1, right)
       end
     end
   end
diff --git a/test/exercise/arrays/test.rb b/test/exercise/arrays/test.rb
index 6876461e..da91370a 100644
--- a/test/exercise/arrays/test.rb
+++ b/test/exercise/arrays/test.rb
@@ -4,7 +4,6 @@
 class Exercise::ArraysTest < Minitest::Test
   # Заменить все положительные элементы целочисленного массива на максимальное значение элементов массива.
   def test_replace
-    skip
     array = [3, 2, -8, 4, 100, -6, 7, 8, -99]
     new_array = Exercise::Arrays.replace(array)
 
@@ -14,7 +13,6 @@ def test_replace
   # Реализовать двоичный поиск
   # Функция должна возвращать индекс элемента
   def test_bin_search
-    skip
     assert Exercise::Arrays.search([1], 900) == -1
     assert Exercise::Arrays.search([1], 1).zero?
     assert Exercise::Arrays.search([], 900) == -1