remove require set

Author: Dbz

algorithms/intersection.rb

@@ -4,8 +4,6 @@
 # node of the first linked list is the exact same node (by reference) as the jth node of the second
 # linked list, then they are intersecting.
 
-require 'Set'
-
 class Node
   attr_accessor :data, :next, :prev
   def initialize(data)

algorithms/is_unique.rb

@@ -2,8 +2,6 @@
 # Is Unique: Implement an algorithm to determine if a string has all unique characters. What if you
 # cannot use additional data structures?
 
-require 'Set'
-
 # O(n) solution
 # The string length will be the same as the set length if it is all unique characters
 def unique_1?(str)

algorithms/loop_detection.rb

@@ -8,8 +8,6 @@
 # Input: A -) B -) C -) D -) E -) C
 # Output: C
 
-require 'Set'
-
 class Node
   attr_accessor :data, :next, :prev
   def initialize(data)

algorithms/remove_duplicates.rb

@@ -1,5 +1,3 @@
-require 'Set'
-
 # @param {String} text
 # @return {String}
 

algorithms/remove_duplicates_in_linked_list.rb

@@ -2,8 +2,6 @@
 # Remove Dups: Write code to remove duplicates from an unsorted linked list.
 # How would you solve this problem if a temporary buffer is not allowed?
 
-require 'Set'
-
 class Node
   attr_accessor :data, :next
   def initialize(data)

algorithms/string_rotation.rb

@@ -3,8 +3,6 @@
 # of another. Given two strings, 51 and 52, write code to check if 52 is a rotation of 51 using only one
 # call to isSubstring (e.g., "waterbottle" is a rotation of"erbottlewat").
 
-require 'Set'
-
 # Looping is O(n), concatination is O(n), and comparision is also O(n) making this O(n^2)
 def rotation_1?(str1, str2)
   return false unless str1.size == str2.size

algorithms/zero_matrix.rb

@@ -2,8 +2,6 @@
 # Zero Matrix: Write an algorithm such that if an element in an MxN matrix is 0, its entire row and
 # column are set to O.
 
-require 'Set'
-
 # Matrix is NxM
 class Matrix
   def initialize(matrix_array)