2024-08-20 v. 6.5.1: updated some tests

Author: fartem

test/easy/test_500_keyboard_row.rb

@@ -5,15 +5,14 @@
 require 'minitest/autorun'
 
 class KeyboardRowTest < ::Minitest::Test
-  def test_default
+  def test_default_one
     assert_equal(
       %w[Alaska Dad],
       find_words(%w[Hello Alaska Dad Peace])
     )
-    assert_equal([], find_words(['omk']))
   end
 
-  def test_additional
-    assert_equal(['MMM'], find_words(['MMM']))
-  end
+  def test_default_two = assert_equal([], find_words(['omk']))
+
+  def test_additional_one = assert_equal(['MMM'], find_words(['MMM']))
 end

test/easy/test_501_find_mode_in_binary_search_tree.rb

@@ -6,7 +6,7 @@
 require 'minitest/autorun'
 
 class FindModeInBinarySearchTreeTest < ::Minitest::Test
-  def test_default
+  def test_default_one
     assert_equal(
       [2],
       find_mode(
@@ -21,9 +21,14 @@ def test_default
         )
       )
     )
+  end
+
+  def test_default_two
     assert_equal(
       [0],
-      find_mode(::TreeNode.new(0))
+      find_mode(
+        ::TreeNode.new(0)
+      )
     )
   end
 end

test/easy/test_504_base_7.rb

@@ -5,8 +5,7 @@
 require 'minitest/autorun'
 
 class Base7Test < ::Minitest::Test
-  def test_default
-    assert_equal('202', convert_to_base7(100))
-    assert_equal('-10', convert_to_base7(-7))
-  end
+  def test_default_one = assert_equal('202', convert_to_base7(100))
+
+  def test_default_two = assert_equal('-10', convert_to_base7(-7))
 end

test/easy/test_506_relative_ranks.rb

@@ -5,15 +5,30 @@
 require 'minitest/autorun'
 
 class RelativeRanksTest < ::Minitest::Test
-  def test_default
+  def test_default_one
     assert_equal(
-      ['Gold Medal', 'Silver Medal', 'Bronze Medal', '4', '5'],
+      [
+        'Gold Medal',
+        'Silver Medal',
+        'Bronze Medal',
+        '4',
+        '5'
+      ],
       find_relative_ranks(
         [5, 4, 3, 2, 1]
       )
     )
