How to increase prime performance

showing test case too slow
please suggest to improve my algorithim

generate prime numbers(according to the constraints)…pre compute the result and store it in a map…then whenever user inputs a value just get the value from map…

use seive of eratosthenes to generate prime numbers…in the hashmap key:count and value:the prime number

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.