style: comment

Author: 0x01f7

algorithms/jump_game.rb

@@ -1,9 +1,9 @@
 # https://leetcode.com/problems/jump-game/
 #
-# Given an array of non-negative integers, you are initially positioned
-# at the first index of the array. Each element in the array represents
-# your maximum jump length at that position. Determine if you are able
-# to reach the last index.
+# Given an array of non-negative integers, you are initially positioned at the
+# first index of the array. Each element in the array represents your maximum
+# jump length at that position. Determine if you are able to reach the last
+# index.
 #
 # For example:
 #

algorithms/jump_game_ii.rb

@@ -1,15 +1,15 @@
 # https://leetcode.com/problems/jump-game-ii/
 #
-# Given an array of non-negative integers, you are initially positioned
-# at the first index of the array. Each element in the array represents
-# your maximum jump length at that position. Your goal is to reach the
-# last index in the minimum number of jumps.
+# Given an array of non-negative integers, you are initially positioned at the
+# first index of the array. Each element in the array represents your maximum
+# jump length at that position. Your goal is to reach the last index in the
+# minimum number of jumps.
 #
 # For example:
 #
 #     Given array A = [2,3,1,1,4]
-#     The minimum number of jumps to reach the last index is 2. (Jump 1
-#     step from index 0 to 1, then 3 steps to the last index.)
+#     The minimum number of jumps to reach the last index is 2. (Jump 1 step
+#     from index 0 to 1, then 3 steps to the last index.)
 
 
 # @param {Integer[]} nums

algorithms/kth_largest_element_in_an_array.rb

@@ -1,12 +1,18 @@
 # https://leetcode.com/problems/kth-largest-element-in-an-array/
 #
-# Find the kth largest element in an unsorted array. Note that it is
-# the kth largest element in the sorted order, not the kth distinct
-# element.
+# Find the kth largest element in an unsorted array. Note that it is the kth
+# largest element in the sorted order, not the kth distinct element.
 #
 # For example, Given [3,2,1,5,6,4] and k = 2, return 5.
 #
-# Note: You may assume k is always valid, 1 ≤ k ≤ array's length.
+# Note:
+#
+#     You may assume k is always valid, 1 ≤ k ≤ array's length.
+#
+# Credits:
+#
+#     Special thanks to @mithmatt for adding this problem and creating all
+#     test cases.
 
 
 # @param {Integer[]} nums

algorithms/kth_smallest_element_in_a_bst.rb

@@ -1,13 +1,22 @@
 # https://leetcode.com/problems/kth-smallest-element-in-a-bst/
 #
-# Given a binary search tree, write a function kthSmallest to find the
-# kth smallest element in it.
+# Given a binary search tree, write a function kthSmallest to find the kth
+# smallest element in it.
 #
-# Note: You may assume k is always valid, 1 ≤ k ≤ BST's total elements.
+# Note:
 #
-# Follow up: What if the BST is modified (insert/delete operations)
-# often and you need to find the kth smallest frequently? How would
-# you optimize the kthSmallest routine?
+#     You may assume k is always valid, 1 ≤ k ≤ BST's total elements.
+#
+# Follow up:
+#
+#     What if the BST is modified (insert/delete operations) often and you
+#     need to find the kth smallest frequently? How would you optimize the
+#     kthSmallest routine?
+#
+# Credits:
+#
+#     Special thanks to @ts for adding this problem and creating all test
+#     cases.
 
 
 # Definition for a binary tree node.