Ruby Challenge Solutions!

CountingGame.rb

@@ -0,0 +1,81 @@
+# 10 friends in a circle count from 1-100 
+# Catch 1: when number is divisible by 7, switch directions 
+# Catch 2: when number is divisble by 11, skip next person 
+
+
+def countingGame(totalPlayers, targetNumber)
+
+	player = 1
+	normalRotation = true 
+
+	# Find next player based on direction, current player, total # of players, and current number
+	def rotatePlayer(normalRotation, currentPlayer, totalPlayers, numberNeeded)
+
+		#CHECK DIRECTION
+		if normalRotation == true
+
+			# DIVISIBLE BY 11? SKIP
+			if numberNeeded % 11 == 0 
+				if currentPlayer == totalPlayers - 1
+					nextPlayer = 1
+				elsif currentPlayer == totalPlayers
+					nextPlayer = 2
+				else
+					nextPlayer = currentPlayer + 2 
+				end
+
+			# NOT DIVISBLE BY 11
+			else 
+				if currentPlayer == totalPlayers 
+					nextPlayer = 1
+				else
+					nextPlayer = currentPlayer + 1
+				end
+			end
+
+		# CHANGE DIRECTION
+		else 
+
+			#DIVISIBLE BY 11? SKIP 
+			if numberNeeded % 11 == 0 
+				if currentPlayer == 1
+					nextPlayer = totalPlayers - 1					
+				elsif currentPlayer == 2
+					nextPlayer = totalPlayers
+				else
+					nextPlayer = currentPlayer - 2
+				end
+
+			#NOT DIVISBLE BY 11 
+			else
+				if currentPlayer == 1
+					nextPlayer = totalPlayers
+				else 
+					nextPlayer = currentPlayer - 1
+				end
+			end
+		end
+
+		return nextPlayer
+	end
+
+
+	(1..targetNumber).each do |number|
+		puts "Player #{player} said the number #{number}"
+
+		#CHECK FOR CHANGE IN DIRECTION 
+		if number % 7 == 0 
+			normalRotation = !normalRotation
+		end
+
+		player = rotatePlayer(normalRotation, player, totalPlayers, number)
+	end 
+
+end
+
+
+# TEST: 
+countingGame(10, 100)
+
+
+

RubyCalisthenics.rb

@@ -0,0 +1,161 @@
+# -----------------------------------------------
+# Method 1: Power
+# -----------------------------------------------
+
+def power(base, exponent)
+	result = 1
+	exponent.times do 
+		result *= base 
+	end
+	puts result
+end
+
+# Tests: 
+# power(3,4)
+	# => 81 # (3*3*3*3)
+# power(5,5)
+	# => 3125
+# power(8,2)
+	# => 64
+
+# -----------------------------------------------
+# Method 2: Factorial
+# -----------------------------------------------
+
+def factorial (num)
+	counter = 1
+	product = 1
+	while counter <= num do 
+		product *= counter 
+		counter += 1
+	end
+	print product
+end
+
+# Tests:
+# factorial(5)
+	# => 120 
+# factorial(4)
+	# => 24
+# factorial(7)
+	# => 5040
+
+# -----------------------------------------------
+# Method 3: Uniques
+# -----------------------------------------------
+# SOLUTION 1: Add values to a new array if that value is not already present in the new array. 
+
+def uniques (itemArray)
+	uniqueArray = []
+
+	# Check whether each item is already present in the array
+	# If it isn't, add it to the array. 
+
+	itemArray.each do |item|
+		while uniqueArray.include?(item) != true
+			uniqueArray << item
+		end
+	end
+
+	return uniqueArray
+end
+
+# Test:
+# print uniques([1,5,"frog", 2,1,3,"frog"])
+
+
+# SOLUTION 2: Compare the origianl array with a duplicate of the original array to create a third array containing all of the values that were present in both the original and the duplicate, but removes any duplicate values. 
+
+def uniques (itemArray)
+	duplicateArray = itemArray
+	uniqueArray = duplicateArray & itemArray
+end
+
+# Test: 
+ # print uniques([1,5,"frog", 2,1,3,"frog"])
+
+
+# -----------------------------------------------
+# Method 4: Combinations
+# -----------------------------------------------
+
+def combinations(firstArray, secondArray)
+	newArray = []
+	firstArray.each do |firstString|
+		secondArray.each do |secondString|
+			newArray << "#{firstString}#{secondString}"
+		end
+	end
+	print newArray
+end
+
+
+# Tests: 
+# combinations(["on", "in"],["to", "rope"])
+# => [“onto”,”onrope”,”into”,”inrope”]
+
+# combinations(["i love ", "My pets include "],["Rambo", "Loretta", "Ever"])
+# => ["i love Rambo", "i love Loretta", "i love Ever", "My pets include Rambo", "My pets include Loretta", "My pets include Ever"]
+
+# -----------------------------------------------
+# Method 5: Primes 
+# -----------------------------------------------
+
+def is_prime?(number)
+
+	# Check to see if number is 0 or 1 since those are not considered prime numbers.
+	if (number == 1 || number == 0)
+		return false
+
+	# See number is divisible by any number lower than number other than 1
+	else
+		(2..number-1).each {|value| return false if number % value == 0}
+	end
+
+	true
+end
+
+
+# Tests
+# puts is_prime?(1)
+# puts is_prime?(29)
+# puts is_prime?(7)
+# puts is_prime?(14)
+
+
+# -----------------------------------------------
+# Method 6: Rectangle Overlap
+# -----------------------------------------------
+# The first coordinate in a pair is the x-coordinate (across) and the second is the y-coordinate (up or down)
+	# rectangle = [[start_across, start_height], [end_across, end_height]]
+	# height = rectangle[1][1] - rectangle[0][1]
+	# width = rectangle[1][0] - rectangle[0][0]
+
+
+def overlap(rectangle1, rectangle2)
+	widthIntersect = false
+	heightIntersect = false
+
+	# Check to see if the rectangles overlap on the x axis
+	widthIntersect = true if (rectangle1[0][0]+1...rectangle1[1][0]).include?(rectangle2[0][0] || rectangle2[1][0])
+
+	# Check to see if the rectangles overlap on the y axis
+	heightIntersect = true if (rectangle1[0][1]+1...rectangle1[1][1]).include?(rectangle2[0][1] || rectangle2[1][1])
+
+	if (widthIntersect == true && heightIntersect == true)
+		return true
+	else
+		return false
+	end
+end
+
+
+# Tests:
+# puts overlap( [[0,0],[3,3]], [[1,1],[4,5]] )
+# puts overlap( [ [0,0],[1,4] ], [ [1,1],[3,2] ] )
+
+
+
+
+
+