Note "This playlist is really to the point. I've never seen this level of content on UA-cam. In fact, I couldn't even understand the other playlists from my college, but now I understand DSA. Thank you so much to the college team. Please make a video on the difference between Data Science and Machine Learning, and also explain which language is best for it."
DSA series Day-12 completed I hope I will maintain this consistency with shraddha maam .Thankyou so much mam for this series and also thanks to Aman sir who behinde all of that❤🎉
I do make notes, being an experienced C++ coder, I make notes in Word file and note book as well if necessary. Making notes is much beneficial as it helps if you have forget any concept and in future you can go through the whole topic@@faizajahangir1500
For the first time I am following a DSA Tutorial without getting bored and with passion also i am consistent, Mam please complete this series , Huge respect for you and Aman Bhaiya
Awesome Lecture. I was study same topic in my college but i don't understand the complexity but in this lecture clear all my doubts related to Time and Space Complexity.❤❤👌👌 Thank you, Apna College and Team.
48:18 From my perspective ,There is a minor mistake in calculating time complexity of the Selection sort as the outer loop will run from 0 to n-1 so it will run n-1 times. As well first time the second loop will run n-1 times n-1 to 1 times As follows: n*(n-1)/2 times the loop will run Ultimately the time complexity will come O(n^2) after eliminating constants and considering prominent term ( which has more value ). Completed this lecture on 11 Nov 2024 Thanks for this amazing lecture of time complexity - Aditya ( Your viewer )
I have seen many youtube channels but apna college is best and I'm really glad they brought this placement series which is available nowhere at one place like this ...I had to search one concept on one UA-cam channel and here everything is at one place
I am so greatful that I found this UA-cam channel without this I was not able to learn in the comfort of my home . THANK YOU SO MUCH MAM . I blindly trust on you
Lecture 12 - Time&space complexity Completed on 23-11-24 Homework done on 23-11-24 Got to know about the time and space complexity of different approaches and functions!
Hi di please suggest some youtube channel to cover syllabus of bsc cs 1 st year sem 1 , the cahannels which can provide such lectures for maharashtra state under shivaji university. Please di ❤️ Your c programming is a ultimate amazing series helped a lot
Life is too short to appreciate Shradha ma'am ❤
Yes 👍 ma’am ham students ki bhut help kar rhi hn
Best teacher hn ,
Which year... btw?...
Really I wanted to post this comment but you already did.
💯
Jitani mehant ham students k liy ma’am karti hn utani ham khud apane liy karle to sbki job lag jani hn😊so
Note
"This playlist is really to the point. I've never seen this level of content on UA-cam. In fact, I couldn't even understand the other playlists from my college, but now I understand DSA. Thank you so much to the college team. Please make a video on the difference between Data Science and Machine Learning, and also explain which language is best for it."
DSA series Day-12 completed I hope I will maintain this consistency with shraddha maam .Thankyou so much mam for this series and also thanks to Aman sir who behinde all of that❤🎉
Do you make notes or just listen attentively. Plz guide
I do make notes, being an experienced C++ coder, I make notes in Word file and note book as well if necessary.
Making notes is much beneficial as it helps if you have forget any concept and in future you can go through the whole topic@@faizajahangir1500
@@StudywithmeAkku kya aap telegram ya insta use karti ho 🙄
U r right bro
@@StudywithmeAkku aap telegram use karti ho ya insta
Shradha didi thanks for students ki help
Love from my heart didi 😢,
Best teacher
45:50 TC order: logn< √n
honestly, amazing level of explanation, i feel i should watch every video more than once just for the soothing simple effect of it
You are more talented than my college cs teacher in teaching. You teach in very simple way, even below average students can get it properly.
Time Stamps :
00:00 Introduction
00:23 Disclaimer
01:17 Why study these concepts?
02:23 Time Complexity
10:53 Big O Notation
16:14 Space Complexity
21:32 Common Time Complexities
23:15 Understanding O(1)
26:35 Understanding O(n)
29:06 Understanding O(n^2) & O(n^3)
34:40 Understanding O(logn)
39:39 O(nlogn)
40:46 O(2^n) & O(n!)
44:03 Solving for Prime Number
45:56 Solving for Selection Sort
48:59 Recursion (Time Complexity)
55:50 Recursion (Space Complexity)
59:28 Solving for Recursive Fibonacci
1:05:43 Solving for Merge Sort
1:16:41 Practical Usage
Thankyou for free this course bignner friendly course ❤
Didi your videos help me understand very much❤❤
Homework solution
Best TC
O(√n) or O(n)
Ans: O(√n)
O(√n) or O(log n)
Ans: O(log n)
The solution is confirmly correct naa
The solution is confirmly correct naa
Yes
Your quest to obtain so much knowledge has inspired each and every member of our company.
mam, your teaching style is so good
Thanks mam for giving new information
Fantastic explanation in DSA series ❤❤❤
Love u shradha didi 💖💖
U are the best teacher in the world.
For the first time I am following a DSA Tutorial without getting bored and with passion also i am consistent, Mam please complete this series , Huge respect for you and Aman Bhaiya
I was actually waiting for this lecture without it's understanding DS is a puppet
Thanks didi 😊
Ur teaching excellent,No body there in UA-cam to teach as like u
Assalamu Waliakum.Dear Apu....
This is really awesome. Over 1 year after I found a class with almost everything about TLE.
thank you didi for the amazing series .
for me it is taking time to understand because I am doing in java
but yes, I will never give up
hiii
Awesome Lecture. I was study same topic in my college but i don't understand the complexity but in this lecture clear all my doubts related to Time and Space Complexity.❤❤👌👌
Thank you, Apna College and Team.
48:18
From my perspective ,There is a minor mistake in calculating time complexity of the Selection sort as the outer loop will run from 0 to n-1 so it will run n-1 times.
As well first time the second loop will run n-1 times
n-1 to 1 times
As follows: n*(n-1)/2 times the loop will run
Ultimately the time complexity will come O(n^2) after eliminating constants and considering prominent term ( which has more value ).
Completed this lecture on 11 Nov 2024
Thanks for this amazing lecture of time complexity
- Aditya ( Your viewer )
Thankyou so much maam for this playlist today I successfully complete all videos in this playlist 💖😀
Hi sister, My name is TANVIR. From Bangladesh. I am 15 years old. I love you content.❤
Please boycott India 😂😂😂
@code_craft_30 😂😅🤣🤣
Successfully completed ✅ Day 12 lectures, thank you shradha maam for you valuable lectures to us 😊😊
19/09/2024
Thank u mam ❤i learn something that I wanted to be ..❤
Thanks shradha Mam ❤❤❤
45:47
O(✓n) or O(n)
Best is O(✓n)
O(✓n) or O(logn)
Best is O(logn)
Thankyou✨Done✨Completed✨
I have seen many youtube channels but apna college is best and I'm really glad they brought this placement series which is available nowhere at one place like this ...I had to search one concept on one UA-cam channel and here everything is at one place
mam please lecture daily upload kijiye ... next month mere exams hai 😢😢
Ma'am you are the world's best teacher
45:47 O(root n) < O(n) and O(root n) > O(log n). pls answer whether its correct or not
Nice tutorial for learning time and space complexity
Wow, Didi I am learn something new ❤❤❤
🔥🔥🔥🔥🔥 best lecture of time complexity
Completed ✔️✔️✔️✔️ time complexity
Thank you so much for teaching DSA ❤❤❤❤❤❤
Smjh aa gy didi😊
Thankyou for this amazing series is to nice to watch and learn 😊😊❤
Lecture 12 completed successfully on 19/09/2024🙂
I am so greatful that I found this UA-cam channel without this I was not able to learn in the comfort of my home . THANK YOU SO MUCH MAM . I blindly trust on you
hii sonal 🙂🙂
Thank you mam for this wonderful course
Completed September 30, 2024, time and space complexity thank u so much mam 😊
Thank you maam ❤
mam aapka jitna shukriya ada karu kamm hai thank you so mch mam love you for your hard woek and your dedication
Very helpful video Thanks Mam
finally got SDE sheet
Lecture 12 Time and Space Complexity done ❤😊
Fantastic explanation
Thank you di ❤
Lec 12 Completed ✅
Respect button for Shradha Mam ❤
successfully completed~!(due to health issue I have a backlog now)
day3:completed
thanku so much❤
Thanks for this opportunity
Thankyou
L-12 DONE 🚀
Day-12 Completed ✅🎉
Thinks from your help ❤❤❤
Just completed it!
What a wonderful session it was, cleared all my lingering doubts on TC
Helpful ! 🙌🏻
wonderful class mam
Good evening mam❤❤❤
THANK YOU!!
❤
lecture complete 👍👍
Thank you ma'am 🙂
Good evening di❤
@@priyapal2408 hey priya aap kis year me ho....
Thank you soo much didi❤
check from 48:59 to 1:16:52
Thanku
Mam U r doing such a great job
Also make a video on "How to get good internships"
Thanks didi for free class start
Mam is best ❤
Day 12 Completed!
Lecture 12 Completed
Respect button for Shradha Mam
Thabku so much sradha maam
Lecture 12 successfully completed on 2 October 2024❤️
Plzzz make one video about WordPress with full details and which one is better for beginners (WordPress or full stuck web development)🙏
Lecture 12 complete ✅
49:20 after recursion continue
Good video 🎉
day 12: completed❤
√n is better as compared to n
As √n grows slowly as compared to n
And
Log n is better than √n
As log n grows even more slowly
Thankyou mam ❤
01:01:57 r is not common difference but in GP r is common ratio
Day-12 Done ✅
Good evening didi
New subscriber 🎉
done dona done london mam bahot bahot shukriya aapka mam
Isika ka too wait kr rha tha 😅
Lecture 12 - Time&space complexity
Completed on 23-11-24
Homework done on 23-11-24
Got to know about the time and space complexity of different approaches and functions!
Day 12 completed ✅
0(n) > 0(rootn)
0(rootn) > 0(logn)
ye dono big hai and right wali best hai.
3 semester
watched this session on 9 october
finished twelfth lecture
Lecture 12 completed. 22/9/24
yout try to make it best DSA series online and we try our best to get best from this series to create boom in IT sector .❤😊
Ma’am best DSA hi pda rhe hn,
@@Ravi-vr3xc no doubt bro.. she is the best.
@@Ravi-vr3xc vaise nahi bhai matlab daily lectures upload karo aur jyada demand aayega course ko
Completed 19 september, 2024, 21:20pm;😎
Hi di please suggest some youtube channel to cover syllabus of bsc cs 1 st year sem 1 , the cahannels which can provide such lectures for maharashtra state under shivaji university.
Please di ❤️
Your c programming is a ultimate amazing series helped a lot
49:00
Present ma'am 🙋🏻♂️