Kth root challeges in sortingand seraching

#1

how can i handle large input data 10^15
if I store in array how can I solve this question

#2

@khemchandrs hey apko binary search use krna pdega:
Approach: Binary search.
Basically search for X satisfying X^K<=N in range 0 to sqrt(N) and handle the case of K=1 separately.

#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.