Hi everyone,

Please check out episode 4 of the Q For Problems video series.

This covers problem 4 from the Project Euler problem set. Project Euler - Problem 4

The problem wants us to find the largest palindrome made from the product of two 3-digit numbers.

Hopefully you enjoy the new intro, outro and section transitions! 😊

Feel free to share your own solutions and ideas in the comments.

Thanks