style: comment

Author: 0x01f7

algorithms/largest_number.rb

@@ -1,13 +1,19 @@
 # https://leetcode.com/problems/largest-number/
 #
-# Given a list of non negative integers, arrange them such that
-# they form the largest number.
+# Given a list of non negative integers, arrange them such that they form the
+# largest number.
 #
-# For example, given [3, 30, 34, 5, 9], the largest formed number
-# is 9534330.
+# For example, given [3, 30, 34, 5, 9], the largest formed number is 9534330.
 #
-# Note: The result may be very large, so you need to return a
-# string instead of an integer.
+# Note:
+#
+#     The result may be very large, so you need to return a string instead of
+#     an integer.
+#
+# Credits:
+#
+#     Special thanks to @ts for adding this problem and creating all test
+#     cases.
 
 
 # @param {Integer[]} nums

algorithms/largest_rectangle_in_histogram.rb

@@ -1,8 +1,8 @@
 # https://leetcode.com/problems/largest-rectangle-in-histogram/
 #
-# Given n non-negative integers representing the histogram's bar height
-# where the width of each bar is 1, find the area of largest rectangle
-# in the histogram.
+# Given n non-negative integers representing the histogram's bar height where
+# the width of each bar is 1, find the area of largest rectangle in the
+# histogram.
 #
 #                   6
 #                  ___

algorithms/length_of_last_word.rb

@@ -1,13 +1,17 @@
 # https://leetcode.com/problems/length-of-last-word/
 #
-# Given a string s consists of upper/lower-case alphabets and empty
-# space characters ' ', return the length of last word in the
-# string. If the last word does not exist, return 0.
+# Given a string s consists of upper/lower-case alphabets and empty space
+# characters ' ', return the length of last word in the string. If the last
+# word does not exist, return 0.
 #
-# Note: A word is defined as a character sequence consists of non-space
-# characters only. For example,
+# For example:
 #
 #     Given s = "Hello World", return 5.
+#
+# Note:
+#
+#     A word is defined as a character sequence consists of non-space
+#     characters only.
 
 
 # @param {String} s

algorithms/letter_combinations_of_a_phone_number.rb

@@ -1,10 +1,10 @@
 # https://leetcode.com/problems/letter-combinations-of-a-phone-number/
 #
-# Given a digit string, return all possible letter combinations that
-# the number could represent.
+# Given a digit string, return all possible letter combinations that the
+# number could represent.
 #
-# A mapping of digit to letters (just like on the telephone buttons)
-# is given below.
+# A mapping of digit to letters (just like on the telephone buttons) is given
+# below:
 #
 #     1()     2(abc)  3(def)
 #     4(ghi)  5(jkl)  6(mno)
@@ -14,8 +14,8 @@
 #    Input: Digit string "23"
 #   Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].
 #
-# Note: Although the above answer is in lexicographical order, your
-# answer could be in any order you want.
+# Note: Although the above answer is in lexicographical order, your answer
+# could be in any order you want.
 
 
 # @param {String} digits

algorithms/longest_common_prefix.rb

@@ -1,7 +1,7 @@
 # https://leetcode.com/problems/longest-common-prefix/
 #
-# Write a function to find the longest common prefix string amongst
-# an array of strings.
+# Write a function to find the longest common prefix string amongst an array
+# of strings.
 
 
 # @param {String[]} strs

algorithms/longest_consecutive_sequence.rb

@@ -3,8 +3,8 @@
 # Given an unsorted array of integers, find the length of the longest
 # consecutive elements sequence.
 #
-# For example, Given [100, 4, 200, 1, 3, 2], The longest consecutive
-# elements sequence is [1, 2, 3, 4]. Return its length: 4.
+# For example, Given [100, 4, 200, 1, 3, 2], The longest consecutive elements
+# sequence is [1, 2, 3, 4]. Return its length: 4.
 #
 # Your algorithm should run in O(n) complexity.
 

algorithms/longest_palindromic_substring.rb

@@ -1,8 +1,8 @@
 # https://leetcode.com/problems/longest-palindromic-substring/
 #
-# Given a string S, find the longest palindromic substring in S. You
-# may assume that the maximum length of S is 1000, and there exists
-# one unique longest palindromic substring.
+# Given a string S, find the longest palindromic substring in S. You may
+# assume that the maximum length of S is 1000, and there exists one unique
+# longest palindromic substring.
 
 
 # @param {String} s

algorithms/longest_substring_without_repeating_characters.rb

