Please check the code
Problem in Kth Root, timelimit exceeded
Hi Vivek,
A simple O(n) solution won’t work in this question. You need a O(Log n) solution. Therefore, you need to use Binary Search instead of Linear Search. Else you will have TLE.
Please check the code
Hi Vivek,
A simple O(n) solution won’t work in this question. You need a O(Log n) solution. Therefore, you need to use Binary Search instead of Linear Search. Else you will have TLE.