style: comment

Author: 0x01f7

algorithms/majority_element.rb

@@ -1,9 +1,13 @@
 # https://leetcode.com/problems/majority-element/
 #
-# Given an array of size n, find the majority element. The majority
-# element is the element that appears more than n/2 times. You may
-# assume that the array is non-empty and the majority element
-# always exist in the array.
+# Given an array of size n, find the majority element. The majority element is
+# the element that appears more than n/2 times. You may assume that the array
+# is non-empty and the majority element always exist in the array.
+#
+# Credits:
+#
+#     Special thanks to @ts for adding this problem and creating all test
+#     cases.
 
 
 # @param {Integer[]} nums

algorithms/max_points_on_a_line.rb

@@ -1,7 +1,7 @@
 # https://leetcode.com/problems/max-points-on-a-line/
 #
-# Given n points on a 2D plane, find the maximum number of points that lie
-# on the same straight line.
+# Given n points on a 2D plane, find the maximum number of points that lie on
+# the same straight line.
 
 
 # Definition for a point.

algorithms/maximal_rectangle.rb

@@ -1,7 +1,7 @@
 # https://leetcode.com/problems/maximal-rectangle/
 #
-# Given a 2D binary matrix filled with 0's and 1's, find the largest
-# rectangle containing all ones and return its area.
+# Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle
+# containing all ones and return its area.
 
 
 # @param {Character[][]} matrix

algorithms/maximal_square.rb

@@ -1,16 +1,23 @@
 # https://leetcode.com/problems/maximal-square/
 #
-# Given a 2D binary matrix filled with 0's and 1's, find the largest
-# square containing all 1's and return its area.
+# Given a 2D binary matrix filled with 0's and 1's, find the largest square
+# containing all 1's and return its area.
 #
-# For example, given the following matrix:
+# For example:
 #
-#     1 0 1 0 0
-#     1 0 1 1 1
-#     1 1 1 1 1
-#     1 0 0 1 0
+#     Given the following matrix:
 #
-# Return 4.
+#         1 0 1 0 0
+#         1 0 1 1 1
+#         1 1 1 1 1
+#         1 0 0 1 0
+#
+#     Return 4.
+#
+# Credits:
+#
+#     Special thanks to @Freezen for adding this problem and creating all
+#     test cases.
 
 
 # @param {Character[][]} matrix

algorithms/maximum_depth_of_binary_tree.rb

@@ -1,8 +1,8 @@
 # https://leetcode.com/problems/maximum-depth-of-binary-tree/
 #
-# Given a binary tree, find its maximum depth. The maximum depth is
-# the number of nodes along the longest path from the root node down
-# to the farthest leaf node.
+# Given a binary tree, find its maximum depth. The maximum depth is the number
+# of nodes along the longest path from the root node down to the farthest leaf
+# node.
 
 
 # Definition for a binary tree node.

algorithms/maximum_gap.rb

@@ -1,11 +1,16 @@
 # https://leetcode.com/problems/maximum-gap/
 #
-# Given an unsorted array, find the maximum difference between the
-# successive elements in its sorted form. Try to solve it in linear
-# time/space. Return 0 if the array contains less than 2 elements.
+# Given an unsorted array, find the maximum difference between the successive
+# elements in its sorted form. Try to solve it in linear time/space. Return 0
+# if the array contains less than 2 elements.
 #
-# You may assume all elements in the array are non-negative integers
-# and fit in the 32-bit signed integer range.
+# You may assume all elements in the array are non-negative integers and fit
+# in the 32-bit signed integer range.
+#
+# Credits:
+#
+#     Special thanks to @porker2008 for adding this problem and creating all
+#     test cases.
 
 
 # Limits on Integer Constants

algorithms/maximum_product_subarray.rb

@@ -1,10 +1,10 @@
 # https://leetcode.com/problems/maximum-product-subarray/
 #
-# Find the contiguous subarray within an array (containing at least one
-# number) which has the largest product.
+# Find the contiguous subarray within an array (containing at least one number)
+# which has the largest product.
 #
