Please suggest me a hint for the Kth root problem, in which we have to maximum x such that x^k<=n and n and k are two numbers.
Kth Root Question Doubt
use binary search on x
Reference Code
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.