remy727 · May 4, 2023
diff --git a/‎algorithms/ruby/0011-container-with-most-water.rb
+1-1 b/‎algorithms/ruby/0011-container-with-most-water.rb
+1-1
diff --git a/‎algorithms/ruby/0016-3sum-closest.rb
+1-1 b/‎algorithms/ruby/0016-3sum-closest.rb
+1-1
@@ -2,7 +2,7 @@
 
 # 11. Container With Most Water
 # https://leetcode.com/problems/container-with-most-water/
-# Difficulty: Medium
+# Medium
 
 =begin
 
 
@@ -2,7 +2,7 @@
 
 # 16. 3Sum Closest
 # https://leetcode.com/problems/3sum-closest/
-# Difficulty: Medium
+# Medium
 
 =begin
 Given an integer array nums of length n and an integer target, find three integers in nums such that the sum is closest to target.