Fix: remove difficulty

Author: remy727

algorithms/ruby/0011-container-with-most-water.rb

@@ -2,7 +2,7 @@
 
 # 11. Container With Most Water
 # https://leetcode.com/problems/container-with-most-water/
-# Difficulty: Medium
+# Medium
 
 =begin
 

algorithms/ruby/0016-3sum-closest.rb

@@ -2,7 +2,7 @@
 
 # 16. 3Sum Closest
 # https://leetcode.com/problems/3sum-closest/
-# Difficulty: Medium
+# Medium
 
 =begin
 Given an integer array nums of length n and an integer target, find three integers in nums such that the sum is closest to target.

algorithms/ruby/0033-search-in-rotated-sorted-array.rb

@@ -2,7 +2,7 @@
 
 # 33. Search in Rotated Sorted Array
 # https://leetcode.com/problems/search-in-rotated-sorted-array
-# Difficulty: Medium
+# Medium
 
 =begin
 There is an integer array nums sorted in ascending order (with distinct values).

algorithms/ruby/0039-combination-sum.rb

@@ -2,7 +2,7 @@
 
 # 39. Combination Sum
 # https://leetcode.com/problems/combination-sum
-# Difficulty: Medium
+# Medium
 
 =begin
 Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum to target. You may return the combinations in any order.

algorithms/ruby/0046-permutations.rb

@@ -2,7 +2,7 @@
 
 # 46. Permutations
 # https://leetcode.com/problems/permutations
-# Difficulty: Medium
+# Medium
 
 =begin
 Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.

algorithms/ruby/0056-merge-intervals.rb

@@ -2,7 +2,7 @@
 
 # 56. Merge Intervals
 # https://leetcode.com/problems/merge-intervals
-# Difficulty: Medium
+# Medium
 
 =begin
 Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.

algorithms/ruby/0057-insert-interval.rb

@@ -2,7 +2,7 @@
 
 # 57. Insert Interval
 # https://leetcode.com/problems/insert-interval
-# Difficulty: Medium
+# Medium
 
 =begin
 You are given an array of non-overlapping intervals intervals where intervals[i] = [starti, endi] represent the start and the end of the ith interval and intervals is sorted in ascending order by starti. You are also given an interval newInterval = [start, end] that represents the start and end of another interval.

algorithms/ruby/0071-simplify-path.rb

@@ -2,7 +2,7 @@
 
 # 71. Simplify Path
 # https://leetcode.com/problems/simplify-path/
-# Difficulty: Medium
+# Medium
 
 =begin
 Given a string path, which is an absolute path (starting with a slash '/') to a file or directory in a Unix-style file system, convert it to the simplified canonical path.

algorithms/ruby/0074-search-a-2d-matrix.rb

@@ -2,7 +2,7 @@
 
 # 74. Search a 2D Matrix
 # https://leetcode.com/problems/search-a-2d-matrix
-# Difficulty: Medium
+# Medium
 
 =begin
 You are given an m x n integer matrix matrix with the following two properties:

algorithms/ruby/0076-minimum-window-substring.rb

@@ -2,7 +2,7 @@
 
 # 76. Minimum Window Substring
 # https://leetcode.com/problems/minimum-window-substring/
-# Difficulty: Hard
+# Hard
 
 =begin
 Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If there is no such substring, return the empty string "".

algorithms/ruby/0100-same-tree.rb

@@ -2,7 +2,7 @@
 
 # 100. Same Tree
 # https://leetcode.com/problems/same-tree/
-# Difficulty: Easy
+# Easy
 
 =begin
 Given the roots of two binary trees p and q, write a function to check if they are the same or not.

algorithms/ruby/0108-convert-sorted-array-to-binary-search-tree.rb

@@ -2,7 +2,7 @@
 
 # 108. Convert Sorted Array to Binary Search Tree
 # https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree
-# Difficulty: Easy
+# Easy
 
 =begin
 

algorithms/ruby/0110-balanced-binary-tree.rb

@@ -2,7 +2,7 @@
 
 # 110. Balanced Binary Tree
 # https://leetcode.com/problems/balanced-binary-tree/
-# Difficulty: Easy
+# Easy
 
 =begin
 

algorithms/ruby/0148-sort-list.rb

@@ -2,7 +2,7 @@
 
 # 148. Sort List
 # https://leetcode.com/problems/sort-list
-# Difficulty: Medium
+# Medium
 
 # Definition for singly-linked list.
 # class ListNode

algorithms/ruby/0151-reverse-words-in-a-string.rb

@@ -2,7 +2,7 @@
 
 # 151. Reverse Words in a String
 # https://leetcode.com/problems/reverse-words-in-a-string
-# Difficulty: Medium
+# Medium
 
 =begin
 Given an input string s, reverse the order of the words.

