Skip to content

Instantly share code, notes, and snippets.

@gstark

gstark/problem1.md

Last active October 15, 2015 15:19
Show Gist options

  • Select an option

    Learn more about clone URLs
  • Save gstark/9d5b19f5b54a0732c108 to your computer and use it in GitHub Desktop.

Select an option

Learn more about clone URLs
Save gstark/9d5b19f5b54a0732c108 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
problem1.md

For the numbers 1 through 1000

  • if the number is divisible by 5 print Iron

  • if the number is divisible by 7, print Yard

  • if it is divisible by both 5 and 7, print IronYard

  • that is:

1
2
3
4
Iron
5
6
Yard
.
.
.
Raw
problem2.md

Given an array, create a new array that has all of the elements of the first array but in reverse order.

  • That is, given [5,4,9,1,2] return [2,1,9,4,5]
Raw
problem3.md

Write a method that given an array of strings, returns an array containing only the strings that are palindromes.

  • this is, given ["foo", "bar", "bazab", "Gavin", "barrab", "test"], returns only ["bazab", "barrab"]
Raw
problem4.md

Write a method that given a number returns the sum of the digits of that number

  • that is, given 1572, returns 15
Raw
problem5.md

Write a method to find all the numbers between 2 and 1000 that are squares

  • that is 4, 16, 25, ...
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment