style: comment

Author: 0x01f7

algorithms/same_tree.rb

@@ -1,8 +1,8 @@
 # https://leetcode.com/problems/same-tree/
 #
-# Given two binary trees, write a function to check if they are equal
-# or not. Two binary trees are considered equal if they are structurally
-# identical and the nodes have the same value.
+# Given two binary trees, write a function to check if they are equal or not.
+# Two binary trees are considered equal if they are structurally identical and
+# the nodes have the same value.
 
 
 # Definition for a binary tree node.

algorithms/scramble_string.rb

@@ -1,7 +1,7 @@
 # https://leetcode.com/problems/scramble-string/
 #
-# Given a string s1, we may represent it as a binary tree by
-# partitioning it to two non-empty substrings recursively.
+# Given a string s1, we may represent it as a binary tree by partitioning it
+# to two non-empty substrings recursively.
 #
 # Below is one possible representation of s1 = "great":
 #
@@ -13,9 +13,9 @@
 #                / \
 #               a   t
 #
-# To scramble the string, we may choose any non-leaf node and swap
-# its two children. For example, if we choose the node "gr" and swap
-# its two children, it produces a scrambled string "rgeat".
+# To scramble the string, we may choose any non-leaf node and swap its two
+# children. For example, if we choose the node "gr" and swap its two children,
+# it produces a scrambled string "rgeat".
 #
 #         rgeat
 #        /     \
@@ -25,9 +25,9 @@
 #                 / \
 #                a   t
 #
-# We say that "rgeat" is a scrambled string of "great". Similarly,
-# if we continue to swap the children of nodes "eat" and "at", it
-# produces a scrambled string "rgtae".
+# We say that "rgeat" is a scrambled string of "great". Similarly, if we
+# continue to swap the children of nodes "eat" and "at", it produces a
+# scrambled string "rgtae".
 #
 #         rgtae
 #        /     \
@@ -37,9 +37,8 @@
 #           / \
 #          t   a
 #
-# We say that "rgtae" is a scrambled string of "great". Given two
-# strings s1 and s2 of the same length, determine if s2 is a scrambled
-# string of s1.
+# We say that "rgtae" is a scrambled string of "great". Given two strings s1
+# and s2 of the same length, determine if s2 is a scrambled string of s1.
 
 
 # @param {String} s1

algorithms/search_a_2d_matrix.rb

@@ -1,21 +1,23 @@
 # https://leetcode.com/problems/search-a-2d-matrix/
 #
-# Write an efficient algorithm that searches for a value in an m x n
-# matrix. This matrix has the following properties:
+# Write an efficient algorithm that searches for a value in an m x n matrix.
+# This matrix has the following properties:
 #
 #     + Integers in each row are sorted from left to right.
-#     + The first integer of each row is greater than the last integer
-#       of the previous row.
+#     + The first integer of each row is greater than the last integer of the
+#       previous row.
 #
-# For example, Consider the following matrix:
+# For example:
 #
-#     [
-#       [1,   3,  5,  7],
-#       [10, 11, 16, 20],
-#       [23, 30, 34, 50]
-#     ]
+#     Consider the following matrix:
 #
-# Given target = 3, return true.
+#         [
+#           [1,   3,  5,  7],
+#           [10, 11, 16, 20],
+#           [23, 30, 34, 50]
+#         ]
+#
+#     Given target = 3, return true.
 
 
 # @param {Integer[][]} matrix

algorithms/search_a_2d_matrix_ii.rb

@@ -1,23 +1,25 @@
 # https://leetcode.com/problems/search-a-2d-matrix-ii/
 #
-# Write an efficient algorithm that searches for a value in an m x n
-# matrix. This matrix has the following properties:
+# Write an efficient algorithm that searches for a value in an m x n matrix.
+# This matrix has the following properties:
 #
 #     + Integers in each row are sorted in ascending from left to right.
 #     + Integers in each column are sorted in ascending from top to bottom.
 #
-# For example, Consider the following matrix:
+# For example:
 #
-#     [
-#       [1,   4,  7, 11, 15],
-#       [2,   5,  8, 12, 19],
-#       [3,   6,  9, 16, 22],
-#       [10, 13, 14, 17, 24],
-#       [18, 21, 23, 26, 30]
-#     ]
+#     Consider the following matrix:
 #
-# Given target = 5, return true.
-# Given target = 20, return false.
+#         [
+#           [1,   4,  7, 11, 15],
+#           [2,   5,  8, 12, 19],
+#           [3,   6,  9, 16, 22],
+#           [10, 13, 14, 17, 24],
+#           [18, 21, 23, 26, 30]
+#         ]
+#
+#     Given target = 5, return true.
+#     Given target = 20, return false.
 
 
 # @param {Integer[][]} matrix