algorithms/ruby/0152-maximum-product-subarray.rb

@@ -2,7 +2,7 @@
 
 # 152. Maximum Product Subarray
 # https://leetcode.com/problems/maximum-product-subarray/
-# Difficulty: Medium
+# Medium
 
 =begin
 Given an integer array nums, find a subarray that has the largest product, and return the product.

algorithms/ruby/0155-min-stack.rb

@@ -2,7 +2,7 @@
 
 # 155. Min Stack
 # https://leetcode.com/problems/min-stack/
-# Difficulty: Medium
+# Medium
 
 =begin
 Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

algorithms/ruby/0173-binary-search-tree-iterato.rb

@@ -2,7 +2,7 @@
 
 # 173. Binary Search Tree Iterator
 # https://leetcode.com/problems/binary-search-tree-iterator
-# Difficulty: Medium
+# Medium
 
 =begin
 

algorithms/ruby/0198-house-robber.rb

@@ -2,7 +2,7 @@
 
 # 198. House Robber
 # https://leetcode.com/problems/house-robber/
-# Difficulty: Medium
+# Medium
 
 =begin
 

algorithms/ruby/0199-binary-tree-right-side-view.rb

@@ -2,7 +2,7 @@
 
 # 199. Binary Tree Right Side View
 # https://leetcode.com/problems/binary-tree-right-side-view/
-# Difficulty: Medium
+# Medium
 
 =begin
 Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.

algorithms/ruby/0210-course-schedule-ii.rb

@@ -2,7 +2,7 @@
 
 # 210. Course Schedule II
 # https://leetcode.com/problems/course-schedule-ii/
-# Difficulty: Medium
+# Medium
 
 =begin
 

algorithms/ruby/0227-basic-calculator-ii.rb

@@ -2,7 +2,7 @@
 
 # 227. Basic Calculator II
 # https://leetcode.com/pcalculatelems/basic-calculator-ii
-# Difficulty: Medium
+# Medium
 
 =begin
 Given a string s which represents an expression, evaluate this expression and return its value.

algorithms/ruby/0230-kth-smallest-element-in-a-bst.rb

@@ -2,7 +2,7 @@
 
 # 230. Kth Smallest Element in a BST
 # https://leetcode.com/problems/kth-smallest-element-in-a-bst
-# Difficulty: Medium
+# Medium
 
 =begin
 

algorithms/ruby/0232-implement-queue-using-stacks.rb

@@ -2,7 +2,7 @@
 
 # 232. Implement Queue using Stacks
 # https://leetcode.com/problems/implement-queue-using-stacks/
-# Difficulty: Easy
+# Easy
 
 =begin
 Implement a first in first out (FIFO) queue using only two stacks. The implemented queue should support all the functions of a normal queue (push, peek, pop, and empty).

algorithms/ruby/0238-product-of-array-except-self.rb

@@ -2,7 +2,7 @@
 
 # 238. Product of Array Except Self
 # https://leetcode.com/problems/product-of-array-except-self
-# Difficulty: Medium
+# Medium
 
 =begin
 Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].

algorithms/ruby/0258-add-digits.rb

@@ -2,7 +2,7 @@
 
 # 258. Add Digits
 # https://leetcode.com/problems/add-digits
-# Difficulty: Easy
+# Easy
 
 =begin
 Given an integer num, repeatedly add all its digits until the result has only one digit, and return it.

algorithms/ruby/0283-move-zeroes.rb

@@ -2,7 +2,7 @@
 
 # 283. Move Zeroes
 # https://leetcode.com/problems/move-zeroes
-# Difficulty: Easy
+# Easy
 
 =begin
 Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.

algorithms/ruby/0319-bulb-switcher.rb

@@ -2,7 +2,7 @@
 
 # 319. Bulb Switcher
 # https://leetcode.com/problems/bulb-switcher
-# Difficulty: Medium
+# Medium
 
 =begin
 There are n bulbs that are initially off. You first turn on all the bulbs, then you turn off every second bulb.

algorithms/ruby/0322-coin-change.rb

@@ -2,7 +2,7 @@
 
 # 322. Coin Change
 # https://leetcode.com/problems/coin-change/
-# Difficulty: Medium
+# Medium
 
 =begin
 

algorithms/ruby/0328-odd-even-linked-list.rb

@@ -2,7 +2,7 @@
 
 # 328. Odd Even Linked List
 # https://leetcode.com/problems/odd-even-linked-list
-# Difficulty: Medium
+# Medium
 
 =begin
 Given the head of a singly linked list, group all the nodes with odd indices together followed by the nodes with even indices, and return the reordered list.

algorithms/ruby/0334-increasing-triplet-subsequence.rb

@@ -2,7 +2,7 @@
 
 # 334. Increasing Triplet Subsequence
 # https://leetcode.com/problems/increasing-triplet-subsequence
