Array Data Structure - Part1 | DSA Series by Shradha Khapra Ma'am | C++

Time Stamps :
00:00 What is Binary Number System?
02:29 Array Syntax
12:16 Loops on Arrays
15:45 Smallest/Largest in Array
24:04 Pass by Reference
30:09 Linear Search
37:38 Reverse an Array (2 Pointer)
49:27 Summary & Homework

Want to study for Tech Placements/Internships from us :

Shradha Ma'am community

[haiderali]

Literally, Shradha mam you are my life savior. Thankyou for this dsa series❤

[BVKCHHATARPUR]

This lecture complete ✅ on 14 September 2024 .
Thank you ❤
Amazing lecture

[akashmaurya]

• C++
• DSA Series
• Day = 8
• Attendance...!!

[CodingWithMoeen-]

Finally didi you're back with another video
Respect button for the shardha mam ❤

[unevengamer]

24:01 to find index of smallest number ...
int size=4;
int marks[size]={15, 10, 20, 5};
int index;
int smallest=INT_MAX;

for(int i=0; i<size; i++;){
smallest=min(marks[i], smallest);
if(smallest==marks[i]) {
index=i;
}

}
cout << "Index of smallest number is " << index <<endl;

[Intelli_Jayant]

This series is awesome, I'm revising my concepts with these videos.
Excited for the upcoming advanced DSA concepts

[ISHAPANDEY-td]

DEAR MAM;
I SINCERELY REQUEST YOU TO PROVIDE SOLUTIONS TO THE HOMEWORK MAM IT WILL BE A GREAT HELP.

[PrithaMajumder]

Day - 1 Completed ✅
Day - 2 Completed ✅
Day - 3 Completed ✅
Day - 4 Completed ✅
Day - 5 Completed ✅
Day - 6 Completed ✅
Day - 7 Completed ✅
Day - 8 Completed ✅

Thanks a lot for this amazing lecture series 😇

[nikitalokhande]

20:58 infinity keliye INT_MAX se mera output nahi aa raha hai..main method mein declare bhi kiye hai lekin fir bhi not declared in scope aa rha hai..how to solve it..?

[Dhanush_]

Mam if you don't mind can you discuss the homework problem to find the unique values in an array

[RAHEELHASSAN-xv]

Do we need to learn C++ first to learn this DSA series???
anyone please reply!!!

[Paradoxgaming]

Shradha Mam 1 Hour se kam ya 1 Hour tak hi lecture upload kara kijye Request🙏😊

[unevengamer]

Q3 Homework
It is not best way but it is according to my understanding or logic
Hope it will help others 😊

int arr[]={10, 10, 10, 10};
int size=4;
for(int i=0;i<size;i++) {
for(int j=0;j<size;j++) {

if(arr[i]!=arr[j]) {
if(j==size-1) {
cout << arr[i] << endl;
}
}else if(i==size-1) {

for(int j=0;j<i;j++) {

if(arr[i]!=arr[j]) {

if(j==i-1) {
cout << arr[i] << endl;
}
}
}
}

}
}

[RenukaNelwade]

Thank you so much didi...
I'm so excited to learn DSA.... only for u....very clearly line line explain THANKS ❤❤

[KashafFatima-]

This DSA series is incredibly helpful, Shradha Ma’am!😃💖 Your explanations make complex topics so much easier to understand. Thank you!💞💜💜

[SubrataJana-iz]

I am excited to learn this DSA properly from this series.. ❤

[ashokbalgurgi]

Really very grateful to have like this lecture...., heartly thank you shradha ma'am

[StudywithmeAkku]

DSA series Day-8 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❤🎉

[hanzalaarshad]

24:02 for finding the position of the variable simple initiate a variable for example smallestindex=-1 and update it after the condition you will get the index number

[unevengamer]

Kis kis ko error aya INT_MAX use karne par