algorithms/search_for_a_range.rb

@@ -1,8 +1,9 @@
 # https://leetcode.com/problems/search-for-a-range/
 #
-# Given a sorted array of integers, find the starting and ending position
-# of a given target value. If the target is not found in the array,
-# return [-1, -1]. For example
+# Given a sorted array of integers, find the starting and ending position of a
+# given target value. If the target is not found in the array, return [-1, -1].
+#
+# For example:
 #
 #     Given [5, 7, 7, 8, 8, 10] and target value 8, return [3, 4].
 #

algorithms/search_in_rotated_sorted_array.rb

@@ -1,12 +1,11 @@
 # https://leetcode.com/problems/search-in-rotated-sorted-array/
 #
-# Suppose a sorted array is rotated at some pivot unknown to you
-# beforehand.
+# Suppose a sorted array is rotated at some pivot unknown to you beforehand.
 #
 #     (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).
 #
-# You are given a target value to search. If found in the array
-# return its index, otherwise return -1.
+# You are given a target value to search. If found in the array return its
+# index, otherwise return -1.
 #
 # You may assume no duplicate exists in the array.
 

algorithms/search_insert_position.rb

@@ -1,17 +1,15 @@
 # https://leetcode.com/problems/search-insert-position/
 #
-# Given a sorted array and a target value, return the index if
-# the target is found. If not, return the index where it would
-# be if it were inserted in order.
-#
-# You may assume no duplicates in the array.
+# Given a sorted array and a target value, return the index if the target is
+# found. If not, return the index where it would be if it were inserted in
+# order. You may assume no duplicates in the array.
 #
 # Here are few examples.
 #
-#     [1,3,5,6], 5 -> 2
-#     [1,3,5,6], 2 -> 1
-#     [1,3,5,6], 7 -> 4
-#     [1,3,5,6], 0 -> 0
+#     [1, 3, 5, 6], 5 -> 2
+#     [1, 3, 5, 6], 2 -> 1
+#     [1, 3, 5, 6], 7 -> 4
+#     [1, 3, 5, 6], 0 -> 0
 
 
 # @param {Integer[]} nums

algorithms/set_matrix_zeroes.rb

@@ -1,12 +1,11 @@
 # https://leetcode.com/problems/set-matrix-zeroes/
 #
-# Given a m x n matrix, if an element is 0, set its entire row
-# and column to 0. Do it in place.
+# Given a m x n matrix, if an element is 0, set its entire row and column to 0.
+# Do it in place.
 #
-# Follow up: Did you use extra space? A straight forward solution
-# using O(mn) space is probably a bad idea. A simple improvement
-# uses O(m + n) space, but still not the best solution. Could you
-# devise a constant space solution?
+# Follow up: Did you use extra space? A straight forward solution using O(mn)
+# space is probably a bad idea. A simple improvement uses O(m + n) space, but
+# still not the best solution. Could you devise a constant space solution?
 
 
 # @param {Integer[][]} matrix

algorithms/simplify_path.rb

@@ -2,7 +2,7 @@
 #
 # Given an absolute path for a file (Unix-style), simplify it.
 #
-# For example,
+# For example:
 #
 #     path = "/home/", => "/home"
 #     path = "/a/./b/../../c/", => "/c"

algorithms/single_number.rb

@@ -1,10 +1,10 @@
 # https://leetcode.com/problems/single-number/
 #
-# Given an array of integers, every element appears twice except for
-# one. Find that single one.
+# Given an array of integers, every element appears twice except for one. Find
+# that single one.
 #
-# Note: Your algorithm should have a linear runtime complexity. Could
-# you implement it without using extra memory?
+# Note: Your algorithm should have a linear runtime complexity. Could you
+# implement it without using extra memory?
 
 
 # @param {Integer[]} nums

algorithms/single_number_ii.rb

@@ -1,10 +1,10 @@
 # https://leetcode.com/problems/single-number-ii/
 #
-# Given an array of integers, every element appears three times except
-# for one. Find that single one.
+# Given an array of integers, every element appears three times except for one.
+# Find that single one.
 #
-# Note: Your algorithm should have a linear runtime complexity. Could
-# you implement it without using extra memory?
+# Note: Your algorithm should have a linear runtime complexity. Could you
+# implement it without using extra memory?
 
 
 # Limits on Integer Constants

algorithms/single_number_iii.rb

@@ -1,17 +1,24 @@
 # https://leetcode.com/problems/single-number-iii/
 #
