How to Calculate Time Complexity of an Algorithm + Solved Questions (With Notes)

[@CodeWithHarry]

Ho sake to please like aur share karna. I am working very hard on these videos dil se bo raha hoon please kar do (Ignore mat karna) 😊❤❤❤ Playlist - kzbin.info/aero/PLu0W_9lII9ahIappRPN0MCAgtOu3lQjQi Notes - codewithharry.com/videos/data-structures-and-algorithms-in-hindi-5

[@anilsrivastava936]

Harry bhai mere comment par reply do please

[@anilsrivastava936]

Please batao ye %d aur %f kaya hota hai C language mein

[@cryptofacts5833]

Bhai tu zip file kyu banaraha hai yaar please pdf de na zip file nhi chalti mere phone pe

[@yashbansal1414]

Bura lagta hai bhai, dil se bol rha hu bhai, bhai samjh kar bol rha hu, dil se bura lagta hai bhai 😂😂😂😂 Vo mote Bacche ka meme yaad aa gaya 😂😂

[@yashbansal1414]

@@anilsrivastava936 %d use for Int values and %f use for float values

[@vasutiwari4187]

i self taught data structure and algo during lockdown but many of my concepts aren't clear and i was saving money for online paid course but with course and quality of videos i feel blessed . i recently found your channel and now will follow this course with disciple and thank u very much 😍🤗🤗 i pray god bless you .

[@vasu2239]

Kese ho vasu ji coinsidence

[@ViratKohli-wy2sk]

Bro I didn't understand why I haven't done c language should I do that first??

[@vasutiwari4187]

@@ViratKohli-wy2sk bro you can do c++ or java then understanding c will be easy

[@amartyasumukhvarma2748]

37:28 The function calls itself recursively till every node is traversed so runtime is O(n).

[@ReachTheSky0711]

00:00 Tricks to get rid of time complexity 06:03 Time complexity of nested for loops 11:11 Double for loops result in O(n²) time complexity 16:08 Find time complexity of Func function in program2.c 21:12 Understanding time complexity of double for loop 26:10 T(6) will make 6 random calls 31:06 Understanding Big O notation and equivalent time complexities 36:01 The code is summing the values of all nodes in a Binary Search Tree with a runtime of O(N). 41:01 Understanding time complexity and big O notation 45:39 Notes and sheet available for chapter

[@beastboyaishh4145]

Hi Harry, I am restarting my career with Data Analytics and your course is like a blessing for me. I saw your road map to Data Science, learning Python from your channel and now was here to understand the concepts of Time Complexity, working hard to understand all this and hope will achieve my dreams, I don't know how to thankyou for all this, but yes for sure I am much elder than you to give you my blessings and love for doing such a wonderful act of helping others to learn for free from your channel, and as said vidya ka daan sabse bada daan hota hai, keep up the good work. God bless you.

[@elmo4672]

We need an update!

[@BrainBlink-111]

seriously I had never thought that DS could be this much interesting. Mind-blowing explanation.

[@rishabhtaneja6634]

Was just going through previous videos and I must tell you that these are so underrated videos. I actually could understand a lot just by watching it 2 times. Waiting for a detailed explanation of every algorithm and the use of data structures to solve them. Notes are the best thing you introduced.

[@CodeWithHarry]

Wow, thank you! I am glad you liked them!

[@rishabhtaneja6634]

CodeWithHarry any chance of you releasing notes using python too? I know C is powerful and fast but every company in the US is asking for Python right now.

[@yogitaghodke7090]

Ha harry bhai sabhi company right now asking for Pythan programmers

[@ZEN-pt5ij]

@@anonymusk9397 For loops is is same for mostly every language and only syntax is diffrent ... so i think you can figure that out By Yourself.

[@priyankpatel2266]

@@yogitaghodke7090 to

[@AnshimaSingh-o6w]

time of best qs Q1 on recursion == 31:05; Q2 balanced binary search tree == 39:16; Q3 checking whethr a number is prime or not == 43:00; Q4 confusing one for prime is function dekhke == 43:09

[@HeartOfTech-cw5kz]

