Kth ROOT challenge

#1

https://ide.codingblocks.com/s/239770.
this is my code shows time limit exceeds .

#2

Use the binary search approach
take the left=1,right=1000000,mid;
As mid^k is very very greater than 10^15. Your answer might overflow. Use a linear method to multiply it k times to check if it ts lesser than n.

#3

@naazsayma123 You can also have a look at this code for reference.https://ide.codingblocks.com/s/239789

#4

Can you suggest the changes for my code or the code with similar approach.

#5

I already stated the problem in your solution. Now it’s your turn to write the solution.

#6

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.