Item #10: Always override toString All classes that extend the Object class, which is to say all classes, have the toString method. When toString is not overriden, this method simply prints the name of the class, followed by an “@”, followed by the id of the instance of the class. This is not super helpful […]
Effective Java: Item #9
Header: I am working my way through effective java and am writing these posts to help solidify my understanding of what’s in the book. This is the first post of it’s kind, but I’m sure I’ll get around to writing posts on the previous 8 items, along with the next 45-ish. Effective Java: Item #9, […]
Programming Praxis: Feb 15, 2011
Below is my solution to the Programming Praxis problem from Feb. 15, 2011. The problem came from Google Code Jam Qualification Round Africa 2010. For more info, check this link. And here are some tests I did to make sure everything worked properly.
Below is my solution to the Programming Praxis problem from Sept. 21, 2010. The problem was to find all Kaprekar numbers less than 1000. I wrote my solution in C++ to refresh my skills a little. For more info, see this link.
Project Euler Problem 11
The problem: Find the largest product of 4 adjacent numbers in a 20×20 grid. Numbers can be adjacent in any direction, vertical, horizontal, diagonal. http://projecteuler.net/problem=11 My solution (in java):
Project Eurler Problem 10
Here’s the problem: Find the sum of all primes less than 2,000,000 projecteuler.net/problem=10 My solution:
Project Euler Problem 36
Another one bites the dust! I worked with my brother David on this one, so a big thanks to him for his help. Here’s the problem: The decimal number, 585 = 10010010012 (binary), is palindromic in both bases. Find the sum of all numbers, less than one million, which are palindromic in base 10 and […]
Project Euler Problem 30
My solution to Project Euler Problem 30. Here’s the problem: Surprisingly there are only three numbers that can be written as the sum of fourth powers of their digits: 1634 = 14 + 64 + 34 + 44 8208 = 84 + 24 + 04 + 84 9474 = 94 + 44 + 74 + […]
Solution: Project Euler Problem 8
The Problem: Find the greatest product of five consecutive digits in the 1000-digit number. 73167176531330624919225119674426574742355349194934 96983520312774506326239578318016984801869478851843 85861560789112949495459501737958331952853208805511 12540698747158523863050715693290963295227443043557 66896648950445244523161731856403098711121722383113 62229893423380308135336276614282806444486645238749 30358907296290491560440772390713810515859307960866 70172427121883998797908792274921901699720888093776 65727333001053367881220235421809751254540594752243 52584907711670556013604839586446706324415722155397 53697817977846174064955149290862569321978468622482 83972241375657056057490261407972968652414535100474 82166370484403199890008895243450658541227588666881 16427171479924442928230863465674813919123162824586 17866458359124566529476545682848912883142607690042 24219022671055626321111109370544217506941658960408 07198403850962455444362981230987879927244284909188 84580156166097919133875499200524063689912560717606 05886116467109405077541002256983155200055935729725 71636269561882670428252483600823257530420752963450 My Solution (in Java):
Solution: Project Euler Problem 7
The Problem: What is the 10 001st prime number? My Solution (in Python): Feedback is always appreciated!