style: comment

Author: 0x01f7

algorithms/factorial_trailing_zeroes.rb

@@ -1,6 +1,15 @@
 # https://leetcode.com/problems/factorial-trailing-zeroes/
 #
 # Given an integer n, return the number of trailing zeroes in n!.
+#
+# Note:
+#
+#     Your solution should be in logarithmic time complexity.
+#
+# Credits:
+#
+#     Special thanks to @ts for adding this problem and creating
+#     all test cases.
 
 
 # @param {Integer} n

algorithms/find_median_from_data_stream.rb

@@ -1,18 +1,18 @@
 # https://leetcode.com/problems/find-median-from-data-stream/
 #
-# Median is the middle value in an ordered integer list. If the size of
-# the list is even, there is no middle value. So the median is the mean
-# of the two middle value.
+# Median is the middle value in an ordered integer list. If the size of the
+# list is even, there is no middle value. So the median is the mean of the two
+# middle value.
 #
 # Examples:
 #
-#     [2,3,4] , the median is 3
-#     [2,3], the median is (2 + 3) / 2 = 2.5
+#     [2, 3, 4], the median is 3
+#     [2, 3], the median is (2 + 3) / 2 = 2.5
 #
 # Design a data structure that supports the following two operations:
 #
-#     + void addNum(int num) - Add a integer number from the data stream
-#       to the data structure.
+#     + void addNum(int num) - Add a integer number from the data stream to
+#       the data structure.
 #     + double findMedian() - Return the median of all elements so far.
 #
 # For example:
@@ -22,6 +22,11 @@
 #     findMedian() -> 1.5
 #     add(3)
 #     findMedian() -> 2
+#
+# Credits:
+#
+#     Special thanks to @Louis1992 for adding this problem and creating all
+#     test cases.
 
 
 class PriorityQueue

algorithms/find_minimum_in_rotated_sorted_array.rb

@@ -1,12 +1,10 @@
 # https://leetcode.com/problems/find-minimum-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).
 #
-# Find the minimum element. You may assume no duplicate exists in
-# the array.
+# Find the minimum element. You may assume no duplicate exists in the array.
 
 
 # @param {Integer[]} nums

algorithms/find_minimum_in_rotated_sorted_array_ii.rb

@@ -5,8 +5,7 @@
 #     What if duplicates are allowed?
 #     Would this affect the run-time complexity? How and why?
 #
-# 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).
 #

algorithms/find_peak_element.rb

@@ -1,13 +1,22 @@
 # https://leetcode.com/problems/find-peak-element/
 #
-# A peak element is an element that is greater than its neighbors. Given
-# an input array where num[i] != num[i+1], find a peak element and return
-# its index. The array may contain multiple peaks, in that case return
-# the index to any one of the peaks is fine. You may imagine that
+# A peak element is an element that is greater than its neighbors. Given an
+# input array where num[i] != num[i+1], find a peak element and return its
+# index. The array may contain multiple peaks, in that case return the index
+# to any one of the peaks is fine. You may imagine that
 # num[-1] = num[n] = -Inf.
 #
-# For example, in array [1, 2, 3, 1], 3 is a peak element and your
-# function should return the index number 2.
+# For example, in array [1, 2, 3, 1], 3 is a peak element and your function
+# should return the index number 2.
+#
+# Note:
+#
+#     Your solution should be in logarithmic complexity.
+#
+# Credits:
+#
+#     Special thanks to @ts for adding this problem and creating all test
+#     cases.
 
 
 # @param {Integer[]} nums

algorithms/find_the_duplicate_number.rb

@@ -1,17 +1,21 @@
 # https://leetcode.com/problems/find-the-duplicate-number/
 #
-# Given an array nums containing n + 1 integers where each integer is
-# between 1 and n (inclusive), prove that at least one duplicate
-# number must exist. Assume that there is only one duplicate number,
-# find the duplicate one.
+# Given an array nums containing n + 1 integers where each integer is between
+# 1 and n (inclusive), prove that at least one duplicate number must exist.
+# Assume that there is only one duplicate number, find the duplicate one.
 #
-# Note:
+# Notes:
 #
 #     + You must not modify the array (assume the array is read only).
 #     + You must use only constant, O(1) extra space.
 #     + Your runtime complexity should be less than O(n2).
-#     + There is only one duplicate number in the array, but it could
-#       be repeated more than once.
+#     + There is only one duplicate number in the array, but it could be
+#       repeated more than once.
+#
+# Credits:
+#
+#     Special thanks to @jianchao.li.fighter for adding this problem and
+#     creating all test cases.
 
 
 # @param {Integer[]} nums

algorithms/first_bad_version.rb

@@ -1,16 +1,21 @@
 # https://leetcode.com/problems/first-bad-version/
 #
 # You are a product manager and currently leading a team to develop a new
-# product. Unfortunately, the latest version of your product fails the
-# quality check. Since each version is developed based on the previous
-# version, all the versions after a bad version are also bad.
+# product. Unfortunately, the latest version of your product fails the quality
+# check. Since each version is developed based on the previous version, all
+# the versions after a bad version are also bad.
 #
 # Suppose you have n versions [1, 2, ..., n] and you want to find out the
 # first bad one, which causes all the following ones to be bad.
 #
 # You are given an API bool isBadVersion(version) which will return whether
 # version is bad. Implement a function to find the first bad version. You
 # should minimize the number of calls to the API.
+#
+# Credits:
+#
+#     Special thanks to @jianchao.li.fighter for adding this problem and
+#     creating all test cases.
 
 
 # The is_bad_version API is already defined for you.

algorithms/first_missing_positive.rb

@@ -1,9 +1,10 @@
 # https://leetcode.com/problems/first-missing-positive/
 #
-# Given an unsorted integer array, find the first missing positive
-# integer.
+# Given an unsorted integer array, find the first missing positive integer.
 #
-# For example, Given [1,2,0] return 3, and [3,4,-1,1] return 2.
+# For example:
+#
+#     Given [1,2,0] return 3, and [3,4,-1,1] return 2.
 #
 # Your algorithm should run in O(n) time and uses constant space.
 

algorithms/fraction_to_recurring_decimal.rb

@@ -1,14 +1,19 @@
 # https://leetcode.com/problems/fraction-to-recurring-decimal/
 #
-# Given two integers representing the numerator and denominator of a
-# fraction, return the fraction in string format. If the fractional
-# part is repeating, enclose the repeating part in parentheses.
+# Given two integers representing the numerator and denominator of a fraction,
+# return the fraction in string format. If the fractional part is repeating,
+# enclose the repeating part in parentheses.
 #
 # For example,
 #
 #     Given numerator = 1, denominator = 2, return "0.5".
 #     Given numerator = 2, denominator = 1, return "2".
 #     Given numerator = 2, denominator = 3, return "0.(6)".
+#
+# Credits:
+#
+#     Special thanks to @Shangrila for adding this problem and creating all
+#     test cases.
 
 
 # @param {integer} numerator