Skip to content

Instantly share code, notes, and snippets.

View gist:5000938
def count_between(array, lower_bound, upper_bound)
if array.empty?
return 0
end
array.each do |num|
if num >= lower_bound && num <= upper_bound
return num
else
return 0
View gist:5016284
def count_between(array, lower_bound, upper_bound)
if array.empty?
return 0
end
counter = 0
array.select { |num| counter += 1 if num >= lower_bound && num <= upper_bound }
end
counter
View gist:5018587
Exercise: Calculating the array mode
Write a method mode which takes an Array of numbers as its input and returns an Array of the most frequent values.
If there's only one most-frequent value, it returns a single-element Array.
For example,
mode([1,2,3,3]) # => [3]
mode([4.5, 0, 0]) # => [0]
mode([1.5, -1, 1, 1.5]) # => [1.5]
View gist:5018695
def times_table(rows)
if rows == 0
return false
end
array = []
counter = 1
while counter <= rows
1.upto(rows) do |i|
array << i*counter
end
View gist:5043466
def factorial(n)
if n == 0
return 1
end
counter = 0
array = []
while n >= counter
n.times do |i|
array << i *= (n-counter)
end
View gist:5051882
def mode(array)
a = array.inject(Hash.new(0)) { |key, value| key[value] += 1; key }
array.sort_by { |value| a[value] }.last
end
@kenrett
kenrett / gist:5130538
Last active Dec 14, 2015
class GuessingGame
View gist:5130538
class GuessingGame
def initialize(answer)
@answer = answer
end
def guess(g)
@guess = g
if @answer < @guess
return :high
end
View lucky_ajax.md

Instructions:

  1. Download this application skeleton.
  2. Convert the app to use AJAX.
  3. Add any files you changed to your gist and submit your code.
View lucky_ajax.md
View jquery_quiz.js
/* Here is your chance to take over Socrates!
Spend 10 minutes on each of the following hacks to the socrates website.
Enter them in the console to make sure it works and then save
your results here.
Choose a new pair for each. Add your names to the section you complete.
*/