I’ve a doubt in the prime visits problem on hackerblocks. Test case 1 and 2 are working fine but test case 3 is not working. Here is the link of my code:
Test case 3 of prime visits oh hackerblocks not working
why isnt it efficient?
ur time complexity is high roughy O(q *range^2) .