Easy-to-follow tutorials and challenges for just snippets of your time.
Click to get started.
Try solving Project Euler problem 12, in finding the first triangle (generated by adding the natural numbers) to have over five hundred divisors.
Find out how to implement a method that checks if a number is prime in Java.
Try solving Project Euler problem 27, a question concerning quadratic primes from Project Euler in Java.