Your question is Core Coding: Prime and Palindrome. Start with the requirements on the right.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
Implement check_prime_and_palindrome(number) for a non-negative integer. Return a two-element list: [is_prime, is_palindrome]. Treat numbers less than 2 as non-prime, and check palindromes using the decimal representation of the number.
Example: number = 131 returns [True, True].
def check_prime_and_palindrome(number):