Note "This playlist is really to the point. I've never seen this level of content on TH-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."
Sharda ma'am is amazing in her teaching, clarity of speech.... her lectures are so interesting and full of conceptual information... I'm basically medical student but I have learnt computer languages by her lectures... so I'm very grateful to her...
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
lec completed just now , Before this lec i have so many doubts regarding time and space complexity after wwtching this majority doubts are solved . Thanks to APNA COLLEGE for providing such contents❤.
practical usage section was the biggest highlight! till now i was thinking the constraints given is a useless information! what a way to find out the hints and go ahead ! thanks Apna College! Very Insightful!
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.
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 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 TH-cam channel and here everything is at one place
completed on 29/12/24(1st vid) just overviewed as already known No notes. Some key points are : 1. TC of Rec = no. of rec calls * work done in each call 2.SC of Rec = height of call stack * memory in each call Last slide is super usefull******** skipped merge sort for later consumption
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 am so greatful that I found this TH-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
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 TH-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."
Sharda ma'am is amazing in her teaching, clarity of speech....
her lectures are so interesting and full of conceptual information...
I'm basically medical student but I have learnt computer languages by her lectures...
so I'm very grateful to her...
Love from my heart didi 😢,
Best teacher
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
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.
lec completed just now , Before this lec i have so many doubts regarding time and space complexity after wwtching this majority doubts are solved . Thanks to APNA COLLEGE for providing such contents❤.
Shradha didi thanks for students ki help
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
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.
practical usage section was the biggest highlight! till now i was thinking the constraints given is a useless information! what a way to find out the hints and go ahead ! thanks Apna College! Very Insightful!
Thankyou for free this course bignner friendly course ❤
Fantastic explanation in DSA series ❤❤❤
Love u shradha didi 💖💖
U are the best teacher in the world.
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.
Practical Usage Part is amazing . Thank you.
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
mam, your teaching style is so good
Thanks mam for giving new information
Thankyou✨Done✨Completed✨
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
Assalamu Waliakum.Dear Apu....
This is really awesome. Over 1 year after I found a class with almost everything about TLE.
Ur teaching excellent,No body there in TH-cam to teach as like u
Thankyou so much maam for this playlist today I successfully complete all videos in this playlist 💖😀
Thank u mam ❤i learn something that I wanted to be ..❤
Thanks shradha Mam ❤❤❤
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 TH-cam channel and here everything is at one place
Completed ✔️✔️✔️✔️ time complexity
Thank you ma'am for such a nice Explanation 🙏
🔥🔥🔥🔥🔥 best lecture of time complexity
Successfully completed ✅ Day 12 lectures, thank you shradha maam for you valuable lectures to us 😊😊
19/09/2024
Day - 12 Completed of DSA learning Journey ✌
completed on 29/12/24(1st vid) just overviewed as already known
No notes. Some key points are :
1. TC of Rec = no. of rec calls * work done in each call
2.SC of Rec = height of call stack * memory in each call
Last slide is super usefull********
skipped merge sort for later consumption
Wow, Didi I am learn something new ❤❤❤
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 for this amazing series is to nice to watch and learn 😊😊❤
Thank you so much for teaching DSA ❤❤❤❤❤❤
mam please lecture daily upload kijiye ... next month mere exams hai 😢😢
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
Ma'am you are the world's best teacher
Good evening di❤
@@priyapal2408 hey priya aap kis year me ho....
Smjh aa gy didi😊
I was actually waiting for this lecture without it's understanding DS is a puppet
Thanks didi 😊
Lecture 12 completed successfully on 19/09/2024🙂
Lecture 12 Time and Space Complexity done ❤😊
45:47
O(✓n) or O(n)
Best is O(✓n)
O(✓n) or O(logn)
Best is O(logn)
Good evening mam❤❤❤
45:47 O(root n) < O(n) and O(root n) > O(log n). pls answer whether its correct or not
Day-12 Completed ✅🎉
Thank you maam ❤
Completed September 30, 2024, time and space complexity thank u so much mam 😊
Thank you di ❤
mam aapka jitna shukriya ada karu kamm hai thank you so mch mam love you for your hard woek and your dedication
Nice tutorial for learning time and space complexity
day3:completed
thanku so much❤
Thinks from your help ❤❤❤
I'm in grade 6th. And I am a fan of her!!
Thank you mam for this wonderful course
DONE NICE CONCEPT THANKS DIDI
Day - 11 of DSA✅
🗓 - 24/12/2024(2:32pm)
Time & Space Complexity are too good yrr ❤
Lec 12 Completed ✅
Respect button for Shradha Mam ❤
Thank you soo much didi❤
L-12 DONE 🚀
finally got SDE sheet
Appreciate your hard work ma'am 💪.
Your are like my first teacher.
Love 💗 you
successfully completed~!(due to health issue I have a backlog now)
That's great 👍
Very helpful video Thanks Mam
Thank you ma'am 🙂
THANK YOU!!
❤
Thanks for this opportunity
day 12: completed❤
lecture complete 👍👍
Lecture 12 complete ✅
Thankyou
Fantastic explanation
Mam U r doing such a great job
Also make a video on "How to get good internships"
Plzzz make one video about WordPress with full details and which one is better for beginners (WordPress or full stuck web development)🙏
Day 12 Completed!
Thanks didi for free class start
Helpful ! 🙌🏻
Day-12 Done ✅
Thabku so much sradha maam
Lecture 12 successfully completed on 2 October 2024❤️
wonderful class mam
Mam is best ❤
Day 12 completed ✅
Hi sister, My name is TANVIR. From Bangladesh. I am 15 years old. I love you content.❤
Please boycott India 😂😂😂
@code_craft_30 😂😅🤣🤣
I am so greatful that I found this TH-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 🙂🙂
Thanku
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
Thankyou mam ❤
√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
Good video 🎉
Lecture 12 completed. 22/9/24
completed on 28-09-24👍
New subscriber 🎉
Isika ka too wait kr rha tha 😅
49:05 I'll Continue after learning about Recursion