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

Learn how to calculate time complexity (Big O) of a program in hindi. these Data Structures and algorithm videos will walk you through the series of topics you need to learn to prepare for a placement interview

Best Hindi Videos For Learning Programming:

►C Language Complete Course In Hindi -

►JavaScript Complete Course In Hindi -

►Django Complete Course In Hindi -

Follow Me On Social Media

[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) 😊❤❤❤

[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💯💯💯🙏🙏🙏🙏🔥🔥

[vasutiwari]

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 .

[rishabhtaneja]

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.

[beastboyaishh]

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.

[amartyasumukhvarma]

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

[DataScience]

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

[rudrakshpnd]

Harry bro, you are doing excellence and providing most valuable content in YouTube, 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

[mahima]

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!

[HeartOfTech-cwkz]

One mistake in Q.6 that is in for loop condition i * i < n, include equal sign as well --> i * i <=n and return 1 instead of return 0 in first if condition.
Love you Harry Bhai, I discovered lots of new logics and options due to your this Mistake.

[mohdhasnain]

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

[ReachTheSky]

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

[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

[sahilprasantachoudhury]

Self referential note: this video is important

[priyanshi_]

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

[EverythingaboutTechPro]

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

[salvinrai]

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 ...😊😊

[sumitmukharjee]

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

[codingp]

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.

[minecraftcookie]

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