style: comment

Author: 0x01f7

algorithms/3sum.rb

@@ -1,17 +1,19 @@
 # https://leetcode.com/problems/3sum/
 #
-# Given an array S of n integers, are there elements a, b, c
-# in S such that a + b + c = 0? Find all unique triplets in
-# the array which gives the sum of zero.
+# Given an array S of n integers, are there elements a, b, c in S such that
+# a + b + c = 0? Find all unique triplets in the array which gives the sum
+# of zero.
 #
 # Notes:
 #
-#     + Elements in a triplet (a,b,c) must be in non-descending
-#       order. (ie, a ≤ b ≤ c)
+#     + Elements in a triplet (a, b, c) must be in non-descending order.
+#       (ie, a <= b <= c)
 #     + The solution set must not contain duplicate triplets.
 #
-# For example, given array S = {-1 0 1 2 -1 -4}, A solution set
-# is: (-1, 0, 1) (-1, -1, 2)
+# For example, given array S = {-1 0 1 2 -1 -4}, A solution set is:
+#
+#     (-1,  0, 1)
+#     (-1, -1, 2)
 
 
 # @param {Integer[]} nums

algorithms/3sum_closest.rb

@@ -1,12 +1,11 @@
 # https://leetcode.com/problems/3sum-closest/
 #
-# Given an array S of n integers, find three integers in S such
-# that the sum is closest to a given number, target. Return the
-# sum of the three integers. You may assume that each input
-# would have exactly one solution.
+# Given an array S of n integers, find three integers in S such that the sum
+# is closest to a given number, target. Return the sum of the three integers.
+# You may assume that each input would have exactly one solution.
 #
-# For example, given array S = {-1 2 1 -4}, and target = 1. The
-# sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
+# For example, given array S = {-1 2 1 -4}, and target = 1. The sum that is
+# closest to the target is 2. (-1 + 2 + 1 = 2).
 
 
 # @param {Integer[]} nums

algorithms/4sum.rb

@@ -1,17 +1,17 @@
 # https://leetcode.com/problems/4sum/
 #
-# Given an array S of n integers, are there elements a, b, c, and d in S
-# such that a + b + c + d = target? Find all unique quadruplets in the
-# array which gives the sum of target.
+# Given an array S of n integers, are there elements a, b, c, and d in S such
+# that a + b + c + d = target? Find all unique quadruplets in the array which
+# gives the sum of target.
 #
-# Note:
+# Notes:
 #
-#     + Elements in a quadruplet (a,b,c,d) must be in non-descending
-#       order. (ie, a ≤ b ≤ c ≤ d)
+#     + Elements in a quadruplet (a, b, c, d) must be in non-descending order.
+#       (ie, a <= b <= c <= d)
 #     + The solution set must not contain duplicate quadruplets.
 #
-# For example, given array S = {1 0 -1 0 -2 2}, and target = 0. A solution
-# set is:
+# For example, given array S = {1 0 -1 0 -2 2}, and target = 0. A solution set
+# is:
 #
 #     (-1,  0, 0, 1)
 #     (-2, -1, 1, 2)