We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Java has a NavigableSet interface (implemented by TreeSet) that is helpful for this situation.
So first we construct the set, and then query for the result using the lower method.
Project Euler #4: Largest palindrome product
You are viewing a single comment's thread. Return to all comments →
Java has a NavigableSet interface (implemented by TreeSet) that is helpful for this situation. So first we construct the set, and then query for the result using the lower method.