One mistake in Q.6 that is in for loop condition i * i < n, include equal sign as well --> i * i

[@hemanthghs]

I have went through many paid courses to learn DS Algo But I didn't learn anything But Harry Bhai Ka course is Excellent💯💯💯🙏🙏🙏🙏🔥🔥

[@CodeWithHarry]

Thanks a lot buddy!

[@piyushmishra5533]

@@CodeWithHarry sir aap kab ke passout ho aur kis clg se

[@tusharagarwal97]

Toh harry bhai ko pay kr do

[@tusharagarwal97]

@@piyushmishra5533 nice question

[@piyushmishra5533]

@@tusharagarwal97 IIT Kharagpur bhai

[@mohdhasnain3812]

11:11 Harry becomes the real teacher , But Honestly i will love any way he teaches.

[@mrmirzaa]

Fir bad me question dunga solve nhi hua to bata rha hu 😂😂

[@mahima7638]

This is a great playlist!! I didn't understand how in the 3rd practice question, the function is called 6 times exactly, that to everytime. I have my interview tomorrow and I'm watching this playlist today. I wish I had started it a month ago!

[@garvitsharma3779]

Here is what I understood why it was running exactly 6 times. If you see the last line of else, it says, return function(i)+function(n-1-i). So, even if i takes the minimum value possible, the second term(n-1-i) will give you the maximum value possible in the range. Let's say when n=6 i=random(n-1) so i can take random value from {0,1,2,3,4,5}, if we talk about the worst case, i will take the value 0. so, n-1-i = 6-1-0 = 5, that's why function(i) will be function(0) which will run for just 1 time BUT function(n-1-i) will be function(5) which will recursively run for 5 times because of the same logic I told above. Another example, when i takes value 2 so, n-1-i= 6-1-2 = 3. These values will also make the function run for 6 times in total. I hope it helps.

[@CrazyPanda.000]

@@garvitsharma3779 i didn't understand at first but if we give value to n whatever it will be like 3 then it will run 3 times , for t(6) it runs 6 times , t(6)->t(5) ->t(4)->t(3)->t(2)->t(1) & for t(0) it will return 0

[@philosphize]

Iss series ki bht wait thi Maine python, django aapke course se sikhaa h I love the way you teach And most important i am of 2020 batch so i need placement asap and i am sure your course will definitely help me

[@ak332]

Have you tried freelancing?

[@damnitshrestha]

Mil gaya placement?

[@srafayal]

i was very interested in coding but utne pese ni the sikhne ke par harry bhai ko thanks me sare vids free m dekh skta h tq harry bhai god bless you

[@codingp110]

37:30 Runtime for this function should depend on n(number of nodes ) as during execution of function each node is visited once and its node value is added which happens in k time and hence total time is nk.

[@rudrakshpnd]

Harry bro , you are doing excellence and providing most valuable content in KZbin , Your explanation is superb , i hope you will continue putting your full energy in this whole playlist , as of doing now, This course will become best in market .I request you to don't step back . Your determination is awesome , as your other playlists are also awesome . Make this playlist as placement series , try more questions of interview and organise test in Hacker rank . So you will get to know , who are doing great , and you should guide them thoroughly , so they can get placed in their dream company . This will be your achievement that your most of students will get placed . ♥️Love uh bro

[@dixhatiwari4860]

@Rudraksh Pandey pls give me the pdf notes of this chapter I can't get it

[@sumitmukharjee5816]

All the concepts taught here have great value then paid courses and Videos..Thank you for the dedication

[@salvinrai2272]

seriously , i can say that no one is better than you harry bhaiya , you helped us alot in every terms of explanation and all stuffs you are just osm a big thanks to you ...😊😊

[@bsaisalini7934]

Bro yours explanation is ultimate

[@bsaisalini7934]

Notes link bro

[@iloveindia7912]

@@bsaisalini7934 description box me hai

[@piyushmishra5533]

Ultra ultimate bro...

[@t.shravyasree-ie-2435]

Sai shalini ... actually new to see this channel..can you pls tell me is that useful ..like is there any need of going and learning this data structure and algorithms out...or is this enough..I hope u will ans me

[@dhananjayjadhav7064]

