Powerful Integers | Live Coding with Explanation | Leetcode - 970

preview_player
Показать описание
The time and space complexity for this problem will be O(logx(bound) * logy(bound)) where x and y are the base.

To support us you can donate

Check out our other popular playlists:
Questions you might like:

If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful.

#coding #leetcode #programminglife #programmingisfun #programmer #tech #software #codinglife #leetcode
Рекомендации по теме
Комментарии
Автор

We hope you all are enjoying our videos!!! Don't forget to leave a comment!!! Please like the video to support us!!!

Questions you might like:

Struggling in a question??

Leave in a comment and we will make a video!!!🙂🙂🙂

AlgorithmsMadeEasy
Автор

For the time complexity part, We are trying with incremental powers of x and y to reach bounds. Shouldn't it be Logx(Bounds) and Logy(Bounds) where x and y are log bases?

varunr
Автор

Great content. It will be helpful to have pictures from your videos along with the code for reference. Is the presentation material available online?

rabsgcs
Автор

I love the way you keep things simple in the coding challenge. I have one question. If you see the leetcode solution they have done some logarithmic by taking two variables. Do you have any idea what they are doing?

aditgandhi
Автор

return new ArrayList<Integer>(result); will work

alainatoyreview