Time Complexity|10 Practice problems with solutions on Time Complexity | How to find Time Complexity

[@VARSHA-te5wk]

I really loved solving the problems through out the session .The explanations is very good and clear. Thank you so much mam.

[@computershastra]

:)

[@TahaTariq-f7m]

the most perfect video on time complexity 👏

[@computershastra]

😊

[@Ashish-yh7rg]

Very easy explanation mam. This video not only saves my time but also makes me more confident in solving questions correctly. 💯💯

[@computershastra]

Thank you😊

[@MdRubel-hr5ur]

Thanks you so much mam for this video . I easily understand your every question and answer. Love from Bangladesh❤❤❤

[@computershastra]

😊

[@hiddengamer7994]

Every doubt from time complexity is now cleared after seeing this video😊

[@computershastra]

@@hiddengamer7994 🙏

[@anjaligupta7091]

TQ so much mam for clearing our whole doubts regarding time complexity

[@computershastra]

😊

[@theperpetuallyannoyed4074]

Oh god this actually helped so much by solving questions.

[@computershastra]

😊 thank you

[@abdulrehman7470]

Thank you. Very well explained. Was trying to learn this for so long.

[@computershastra]

:)

[@Vasu.._..Agarwal]

36:11 8d) one will also execute infinite no. of times bcz i will always be greater thn zero

[@computershastra]

No, At one point i will be zero as after each completion of loop we are reducing i by half. So this will not go for infinite times

[@feluda24]

34:22 here, the complexity will be O(n/2). Because the 2 in (n/2) will not get cancelled as a constant term. It will remain with it. Taught by our teacher in class. The analogy of stairs was given here. As we are climbing 2 stairs at a time i. e. (i=i+2) so, less time will be required to run the program and hence time complexity will be O(n/2). Is this correct madam?

[@computershastra]

No, In genereal we take constant out. So it will be O(n) only. I agree time taken will be less but we assume it will not greatly impact the overall performance when n is very high. That is why we remove 1/2 from the expression.

[@feluda24]

@@computershastra Sure madam. The doubt is cleared. Thanks for the help 🙏🏼

[@computershastra]

@@feluda24 Happy to help

[@prathameshsawant9299]

Thank you ! Very well explained, keep up the good work !

[@computershastra]

:)

[@apoorvgupta820]

Practice Problem 1 : T.C : O(N^2) & S.C : O(1) Problem 2 : T.C : O(N^2) & S.C (1) Problem 3 : T.C : O(N^3) & S.C (1) Problem 4 : Option A, B & C. Problem 5 : T.C : O(N) & S.C (1) Problem 6 : T.C : O(log n base 2) & S.C (1) Problem 7 : T.C : O(log n base 2) & S.C (1) Problem 8 : T.C : A->O(N), B->O(N), C->TLE,D->O(log N) & S.C (1)

[@ashish_kumar9735]

In problem 8 Apologies for the oversight. Starting from 0 doesn't affect the time complexity in this case. Whether the loop starts from 0 or any other value, the number of iterations will still be logarithmic with respect to n. The time complexity remains O(log n) because the loop variable i doubles in each iteration until it exceeds n.

[@AmaduBalde-oz1zu]

Nope, I think that is infinite loop, unless 'n' becomes 0, because 'i' will always be 0. Any number multiply by 0 is just 0 in that case.

[@saniaayoub5474]

Best instructor

[@computershastra]

😊

[@nikeshbhalerao3598]

Love your teaching mam....thank you so much mam🙏🙏

[@computershastra]

:)

[@sejalvinodwasule8868]

Thankyou soo much it was really helpful in understanding concepts

[@computershastra]

:)

[@eboubaker3722]

Good examples, used for exam preparation, thanks :)

[@computershastra]

Good luck 😊

[@MahadElahi-k5i]

very good explanation i am very thankful for this video

[@computershastra]

🙏

[@nothing2everything772]

Thank you so much mam now my concept is clear

[@computershastra]

😊

[@rajabmuhamedrajab5128]

It's very Useful , Thanks

[@computershastra]

😊

[@meghatuteja8538]

You deserve a lot.Thank ou so much.

[@computershastra]

:)

[@ashraionart]

dhanywaad mam...🙏

[@computershastra]

@@ashraionart 😊

[@pangulurisiva4888]

in the 9th problem i think we have divide both codes by 2 as if condition wont execute for every value of n.

[@pavanimmadisetty5099]

Nicely covered. Good job

[@computershastra]

@@pavanimmadisetty5099 😊

[@chiranjeebdas709]

thanks a lot mam, i understood it clearly...

[@computershastra]

😊

[@kunraiyan]

10 was really important

[@computershastra]

:)

[@shri_ramkrishnan3962]

Thank you so much ma'am, it helped me a lot ❤️

[@computershastra]

:)

[@ReggieMisFit]

