#Bonus Challenges
###Exercises
- Project Euler #1 - Multiples of 3 and 5
- Modify this code to write FizzBuzz. Print out each of the numbers from 1 to 1000. If the number is divisible by 3 then print "Fizz" instead of the number. If the number is divisible by 5 then print "Buzz" instead of the number. If the number is divisible by both then print "Fizzbuzz".
- Modify this code again: instead of replacing numbers if they are divisible by 3 and 5, print "Fizz" if the number contains a 3 and "Buzz" if the number contains a 5, and "Fizzbuzz" if it contains both.
- Read this for more on FizzBuzz.
- Project Euler #14 - Longest Collatz sequence
- Modify this code so that it takes in the starting number as a parameter.
- Modify this code so that it prints out each chain.
- Modify this code so that it only prints out the longest chain found so far, whenever a new longest chain is encountered.
- Modify this code so that it only prints out the longest chain under the starting number.
- See also: Collatz Conjecture
- Project Euler #19 - Counting Sundays
- Find a Java date library and solve this problem again, using that library.
- Find another Java date library. Implement this solution again, using the new date library.
- What day of the week were you born?
- Read more about programming and time.
- Project Euler #31 - Coin sums
- How many different ways can you make $2 with American coins?
- How many different ways can you make $2 with Canadian coins?
- Read more on dynamic programming and the coin change problem.
Create some bonus challenges for the assessment. Bonus challenges should be of the following format:
/*
* Comment describing what the challenge is
*/
public static RETURN_TYPE METHOD_NAME (PARAMETER_TYPE PARAMETER) {
return DEFAULT_VALUE;
}