Skip to content

Instantly share code, notes, and snippets.

View AndrewGuard's full-sized avatar

Andrew AndrewGuard

7 followers · 2 following
View GitHub Profile
@AndrewGuard
AndrewGuard / index.html
Created March 10, 2017 20:57
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<title></title>
<link rel="stylesheet" type="text/css" href="style.css">
</head>
<body>
@AndrewGuard
AndrewGuard / Foo
Created January 26, 2017 01:39
Bar
@AndrewGuard
AndrewGuard / sum_of_primes.rb
Last active January 4, 2016 18:08
# The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
# Find the sum of all the primes below two million.
# Slow
def is_prime?(num)
(2..Math.sqrt(num)).each { |i|
if num % i == 0 && i < num
return false
@AndrewGuard
AndrewGuard / capybara cheat sheet
Created January 24, 2014 18:52 — forked from zhengjia/capybara cheat sheet
=Navigating=
visit('/projects')
visit(post_comments_path(post))
=Clicking links and buttons=
click_link('id-of-link')
click_link('Link Text')
click_button('Save')
click('Link Text') # Click either a link or a button
click('Button Value')
@AndrewGuard
AndrewGuard / is_fib.rb
Last active January 3, 2016 07:09
def is_fib(num)
x = 0
y = 1
until y > num
x, y = y, x + y
end
x == num
end
p is_fib(8670007398507948658051921) #true
@AndrewGuard
AndrewGuard / largest_product_in_series.rb
Last active January 2, 2016 23:09
# http://projecteuler.net/problem=8
# Find the greatest product of five consecutive digits in the 1000-digit number.
big_num = 7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607
@AndrewGuard
AndrewGuard / is_fib.rb
Last active January 2, 2016 21:49
def fib_iterative(n)
current = 0
successor = 1
n.times do |n|
current, successor = successor, current + successor
end
return current
end
@AndrewGuard
AndrewGuard / fibonacci.rb
Created January 11, 2014 01:13
require 'benchmark'
def fib_it(n)
fib_nums = [0, 1]
iterate = n-1
iterate.times do
num = fib_nums[-2] + fib_nums[-1]
fib_nums << num
end
p fib_nums[-1]
@AndrewGuard
AndrewGuard / prime_value.rb
Created January 10, 2014 20:48
# Problem #7 from http://projecteuler.net/problem=7
def prime? x
a = Math.sqrt(x)
(2..a).each {|y| return false if x % y == 0}
true
end
def prime_value(index)
val = 3
@AndrewGuard
AndrewGuard / sum_square_difference.rb
Created January 10, 2014 19:06
# Problem #6 from http://projecteuler.net/problems
num = 10
def sum_of_squares(num)
sum_of_squares = 0
num.downto(1) do |number|
sum_of_squares += number * number
end
sum_of_squares