style: comment

Author: 0x01f7

algorithms/add_and_search_word_data_structure_design.rb

@@ -18,7 +18,9 @@
 #     search(".ad") -> true
 #     search("b..") -> true
 #
-# Note: You may assume that all words are consist of lowercase letters a-z.
+# Note:
+#
+#     You may assume that all words are consist of lowercase letters a-z.
 
 
 class TrieNode

algorithms/balanced_binary_tree.rb

@@ -1,9 +1,8 @@
 # https://leetcode.com/problems/balanced-binary-tree/
 #
-# Given a binary tree, determine if it is height-balanced. For this
-# problem, a height-balanced binary tree is defined as a binary
-# tree in which the depth of the two subtrees of every node never
-# differ by more than 1.
+# Given a binary tree, determine if it is height-balanced. For this problem,
+# a height-balanced binary tree is defined as a binary tree in which the
+# depth of the two subtrees of every node never differ by more than 1.
 
 
 # Definition for a binary tree node.

algorithms/basic_calculator.rb

@@ -1,9 +1,9 @@
 # https://leetcode.com/problems/basic-calculator/
 #
-# Implement a basic calculator to evaluate a simple expression string.
-# The expression string may contain open ( and closing parentheses ),
-# the plus + or minus sign -, non-negative integers and empty spaces.
-# You may assume that the given expression is always valid.
+# Implement a basic calculator to evaluate a simple expression string. The
+# expression string may contain open ( and closing parentheses ), the plus
+# + or minus sign -, non-negative integers and empty spaces. You may assume
+# that the given expression is always valid.
 #
 # Some examples:
 #

algorithms/basic_calculator_ii.rb

@@ -1,17 +1,24 @@
 # https://leetcode.com/problems/basic-calculator-ii/
 #
-# Implement a basic calculator to evaluate a simple expression string.
-# The expression string contains only non-negative integers, +, -, *,
-# / operators and empty spaces. The integer division should truncate
-# toward zero. You may assume that the given expression is always valid.
+# Implement a basic calculator to evaluate a simple expression string. The
+# expression string contains only non-negative integers, +, -, *, / operators
+# and empty spaces. The integer division should truncate toward zero. You may
+# assume that the given expression is always valid.
 #
 # Some examples:
 #
 #     "3+2*2" = 7
 #     " 3/2 " = 1
 #     " 3+5 / 2 " = 5
 #
-# Note: Do not use the eval built-in library function.
+# Note:
+#
+#     Do not use the eval built-in library function.
+#
+# Credits:
+#
+#     Special thanks to @ts for adding this problem and creating all test
+#     cases.
 
 
 # @param {String} s

algorithms/best_time_to_buy_and_sell_stock.rb

@@ -1,9 +1,9 @@
 # https://leetcode.com/problems/best-time-to-buy-and-sell-stock/
 #
-# Say you have an array for which the ith element is the price of a
-# given stock on day i. If you were only permitted to complete at
-# most one transaction (ie, buy one and sell one share of the stock),
-# design an algorithm to find the maximum profit.
+# Say you have an array for which the ith element is the price of a given
+# stock on day i. If you were only permitted to complete at most one
+# transaction (ie, buy one and sell one share of the stock), design an
+# algorithm to find the maximum profit.
 
 
 # @param {Integer[]} prices

algorithms/best_time_to_buy_and_sell_stock_ii.rb

@@ -1,11 +1,11 @@
 # https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/
 #
-# Say you have an array for which the ith element is the price of a
-# given stock on day i. Design an algorithm to find the maximum
-# profit. You may complete as many transactions as you like (ie,
-# buy one and sell one share of the stock multiple times). However,
-# you may not engage in multiple transactions at the same time (ie,
-# you must sell the stock before you buy again).
+# Say you have an array for which the ith element is the price of a given
+# stock on day i. Design an algorithm to find the maximum profit. You may
+# complete as many transactions as you like (ie, buy one and sell one share
+# of the stock multiple times). However, you may not engage in multiple
+# transactions at the same time (ie, you must sell the stock before you buy
+# again).
 
 
 # @param {Integer[]} prices

algorithms/best_time_to_buy_and_sell_stock_iii.rb

@@ -1,10 +1,10 @@
 # https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/
 #
-# Say you have an array for which the ith element is the price of a
-# given stock on day i. Design an algorithm to find the maximum
-# profit. You may complete at most two transactions. However,
-# You may not engage in multiple transactions at the same time (ie,
-# you must sell the stock before you buy again).
+# Say you have an array for which the ith element is the price of a given
+# stock on day i. Design an algorithm to find the maximum profit. You may
+# complete at most two transactions. However, You may not engage in multiple
+# transactions at the same time (ie, you must sell the stock before you buy
+# again).
 
 
 # @param {Integer[]} prices

algorithms/best_time_to_buy_and_sell_stock_iv.rb

@@ -1,10 +1,15 @@
 # https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/
 #
-# Say you have an array for which the ith element is the price of a
-# given stock on day i. Design an algorithm to find the maximum
-# profit. You may complete at most k transactions. However,
-# You may not engage in multiple transactions at the same time (ie,
-# you must sell the stock before you buy again).
+# Say you have an array for which the ith element is the price of a given
+# stock on day i. Design an algorithm to find the maximum profit. You may
+# complete at most k transactions. However, You may not engage in multiple
+# transactions at the same time (ie, you must sell the stock before you buy
+# again).
+#
+# Credits:
+#
+#     Special thanks to @Freezen for adding this problem and creating all
+#     test cases.
 
 
 # @param {Integer} k

algorithms/binary_search_tree_iterator.rb

@@ -1,12 +1,18 @@
 # https://leetcode.com/problems/binary-search-tree-iterator/
 #
-# Implement an iterator over a binary search tree (BST). Your iterator
-# will be initialized with the root node of a BST.
+# Implement an iterator over a binary search tree (BST). Your iterator will
+# be initialized with the root node of a BST. Calling next() will return the
+# next smallest number in the BST.
 #
-# Calling next() will return the next smallest number in the BST.
+# Note:
 #
-# Note: next() and hasNext() should run in average O(1) time and uses
-# O(h) memory, where h is the height of the tree.
+#     next() and hasNext() should run in average O(1) time and uses O(h)
+#     memory, where h is the height of the tree.
+#
+# Credits:
+#
+#     Special thanks to @ts for adding this problem and creating all test
+#     cases.
 
 
 # Definition for a binary tree node.

algorithms/binary_tree_inorder_traversal.rb

@@ -1,19 +1,18 @@
 # https://leetcode.com/problems/binary-tree-inorder-traversal/
 #
-# Given a binary tree, return the inorder traversal of its nodes'
-# values.
+# Given a binary tree, return the inorder traversal of its nodes' values.
 #
 # For example:
 #
-#     Given binary tree {1,#,2,3},
+#     Given binary tree {1, #, 2, 3},
 #
 #         1
 #          \
 #           2
 #          /
 #         3
 #
-#     return [1,3,2].
+#     Return [1, 3, 2].
 #
 # Note: Recursive solution is trivial, could you do it iteratively?