style: comment

Author: 0x01f7

Diff for: algorithms/palindrome_partitioning.rb

@@ -1,9 +1,7 @@
 # https://leetcode.com/problems/palindrome-partitioning/
 #
-# Given a string s, partition s such that every substring of the
-# partition is a palindrome.
-#
-# Return all possible palindrome partitioning of s.
+# Given a string s, partition s such that every substring of the partition is
+# a palindrome. Return all possible palindrome partitioning of s.
 #
 # For example, given s = "aab", Return
 #

Diff for: algorithms/palindrome_partitioning_ii.rb

@@ -1,11 +1,11 @@
 # https://leetcode.com/problems/palindrome-partitioning-ii/
 #
-# Given a string s, partition s such that every substring of the
-# partition is a palindrome. Return the minimum cuts needed for
-# a palindrome partitioning of s.
+# Given a string s, partition s such that every substring of the partition is
+# a palindrome. Return the minimum cuts needed for a palindrome partitioning
+# of s.
 #
-# For example, given s = "aab", Return 1 since the palindrome
-# partitioning ["aa","b"] could be produced using 1 cut.
+# For example, given s = "aab", Return 1 since the palindrome partitioning
+# ["aa","b"] could be produced using 1 cut.
 
 
 # @param {String} s

Diff for: algorithms/partition_list.rb

@@ -1,15 +1,15 @@
 # https://leetcode.com/problems/partition-list/
 #
-# Given a linked list and a value x, partition it such that all nodes
-# less than x come before nodes greater than or equal to x.
+# Given a linked list and a value x, partition it such that all nodes less
+# than x come before nodes greater than or equal to x.
 #
-# You should preserve the original relative order of the nodes in
-# each of the two partitions.
+# You should preserve the original relative order of the nodes in each of the
+# two partitions.
 #
-# For example,
+# For example:
 #
 #     Given 1->4->3->2->5->2 and x = 3,
-#     return 1->2->2->4->3->5.
+#     Return 1->2->2->4->3->5.
 
 
 # Definition for singly-linked list.

Diff for: algorithms/pascals_triangle_ii.rb

@@ -3,6 +3,10 @@
 # Given an index k, return the kth row of the Pascal's triangle.
 #
 # For example, given k = 3, Return [1,3,3,1].
+#
+# Note:
+#
+#     Could you optimize your algorithm to use only O(k) extra space?
 
 
 # @param {Integer} row_index

Diff for: algorithms/path_sum.rb

@@ -1,8 +1,7 @@
 # https://leetcode.com/problems/path-sum/
 #
-# Given a binary tree and a sum, determine if the tree has a
-# root-to-leaf path such that adding up all the values along
-# the path equals the given sum.
+# Given a binary tree and a sum, determine if the tree has a root-to-leaf path
+# such that adding up all the values along the path equals the given sum.
 #
 # For example:
 #
@@ -16,7 +15,7 @@
 #          / \       \
 #         7   2       1
 #
-#     return true, as there exist a root-to-leaf
+#     Return true, as there exist a root-to-leaf
 #     path 5->4->11->2 which sum is 22.
 
 

Diff for: algorithms/path_sum_ii.rb

@@ -1,24 +1,26 @@
 # https://leetcode.com/problems/path-sum-ii/
 #
-# Given a binary tree and a sum, find all root-to-leaf paths where
-# each path's sum equals the given sum.
+# Given a binary tree and a sum, find all root-to-leaf paths where each path's
+# sum equals the given sum.
 #
-# For example: Given the below binary tree and sum = 22,
+# For example:
 #
-#           5
-#          / \
-#         4   8
-#        /   / \
-#       11  13  4
-#      /  \    / \
-#     7    2  5   1
+#     Given the below binary tree and sum = 22,
 #
-# return
+#               5
+#              / \
+#             4   8
+#            /   / \
+#           11  13  4
+#          /  \    / \
+#         7    2  5   1
 #
-#     [
-#       [5,4,11,2],
-#       [5,8,4,5]
-#     ]
+#     Return
+#
+#         [
+#           [5, 4, 11, 2],
+#           [5, 8, 4, 5]
+#         ]
 
 
 # Definition for a binary tree node.

