Test case 2 seems to be getting wrong answer

#1

Could you please clarify why test case 2 seems to be failing

#2

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.

#3

I have saved my code on ide.codingblocks. I dont understand what is the problem with my current method, using the Math.pow method