Prime Visit code

#1

getting run error and 2 test cases are not correct

#2

@shubhamkumarsingh the logic that you are using should not pass the tests. You should first store all the primes using a sieve of Eratosthenes and then binary search for the position of A and B in that list. Report their difference as the answer.

#3

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.

#4

can’t pass all test cases

#5

Please post your code then

#6
#7

you still aren’t using binary search , you are linearly iterating which won’t pass time limits.

#8

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.