Ep4 - Find Nth power of a number using recursion | DSA series | Code available in description

preview_player
Показать описание
In this lecture, we will try to write a function which will find Nth power, of a number X for us. We will also analyse its time & space complexity using recursion tree. Don't let your motivation go down. Watch the video and share it with you friends too.

To get all updates follow on Instagram

👨‍💻Utilize free courses, DSA sheet, and articles on Lead Coding website at

Join our telegram channel for all the important announcements

✨ Hashtags ✨
#DSA #Recursion #Placement #Fraz
Рекомендации по теме
Комментарии
Автор

Bas 1 request, accha lage to zaroor comment kar dia karo. Or bura lage tabh bhi improvement bata diya karo

For practice, I will conduct a test soon.

LearnYardYT
Автор

Beautifully explained the second way for solution. Didn't triggered at first place, so much complex for the brain to optimize for the computer . Hahaaha

sauravmandal
Автор

It’s great to have this in English!
Thank you so much mate!

fabdiyeva
Автор

It was an amazing approach to reduce time and space complexity.
Waited a lot for it.
Solved the problem as well

ajourneyforfun
Автор

Fraz Bhai I have never saw better explanation of recursion and time complexity than your's explanation I am very happy easy to understand and crystal clear concept now thank you bhai mashallah keep helping us. ❤️

Iron_Man
Автор

When you said it is very easy problem, suddenly it lowered my stress and changed my approach toward the problem and I managed to solve it immediately. I have 6+ yrs of exp in coding but I never dared to go recursive way yet, but now I am sure I will.
I am preparing for Google and I hope to see you in the Banglore office in near future. Till then, keep up the good work.
Thanx alot.

pratikmhatre
Автор

EP-04 done..
.
Awsome explanation.. Bhaiya.. I'm in 1st year (about to goi in 2nd year within 2 months) enjoying the lectures a lot.. 1st year walo bhi bohot he iss channel me.. Thanks you so much

Debarup_Sarkar
Автор

2 approaches discussed to solve this problem using recursion.
#1. Normally applying recursion to power of n till power == 1. T.C and S.C = O(n).
#2. Applying recursion to power of n till power / 2 and storing that in a variable v. Then simply
returning v * v if power is even or v * v * n if power is odd. T.C and S.C = O(logn)

er.waseem
Автор

Consistency of your uploaded videos are making us also consistent. Seriously, I have got much more interested to spend a good time watching these videos and practice some questions although I have internship in wipro. Hats off you 🔥for your hard work. Just keep uploading and help us to crack product based companies. Thanks a lot ❤️

anirudrabrahma_
Автор

Plz increase the length of the video, so that we can cover more topics as we have only two months remaining before internship season to start

recreators
Автор

Sir, first time recursion mein maza aa raha hai recursion se pehle dar lagta but you made it very interesting

ABHISHEKKUMAR-nsom
Автор

Yeah We are Understanding videos
Continue uploading these type of videos for all topics of DSA

sowmi
Автор

Maza aagya bhaiyaa... Plz keep doing the good work!

vrindasharma
Автор

Ep 4 done, maja ageya, excited for next video

isikamaiti
Автор

This Series is explained in a very approachable manner.Keep th good work Bro❤😊🤗

sandhyamdr
Автор

4th day, got stucked in other works, but still i watched it now and Thanks for the video bhai,
I have doubt on calculating time complexity, can u explain how to calculate time complexity in your style(easiest way), have watched many videos but didn't satisfied
Thank you for the video
#consistency 4th day ✌✌

nithins
Автор

Very Helpful Lectures also multiple approaches gives more confidence

Episode - 4 completed

maazulhaque
Автор

Able to understand the working of code very easily. N thank u for making toughest topic very easy to understand ✨

vaishnavimore
Автор

analysing every problem with recursion tree helps in understanding the TC and SC. I would request to continue this analysis with some tougher problems on recursion as well

ranitbandyopadhyay
Автор

If possible
Before solving question for eg. ⅖+3+7*⅝
(just an example)
.
First, take same question but in its simplest form like ⅖
First teach to solve the simplest form of same question then whole question.
.
Or try to solve similar question but easiest one
Example:- ⅘+⅗+⅘
Do not teach this directly
First teach
4+3+4
.
I hope u r getting what I'm saying👀

aashishgupta
join shbcf.ru