-# For example, given the array [2,3,-2,4], the contiguous subarray [2,3]
-# has the largest product = 6.
+# For example, given the array [2,3,-2,4], the contiguous subarray [2,3] has
+# the largest product = 6.
 
 
 # @param {Integer[]} nums

algorithms/maximum_subarray.rb

@@ -1,9 +1,9 @@
 # https://leetcode.com/problems/maximum-subarray/
 #
-# Find the contiguous subarray within an array (containing at least
-# one number) which has the largest sum.  For example, given the
-# array [−2,1,−3,4,−1,2,1,−5,4], the contiguous subarray [4,−1,2,1]
-# has the largest sum = 6.
+# Find the contiguous subarray within an array (containing at least one number)
+# which has the largest sum.  For example, given the array
+# [−2, 1, −3, 4, −1, 2, 1, −5, 4], the contiguous subarray [4, −1, 2, 1] has
+# the largest sum = 6.
 
 
 # @param {Integer[]} nums

algorithms/median_of_two_sorted_arrays.rb

@@ -1,8 +1,8 @@
 # https://leetcode.com/problems/median-of-two-sorted-arrays/
 #
-# There are two sorted arrays nums1 and nums2 of size m and n
-# respectively. Find the median of the two sorted arrays. The
-# overall run time complexity should be O(log(m+n)).
+# There are two sorted arrays nums1 and nums2 of size m and n respectively.
+# Find the median of the two sorted arrays. The overall run time complexity
+# should be O(log(m+n)).
 
 
 # @param {Integer[]} nums1

algorithms/merge_intervals.rb

@@ -4,8 +4,8 @@
 #
 # For example,
 #
-#     Given [1,3],[2,6],[8,10],[15,18],
-#     return [1,6],[8,10],[15,18].
+#     Given [1, 3], [2, 6], [8, 10], [15, 18],
+#     Return [1, 6], [8, 10], [15, 18].
 
 
 # Definition for an interval.

algorithms/merge_k_sorted_lists.rb

@@ -1,7 +1,7 @@
 # https://leetcode.com/problems/merge-k-sorted-lists/
 #
-# Merge k sorted linked lists and return it as one sorted list. Analyze
-# and describe its complexity.
+# Merge k sorted linked lists and return it as one sorted list. Analyze and
+# describe its complexity.
 
 
 # Definition for singly-linked list.

algorithms/merge_sorted_array.rb

@@ -1,10 +1,10 @@
 # https://leetcode.com/problems/merge-sorted-array/
 #
-# Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1
-# as one sorted array.
+# Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as
+# one sorted array.
 #
-# Note: You may assume that nums1 has enough space (size that is greater
-# or equal to m + n) to hold additional elements from nums2. The number of
+# Note: You may assume that nums1 has enough space (size that is greater or
+# equal to m + n) to hold additional elements from nums2. The number of
 # elements initialized in nums1 and nums2 are m and n respectively.
 
 

algorithms/merge_two_sorted_lists.rb

@@ -1,8 +1,7 @@
 # https://leetcode.com/problems/merge-two-sorted-lists/
 #
-# Merge two sorted linked lists and return it as a new list. The
-# new list should be made by splicing together the nodes of the
-# first two lists.
+# Merge two sorted linked lists and return it as a new list. The new list
+# should be made by splicing together the nodes of the first two lists.
 
 
 # Definition for singly-linked list.

algorithms/min_stack.rb

@@ -1,7 +1,7 @@
 # https://leetcode.com/problems/min-stack/
 #
-# Design a stack that supports push, pop, top, and retrieving the
-# minimum element in constant time.
+# Design a stack that supports push, pop, top, and retrieving the minimum
+# element in constant time.
 #
 #     push(x) -- Push element x onto stack.
 #     pop() -- Removes the element on top of the stack.

algorithms/minimum_depth_of_binary_tree.rb

@@ -1,8 +1,8 @@
 # https://leetcode.com/problems/minimum-depth-of-binary-tree/
 #
-# Given a binary tree, find its minimum depth. The minimum depth
-# is the number of nodes along the shortest path from the root
-# node down to the nearest leaf node.
+# Given a binary tree, find its minimum depth. The minimum depth is the number
+# of nodes along the shortest path from the root node down to the nearest leaf
+# node.
 
 
 # Definition for a binary tree node.