ma'am agar koi loop variable (eg i) 0 se lekar i

[@computershastra]

Yes wo loop n+1 tak chlega.. sorry book muje b ni pta practice problems k liye... otherwise me video me hi mention kr deti

[@paranormaledits9526]

thank you, this video was helpful

[@computershastra]

😃

[@wajid716]

Thank you so much my every doubt is cleared in this video

[@computershastra]

:)

[@pratz_photography]

Very nicely explained. Thank you.

[@computershastra]

😊

[@grossHumiliation]

love you mam, Great help🥰

[@computershastra]

😊

[@AnkitSingh-nl1gn]

very very thank you maam... god bless you :)

[@computershastra]

:)

[@yesonlyanime]

TOOOoo Slowwwwwwwww but Superrr Lactureeee Thank u maam😇😇😇😇🥰🥰

[@computershastra]

watch in 1.5X speed

[@RakeshDas-zy4zk]

Great Questions...Thank You

[@computershastra]

:)

[@tanushreesaxena9322]

Very helpful ❤

[@computershastra]

😊

[@PreetiSingh_1106]

thank you so much.

[@computershastra]

☺

[@darpanchauhan4547]

mam yr voice is so beautiful

[@suryakantkumarkashyap8741]

good set of questions

[@computershastra]

👍

[@code_smartly]

help me a lot thanks

[@computershastra]

😊

[@bipinsingh9318]

What a explanation 👏

[@computershastra]

😊

[@pvcube66]

thank you soo ooooo much mam

[@computershastra]

😊

[@adarshranjan5675]

mam at 28:19 if we put n=16 then answer will be o(4) . but according to the dry run, it would be o(5).i did not get it

[@Dheerajpathak_9]

logn+1

[@rajankpandey]

well explained mam🙏

[@computershastra]

😊

[@anujbhadola2834]

Thank you ma'am

[@computershastra]

😊

[@hasnatrafiuddinmunif8219]

Appreciate your effort 👍

[@computershastra]

☺

[@abirkolin4702]

thanks a lot

[@computershastra]

😊

[@Quiet_Wanderer015]

Mam this video was so helpful! are these question helpful for gate?

[@computershastra]

Sorry but these are just basics of complexity.. gate exams generally have complex problems

[@anishmandal9371]

This video helps me to boost my confidence 🤍

[@computershastra]

Thank you😊

[@abdelmalek9004]

Can we change the WHILE loop into FOR loop to compute that complexity ?

[@computershastra]

How will it help you? For loop is a counter loop whereas while loop is related with exit condition

[@spardha-yug]

Thank you Madam :)

[@computershastra]

😊

[@atiqueahmed4908]

excellent

[@computershastra]

😊

[@avikmondal954]

Thank you

[@computershastra]

😊

[@jahnvipandey1111]

Thank you ma'am ❤

[@computershastra]

😊

[@Banker554]

Maza aayga 🎉

[@computershastra]

:)

[@yagniktalaviya2146]

mam you told that in x^2 + x, x^2 will be the greater but what if the value is between 0 ad 1....?

[@computershastra]

look at the graph of Big oh sign for any function. there are exceptions in initial values. kzbin.info/www/bejne/hWjVpmmVa9h5q8U

[@sakshitiwari1869]

Main ye if else wale me n+1 will be the worst case na?

[@computershastra]

n

[@shad491]

so useful

[@computershastra]

😊

[@seamustard3498]

Can i ask why in problem 8 part D is O(logN) but not O(log2N). Thanks

[@computershastra]

Yes, You are right its complexity is O(logn base 2) . In a hurry I forgot to mention base2, however I stated that its answer will be same as previous question i.e. O(logn base2) 🙂

[@Vasu.._..Agarwal]

man either of 2 is incorrect

[@rishabhmishra3017]

Mam ur voice 🥰🙏😇

[@computershastra]

:)

[@nilesh_dash]

In option "c" The time complexity will be log(n) base 2 how it will execute infinite time?? Here the value of "i" is less than "n" ??

[@nilesh_dash]

In question number 8

[@computershastra]

Yes, You are right its complexity is O(logn base 2) . In a hurry I forgot to mention base2, however I stated that its answer will be same as previous question i.e. O(logn base2) 🙂

[@nilesh_dash]

@@computershastra okey maam thank you ☺ i have a query is this playlist is enough for dsa or any extra things is required ?

[@computershastra]

For data structure basics this playlist is enough. Though some topics are missing like AVL tree, red black tree et cetera. Once you are familiar with basics of data structure, you can attempt any question in competitive exam.

[@nilesh_dash]

@@computershastra okey maam thanks a lot ☺

[@kritikasharma3331]

amazing session mam :)!!!!

[@computershastra]

:)

[@1790Neha]

Please provide the link to find the time complexity

[@computershastra]

kzbin.info/www/bejne/iZuoZGmHj9-pe5o