-# Given an array of numbers nums, in which exactly two elements appear
-# only once and all the other elements appear exactly twice. Find the
-# two elements that appear only once.
+# Given an array of numbers nums, in which exactly two elements appear only
+# once and all the other elements appear exactly twice. Find the two elements
+# that appear only once.
 #
-# For example: Given nums = [1, 2, 1, 3, 2, 5], return [3, 5].
+# For example:
 #
-# Note:
+#     Given nums = [1, 2, 1, 3, 2, 5], return [3, 5].
+#
+# Notes:
 #
 #     + The order of the result is not important. So in the above example,
 #       [5, 3] is also correct.
 #     + Your algorithm should run in linear runtime complexity. Could you
 #       implement it using only constant space complexity?
+#
+# Credits:
+#
+#     Special thanks to @jianchao.li.fighter for adding this problem and
+#     creating all test cases.
 
 
 # @param {Integer[]} nums

algorithms/sliding_window_maximum.rb

@@ -1,11 +1,11 @@
 # https://leetcode.com/problems/sliding-window-maximum/
 #
-# Given an array nums, there is a sliding window of size k which is
-# moving from the very left of the array to the very right. You can
-# only see the k numbers in the window. Each time the sliding
-# window moves right by one position.
+# Given an array nums, there is a sliding window of size k which is moving
+# from the very left of the array to the very right. You can only see the k
+# numbers in the window. Each time the sliding window moves right by one
+# position.
 #
-# For example, Given nums = [1,3,-1,-3,5,3,6,7], and k = 3.
+# For example, Given nums = [1, 3, -1, -3, 5, 3, 6, 7], and k = 3.
 #
 #     Window position                Max
 #     ---------------               -----
@@ -16,12 +16,16 @@
 #     1  3  -1  -3 [5  3  6] 7       6
 #     1  3  -1  -3  5 [3  6  7]      7
 #
-# Therefore, return the max sliding window as [3,3,5,5,6,7].
+# Therefore, return the max sliding window as [3, 3, 5, 5, 6, 7].
 #
-# Note: You may assume k is always valid, ie: 1 ≤ k ≤ input array's
-# size for non-empty array.
+# Note:
 #
-# Follow up: Could you solve it in linear time?
+#     You may assume k is always valid, ie: 1 ≤ k ≤ input array's size for
+#     non-empty array.
+#
+# Follow up:
+#
+#     Could you solve it in linear time?
 
 
 class MonotonicQueue

algorithms/sort_colors.rb

@@ -1,14 +1,14 @@
 # https://leetcode.com/problems/sort-colors/
 #
-# Given an array with n objects colored red, white or blue, sort them
-# so that objects of the same color are adjacent, with the colors in
-# the order red, white and blue.
+# Given an array with n objects colored red, white or blue, sort them so that
+# objects of the same color are adjacent, with the colors in the order red,
+# white and blue.
 #
-# Here, we will use the integers 0, 1, and 2 to represent the color
-# red, white, and blue respectively.
+# Here, we will use the integers 0, 1, and 2 to represent the color red, white,
+# and blue respectively.
 #
-# Note: You are not suppose to use the library's sort function for
-# this problem.
+# Note: You are not suppose to use the library's sort function for this
+# problem.
 
 
 # @param {Integer[]} nums

algorithms/spiral_matrix.rb

@@ -1,17 +1,17 @@
 # https://leetcode.com/problems/spiral-matrix/
 #
-# Given a matrix of m x n elements (m rows, n columns), return all
-# elements of the matrix in spiral order.
+# Given a matrix of m x n elements (m rows, n columns), return all elements of
+# the matrix in spiral order.
 #
 # For example, Given the following matrix:
 #
 #     [
-#       [ 1, 2, 3 ],
-#       [ 4, 5, 6 ],
-#       [ 7, 8, 9 ]
+#       [1, 2, 3],
+#       [4, 5, 6],
+#       [7, 8, 9]
 #     ]
 #
-# You should return [1,2,3,6,9,8,7,4,5].
+# You should return [1, 2, 3, 6, 9, 8, 7, 4, 5].
 
 
 # @param {Integer[][]} matrix

algorithms/spiral_matrix_ii.rb

@@ -1,14 +1,14 @@
 # https://leetcode.com/problems/spiral-matrix-ii/
 #
-# Given an integer n, generate a square matrix filled with elements
-# from 1 to n^2 in spiral order.
+# Given an integer n, generate a square matrix filled with elements from 1 to
+# n^2 in spiral order.
 #
 # For example, Given n = 3, You should return the following matrix:
 #
 #     [
-#       [ 1, 2, 3 ],
-#       [ 8, 9, 4 ],
-#       [ 7, 6, 5 ]
+#       [1, 2, 3],
+#       [8, 9, 4],
+#       [7, 6, 5]
 #     ]