I cant pass 4 test cases, please tell me where i am going wrong
hello @haseebshaik00
For c++ the time complexity of inbuilt pow is O(log(N)) but as we know c++ does not support any inbuilt datatype which can handle such large values … It is usually avoided for large values
if a and b are very large numbers the overflow might occur .
you have to right your own pow function calculation .
if you feel your doubt is cleared please mark this doubt as cleared .
if a is 53 and b is 59 you are calculating the pow of a and b using pow which becomes very large .
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.