9.2 "2D Array" Challenges | Asked by Top MNC's | C++ Placement Course

Notes of this lecture: drive.google.c...

[@nkjha6625]

Whoever explained matrix search, his way to explain the concept is so easy and smooth ,thanks 😊😊

[@MuhammadAbdullah-vt4wx]

It's very helpful for me thanks apna college 🤗

[@anushkakumari535]

She is shardha didi

[@sandippaul468]

My child, these 3 questions itself were actually easy peasy.

[@ojasahirrao3287]

Instead of swapping, we can directly do- cout

[@manashdas5004]

yeah, that's true. But the method shown in video actually changing the matrix. And the way that you said, is changing the way of print.

[@mahesh248]

@@manashdas5004 Right Bro

[@lokeshkumarchaman1106]

@@manashdas5004 bhai difference btween changing the matrix and only print??

[@manashdas5004]

@@lokeshkumarchaman1106 bhai changing the matrix will help you to do operation on swap matrix. But if you only print you can't do anything to the swap matrix. It is just like toy phone and real phone. Toy phone looks like phone but can't perform any operation like real phone. Hope you understand😊😊

[@anujsaini4454]

Can anyone tell me ? What is the use of k for loop and how it is work in multiplication of Matrix

[@AvinashKumar-rj2zz]

Awaj Pehchan ke chehra bhi yaad aa gaya Off campus in Microsoft 😍

[@UnKnown-by6pu]

Konsi video mein ?

[@haiderali0801]

Exactly brother!!

[@shivanshupadhyay7356]

shraddha di Meri neha ka naam v shraddha h

[@ishankbansal9239]

@@shivanshupadhyay7356 fir toh teri Neha bhi teri bhen huiii

[@sarthakbehera8324]

microsoft wali didi

[@pavankumar-gp9zx]

0:20 transpose of matrix 7:05 matrix multiplication 16:45 matrix search

[@ArvindKumar-iu3rt]

Tbkx

[@sunnyroy2818]

thank u

[@uttamkarmakarece3534]

This college is much much better than my actual college ❤️

[@heplotile8016]

Really ♥️

[@uttamkarmakarece3534]

@@DeepakKumar-uh9yn very true ☹️

[@subhransusekhar7581]

Agree bro

[@SurajMapariPrivate]

💯 agreed

[@mahvishfatima1692]

Absolutely right

[@vaibhavs2740]

The last problem's code would create a infinite loop because r0 would always be satisfied, so the loop will continue indefinitely.

[@11.naghmamahtab.27]

this c++ course is amazing ......i faced some problem on starting ... bcoz I am beginner...but now I am understanding properly.......thanks to aman sir and team....

[@arushisinha6742]

Great course!! It's unlike other courses on KZbin as you solved many questions.. Thank you for so much effort ☺

[@AyushKumar-zs6gf]

