# Smallest Integer

# I worked on this challenge by myself.

# smallest_integer is a method that takes an array of integers as its input
# and returns the smallest integer in the array
#
# +list_of_nums+ is an array of integers
# smallest_integer(list_of_nums) should return the smallest integer in +list_of_nums+
#
# If +list_of_nums+ is empty the method should return nil

# Your Solution Below
def smallest_integer(list_of_nums)
  # Your code goes here!
  if (list_of_nums.length == 0)
    return nil
  else
    smallest_num = list_of_nums[0]
    list_of_nums.each do |num|
      if (num < smallest_num)
        smallest_num = num
      end
    end
    return smallest_num
  end
end
# Smallest Integer

# I worked on this challenge by myself.

# smallest_integer is a method that takes an array of integers as its input
# and returns the smallest integer in the array
#
# +list_of_nums+ is an array of integers
# smallest_integer(list_of_nums) should return the smallest integer in +list_of_nums+
#
# If +list_of_nums+ is empty the method should return nil

# Your Solution Below
=begin Initial Solution
def smallest_integer(list_of_nums)
  # Your code goes here!
  if (list_of_nums.length == 0)
    return nil
  else
    smallest_num = list_of_nums[0]
    list_of_nums.each do |num|
      if (num < smallest_num)
        smallest_num = num
      end
    end
    return smallest_num
  end
end
=end

#Refactored Solution
def smallest_integer(list_of_nums)
  return list_of_nums.sort().slice(0)
end
Add refactored smallest integer solution
Add refactored smallest integer solution
