Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
be0cac0
commit d3d226c
Showing
9 changed files
with
27 additions
and
0 deletions.
There are no files selected for viewing
File renamed without changes.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,5 @@ | ||
class BookUtils | ||
def self.valid_isbn13?(isbn) | ||
# your code here | ||
end | ||
end |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,3 +1,4 @@ | ||
require 'rspec' | ||
require './book_utils' | ||
|
||
describe BookUtils, "#valid_isbn13" do | ||
|
File renamed without changes.
File renamed without changes.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,3 @@ | ||
Solve RPCFN #1: | ||
|
||
http://rubylearning.com/blog/2009/09/24/rpcfn-shift-subtitle-1/ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,12 @@ | ||
Part 1: | ||
I want you to write a memoized Fibonacci program. | ||
|
||
By memoized I mean that no result should be calculated twice, | ||
previous computations get reused instead. | ||
|
||
Requirement: make this as simple as possible. Be creative, | ||
use Ruby in unexpected ways, suprise me! | ||
|
||
Part 2: | ||
Write a Fibonacci class that can be called like this: Fib.f_x (where x will | ||
be replaced by an actual number). |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,3 @@ | ||
Find a solution for RPCFN #2: | ||
|
||
http://rubylearning.com/blog/2009/10/08/rpcfn-average-arrival-time-for-a-flight-2/ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,3 @@ | ||
Solve RPCFN #4: | ||
|
||
http://rubylearning.com/blog/2009/11/26/rpcfn-rubyfun-4/ |