Efficient code for Transpose of a matrix - After taking all inputs int col=0; while (col

[@karanbisht7441]

🎉 nice

[@smrtghosh5072]

Bhai tune to whi kiya h ki arr[j][i] ko print krya h, plus yaha matrix bhi change nhi hua h 🥂

[@yadavji_official5548]

In the matrix multiplication question , before the multiplication I think we should check the matrix multiplication rule first i.e if the number of column of the first matrix is equal to number of rows of the second matrix. By the way Thanks for the amazing series!

[@aritrisaha5942]

no bro he has already assumed that the two values are same ie n2

[@aritrisaha5942]

if he would have generalised the sizes of n1 n2 and n3 then he should have compared

[@rameshmalhotra9525]

kzbin.info/www/bejne/a3fWepRqgtVmntE

[@ashishredhu2379]

I thought the same thing.

[@artirani3806]

Bhaiya ko dher saara pyaar aur apni kaksha team ko bhi😘💖💖😘

[@sadaysamnotra1814]

I tried a solution of the order of O(n), here it is: int main() { int r,c; coutr>>c; int arr[r][c]; //Entering 2D array for(int i=0;iarr[i][j]; } } //Algo for transpose of a matrix int columnStart=0,columnEnd=c-1 ,rowStart=0,rowEnd=r-1; while(columnStart

[@tedbundy8712]

Sir frm which year u r ?

[@tonystark861]

O(n^2) aa raha hain

[@abhinandankainth]

Last wala ques toh boht hi bdia padhaya

[@shaileshvashisth9973]

bande ki salary toh badni chahiye jis tarike se badhiya samjhaya hai

[@ayushgoel8277]

Ha last question ne to maje dila die ❤️

[@_dassi_]

Kainthcool

[@ritikshrivastava9442]

6:52 if in question written like print the transpose matrix then //transpose logic for(int j=0; j

[@dopetechman7921]

i cant be equal to 0 cause it will then exchange every no and the same matrix will show again. i should be equal to j

[@ritikshrivastava9442]

@@dopetechman7921 first run it then make any comments

[@dopetechman7921]

@@ritikshrivastava9442 oh sorry, got it now, hey do u wanna be my coding buddy as it will be helpful as we are learning from same resources. Would be great to learn together. If oke how can I connect with you? I m available on LinkedIn, instagram, twitter etc

[@Harshil-Jani]

@@dopetechman7921 Can we Join ?

[@dopetechman7921]

@@Harshil-Jani ya sure, any id of u were i can connect with you

[@snighdhagupta9911]

Sir who taught Matrix multiplication question has taught with extensive explanation and the best explanation I have ever heard for such questions. Looking forward to learn more from you. Great job guys, keep enlightening students like me. Thank you team Apna College🙏

[@kumarharsh90]

He's best one according to me

[@prakharjalan7546]

hey i have doubt in that ques can you help me?

[@kumarharsh90]

@@prakharjalan7546 what?

[@rameshmalhotra9525]

kzbin.info/www/bejne/a3fWepRqgtVmntE

[@kundanraj2690]

we can also do for like arr[j][i] as a output it also take less memory and time complexcity is same 😀

[@AliAhmad-if8hi]

thought the same thing

[@ankushbalhara440]

(16:00) 27+8=33😂😂 Op calculation. Kisko kya hi pta chalega😂😂🤭 By the way nice content bro❣️❣️

[@ayushsarangi4095]

CHOMU 25+8 BOLA H

[@search_Adam_seeker]

@@ayushsarangi4095 cho p

[@dabblu]

I can't belive that I did the 1st Qn on my own...Thank you so much to the WHOLE TEAM of Apna College, I'm so proud of Myself. edit: you might think that the 1st Question was Easy...but I'm still proud of Myself

[@vritantjain1161]

Transpose wale mein j ko i+1 se start kre to less time lagega aur output bhi desired mil jayega

[@tejasdubhir6935]

Last question bhot badhiya samajh aaya. Un bhaiya ke aur videos lao please!!!!

[@findyourself8806]

Image Transformation Digital images are represented as a matrix and each element in the matrix represents the RGB value of a pixel. Given the pixel values of a nXn image. Write a code to transform the image into another image by alternate swap of edge pixels. That is for example, given a 4 X 4 image as follows: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 The edge elements of the above image are 1, 2, 3, 4, 8, 12, 16, 15, 14, 13, 9 and 5. The following steps are involved in the transformation: 1 and 3 are swapped 1 and 8 are swapped 1 and 16 are swapped 1 and 14 are swapped 1 and 9 are swapped After doing alternate swap of edge elements the pixel values of the image looks as follows: 3 2 8 4 5 6 7 16 1 10 11 12 13 9 15 14 And given an image of dimension 5 X 5 as follows: 2 4 5 6 3 3 11 12 7 9 7 15 13 8 1 2 21 25 13 14 17 10 16 19 3 Should transform as: 5 4 3 6 1 3 11 12 7 9 2 15 13 8 3 2 21 25 13 14 7 10 17 19 16 Input Format First line contains the dimension of the matrix, n Next nxn lines contain the elements of the matrix in row major order. That is the elements in the first row are given followed by second row and so on Output Format Print the transformed nxn matrix in ‘n’ lines Each line contains the elements of a row separated by a tab. Note: There is a tab at the end of each line

[@snehilsinha4689]

Urvi Goel didi, Rishabh Gupta bhaiya, Shraddha Khapra didi,... and the list goes on... 😁😁. Who's next? 🤔

[@deveshshetkar8106]

Top class faculties love you all❤️

[@shivamaggarwal4887]

6:00 would be more efficient if we start inner loop from j=i+1...because when i and j are equal then we dont require swapping

[@arkachakraborty843]

Sorry to say but no it is valid only for the 1st row in second row we get i=j for 1 and hence you would check only the numbers beyond i=j=1 and for 3rd row numbers with index beyond i=j=2.

[@vishalkarmakar418]

Last mein konse bhaiya ne smjhaya tha jo bhi h bhot mst smjhaya hain maza aagya 🔥🔥🔥

[@shreyaschavhan5522]

Matrix Transpose - == 0:10 == - Matrix Multiplication - == 7:01 == - Matrix Search - == 16:31 == -

[@BTEEEHarshChauhan]

Sir, we can start from 0,0 or n,n for searching by forcing our search from either way and then checking the condition.

[@Raghav_362]

last question can be done as --> only see diagonal elements and check which is dig element is greater than search then search in that rwo and column only

[@anubhavgoyal2458]

From O(n*2) to O(n) Love the optimization

[@thespecuber1319]

Not really

[@thespecuber1319]

Recognise he used a while loop as well

[@UnKnown-id7ih]

Concept cleared and i think bhiya just listen our query about the speed of teaching and he improved is just mind blowing.

[@a.s.nurrie5282]

Last wali problem me second if ko agr replace krte hai else if se ton vode run kyo nhi hota🤔🤔🤔

[@Go_D_Roger]

6:30 in transpose matrix instead of swaping elements by temp, one can just cout arr[j][i]. it works and time complexity is less too

[@manishchandrapaneru.o5]

That will not change original matrix...It only displays transpose

[@aayush6991]

instead of swapping,we can also create new array to store the transpose here's the code for it #include using namespace std; int main(){ int n; cout

[@vscreation2184]

How he used and in while loop generally we && for checking conditions actually this works in python

[@arka6302]

instead of creating a loop for initializing the ans array in the multplication of matrices question we can just do for(int i=0;i

[@sohamDevRel]

Please increase the frequency of uploading videos. The content is awesome!

[@mdateeque3997]

Hitler reacting to IIT-JEE RESULTS:- kzbin.info/www/bejne/e5rSc2aLgJt8iK8

[@mdateeque3997]

200 likes and 0 dislikes (all haters are asleep).

[@yourbestie4138]

at 20:49 bro try to got to 14 from 5...it is not possible ig..but u answerd my doubt at 21:45..thank you😂😂

[@rajankpandey]

the person at the end has explained really well

[@LLTletslearn]

First of all I learned a lot from this channel thank you 🙏🏻 everyone behind it. Wanna add one more comment “I am in love with your voice “ mam. If the second one hurts you guys in any way please accept my apologies Else keep it. Happy coding ☺️☺️

[@sagarmahajan1756]

agar ye course 1 saal pahle aagaya hota to mere 5000/- rupaye bach jate but anyways thanks your content is more worthy than that 5000/- paid course!

[@forprofessionalusage2]

last guy voice is simple and complex xD very good last bhaiya xD

[@abanerjee3704]

The last approach was just mind blowing.

[@prakharjalan7546]

can you help me with the code i've commented

[@abanerjee3704]

@@prakharjalan7546 just saw it. See and do reply the problem.

[@aditisharma842]

Just print a[j][i] to get transpose no need of swap operation

[@ManishYadav-lg2qr]

Shradha Khapra is love. Great Explanation

[@sahichezz3934]

Give best explainer award to last bhaiya who teach us matrix search we have only one word for explaining beautifully- cout

[@divyanshuarun7129]

Last question bahot ache se explained kia hua hai❤️.

[@priyanshukunwar]

Masterpiece course 🔥

[@Shadowxgaming_]

bhaiya who is teaching inthis video is way better then all the previous one

[@aryavbhola3066]

Matrix Search Question and Explaination was a beauty to watch

[@shreyansh2729]

I did the matrix search problem by binary search on row and columns. But the method explained was way too smoother than binary search !!

[@AbhishekKumar-td5zu]

Tqsm bhaiya ♥️♥️

[@ujjawalmishra858]

Thank You so much bhaiya...and whole team #ApnaCollege

[@piyushverma415]

first ques can be solved using a single while loop to decrease its time complexity...

[@ayushgoel8277]

Last question wale bhaiya ke lie to mene subscribe kardia hai

[@mukulchambial301]

Thanks for this wonderful lecture 🙌🙌

[@modern_gurukul_24x7]

Epic Moment : When you saw that matrix search could be that simple. Meanwhile : Bhaiya's expression ye sab toh bacho ka khel hai.

[@soumojitchowdhury151]

Last searching question me if statement ke andar ek break bhi hoga.. nahi to flag true karne ke baad toh woh loop break hi nahi hoga

[@pragatigupta1159]

Thankyou so much bhaiya for your valuable time , aap ke sath coding karna bahut simple hojata hai

[@manavsharma142]

Last person explained so well

[@sunilj3553]

Webdevlopment ki classes kab se start hogi ?

[@shivamchaturvedi4336]

lgta h agla google tu hi bnayega

[@eshaaislive5741]

@@shivamchaturvedi4336Nice Joke... 🤣🤣

[@rajansingh1919]

top faculties is the world...👌👌👌👌

[@syedmizbahuddin9390]

Sir, What is the time complexity of second algorithm of matrix search problem...?? Is it O(m+n) ...?

[@abhinandankainth]

Yes

[@mostviewedreels872]

Yes

[@shreyashagrawal2264]

but for loop ke andar for loop lagaya hai to uska complexity O(nm) hoga na? Can any one explain why time complexity is O (n+m)

[@abhishekanavekar1147]

@ Syed Mizbahuddin, It's because we are traversing from top right corner to top left searching for the target by 'n' elements and if not found we go down by 'm' elements, and big O is for the worst case of algorithm so, O(m+n).

[@rameshmalhotra9525]

kzbin.info/www/bejne/a3fWepRqgtVmntE

[@lifeoeshita]

Bhaiya ak telegram group bana do na. Jis par hum sab doubts puch sake. If you also want then hit like

[@akshitsingh5912]

Am I the only one who is spending ages on Bhaiya's Physics and Chemistry notes and really enjoying them? Bhaiya thanks for everything and please start Python on Apni Kaksha. You're the best Bhaiya!!

[@abhinavchaudhary1186]

Yes, you are the only one

[@fitincubicles]

You are life saviour for students like me love you Apna College and Aman bhaiya😍

[@HiteshKumar-si4ok]

For the first prb u can also simply do this for (int j = 0; j < n; j++) { for (int i = 0; i < m; i++) { cout

[@trimbakrajitkar4536]

u are just priting but original matx not changed

[@vaibhavs2740]

damn

[@divyaalakute5412]

in the last cout>>a[i][j] is not give proper o/p instead that cout>>a[j][i] gives right ans

[@shivansh7407]

When is python course gonna upload on this channel... plz plz plz do it fast... if have to sit for placements and wanna learn the data structure and algo. from apna college channel. 🙏🙏🙏 Upload it asap🙂🙂🙂

[@mdateeque3997]

Hitler reacting to IIT-JEE RESULTS:- kzbin.info/www/bejne/e5rSc2aLgJt8iK8

[@mdateeque3997]

200 likes and 0 dislikes (all haters are asleep).

[@ankursahoo3607]

If its that much urgent for you go for a intigrrated 16hours video of python from youtube

[@AKASHSHARMA-wy7mg]

bro is python more important than c++ ? i am juinor though...|

[@shivansh7407]

@@09.arkodevmukherjee24 sure

[@yashwasalwar1031]

when will we study stl sort? As per course index it was before 2D arrays

[@vidheelgujarati2906]

Kindly add an option of skip add for the add which is 9 mins long. 1 or 2 mins is okay, but isn't a 9 mins add too long?

[@pavitragautam2448]

THANKS FOR THE VIDEO.... AMAZING EXPLAINATION....

[@sharma_atul_06]

last explanation was superb

[@solvinglife6658]

transpose wale me direct a [j][i] se karna better option hoga

[@Justdoing185]

Matrix search bale bhaiya ap Neo ho In this field (Neo in matrix movie ) Sarbasaktiman Neo bale bhaiya ❤️

[@kashishshukla23]

that bhaiyaa (matrix search vaale) explains really well... ^_^

[@karanchandak5667]

Matrix Transpose- "THE EASIEST CODE YOU WOULD EVER FIND" #include using namespace std; int main() { int n; cin>>n; int a[n][n]; for(int i=0;ia[i][j]; } } // Transpose for(int i=0;i

[@karanchandak5667]

I was doing some random trial and found this🤣🤣 @Apna College

[@deepanshsharma5970]

Thank you bhaiya and all teachers 😍

[@amalasebastian9968]

Aare wah... The last guy was lit.. Seriously

[@priyanshushekharpandey4235]

Bhya 1 week of November hogya waiting for Python course u didn't upload it if it will take time I will study from Anuj bhya #pythonplease session are near sooo please replyyyy

[@yashvarshney6761]

it's your choice isse kisi ko koi nuksaan nahi hai.

[@priyanshushekharpandey4235]

@@yashvarshney6761 bhai ap kaun

[@priyeshrajsingh2249]

Yeh bhi theek hai

[@priyanshushekharpandey4235]

@@priyeshrajsingh2249 gjb khali ho bhai 😁

[@nirbhaisai3421]

in matrix searching .. the while loop is an infinite loop.. does this affect the time or space complexity?

[@rankitgujjar80]

in the first question just exchange i and j , you will get the transpose

[@sajalgupta3049]

sir if i use else if loop to check the condition a[i][j]>target ,then my code is not working and i m not getting the output and if i using if condition as mentioned in video then my code is running and getting right output

[@himanshugautam9159]

Same

[@nikhilmehra613]

Ek exact time pr video daala kro plz.But thanks for that content ❤️

[@dhairyashah4167]

for transpose of matrix ig there is a mistake int j=0(i got required output by this one) and not j=i

[@utkarshrai101cartoonwala]

Are yar ham search matrix me jaye to 17 element se bhi to start kar skte hai Akhir big , small no. To vha bhi hai n Jis se ki ham vha bhi traverse kar skte hai apni condition ke according

[@sahilsawal]

Thank You Ma'am & Sir 😇🙏👍

[@starkendeavours7072]

@22:16 did anybody noticed? He is writing " and " in while loop instead "&&", still his code is running correctly, without any compilation error.😲😲😲 LOL...

[@mukulchopra3378]

i'm also thinking this ,.... how ??

[@dhruvnaik5317]

Can't make new matrix instead of swaping a =d but with same concept of ij=ji and then d matrix print kar denge

[@012_mohdsameer7]

i think Kainth Bhaiya is the best teacher for this placement course the last question in this video was done by him i read his name on VS CODE

[@pritishpattnaik4674]

give more questions from gfg , hacker rank , etc..

[@SeotiSen]

Bhai, ye kaun hai🙄 jo 1:40am pei vdo mai dislike marne aya; jake soh jao.

[@niladriroy1665]

Vai tu 18 hrs Phle kaise comment kiya? Video premier pe tha kya?

[@shaileshhacker]

0:00 - 7:00 Only Lengends know that this voice is Our Shradha Didi

[@sourishdutta0999]

4:20 Transpose #include using namespace std; int main(){ int n; coutn; cout

[@manaspandey7243]

Simply cout

[@bat_man1138]

I knew today that temp is for "temporary" lol man

[@mehendisworld2606]

is there any problem with time complexity? N:B: I am very beginner. i have some confusion in "time complexity". Can you please help me ? #include using namespace std; int main(){ int n; cin>>n; int a[n][n]; for(int i=0; ia[i][j]; } cout

[@mohdbilal2]

no this one okay but only applicable for square matrix

[@sampakhan2879]

A little heads up if ur facing problems with the last code Add a break after found=true

[@harshitmehra671]

Ohhhhhhhh swap 🤩 I thought it would be hard to transpose

[@vikasmaurya3905]

U R ALL AMAZING 😊😊, THANK U SO MUCH.....

[@shivammaurya3451]

Thank you mam and aman bhaiya best explanation best solution 😃❤🖤

[@harshvardhanyadav7904]

i have a doubt in optimized search in notes you have initialized r=0 but c=n-1 but i think it should be m-1 casue m no. of columns are there if n is not equal to m then this will be incorrect kindly correct this.