style: comment

Author: 0x01f7

algorithms/climbing_stairs.rb

@@ -1,8 +1,8 @@
 # https://leetcode.com/problems/climbing-stairs/
 #
-# You are climbing a stair case. It takes n steps to reach to the
-# top. Each time you can either climb 1 or 2 steps. In how many
-# distinct ways can you climb to the top?
+# You are climbing a stair case. It takes n steps to reach to the top. Each
+# time you can either climb 1 or 2 steps. In how many distinct ways can you
+# climb to the top?
 
 
 # @param {Integer} n

algorithms/combination_sum.rb

@@ -1,19 +1,18 @@
 # https://leetcode.com/problems/combination-sum/
 #
-# Given a set of candidate numbers(C) and a target number(T), find all
-# unique combinations in C where the candidate numbers sums to T.
+# Given a set of candidate numbers(C) and a target number(T), find all unique
+# combinations in C where the candidate numbers sums to T. The same repeated
+# number may be chosen from C unlimited number of times.
 #
-# The same repeated number may be chosen from C unlimited number of
-# times.
-#
-# Note:
+# Notes:
 #
 #     + All numbers (including target) will be positive integers.
-#     + Elements in a combination (a1, a2, ..., ak) must be in
-#       non-descending order. (ie, a1 <= a2 <= ... <= ak).
+#     + Elements in a combination (a1, a2, ..., ak) must be in non-descending
+#       order. (ie, a1 <= a2 <= ... <= ak).
 #     + The solution set must not contain duplicate combinations.
 #
-# For example, given candidate set 2,3,6,7 and target 7, A solution set is:
+# For example, given candidate set {2, 3, 6, 7} and target 7, A solution set
+# is:
 #
 #     [7]
 #     [2, 2, 3]

algorithms/combination_sum_ii.rb

@@ -1,18 +1,17 @@
 # https://leetcode.com/problems/combination-sum-ii/
 #
-# Given a collection of candidate numbers(C) and a target number(T), find
-# all unique combinations in C where the candidate numbers sums to T.
+# Given a collection of candidate numbers(C) and a target number(T), find all
+# unique combinations in C where the candidate numbers sums to T. Each number
+# in C may only be used once in the combination.
 #
-# Each number in C may only be used once in the combination.
-#
-# Note:
+# Notes:
 #
 #     + All numbers (including target) will be positive integers.
-#     + Elements in a combination (a1, a2, ..., ak) must be in
-#       non-descending order. (ie, a1 <= a2 <= ... <= ak).
+#     + Elements in a combination (a1, a2, ..., ak) must be in non-descending
+#       order. (ie, a1 <= a2 <= ... <= ak).
 #     + The solution set must not contain duplicate combinations.
 #
-# For example, given candidate set 10,1,2,7,6,1,5 and target 8, A
+# For example, given candidate set {10, 1, 2, 7, 6, 1, 5} and target 8, a
 # solution set is:
 #
 #     [1, 7]

algorithms/combination_sum_iii.rb

@@ -1,20 +1,24 @@
 # https://leetcode.com/problems/combination-sum-iii/
 #
-# Find all possible combinations of k numbers that add up to a
-# number n, given that only numbers from 1 to 9 can be used
-# and each combination should be a unique set of numbers.
-#
-# Ensure that numbers within the set are sorted in ascending order.
+# Find all possible combinations of k numbers that add up to a number n, given
+# that only numbers from 1 to 9 can be used and each combination should be a
+# unique set of numbers. Ensure that numbers within the set are sorted in
+# ascending order.
 #
 # Example 1:
 #
 #     Input: k = 3, n = 7
-#     Output: [[1,2,4]]
+#     Output: [[1, 2, 4]]
 #
 # Example 2:
 #
 #     Input: k = 3, n = 9
-#     Output: [[1,2,6], [1,3,5], [2,3,4]]
+#     Output: [[1, 2, 6], [1, 3, 5], [2, 3, 4]]
+#
+# Credits:
+#
+#     Special thanks to @mithmatt for adding this problem and creating all
+#     test cases.
 
 
 # @param {Integer} k

algorithms/combinations.rb

@@ -6,12 +6,12 @@
 # For example, If n = 4 and k = 2, a solution is:
 #
 #     [
-#       [2,4],
-#       [3,4],
-#       [2,3],
-#       [1,2],
-#       [1,3],
-#       [1,4],
+#       [2, 4],
+#       [3, 4],
+#       [2, 3],
+#       [1, 2],
+#       [1, 3],
+#       [1, 4],
 #     ]