style: comment

Author: 0x01f7

algorithms/decode_ways.rb

@@ -1,18 +1,18 @@
 # https://leetcode.com/problems/decode-ways/
 #
-# A message containing letters from A-Z is being encoded to numbers
-# using the following mapping:
+# A message containing letters from A-Z is being encoded to numbers using the
+# following mapping:
 #
 #     'A' -> 1
 #     'B' -> 2
 #     ...
 #     'Z' -> 26
 #
-# Given an encoded message containing digits, determine the total
-# number of ways to decode it.
+# Given an encoded message containing digits, determine the total number of
+# ways to decode it.
 #
-# For example, Given encoded message "12", it could be decoded as
-# "AB" (1 2) or "L" (12). The number of ways decoding "12" is 2.
+# For example, Given encoded message "12", it could be decoded as "AB" (1 2)
+# or "L" (12). The number of ways decoding "12" is 2.
 
 
 # @param {String} s

algorithms/delete_node_in_a_linked_list.rb

@@ -1,10 +1,9 @@
 # https://leetcode.com/problems/delete-node-in-a-linked-list/
 #
-# Write a function to delete a node (except the tail) in a singly
-# linked list, given only access to that node. Supposed the linked
-# list is 1 -> 2 -> 3 -> 4 and you are given the third node with
-# value 3, the linked list should become 1 -> 2 -> 4 after calling
-# your function.
+# Write a function to delete a node (except the tail) in a singly linked list,
+# given only access to that node. Supposed the linked list is 1 -> 2 -> 3 -> 4
+# and you are given the third node with value 3, the linked list should become
+# 1 -> 2 -> 4 after calling your function.
 
 
 # Definition for singly-linked list.

algorithms/different_ways_to_add_parentheses.rb

@@ -1,8 +1,8 @@
 # https://leetcode.com/problems/different-ways-to-add-parentheses/
 #
-# Given a string of numbers and operators, return all possible results
-# from computing all the different possible ways to group numbers and
-# operators. The valid operators are +, - and *.
+# Given a string of numbers and operators, return all possible results from
+# computing all the different possible ways to group numbers and operators.
+# The valid operators are +, - and *.
 #
 # Example 1
 #
@@ -24,6 +24,11 @@
 #       (((2*3)-4)*5) = 10
 #
 #     Output: [-34, -14, -10, -10, 10]
+#
+# Credits:
+#
+#     Special thanks to @mithmatt for adding this problem and creating all
+#     test cases.
 
 
 # @param {String} input

algorithms/distinct_subsequences.rb

@@ -1,11 +1,10 @@
 # https://leetcode.com/problems/distinct-subsequences/
 #
-# Given a string S and a string T, count the number of distinct
-# subsequences of T in S. A subsequence of a string is a new string
-# which is formed from the original string by deleting some (can be none)
-# of the characters without disturbing the relative positions of
-# the remaining characters. (ie, "ACE" is a subsequence of "ABCDE"
-# while "AEC" is not).
+# Given a string S and a string T, count the number of distinct subsequences
+# of T in S. A subsequence of a string is a new string which is formed from
+# the original string by deleting some (can be none) of the characters without
+# disturbing the relative positions of the remaining characters. (ie, "ACE" is
+# a subsequence of "ABCDE" while "AEC" is not).
 #
 # Here is an example: S = "rabbbit", T = "rabbit", Return 3.
 

algorithms/divide_two_integers.rb

@@ -1,7 +1,7 @@
 # https://leetcode.com/problems/divide-two-integers/
 #
-# Divide two integers without using multiplication, division and
-# mod operator. If it is overflow, return MAX_INT.
+# Divide two integers without using multiplication, division and mod operator.
+# If it is overflow, return MAX_INT.
 
 
 # Limits on Integer Constants

algorithms/dungeon_game.rb

@@ -1,29 +1,26 @@
 # https://leetcode.com/problems/dungeon-game/
 #
 # The demons had captured the princess (P) and imprisoned her in the
-# bottom-right corner of a dungeon. The dungeon consists of M x N
-# rooms laid out in a 2D grid. Our valiant knight (K) was initially
-# positioned in the top-left room and must fight his way through the
-# dungeon to rescue the princess.
+# bottom-right corner of a dungeon. The dungeon consists of M x N rooms laid
+# out in a 2D grid. Our valiant knight (K) was initially positioned in the
+# top-left room and must fight his way through the dungeon to rescue the
+# princess.
 #
-# The knight has an initial health point represented by a positive
-# integer. If at any point his health point drops to 0 or below,
-# he dies immediately.
+# The knight has an initial health point represented by a positive integer. If
+# at any point his health point drops to 0 or below, he dies immediately.
 #
-# Some of the rooms are guarded by demons, so the knight loses health
-# (negative integers) upon entering these rooms; other rooms are
-# either empty (0's) or contain magic orbs that increase the knight's
-# health (positive integers).
+# Some of the rooms are guarded by demons, so the knight loses health (negative
+# integers) upon entering these rooms; other rooms are either empty (0's) or
+# contain magic orbs that increase the knight's health (positive integers).
 #
-# In order to reach the princess as quickly as possible, the knight
-# decides to move only rightward or downward in each step.
+# In order to reach the princess as quickly as possible, the knight decides to
+# move only rightward or downward in each step.
 #
-# Write a function to determine the knight's minimum initial health
-# so that he is able to rescue the princess.
+# Write a function to determine the knight's minimum initial health so that he
+# is able to rescue the princess.
 #
-# For example, given the dungeon below, the initial health of the
-# knight must be at least 7 if he follows the optimal path
-# RIGHT -> RIGHT -> DOWN -> DOWN.
+# For example, given the dungeon below, the initial health of the knight must
+# be at least 7 if he follows the optimal path RIGHT -> RIGHT -> DOWN -> DOWN.
 #
 #     +-------+-------+-------+
 #     |       |       |       |
@@ -42,9 +39,13 @@
 # Notes:
 #
 #     + The knight's health has no upper bound.
-#     + Any room can contain threats or power-ups, even the first room
-#       the knight enters and the bottom-right room where the princess
-#       is imprisoned.
+#     + Any room can contain threats or power-ups, even the first room the
+#       knight enters and the bottom-right room where the princess is imprisoned.
+#
+# Credits:
+#
+#     Special thanks to @stellari for adding this problem and creating all
+#     test cases.
 
 
 # @param {Integer[][]} dungeon