@@t.shravyasree-ie-2435 yes this is really helpful for do programming 👍

[@priyanshi_29]

Yes, we love your playlist. it's so help to us. I am enjoying watching it

[@sahilprasantachoudhury911]

Self referential note: this video is important

[@NikunjKumarGupta]

Was this course good?? Please tell !!

[@awesome9424]

@@NikunjKumarGupta Yes it was, probably even better than unacademy one.

[@NikunjKumarGupta]

@@awesome9424 thx I am on video number 30 My pace is slow because of college exams 💀

[@dixhatiwari4860]

@aWeSome do u have the notes pdf of this chapter pls send it to me

[@roshanchauhan1123]

@@dixhatiwari4860 link of notes is there on comment!!

[@EverythingaboutTechPro]

THANKS A LOT HARRY BRO ! YOU MAKE MUCH BETTER CONTENT THAN PAID COURSES !

[@philosphize]

Bhai aap ye series plz plz stop mt krnaa Iss series ko jitna jldi ho sake complete kr dijiye

[@yogitaghodke7090]

Harry bhai muze aap ke touch me rahane se bahut acha lagta he aap aapki saari videos bahut Positivity bhar bhar ke banate ho Or Aap hamare liye itni saare course free mai banate ho ias liye shukriya Thanks

[@cocopogo-indianrhymes9811]

Harry bro even i am from different stream still i am understanding your video with easy concept , your are working very hard it is seen in all the videos , and i am sure every one is also agree with my term , you are simply an awesome decoder

[@chaitanyauppuluri6181]

Guys. Do like his videos. Don't just watch and go. He is putting his efforts and time to teach us for free

[@clashingtv2527]

I m from python but now I'm satisfied with this course cause I can understand much better than any other creatures on KZbin Thank u Harry bhi But python walo ki vi kuch khayala raklete to baria hota 😅

[@birendrapandey2849]

thanks harry bhai it was my last day of appearing to the examination and this video cleared all my problem

[@nitinmadan4009]

Harry Bhai, big fan of your videos. Was working on Big Data and Hadoop. Would be cool to get a series on that as well. I am sure slowly building up in that direction.:) Respect and much love:)

[@ritiktrivedi8780]

Seriously now I understand time after a long time complexity amazing bro.

[@prachipatil6110]

Commenting before watching this tutorial...bcoz I already know it is great 🔥🔥🔥

[@veerpratap672]

bhai aapko dil se thanku. Apne notes bhi diya aur bahut acha padate ho really dil se thanku. A big salute to you.

[@sreenandabiswas4787]

I don't know how to thank you..you are very hardworking...its excellent ❤️❤️..the way you are helping us to prepare is priceless ❤️❤️

[@TechnicalAnkesh]

14:43 when he told chalo question solve karlete hai I was soooo... happy and excited!!!!

[@manu-singh]

thanks harry Bhai for believing in giving back to the community Keep it up

[@ShivamKumar-em9nr]

After you complete this series make videos on important coding questions for placements

[@mayankmishra5842]

broo you are so down to earth even after so much knowledge and skills....props to your hardwork and i wish u grow more and more.

[@wolf_with_values]

Harry bhai. Hats off hai apko. Apke tutorial dekh kr lagta hi nh ke tutorial hai. Yun lagta hai jese normal bat ho rhi ho. Bht fantastic tarika hai padhane ka. Bht si playlists shuru ki thi mene continue bas apki kar paya hun.

[@harshkhandelwal9346]

Thnks Harry bhai All questions are Cristal clear... Keep growing 💗💗

[@subhodipguin5889]

jitna bhi thanks bolu kam hi padega!!!!!!!!!!!!!!!!!!!!! thank u so so much brother

[@atadurweshziyaee8208]

Harry bhai aap gajab ho matlab itni aasani kese samjha pate ho aur samajh mai bhi aa jata hai . LOVE YOU SO MUCH HARRY BHAI best teacher😊😊😊

[@minecraftcookie2929]

At question 6 its checking i * i < n why is that ? Why not i < n becuz it just need to check wheather a number is divisible by anything else or not

[@sin5224]