Diff for: algorithms/perfect_squares.rb

@@ -1,12 +1,17 @@
 # https://leetcode.com/problems/perfect-squares/
 #
-# Given a positive integer n, find the least number of perfect square
-# numbers (for example, 1, 4, 9, 16, ...) which sum to n.
+# Given a positive integer n, find the least number of perfect square numbers
+# (for example, 1, 4, 9, 16, ...) which sum to n.
 #
 # For example,
 #
 #     given n = 12, return 3 because 12 = 4 + 4 + 4;
 #     given n = 13, return 2 because 13 = 4 + 9.
+#
+# Credits:
+#
+#     Special thanks to @jianchao.li.fighter for adding this problem and
+#     creating all test cases.
 
 
 # @param {Integer} n

Diff for: algorithms/permutation_sequence.rb

@@ -1,8 +1,8 @@
 # https://leetcode.com/problems/permutation-sequence/
 #
-# The set [1,2,3,…,n] contains a total of n! unique permutations.
-# By listing and labeling all of the permutations in order, We
-# get the following sequence (ie, for n = 3):
+# The set [1,2,3,…,n] contains a total of n! unique permutations. By listing
+# and labeling all of the permutations in order, We get the following sequence
+# (ie, for n = 3):
 #
 #     1. "123"
 #     2. "132"

Diff for: algorithms/permutations.rb

@@ -4,8 +4,8 @@
 #
 # For example,
 #
-#     [1,2,3] have the following permutations:
-#     [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1]
+#     [1, 2, 3] have the following permutations:
+#     [1, 2, 3], [1, 3, 2], [2, 1, 3], [2, 3, 1], [3, 1, 2], and [3, 2, 1]
 
 
 # @param {Integer[]} nums

Diff for: algorithms/permutations_ii.rb

@@ -1,12 +1,12 @@
 # https://leetcode.com/problems/permutations-ii/
 #
-# Given a collection of numbers that might contain duplicates, return
-# all possible unique permutations.
+# Given a collection of numbers that might contain duplicates, return all
+# possible unique permutations.
 #
 # For example,
 #
-#     [1,1,2] have the following unique permutations:
-#     [1,1,2], [1,2,1], and [2,1,1].
+#     [1, 1, 2] have the following unique permutations:
+#     [1, 1, 2], [1, 2, 1], and [2, 1, 1].
 
 
 # @param {Integer[]} nums

Diff for: algorithms/plus_one.rb

@@ -1,8 +1,8 @@
 # https://leetcode.com/problems/plus-one/
 #
-# Given a non-negative number represented as an array of digits, plus
-# one to the number. The digits are stored such that the most significant
-# digit is at the head of the list.
+# Given a non-negative number represented as an array of digits, plus one to
+# the number. The digits are stored such that the most significant digit is
+# at the head of the list.
 
 
 # @param {Integer[]} digits

Diff for: algorithms/power_of_two.rb

@@ -1,6 +1,11 @@
 # https://leetcode.com/problems/power-of-two/
 #
 # Given an integer, write a function to determine if it is a power of two.
+#
+# Credits:
+#
+#     Special thanks to @jianchao.li.fighter for adding this problem and
+#     creating all test cases.
 
 
 # @param {Integer} n

Diff for: algorithms/product_of_array_except_self.rb

@@ -1,16 +1,16 @@
 # https://leetcode.com/problems/product-of-array-except-self/
 #
-# Given an array of n integers where n > 1, nums, return an array
-# output such that output[i] is equal to the product of all the
-# elements of nums except nums[i].
+# Given an array of n integers where n > 1, nums, return an array output such
+# that output[i] is equal to the product of all the elements of nums except
+# nums[i].
 #
 # Solve it without division and in O(n).
 #
-# For example, given [1,2,3,4], return [24,12,8,6].
+# For example, given [1, 2, 3, 4], return [24, 12, 8, 6].
 #
-# Follow up: Could you solve it with constant space complexity? (Note:
-# The output array does not count as extra space for the purpose of
-# space complexity analysis.)
+# Follow up: Could you solve it with constant space complexity? (Note: The
+# output array does not count as extra space for the purpose of space
+# complexity analysis.)
 
 
 # @param {Integer[]} nums