-# Difficulty: Medium
+# Medium
 
 =begin
 Given an integer array nums, return true if there exists a triple of indices (i, j, k) such that i < j < k and nums[i] < nums[j] < nums[k]. If no such indices exists, return false.

algorithms/ruby/0345-reverse-vowels-of-a-string.rb

@@ -2,7 +2,7 @@
 
 # 345. Reverse Vowels of a String
 # https://leetcode.com/problems/reverse-vowels-of-a-string
-# Difficulty: Easy
+# Easy
 
 =begin
 Given a string s, reverse only all the vowels in the string and return it.

algorithms/ruby/0392-is-subsequence.rb

@@ -2,7 +2,7 @@
 
 # 392. Is Subsequence
 # https://leetcode.com/problems/is-subsequence
-# Difficulty: Easy
+# Easy
 
 =begin
 

algorithms/ruby/0416-partition-equal-subset-sum.rb

@@ -2,7 +2,7 @@
 
 # 416. Partition Equal Subset Sum
 # https://leetcode.com/problems/partition-equal-subset-sum/
-# Difficulty: Medium
+# Medium
 
 =begin
 Given an integer array nums, return true if you can partition the array into two subsets such that the sum of the elements in both subsets is equal or false otherwise.

algorithms/ruby/0417-pacific-atlantic-water-flow.rb

@@ -2,7 +2,7 @@
 
 # 417. Pacific Atlantic Water Flow
 # https://leetcode.com/problems/pacific-atlantic-water-flow
-# Difficulty: Medium
+# Medium
 
 =begin
 

algorithms/ruby/0437-path-sum-iii.rb

@@ -2,7 +2,7 @@
 
 # 437. Path Sum III
 # https://leetcode.com/problems/path-sum-iii/
-# Difficulty: Medium
+# Medium
 
 =begin
 Given the root of a binary tree and an integer targetSum, return the number of paths where the sum of the values along the path equals targetSum.

algorithms/ruby/0516-longest-palindromic-subsequence.rb

@@ -2,7 +2,7 @@
 
 # 516. Longest Palindromic Subsequence
 # https://leetcode.com/problems/longest-palindromic-subsequence/
-# Difficulty: Medium
+# Medium
 
 =begin
 

algorithms/ruby/0543-diameter-of-binary-tree.rb

@@ -2,7 +2,7 @@
 
 # 543. Diameter of Binary Tree
 # https://leetcode.com/problems/diameter-of-binary-tree/
-# Difficulty: Easy
+# Easy
 
 =begin
 Given the root of a binary tree, return the length of the diameter of the tree.

algorithms/ruby/0547-number-of-provinces.rb

@@ -2,7 +2,7 @@
 
 # 547. Number of Provinces
 # https://leetcode.com/problems/number-of-provinces
-# Difficulty: Medium
+# Medium
 
 =begin
 There are n cities. Some of them are connected, while some are not. If city a is connected directly with city b, and city b is connected directly with city c, then city a is connected indirectly with city c.

algorithms/ruby/0605-can-place-flowers.rb

@@ -2,7 +2,7 @@
 
 # 605. Can Place Flowers
 # https://leetcode.com/problems/can-place-flowers
-# Difficulty: Easy
+# Easy
 
 =begin
 

algorithms/ruby/0621-task-scheduler.rb

@@ -2,7 +2,7 @@
 
 # 621. Task Scheduler
 # https://leetcode.com/problems/task-scheduler
-# Difficulty: Medium
+# Medium
 
 =begin
 Given a characters array tasks, representing the tasks a CPU needs to do, where each letter represents a different task. Tasks could be done in any order. Each task is done in one unit of time. For each unit of time, the CPU could complete either one task or just be idle.

algorithms/ruby/0662-maximum-width-of-binary-tree.rb

@@ -2,7 +2,7 @@
 
 # 662. Maximum Width of Binary Tree
 # https://leetcode.com/problems/maximum-width-of-binary-tree/
-# Difficulty: Medium
+# Medium
 
 =begin
 Given the root of a binary tree, return the maximum width of the given tree.

algorithms/ruby/0735-asteroid-collision.rb

@@ -2,7 +2,7 @@
 
 # 735. Asteroid Collision
 # https://leetcode.com/problems/asteroid-collision
-# Difficulty: Medium
+# Medium
 
 =begin
 We are given an array asteroids of integers representing asteroids in a row.

algorithms/ruby/0815-bus-routes.rb

@@ -2,7 +2,7 @@
 
 # 815. Bus Routes
 # https://leetcode.com/problems/bus-routes/
-# Difficulty: Hard
+# Hard
 
 =begin
 You are given an array routes representing bus routes where routes[i] is a bus route that the ith bus repeats forever.