its more efficient. using i < n will give O(n) while using i^2 will give O(root n).

[@engineerbhai7642]

Thank you so much Harry Bhai subkuch free sikha denge ap. You are genius and excellent programmer in the world.

[@nayyabdoll7479]

TRUE!

[@infinitymusic4617]

i saved my lots of money by this course thx a lot bro

[@shreyatrivedi8421]

Thankyou so much for putting in so much of effort your videos are really helpful and great .. commenting here because want to be thankful for your efforts in every way possible .. and yess for sure sharing and liking it... THANKYOUUUUUU :)

[@tanishka_sha]

Bro.... really I wanted it. I visited another videos for find info about this topic but haven't found as per my understanding ..so thnkuh so much

[@vaibhavsinhbihola1]

Including examples with notes gajab bhai

[@ADNANKhan-gy7ln]

#Harry Sir is a born Programmer...... Agree with, so like....

[@ayushtripathi2605]

I have learned python, flask, django, HTML and css with you sir even not from my school teacher. You are god and teacher to me 😍😍😙

[@Abhishek-iz6lw]

Project kitne bnaaay

[@ayushtripathi2605]

@@Abhishek-iz6lw bhai bas only dango blog from CWD sir playlist 🤣🤣🤣 actually I am a school student of class 10 so only one big project

[@yashbansal1414]

@@ayushtripathi2605 you are very ahed, keep it up bro 👍

[@ayushtripathi2605]

@@yashbansal1414 thanks bhai I will only try to learn programming languages as I am capable of because my aim is to study IT in cs (software)

[@VISHNUKUMAR-xe7rd]

You are awesome Harry bhai. Itne ache tarike se smjhaya sabkux kux difficult lag hi ni rha. Thank you Harry bhai

[@AdarshSingh-cb5yf]

Wow great guru ji ....... Love you sir 😍😍😍😉😘😘😘😍😍😍

[@jaankajhotta]

This playlist is help full for me. Thanks harry bhai app etni mhanat kerte ho

[@shashi_kamal_chakraborty]

Harry vai, ek "log" wala example dikha dete toh bohut achcha hota. I just can't figure out how log, loglogn, nlogn comes in Big O(). I will be looking forward to such a video from you in the future. And yes, thanks a lot for all your effort to make us as talented as you.

[@mehulparmar4720]

Bro. Harry bhai ne jitana sikhaya hai .... Usaka 0.0001% bhi college mai nahi padhaya hai ... Thankyou Harry bhai ❤️

[@ashutoshchoudhary7830]

Just seeing how hard u are trying ......but the video is just awsome ...was searching for this kind of content and found it ......just keep doing buddy. ....placement to pakki h is baar apni

[@GeekyShubhamSharma]

Happy Rakshabandhan to all of You guys🎀🎆🎇🎇🎁🎁🎇🎇🎆🎆🎆🎇🎁🎇🎇🎇🎆🎆🎆🎇🎇 Btw video is too awesome now first time I am able to calculate time complexity 😘😘

[@mouth1372]

nice bhaiya gee

[@mouth1372]

bhaiya gee apna whatspp no send kera na plz i need yiur help my whatsoo no 7256824088

[@yashswi5131]

Bestest Teacher on KZbin

[@vaibhavgupta777]

Thank You So Much Harry Bhai🙏🙏🙏🙏

[@philosphize]

Bhai aapka ye wala playlist ka mai roj wait krtaa hu, pichle 3 dino se Agar aap uuuhi roj ek lecture v upload krtw rahe its will be huge huge help for us

[@nehaagrawal6602]

Very easy to understand thanks for providing amazing content.

[@chetanram797]

wow. just wow. basic clear kr diye achche se matra bhasa me. thnks a lot

[@atharvapatade6432]

Harry Bhai doing a great job hats off to you I suggest you should start engineering college especially For comp&IT

[@mdshabrezakhtar726]

Sir I can't blv k koi itna ache se pdha skta h u r so talented sir

[@divyanshim1]

Thanks! Very-well explained! Keep up the good work!

[@bulukivine8238]