+  end
+
+  def test_default_two
     assert_equal(
-      ['Gold Medal', '5', 'Bronze Medal', 'Silver Medal', '4'],
+      [
+        'Gold Medal',
+        '5',
+        'Bronze Medal',
+        'Silver Medal',
+        '4'
+      ],
       find_relative_ranks(
         [10, 3, 8, 9, 4]
       )

test/easy/test_507_perfect_number.rb

@@ -5,8 +5,7 @@
 require 'minitest/autorun'
 
 class PerfectNumberTest < ::Minitest::Test
-  def test_default
-    assert(check_perfect_number(28))
-    assert(!check_perfect_number(7))
-  end
+  def test_default_one = assert(check_perfect_number(28))
+
+  def test_default_two = assert(!check_perfect_number(7))
 end

test/easy/test_509_fibonacci_number.rb

@@ -5,9 +5,9 @@
 require 'minitest/autorun'
 
 class FibonacciNumberTest < ::Minitest::Test
-  def test_default
-    assert_equal(1, fib(2))
-    assert_equal(2, fib(3))
-    assert_equal(3, fib(4))
-  end
+  def test_default_one = assert_equal(1, fib(2))
+
+  def test_default_two = assert_equal(2, fib(3))
+
+  def test_default_three =assert_equal(3, fib(4))
 end

test/easy/test_520_detect_capital.rb

@@ -5,12 +5,9 @@
 require 'minitest/autorun'
 
 class DetectCapitalTest < ::Minitest::Test
-  def test_default
-    assert(detect_capital_use('USA'))
-    assert(!detect_capital_use('FlaG'))
-  end
+  def test_default_one = assert(detect_capital_use('USA'))
 
-  def test_additional
-    assert(detect_capital_use('word'))
-  end
+  def test_default_two = assert(!detect_capital_use('FlaG'))
+
+  def test_additional_one = assert(detect_capital_use('word'))
 end

test/easy/test_521_longest_uncommon_subsequence_i.rb

@@ -5,13 +5,11 @@
 require 'minitest/autorun'
 
 class LongestUncommonSubsequenceITest < ::Minitest::Test
-  def test_default
-    # assert_equal(3, find_lu_slength('aba', 'cdc'))
-    # assert_equal(3, find_lu_slength('aaa', 'bbb'))
-    # assert_equal(-1, find_lu_slength('aaa', 'aaa'))
-  end
+  def test_default_one = assert_equal(3, find_lu_slength('aba', 'cdc'))
 
-  def test_additional
-    assert_equal(3, find_lu_slength('abc', 'bca'))
-  end
+  def test_default_two = assert_equal(3, find_lu_slength('aaa', 'bbb'))
+
+  def test_default_three = assert_equal(-1, find_lu_slength('aaa', 'aaa'))
+
+  def test_additional_one = assert_equal(3, find_lu_slength('abc', 'bca'))
 end

test/easy/test_530_minimum_absolute_difference_in_bst.rb

@@ -6,7 +6,7 @@
 require 'minitest/autorun'
 
 class MinimumAbsoluteDifferenceInBSTTest < ::Minitest::Test
-  def test_default
+  def test_default_one
     assert_equal(
       1,
       get_minimum_difference(
@@ -21,6 +21,9 @@ def test_default
         )
       )
     )
