Boston Numbers Question

Why is it giving TLE in Test Cases 1 & 2 ? Please check the code below :

The code is giving a Time Limit Exceeded (TLE) error because the checkprime function is inefficient, checking divisibility up to a for every number, leading to excessive computation, especially for large inputs.

You can refer my code as well

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.