SolomonHD

require 'minitest/autorun'
require 'minitest/pride'

# Write two classes which inherit from the Vehicle class below.  You will also
# need to add a method to the Vehicle class during this challenge.


class Vehicle
  def initialize(make, model)
    @make = make

SolomonHD

class OddArray
  def initialize(odd_array)
      @odd_array = odd_array
  end

  def to_a
    odd_only_array = []
    @odd_array.each do |number|
      if number.class == Fixnum && number.odd?
        odd_only_array << number

SolomonHD

require 'minitest/autorun'
require 'minitest/pride'

# Write a class which has an initialize method, a reader method, a private
# method, and a class method.

# WRITE YOUR CODE HERE.
class Goat
  def initialize(name = "default")
    @name = name

SolomonHD

require 'minitest/autorun'
require 'minitest/pride'

# Write a method which accepts an array and returns a sum of the elements in the
# array.  Specifying a second parameter (e.g. 3) will allow you to sum all the
# items starting from index 3. Specifying three parameters will allow you to sum
# between two indices (e.g. everything between 3 and 6, inclusive).

# WRITE YOUR CODE HERE.  Name your method `subsum`.
def subsum(array, x = -1, y = -1)

SolomonHD

require 'minitest/autorun'
require 'minitest/pride'

def palindrome?(input)
  input.downcase!
  array = input.split(" ")
  array = array.join
  input2 = array.to_s
  if input2 == input2.reverse
    return true

SolomonHD

require 'minitest/autorun'
require 'minitest/pride'

# Write a method which accepts an array and returns a hash.  Each item in the
# array will be a string, and the returned hash should have last names as keys
# and first names as values.

# WRITE YOUR CODE HERE.  Name your method `names`.

def names(array)

SolomonHD

require 'minitest/autorun'
require 'minitest/pride'
require 'prime'

# Write a method which returns the first n primes, where n is provided to the
# method as a parameter.
#
# Remember that the % operator (modulo) is your friend.  It returns a zero if one
# number is divisible by another number.  In other words, 4 % 2 == 0.

SolomonHD

require 'minitest/autorun'
require 'minitest/pride'

# Write a method which accepts an array as the first paramater and a number
# as the second parameter.  Return true if two of the numbers in the array sum
# to the second parameter.

# WRITE YOUR CODE HERE.  Name your method `complements?`.
def complements?(array, sum)
  if array == nil || array.length < 2

SolomonHD

#1
SELECT * FROM authors WHERE email = "shakespeare@example.com"

#2
SELECT * FROM authors ORDER BY created_at DESC LIMIT 1;

#3
SELECT question_text, count(*) FROM questions GROUP BY question_type

#4

SolomonHD

require 'minitest/autorun'
require 'minitest/pride'

# Write a series of methods which use the .any, .all, .map, .select, .reject, and
# .reduce methods in Enumerable.  Each of your methods should be one line.

# WRITE YOUR CODE HERE.  In this challenge, names longer than 5 characters are
# considered long.
def has_even?(array)
  array.any? {|n| n % 2 == 0}