algorithms/minimum_path_sum.rb

@@ -1,8 +1,7 @@
 # https://leetcode.com/problems/minimum-path-sum/
 #
-# Given a m x n grid filled with non-negative numbers, find a path
-# from top left to bottom right which minimizes the sum of all
-# numbers along its path.
+# Given a m x n grid filled with non-negative numbers, find a path from top
+# left to bottom right which minimizes the sum of all numbers along its path.
 #
 # Note: You can only move either down or right at any point in time.
 

algorithms/minimum_size_subarray_sum.rb

@@ -1,11 +1,16 @@
 # https://leetcode.com/problems/minimum-size-subarray-sum/
 #
-# Given an array of n positive integers and a positive integer s,
-# find the minimal length of a subarray of which the sum ≥ s. If
-# there isn't one, return 0 instead.
+# Given an array of n positive integers and a positive integer s, find the
+# minimal length of a subarray of which the sum ≥ s. If there isn't one,
+# return 0 instead.
 #
-# For example, given the array [2,3,1,2,4,3] and s = 7, the subarray
-# [4,3] has the minimal length under the problem constraint.
+# For example, given the array [2, 3, 1, 2, 4, 3] and s = 7, the subarray
+# [4, 3] has the minimal length under the problem constraint.
+#
+# Credits:
+#
+#     Special thanks to @Freezen for adding this problem and creating all
+#     test cases.
 
 
 # @param {Integer} s

algorithms/minimum_window_substring.rb

@@ -1,15 +1,15 @@
 # https://leetcode.com/problems/minimum-window-substring/
 #
-# Given a string S and a string T, find the minimum window in S which
-# will contain all the characters in T in complexity O(n).
+# Given a string S and a string T, find the minimum window in S which will
+# contain all the characters in T in complexity O(n).
 #
 # For example,
 #
 #     S = "ADOBECODEBANC"
 #     T = "ABC"
 #     Minimum window is "BANC".
 #
-# Note:
+# Notes:
 #
 #     + If there is no such window in S that covers all characters in T,
 #       return the empty string "".

algorithms/missing_number.rb

@@ -3,12 +3,19 @@
 # Given an array containing n distinct numbers taken from 0, 1, 2, ..., n,
 # find the one that is missing from the array.
 #
-# For example,
+# For example:
 #
 #     Given nums = [0, 1, 3] return 2.
 #
-# Note: Your algorithm should run in linear runtime complexity. Could you
-# implement it using only constant extra space complexity?
+# Note:
+#
+#     Your algorithm should run in linear runtime complexity. Could you
+#     implement it using only constant extra space complexity?
+#
+# Credits:
+#
+#     Special thanks to @jianchao.li.fighter for adding this problem and
+#     creating all test cases.
 
 
 # @param {Integer[]} nums

algorithms/move_zeroes.rb

@@ -1,15 +1,20 @@
 # https://leetcode.com/problems/move-zeroes/
 #
-# Given an array nums, write a function to move all 0's to the end of it
-# while maintaining the relative order of the non-zero elements.
+# Given an array nums, write a function to move all 0's to the end of it while
+# maintaining the relative order of the non-zero elements.
 #
 # For example, given nums = [0, 1, 0, 3, 12], after calling your function,
 # nums should be [1, 3, 12, 0, 0].
 #
-# Note:
+# Notes:
 #
 #     + You must do this in-place without making a copy of the array.
 #     + Minimize the total number of operations.
+#
+# Credits:
+#
+#     Special thanks to @jianchao.li.fighter for adding this problem and
+#     creating all test cases.
 
 
 # @param {Integer[]} nums

algorithms/multiply_strings.rb

@@ -1,7 +1,7 @@
 # https://leetcode.com/problems/multiply-strings/
 #
-# Given two numbers represented as strings, return multiplication
-# of the numbers as a string.
+# Given two numbers represented as strings, return multiplication of the
+# numbers as a string.
 #
 # Note: The numbers can be arbitrarily large and are non-negative.