+  end
+
+  def test_default_two
     assert_equal(
       1,
       get_minimum_difference(

test/easy/test_543_diameter_of_binary_tree.rb

@@ -6,7 +6,7 @@
 require 'minitest/autorun'
 
 class DiameterOfBinaryTreeTest < ::Minitest::Test
-  def test_default
+  def test_default_one
     assert_equal(
       3,
       diameter_of_binary_tree(
@@ -21,6 +21,9 @@ def test_default
         )
       )
     )
+  end
+
+  def test_default_two
     assert_equal(
       1,
       diameter_of_binary_tree(

test/easy/test_551_student_attendance_record_i.rb

@@ -5,8 +5,7 @@
 require 'minitest/autorun'
 
 class StudentAttendanceRecordITest < ::Minitest::Test
-  def test_default
-    assert(check_record('PPALLP'))
-    assert(!check_record('PPALLL'))
-  end
+  def test_default_one = assert(check_record('PPALLP'))
+
+  def test_default_two = assert(!check_record('PPALLL'))
 end

test/easy/test_557_reverse_words_in_a_string_iii.rb

@@ -5,11 +5,14 @@
 require 'minitest/autorun'
 
 class ReverseWordsInAStringIIITest < ::Minitest::Test
-  def test_default
+  def test_default_one
     assert_equal(
       "s'teL ekat edoCteeL tsetnoc",
       reverse_words("Let's take LeetCode contest")
     )
+  end
+
+  def test_default_two
     assert_equal(
       'doG gniD',
       reverse_words('God Ding')

test/easy/test_559_maximum_depth_of_n_ary_tree.rb

@@ -6,7 +6,7 @@
 require 'minitest/autorun'
 
 class MaximumDepthOfNAryTreeTest < ::Minitest::Test
-  def test_default
+  def test_default_one
     assert_equal(
       3,
       max_depth_of_n_ary_tree(
@@ -26,6 +26,9 @@ def test_default
         )
       )
     )
+  end
+
+  def test_default_two
     assert_equal(
       5,
       max_depth_of_n_ary_tree(

test/easy/test_561_array_partition.rb

@@ -5,13 +5,16 @@
 require 'minitest/autorun'
 
 class ArrayPartitionTest < ::Minitest::Test
-  def test_default
+  def test_default_one
     assert_equal(
       4,
       array_pair_sum(
         [1, 4, 3, 2]
       )
     )
+  end
+
+  def test_default_two
     assert_equal(
       9,
       array_pair_sum(

test/easy/test_563_binary_tree_tilt.rb

@@ -6,7 +6,7 @@
 require 'minitest/autorun'
 
 class BinaryTreeTiltTest < ::Minitest::Test
-  def test_default
+  def test_default_one
     assert_equal(
       1,
       find_tilt(
@@ -17,6 +17,9 @@ def test_default
         )
       )
     )
+  end
+
+  def test_default_two
     assert_equal(
       15,
       find_tilt(
@@ -35,6 +38,9 @@ def test_default
         )
       )
     )
+  end
+
+  def test_default_three
     assert_equal(
       9,
       find_tilt(

test/easy/test_566_reshape_the_matrix.rb

@@ -5,7 +5,7 @@
 require 'minitest/autorun'
 
 class ReshapeTheMatrixTest < ::Minitest::Test
-  def test_default
+  def test_default_one
     assert_equal(
       [[1, 2, 3, 4]],
       matrix_reshape(
@@ -14,6 +14,9 @@ def test_default
         4
       )
     )
+  end
+
+  def test_default_two
     assert_equal(
       [[1, 2], [3, 4]],
       matrix_reshape(

test/easy/test_572_subtree_of_another_tree.rb

@@ -6,7 +6,7 @@
 require 'minitest/autorun'
 
 class SubtreeOfAnotherTreeTest < ::Minitest::Test
-  def test_default
+  def test_default_one
     assert(
       is_subtree(
         ::TreeNode.new(
@@ -25,6 +25,9 @@ def test_default
         )
       )
     )
+  end
+
+  def test_default_two
     assert(
       !is_subtree(
         ::TreeNode.new(

test/easy/test_589_n_ary_tree_preorder_traversal.rb

@@ -8,7 +8,7 @@
 require 'minitest/autorun'
 
 class NAryTreePreorderTraversalTest < ::Minitest::Test
-  def test_default
+  def test_default_one
     assert_equal(
       [1, 3, 5, 6, 2, 4],
       preorder(
@@ -28,6 +28,9 @@ def test_default
         )
       )
     )
+  end
+
+  def test_default_two
     assert_equal(
       [1, 2, 3, 6, 7, 11, 14, 4, 8, 12, 5, 9, 13, 10],
       preorder(

test/easy/test_590_n_ary_tree_postorder_traversal.rb

@@ -6,7 +6,7 @@
 require 'minitest/autorun'
 
 class NAryTreePostorderTraversalTest < ::Minitest::Test
-  def test_default
+  def test_default_one
     assert_equal(
       [5, 6, 3, 2, 4, 1],
       postorder(
@@ -26,6 +26,9 @@ def test_default
         )
       )
     )
+  end
+
+  def test_default_two
     assert_equal(
       [2, 6, 14, 11, 7, 3, 12, 8, 4, 13, 9, 10, 5, 1],
       postorder(

test/easy/test_594_longest_harmonious_subsequence.rb

@@ -5,9 +5,9 @@
 require 'minitest/autorun'
 
 class LongestHarmoniousSubsequenceTest < ::Minitest::Test
-  def test_default
-    assert_equal(5, find_lhs([1, 3, 2, 2, 5, 2, 3, 7]))
-    assert_equal(2, find_lhs([1, 2, 3, 4]))
-    assert_equal(0, find_lhs([1, 1, 1, 1]))
-  end
+  def test_default_one = assert_equal(5, find_lhs([1, 3, 2, 2, 5, 2, 3, 7]))
+
+  def test_default_two = assert_equal(2, find_lhs([1, 2, 3, 4]))
+
+  def test_default_three = assert_equal(0, find_lhs([1, 1, 1, 1]))
 end