Sir, please help me to find out my error
sir, please help me to find my error.
hello @chandreshmaurya
instead of preparing sieve and counting primes again n again, u can store this information in array by preparing sieve only once.
after that use that array to answer query in O(1).
check this video->
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.