@@ -1,9 +1,9 @@
 # https://leetcode.com/problems/longest-substring-without-repeating-characters/
 #
-# Given a string, find the length of the longest substring without
-# repeating characters. For example, the longest substring without
-# repeating letters for "abcabcbb" is "abc", which the length is 3.
-# For "bbbbb" the longest substring is "b", with the length of 1.
+# Given a string, find the length of the longest substring without repeating
+# characters. For example, the longest substring without repeating letters for
+# "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest
+# substring is "b", with the length of 1.
 
 
 # @param {String} s

algorithms/longest_valid_parentheses.rb

@@ -1,11 +1,11 @@
 # https://leetcode.com/problems/longest-valid-parentheses/
 #
-# Given a string containing just the characters '(' and ')', find the
-# length of the longest valid (well-formed) parentheses substring.
+# Given a string containing just the characters '(' and ')', find the length
+# of the longest valid (well-formed) parentheses substring.
 #
-# For "(()", the longest valid parentheses substring is "()", which
-# has length = 2. Another example is ")()())", where the longest valid
-# parentheses substring is "()()", which has length = 4.
+# For "(()", the longest valid parentheses substring is "()", which has
+# length = 2. Another example is ")()())", where the longest valid parentheses
+# substring is "()()", which has length = 4.
 
 
 # @param {String} s

algorithms/lowest_common_ancestor_of_a_binary_search_tree.rb

@@ -1,10 +1,10 @@
 # https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/
 #
-# Given a binary search tree (BST), find the lowest common ancestor (LCA)
-# of two given nodes in the BST. According to the definition of LCA on
-# Wikipedia: “The lowest common ancestor is defined between
-# two nodes v and w as the lowest node in T that has both v and w
-# as descendants (where we allow a node to be a descendant of itself).”
+# Given a binary search tree (BST), find the lowest common ancestor (LCA) of
+# two given nodes in the BST. According to the definition of LCA on Wikipedia:
+# “The lowest common ancestor is defined between two nodes v and w as the
+# lowest node in T that has both v and w as descendants (where we allow a node
+# to be a descendant of itself).”
 #
 #           ----6----
 #          /         \
@@ -14,9 +14,9 @@
 #           /   \
 #          3     5
 #
-# For example, the lowest common ancestor (LCA) of nodes 2 and 8 is 6.
-# Another example is LCA of nodes 2 and 4 is 2, since a node can be a
-# descendant of itself according to the LCA definition.
+# For example, the lowest common ancestor (LCA) of nodes 2 and 8 is 6. Another
+# example is LCA of nodes 2 and 4 is 2, since a node can be a descendant of
+# itself according to the LCA definition.
 
 
 # Definition for a binary tree node.

algorithms/lowest_common_ancestor_of_a_binary_tree.rb

@@ -1,10 +1,10 @@
 # https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/
 #
-# Given a binary tree, find the lowest common ancestor (LCA) of two
-# given nodes in the tree. According to the definition of LCA on
-# Wikipedia: "The lowest common ancestor is defined between two nodes
-# v and w as the lowest node in T that has both v and w as
-# descendants (where we allow a node to be a descendant of itself)."
+# Given a binary tree, find the lowest common ancestor (LCA) of two given
+# nodes in the tree. According to the definition of LCA on Wikipedia: "The
+# lowest common ancestor is defined between two nodes v and w as the lowest
+# node in T that has both v and w as descendants (where we allow a node to be
+# a descendant of itself)."
 #
 #           ----3----
 #          /         \
@@ -14,9 +14,9 @@
 #           /   \
 #          7     4
 #
-# For example, the lowest common ancestor (LCA) of nodes 5 and 1 is 3.
-# Another example is LCA of nodes 5 and 4 is 5, since a node can be a
-# descendant of itself according to the LCA definition.
+# For example, the lowest common ancestor (LCA) of nodes 5 and 1 is 3. Another
+# example is LCA of nodes 5 and 4 is 5, since a node can be a descendant of
+# itself according to the LCA definition.
 
 
 # Definition for a binary tree node.

algorithms/lru_cache.rb

@@ -6,8 +6,8 @@
 #     + get(key) - Get the value (will always be positive) of the key if the
 #       key exists in the cache, otherwise return -1.
 #     + set(key, value) - Set or insert the value if the key is not already
-#       present. When the cache reached its capacity, it should invalidate
-#       the least recently used item before inserting a new item.
+#       present. When the cache reached its capacity, it should invalidate the
+#       least recently used item before inserting a new item.
 
 
 class DoublyLinkedListNode