[@rajabmuhamedrajab5128]

I Think Problem 2 the time Complexity May be O(N(N-1)) , but When I was solving by Summation It will be O(n(n+1)/2) So , Now I am Confusing. Help me ..?

[@computershastra]

Anyhow answer will be O(n square) in both cases

[@rajabmuhamedrajab5128]

@@computershastra you are right 👍

[@computershastra]

😊

[@muskanmaurya-yx9bh]

Mam is this Vedio is in c++ language

[@computershastra]

C lang... but will work with all lang

[@vaibhavmishra1339]

thankyou mam

[@computershastra]

Most Welcome :)

[@MCA_HimanshuSeth]

In problem 10 option 1 I didn't get , how n can be O(n^2) ??

[@computershastra]

see, Big O is for upper bound. Let us take one example, I take 10 min to reach point B from point A. So can i say that it takes me maximum 20 min? Yes... same concept is applied here, if complexity is O(n), then O(square n) is also true, O(Cube n) is also true. but vice a versa is not true. I can not say that it will take maximum 5 min to reach somewhere.

[@MCA_HimanshuSeth]

@@computershastra thanks for replying me , Now I get it 😊

[@computershastra]

:)

[@philomath4747]

39:57 how is 2-(√n-1)=√n-2?

[@Aryan-xd2ju]

31.46 pr 15 toh 4 bari divide nhi hoga even 1 bar bhi nhi hoga kyuki inter type h i toh.... Then 4 times kesse divide hua mam?

[@computershastra]

divide hoga...15/2=7...isme .5 truncate ho jata h because hum int le rhe h.

[@Aryan-xd2ju]

@@computershastra mam pls make a video on how to find time complexity of a recursive function..

[@computershastra]

Ok

[@Aryan-xd2ju]

@@computershastra yes mam if you canmake video at today night then it will very fruitfull especially for me... 🙏🙏

[@AbhinavKumar-um4sz]

man in question 5 log n bass 2 tho 4 hua but program tho 5 times run ho rahai hai na

[@AbhinavKumar-um4sz]

can any one answer this please

[@pangulurisiva4888]

brooo those are just apporoximations means the actual answer will be like logn+k. according to the rules we have to neglect k so approx value is logn

[@aswath8265]

Mam in 7th qn i>1 and if i>0 loop runs infinitely

[@computershastra]

No, every time loop executes, we are decreasing value of i. in statement i=i/2, we are doing half of i...so it will not run infinite times.

[@aswath8265]

Mam but i/2 won't be less than 0 na

[@computershastra]

But at some time, it will be zero

[@aswath8265]

Okk mam thank you

[@MonderMurshed]

i couldn't hear u clearly what is the answer of practice 4 ? a or b or c or d please?

[@computershastra]

The question is incorrect. It should be like which of the following does not have O(n) complexity? Answer is d as all other options have O(n) complexity

[@Tfibanisa-mwa]

Mam problem no.9 thoda breif sa explain kardho mam

[@computershastra]

isme 2 codes given h left side and right side....dono se same output aaega....for any given input....isme ye explain kia h ki kon sa code more efficient h in terms of complexity

[@Ahmoa_pol]

like what's the point of putting the title in English if you're just not gonna speak it

[@philomath4747]

99% Indians speak Hindi. U don't understand that's ur prob.

[@Jaishreeram-ly2jm]

@@philomath474799? Are u living under a rock?U need a reality check.

[@NikaljeHarshal]

@@philomath4747 what 99% you talking about lil bro?

[@Azulz]

@@philomath4747 yeah ur dumb

[@ChukwuemekaKalu-vb6og]

Me: Opens tutorial..... 💥 English language deleted

[@melattar163]

Why is n^2.5 is O(n^2)… but n^1.98 is not O(n^2)??

[@SourabhmalviyaCS]

Because n^2.5 is greater than n^2 but n^1.98 is less than n^2. See first option where n is less than n^2 so we take only n^2 less values

[@Dheerajpathak_9]

prime number second question's condition is wrong

[@manisha2668]

👍👍👍

[@gupshup2821]

Level

[@computershastra]

?

[@gupshup2821]

@@computershastra Thank you so much maam, excellent explanation.

[@computershastra]

😊

[@missionmit9015]

21:20

[@computershastra]

?

[@pawandiwan3464]

👍

[@snehalshelar7778]

Man we have to take 10 Evey time!?

[@computershastra]

Which que are you referring?

[@halamaher6096]

Thank you but can you speak only English

[@computershastra]

Will try next time

[@yvesilboudo7009]

If you have English Title, why are you speaking a different language too? It is very confusing

[@computershastra]

Because i read these topics and books in english only..

[@born2victory944]

Thank you so much mam ❤❤❤

[@computershastra]

:)

[@foodieindia8950]

Good explanation

[@computershastra]

😊