# Longest String

# I worked on this challenge [by myself, with: ].

# longest_string is a method that takes an array of strings as its input
# and returns the longest string
#
# +list_of_words+ is an array of strings
# longest_string(list_of_words) should return the longest string in +list_of_words+
#
# If +list_of_words+ is empty the method should return nil


# Your Solution Below
def count_between(list_of_integers, lower_bound, upper_bound)
  range = (lower_bound..upper_bound)
  list_of_integers.count { |i| range.include?(i) }
end
# Count Between

# I worked on this challenge [by myself, with: ].

# count_between is a method with three arguments:
#   1. An array of integers
#   2. An integer lower bound
#   3. An integer upper bound
#
# It returns the number of integers in the array between the lower and upper bounds,
# including (potentially) those bounds.
#
# If +array+ is empty the method should return 0

# Your Solution Below


# Your Solution Below
def count_between(list_of_integers, lower_bound, upper_bound)
  range = (lower_bound..upper_bound)
  list_of_integers.count { |i| range.include?(i) }
end
Fix comments in count between
Fix comments in count between
