Sab acche se chamak rha hai bhaiyya, dsa karne me ab maza aa rha hai🔥🔥 Ps. Me codes python me implement kar raha hu(want to pursue career in aiml) Aap itna easy kardete ho concept ko, language ka barrier hi nahi rehta, Tysm❤
1:04:44 The time and space complexity actually for "Search element" not "Max Sum". For "Max Sum", the worst and best both time complexity is O(row*col)
Thank you bhaiya itni deeply knowledge dene ke liye maine 2d array bhut jagah se pdha tha but sab seedha matrix btake skip kra dete h address vgera ke part ko ..Thanks 😍
Thank you sir😊. Had to skip some classes because of class syllabus doesn't match with playlist. But completed this at day 14. Resume from lec 24 after 2D array will be completed.
Bhaiya last question ka tc hoga o(row*col) because we are traversing each row and swapping them and for sc o(1) because we are just modifying the matrix not using any extra space 😊
@@colabbro7789 haa bro I too trying but I am in the beginning for both coding and language .so that's why I am not getting that much.absoluetly learning a language is beneficial .
bhaiyya request h ek mai dsa java mai kr rha hu aap c++ me kra rahe ho dono ka 2d array store krne ka tarike alag alag h java to array of array store krti h meri trh or bhi bhot saare students honge please bhiyya thoda bhot hint ya koi resource de diya kro taki ham sab java wale usi level ka java mai padh paye jis level ka aap c++ me padha rahe ho
reverse each row of matrix Time complexity O(n^2) space Comp... O(N) #include using namespace std; void reverserowMatrix(int matrix[][4],int row=0,int col=0) { for(int i=0;i
Get ready to learn in Depth Knowledge of 2D Arrays, Baaki maja aaya aapko kuch, aur kya new seekha? Next class mein Column Major Order ko padenge
Good Morning Bhaiya
Thank you bhaiya for give us this type of content
Chamak gya bhaiya
Yes ready thanks ❤
Sab acche se chamak rha hai bhaiyya, dsa karne me ab maza aa rha hai🔥🔥
Ps. Me codes python me implement kar raha hu(want to pursue career in aiml)
Aap itna easy kardete ho concept ko, language ka barrier hi nahi rehta, Tysm❤
Good morning bhaiya
Aapne 6:00AM o'clock me jagne ki aadat bana diye bhaiya meri.
thank you 🙏
Live seeing the miracle of consistency from rank 1 magician
1:04:44 The time and space complexity actually for "Search element" not "Max Sum". For "Max Sum", the worst and best both time complexity is O(row*col)
Thanks for correcting
@@CoderArmy9 You are welcome bhaiya ❤❤
How did you find the time complexity... I have confusion😢
Bhaiya apki video se new concept sikhne ko milta hai
Completed Lecture 31, loved the way you teach and not going to break my consistancy.
Love you big brother continuing this series in form of revision loving the content absolutely best
The way you teach the approach step by step is incredible❣
Bhaiya aap bhot depth me samja rhe ho thanks a lot ❤❤❤❤
Welcome
Bhaiya maine kafi teacher se padha hu 2d array par aapke jaisa koi depth me nhi btaya 😊❤.
Thank you bhaiya itni deeply knowledge dene ke liye maine 2d array bhut jagah se pdha tha but sab seedha matrix btake skip kra dete h address vgera ke part ko ..Thanks 😍
Optimized code for sum of diagonals question 1:18:12 :
O(2*row) -----> O(row)
c++ code:
void calculateDiagonalSums(int matrix[][3]) {
int primary_diagonal = 0;
int secondary_diagonal = 0;
int size = 3; // Assuming a 3x3 matrix
for (int i = 0; i < size; ++i) {
primary_diagonal += matrix[i][i];
int j = size - 1 - i;
secondary_diagonal += matrix[i][j];
}
std::cout
Concept chamka..❤ superb
Kya baat hai sir 2cr offer reject karne ke baad ek accha profession banne ki tayari
Chalo to fir suru karte h ❤
Good morning Bhaiya
41/180 with consistency
Bhiaya your way teaching is very good. You are helping us a lot in free
Bhaiya sab chamak chuka bahut bahut dhanybad bhaiya
❤ DAY 43
चलिए चमकाते है
Thank you sir😊. Had to skip some classes because of class syllabus doesn't match with playlist. But completed this at day 14. Resume from lec 24 after 2D array will be completed.
Full of Energy Bhai sab clear hogaya
Bas bhaiya apke jaisa baap coder banna hai❤
Just awesome, you're explaining each and every concept very clearly 🫡
Bhaiya last question ka tc hoga o(row*col) because we are traversing each row and swapping them and for sc o(1) because we are just modifying the matrix not using any extra space 😊
As always,
Tagda & dedicated lecture.
Bhiya ek baat hai c++ ke concept clear ho gye ❤❤❤
1:20:00 We can solve it by using only one loop.
for (int i = 0, j = col - 1; i < row; ++i, - -j)
{
first += matrix[i][i];
second += matrix[i][j];
}
Heartly thanks bhaiya ........❣💖for teaching in depth
Day 43/180 done thanku bhaiya🙃
chamak gaya sir ji ek no..
i am always ready #coderarmy🔥
Bro I am from ap. i want to listen ur classses please provide English subtitles . so it is very helpful for students like me
so you have to learn hindi language. as we learn english
@@colabbro7789 haa bro I too trying but I am in the beginning for both coding and language .so that's why I am not getting that much.absoluetly learning a language is beneficial .
@@saireddysathi7585 em kaaka ayipoindaa mari dsa
thankyou bhaiya ethne depth mey padhaane ke liye
Sab chamak gya bhaiya😊
OMG ,,,great sir💗💗💗💗💗💗💗💗💗
Done bhaiya, every topics are shined to me😊
ha sir ji sab kuch ache se chamak gaya
Reverse array:
time complexity:-O(n^2)
space complexity:-O(1);
Chamak gya bhaiya ❤
Simply Awesome♥♥
crystal clear ho gaya bhaiya
Good morning techies
Ram Ram Rohit bhaiya
Let's start
Bro you are a magician.
May god bless you bhaiya thank you 🙏
hn bhaiya sab kuch acha se chamak chuka hai........!
Great video sir💖🙇♂🙏❤
chamak gya bhaiya🚀🚀❤❤
sab kuch chamak chuka hai bhaiya...
DAY 41/180
Chamak gya bhaiya 🎉🎉🎉
love this content bro you are truly gem
chamak gaya bhaiya
bahut ache se chamka hain
ye tarika badhiya hai bhai
chamka diya bhaiya >>>
Chamak gya bhaiyya😊
Chamak gaya sir 😊
Good morning Negi bhai ❤
Good morning bhaiya ❤❤
thanks for great lecture
Good morning Bhaiya 😊
Good Morning Bhayia
best video bhaiya
Thanks Bhaiya...❤🎉
sab chamak gaya bhaiya
43/180Day's full power full power ❤❤❤❤
Good morning sir ❤❤
int chamka = 0;
chamka++;
cout
bhaiya chamak gaya
thank you bhaiyya!!
Chamkadia bhai
Good morning bhaiya
Tq bhaiya, kuch seeka aaj
Good morning ❤
Good Morning 🔥
Full playlist link diva plz
aachese chamkaa he brother.
Day 43 completed
ram ram sir and everyone
Day 43/180 completed.
Love you bhaiya
Thank you bhaiya
Chamka hai !
Good morning bhiya
nice sir
chamka 🔥🔥🔥🔥🔥
chamak gya
Day43/180 Completed #180Daysofcode
17:00
Love from Pakistan
outstanding bhaiya....but my faculty is crying in corner..
woow this is my day 41
#Chamaka bhaiyaa..
Day -43/180 Completed ✅✅✅
chamak gaya
Hello bhai, if possible plz provide problem link of Leetcode, Hacker rank etc., in home work sheet instead of problem statement.
Yes bhai mein link deta hu, jo is lecture mein problem th, wo kisi platform mein availabli nahi th
Ok Bhai. No issue
Day 43/180 Done ✅✅ #CoderArmy #180DaysofCode💥💥
bhaiyya request h ek mai dsa java mai kr rha hu aap c++ me kra rahe ho dono ka 2d array store krne ka tarike alag alag h java to array of array store krti h meri trh or bhi bhot saare students honge please bhiyya thoda bhot hint ya koi resource de diya kro taki ham sab java wale usi level ka java mai padh paye jis level ka aap c++ me padha rahe ho
Good morninig
reverse each row of matrix
Time complexity O(n^2)
space Comp... O(N)
#include
using namespace std;
void reverserowMatrix(int matrix[][4],int row=0,int col=0)
{
for(int i=0;i
Day 43
2D array ❤❤🎉