# -- Psuedo Code -- #
# 1. Create an array with mixed numbers
# 2. Create an final_array that will hold all the numbers we "find" that are greater than 5.
# 3. Go through each of the numbers in the array, checking it's value and comparing it with 5.
# 4. If the check is positive ( greater than 5 ) then push that number to our final_array
# 5. Get the total numbers of final_array to show result
# 6. Print result

arr = [17,7,3,6,10,1]
final_arr = Array.new
arr.each {|number| number >= 5 ? new_arr << number : nil }
puts "this is how many numbers were bigger than 5: #{new_arr.count}"

# -- Psuedo Code -- #
# 1. Create method that takes one argument
# 2. Check that the number is less or equal to 1, or if it's even. If it is, it's not a prime number.
# 3. Check if number is greater than 2, and loop through all numbers from 2 to the square root of number.
# 4. Check if it can be divided by the the integer without any remainder = not a prime number
# 5. If the loop completes without finding any of the previous things, then number is prime. Print "PRIME! ⭐️".

def prime_number(number)
  if number <= 1 || number.even?
    puts 'NOT A PRIME NUMBER! ❌'
  elsif (2..Math.sqrt(number)).all? { |i| (number % i).nonzero? }
    puts 'PRIME! ⭐️'
  else
    puts 'NOT A PRIME NUMBER! ❌'
  end
end


prime_number(3)

# -- Psuedo Code -- #
# 1. Create a method that takes an array of numbers
# 2. Create a variable containing the sum of found prime numbers
# 3. Iterate over the array, checking if the values are prime or not
# 4. If it's a prime number, add to sum
# 5. Print out total value of all the primes

def find_prime_number(arr)
  total = arr.reduce(0) do |sum, number|
    if number <= 1 || number.even?
    sum
    elsif (2..Math.sqrt(number)).all? {|i| (number % i ).nonzero? }
      sum + number
    else
      sum
    end
  end
  puts "Total total of primes in array => #{total}"
end

find_prime_number([3,0,3, 54, 43, 11, 123, 322])

# -- Psuedo Code -- #
# 1. Create method that takes one argument(number)
# 2. Create an array containing all the numbers from 1 to number.
# 3. Iterate over the array and add the value to a sum.
# 4. Print out sum

def factorial_numbers(number)
  arr = (1..number).to_a
  sum = arr.reduce(1) do |accmulator, value|
    accmulator * value
  end
  puts sum
end

factorial_numbers(6)

# -- Psuedo Code -- #
# 1. Make a method that takes a number
# 2. Split the number into an array
# 3. Check if the number is unique or not
# 4. Unless 0, disqualify.

def check_repeated_digits_option(number)
  arr = number.to_s.chars.map(&:to_i)
  puts arr.uniq.length != 1 ? "#{number} => Congrats! Digits are are all unique" : "#{number} => Disqualified. Contains duplicates."
end

# -- Psuedo Code -- #
# 1. Create a method that takes a max value
# 2. Have a variable that holds the count(total)
# 3. Give two numbers to start with
# 4. Create a loop that runs until given max value
# 5. While the loop runs, take the last item in the array, and add the second to last item in the array to count.
# 6. Add the new number to the array
# 7. Print out result

def fibonnaci_count(max)
  count = 0
  arr = [0,1]
  while count <= max
    count = arr.last + arr[-2]
    arr << count
  end
  arr
end


sequence = fibonnaci_count(2000)
puts "The sequence is: #{sequence}"

# -- Psuedo Code -- #
# 1. Create a method that takes an array of numbers.
# 2. Sort the array, to make it work in any order.
# 3. Get the smallest and biggest value to get a start and end point.
# 4. Create a new, perfect array with the range between those numbers
# 5. Use the new array and compare it to the old array
# 6. Create a new missing_numbers array that will be filled with the numbers not included in old_array when comparing.

def missing_number(array)
  array = array.sort
  first = array.min
  last = array.max
  perf_arr = (first..last).to_a
  missing_numbers = []
  if array == perf_arr
    puts 'No missing numbers'
  else
    perf_arr.each do |number|
      missing_numbers << number unless array.include?(number)
    end
    puts "These are the numbers missing: #{missing_numbers}"
  end
end

missing_number([1,3,4,5,9,15,8,10,7,6])