My code
my Answers is right but in the second case, it tells TLE. Though the question is easy but not able to think a different approach.
TLE Exist case 2nd
Hey @HemantNasa
Apply Binary Search
We will aplly binary search in this problem. For every possible mid obtained by using binary search we will check of it is the best suitable candidate or not for becoming the Kth root and then we reduce the search space of the binary search according to the mid value. If mid^k is greater than N then we will find the best suitable value from left to mid-1 otherwise we will find much larger value by finding it from mid+1 to right.