style: comment

Author: 0x01f7

algorithms/implement_queue_using_stacks.rb

@@ -9,16 +9,14 @@
 #
 # Notes:
 #
-#     + You must use only standard operations of a stack --
-#       which means only push to top, peek/pop from top, size,
-#       and is empty operations are valid.
-#     + Depending on your language, stack may not be supported
-#       natively. You may simulate a stack by using a list or
-#       deque (double-ended queue), as long as you use only
-#       standard operations of a stack.
-#     + You may assume that all operations are valid (for
-#       example,no pop or peek operations will be called on
-#       an empty queue).
+#     + You must use only standard operations of a stack -- which means only
+#       push to top, peek/pop from top, size, and is empty operations are
+#       valid.
+#     + Depending on your language, stack may not be supported natively. You
+#       may simulate a stack by using a list or deque (double-ended queue), as
+#       long as you use only standard operations of a stack.
+#     + You may assume that all operations are valid (for example,no pop or
+#       peek operations will be called on an empty queue).
 
 
 class Queue

algorithms/implement_stack_using_queues.rb

@@ -9,16 +9,19 @@
 #
 # Notes:
 #
-#     + You must use only standard operations of a queue --
-#       which means only push to back, peek/pop from front, size,
-#       and is empty operations are valid.
-#     + Depending on your language, queue may not be supported
-#       natively. You may simulate a queue by using a list or
-#       deque (double-ended queue), as long as you use only
-#       standard operations of a queue.
-#     + You may assume that all operations are valid (for
-#       example, no pop or top operations will be called on
-#       an empty stack).
+#     + You must use only standard operations of a queue -- which means only
+#       push to back, peek/pop from front, size, and is empty operations are
+#       valid.
+#     + Depending on your language, queue may not be supported natively. You
+#       may simulate a queue by using a list or deque (double-ended queue), as
+#       long as you use only standard operations of a queue.
+#     + You may assume that all operations are valid (for example, no pop or
+#       top operations will be called on an empty stack).
+#
+# Credits:
+#
+#     Special thanks to @jianchao.li.fighter for adding this problem and all
+#     test cases.
 
 
 class Stack

algorithms/implement_strstr.rb

@@ -1,7 +1,7 @@
 # https://leetcode.com/problems/implement-strstr/
 #
-# Implement strStr(). Returns the index of the first occurrence of
-# needle in haystack, or -1 if needle is not part of haystack.
+# Implement strStr(). Returns the index of the first occurrence of needle in
+# haystack, or -1 if needle is not part of haystack.
 
 
 # @param {String} haystack

algorithms/implement_trie_prefix_tree.rb

@@ -2,8 +2,7 @@
 #
 # Implement a trie with insert, search, and startsWith methods.
 #
-# Note: You may assume that all inputs are consist of lowercase
-# letters a-z.
+# Note: You may assume that all inputs are consist of lowercase letters a-z.
 
 
 class TrieNode

algorithms/insert_interval.rb

@@ -1,21 +1,21 @@
 # https://leetcode.com/problems/insert-interval/
 #
-# Given a set of non-overlapping intervals, insert a new interval into
-# the intervals (merge if necessary).
+# Given a set of non-overlapping intervals, insert a new interval into the
+# intervals (merge if necessary).
 #
-# You may assume that the intervals were initially sorted according
-# to their start times.
+# You may assume that the intervals were initially sorted according to their
+# start times.
 #
 # Example 1:
 #
-#     Given intervals [1,3],[6,9], insert and merge [2,5] in as
-#     [1,5],[6,9].
+#     Given intervals [1, 3], [6, 9], insert and merge [2, 5] in as [1, 5],
+#     [6, 9].
 #
 # Example 2:
 #
-#     Given [1,2],[3,5],[6,7],[8,10],[12,16], insert and merge [4,9]
-#     in as [1,2],[3,10],[12,16]. This is because the new interval
-#     [4,9] overlaps with [3,5],[6,7],[8,10].
+#     Given [1, 2], [3, 5], [6, 7], [8, 10], [12, 16], insert and merge [4, 9]
+#     in as [1, 2], [3, 10], [12, 16]. This is because the new interval [4, 9]
+#     overlaps with [3, 5], [6, 7], [8, 10].
 
 
 # Definition for an interval.

algorithms/integer_to_english_words.rb

@@ -1,7 +1,7 @@
 # https://leetcode.com/problems/integer-to-english-words/
 #
-# Convert a non-negative integer to its english words representation.
-# Given input is guaranteed to be less than 2 ** 31 - 1.
+# Convert a non-negative integer to its english words representation. Given
+# input is guaranteed to be less than 2 ** 31 - 1.
 #
 # For example,
 #
@@ -10,8 +10,8 @@
 #     12345 ->
 #         Twelve Thousand Three Hundred Forty Five
 #     1234567 ->
-#         One Million Two Hundred Thirty Four Thousand
-#         Five Hundred Sixty Seven
+#         One Million Two Hundred Thirty Four Thousand Five Hundred Sixty
+#         Seven
 
 
 # @param {Integer} num

algorithms/integer_to_roman.rb

@@ -1,7 +1,7 @@
 # https://leetcode.com/problems/integer-to-roman/
 #
-# Given an integer, convert it to a roman numeral. Input is
-# guaranteed to be within the range from 1 to 3999.
+# Given an integer, convert it to a roman numeral. Input is guaranteed to be
+# within the range from 1 to 3999.
 
 
 # @param {Integer} num

algorithms/interleaving_string.rb

@@ -1,7 +1,6 @@
 # https://leetcode.com/problems/interleaving-string/
 #
-# Given s1, s2, s3, find whether s3 is formed by the interleaving
-# of s1 and s2.
+# Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.
 #
 # For example,
 #

algorithms/isomorphic_strings.rb

@@ -1,10 +1,10 @@
 # https://leetcode.com/problems/isomorphic-strings/
 #
-# Given two strings s and t, determine if they are isomorphic. Two
-# strings are isomorphic if the characters in s can be replaced to
-# get t. All occurrences of a character must be replaced with another
-# character while preserving the order of characters. No two characters
-# may map to the same character but a character may map to itself.
+# Given two strings s and t, determine if they are isomorphic. Two strings are
+# isomorphic if the characters in s can be replaced to get t. All occurrences
+# of a character must be replaced with another character while preserving the
+# order of characters. No two characters may map to the same character but a
+# character may map to itself.
 #
 # For example,
 #