Working solution, 2 while loops, stop at first 25%

- 2 while loops, one nested in another
- loop through first biggest 25% of numbers, and then first 25% of the next number
- remove any combination of numbers that end in zero, as this cannot be a palindrome
- call a separate palindrome function to test if a product is a palindrome
- remove duplicates of the final array with palindromes