bhut hard harry bhai lockdown or corona pendamik ke time me bhi aag lga di aapne so much respect. Thanku so much

[@swetantkumar7029]

This course far far... Better than paid courses..Thanks harry bhaii

[@mehulparmar4720]

Aachchha hai Harry bhai paid course nahi dete... Warna ham jaise engineer's ka kya hota Thankyou Harry bhai ❤️

[@09.arkodevmukherjee24]

After applying your tricks these problem sums are very easy.

[@priyamondal6177]

Thank you so much brother. The concepts are taught so well. best video ever.

[@amirhasan639]

Mr Harry thank you for this course ,we really need this and you made this easy to access for us, thanks a lot.

[@akankshyapattjoshi4]

Thank you so much sir for this simple and easy way explanation☺️🙏

[@kumkumbhagya51]

22:29 TIME COMPLEXITY= k1+ k2n square k1 cancel as non dominent term k2 cancel as constant hence O(n square)

[@Prabhakaran-hp1to]

Thanks bro making such a spectacular video for us,God bless you bro!

[@sonalranpara1950]

Harry bhai your videos is so amazing

[@sabujdeeptudu6215]

thanks for all your hard work for students like us!

[@jatinbhatoya8420]

U are like God for us. Keep up the good work sir. Thanks so much

[@vishal-mr8rr]

Can you please update this playlist with B and B+ tree.... It would be great help 🆘 Your videos are so much help ❤️❤️❤️

[@arsarmy3044]

Engineers ki aan baan aur saan ....apna Harry bhai jaan❤

[@ruthwikreddynalla1498]

Whenever anyone asks how can i learn coding any language for free , the only thing that gets into our mind is "CODE WITH HARRY" Saviour ❤️

[@improperanyhow]

You are the best harry bhaiya

[@javedmultani2491]

Amazing video really, easy to understand. Salute boss. :)

[@ankitaB11]

Best I've come across till date

[@rekhabisen8873]

You teach like a elder brother ❤️❤️

[@DipsOfficial802]

Awesome video On time complexity.... Pura smaj aa gya... Thank u harry bhai....

[@vik7337]

Superb explaination !!!!!!

[@Raviranjan-gh4bw]

Harry Bhai you are doing good contribution to the tech society. 🙏

[@aryandaftari6665]

Thanks, bro for hardworking that you are doing for us

[@ReinventingEducation]

That smile 😊 is same ❤️. I used to make smile in kids notebook. ❤️

[@saketsingh9543]

Sir please continue this series of dsa your way of explaining is simple and awesome so beginner can also understand it well so please it's a huge respect please continue this series sir. Thank you

[@soyerzoid1180]

Thank you sir Understood very well Didn't thought time complexity was simple to calculate

[@gautamjoshi4541]

Real id se aa carry minati 🌝

[@gouravsharma8567]

Best video Bhai love from Haryana 🙏

[@Shubham_Shiromani]

Harry Sir, i have learnt C, C++, CoreJava, Python from your channel..it was great experience for me..thanks for that sir.... but i have one doubt..why not Python for DS algo...instead of C.... please try to do reply in my comment or can in your videos....thanks sir

[@devenderbariya9198]

great Harry bhai You are the best

[@abhinavshukla5145]

After watching your first two videos I dropped my idea of buying CODING NINJAS dsa course.

[@masoom5320]

same bro.... even i filled the card details but at the last i was like.... chl harry bhai jindabad

[@psi20087]

Nice to see some efforts you make

[@sanketgore2515]

Your course is really going nice so far👍

[@yogitaghodke7090]

Happy rakshabandhan harry bhai

[@Crazybicep]

Hey brother i am watching your videos and its really helpful. i am writing thesis on sentiment analysis on big data on Indian election. can you suggest me from where i can get big data?

[@asifhasan5344]

bhai Thora jaldi jaldi videos do..samne exam hein...kiya bariya lecture hein tomari..maza aa gaya

[@Anujkumar-my1wi]

hey harry bhai like all your videos can you make a series on machine learning from scratch with any libraries like tensorflow or pytorch etc.

[@arcaneteen]

37:29 As we are traversing to each node of BST so, time complexity will be O(n)