Feedback: Again I'm saying problem solving is this course's speciality which no other yt channel or resource has ..lage raho Bhaiya ji...sath me hain bilkul aapke 💯❤️
Present bhaiya . What you said about this course before start is Turning out to be 100 percent true . Keep going bhaiya. You are like our professor from money heist.
@@omprakashtiwari1412No bro if you look at the question value of m denotes the number of elements present in nums1 excetpt the empty space denoted by zero
Personally a JS Learner, Learned C++ amd loved it, but there were less problem solving focused lectures in RUclips. This playlist of DSA series fullfills the issue. Thnx vaiya
25:44 Homework, it is self explanatory class Solution { public: void merge(vector& nums1, int m, vector& nums2, int n) { int i=0; int j=0; vectorans; while(i
Time Stamp 25:44 Re: Homework The way to think about the solution is that we will have to do a reverse sorting. We initialize k=m+n-1 as that will be the last location of nums1. We will keep checking for the greater element of the two arrays(i=m-1,j=n-1) and insert the values. nums1 = [1,2,3,0,0,0], m = 3 nums2 = [2,5,6], n = 3 nums1 = [1,2,3,0,0,0] | | i k nums2 = [2,5,6] | j nums2[j]>nums1[i] thus nums1[k]=6 k and j are decremented. nums1 = [1,2,3,0,0,6] | | i k nums2 = [2,5,6] | j nums2[j]>nums1[i] thus nums1[k]=5 k and j are decremented. nums1 = [1,2,3,0,5,6] | | i k nums2 = [2,5,6] | j We keep following up this procedure and we get the desired reult. void merge(vector& nums1, int m, vector& nums2, int n) { int i=m-1,j=n-1,k=m+n-1; while(i>=0&&j>=0) { if(nums1[i]>nums2[j]) { nums1[k]=nums1[i]; i--; k--; } else { nums1[k]=nums2[j]; j--; k--; } } while(i>=0) nums1[k--]=nums1[i--]; while(j>=0) nums1[k--]=nums2[j--]; }
In the second question merge two sorted arrays - 12:48 I used this approach class Solution { public: void merge(vector& nums1, int m, vector& nums2, int n) { // removing zeroes for(int i = 0; i
Lecture 20 - completed Homework 26:38 class Solution { public: void merge(vector& nums1, int m, vector& nums2, int n) { int i = 0, j = 0,k=0; int nums3[m+n]; while(i
if at the non zero index value is non zero then this code will be wrong example:arr[]={2,0,1,2,0,3,0} solution: #include #include using namespace std; vector reverse(vector,int); void print(vector); vector reverse(vectorv,int i){ for(int j=i+1;j
@@15priyanshupratapsingh24 because kid every problem can be solved in many ways ,By seeing best solution u get better idea, u can compare with your solution to see which code is better in terms of length and time complexity and in this way u will learn a lot
@@abdulrehmaan153 Kaunse discussion mai? If you are talking about Discord ka discussion then wahaan pe kaunse channel mai discuss hoti hai homework problems?
wah bhaiya samajh aa gya bahut asan ho gya aapke padhane ke baad isse pahle aisa lagta tha ki coding mere liye bani hi nhi hai lekin ab mja aa rha hai.Thanks bhaiya ❤
You teach really well , really waiting for the trees data structures as that is my weakest part and I really struggle to solve even a single tree question.
@@CodeHelp Thanks for all the content and this course. One request though: Please don't post content everyday. It's getting harder to keep up. Every other day is fine.
Iss chanel ko jo cheez sabse alag aur ekdum khaas aur effective banati hai vo hai real life problem solving practice jonki aur koi yt channel nhi krta that's the big+++ for this channel.... Keep it up bhaiya 👏👏🙌❤❤
mja sa aa gya bhiya aaaj muje apka solution dekhne ki jrurt hi nhi pdi, khud se hi solve kr diye, abbb dhere dhere lg rha h amazon microsoft jase m selection ho jaeyga.. thanku you bhiya.
solid logic and industry level ki coding experience de rhe hai aap, paisa deke bhi nhi milta bhaiya , i mean kon Amazon ki job chhor ke hmko padhayega , u r great bhaiya time diya apne hum juniour ko thanku so much
19:50 we can add INT_MAX at the end of both arrays, this way we can avoid writing two extra while loops for remaining elements!! thank you Babbar Bhaiya for teaching us so well!
Ek dum se maja aa gaya bhaiya and End sem chal rahe he but...... aap lage raho hum time nikal ke bhi kar lege bus aapki video aani chahiye ......................Love from Gujarat
Bhaiya please make more nd more videos on only problem solving.... Becoz these videos helps to improve logics and also tells that how to approach a problem and how to think about particular problem ❤️❤️
for second question, just add the nums2 to nums1 after nums 1 ends, then simply use insertion sort in the whole nums 1, itll give the fastest result in leetcode. here we dont make another array and convert nums1 to that array so it does save time class Solution { public: void merge(std::vector& nums1, int m, std::vector& nums2, int n) {
you can also try this one class Solution { public: void merge(vector& nums1, int m, vector& nums2, int n) { int i = m - 1; int j = n - 1; while (i >= 0 && j >= 0) { if (nums1[i] > nums2[j]) { nums1[i + j + 1] = nums1[i]; i--; } else { nums1[i + j + 1] = nums2[j]; j--; } } while (j >= 0) { nums1[j] = nums2[j]; j--; } } };
I never comment on Bhaiya's videos as I'm currently on video 9 (yeah lagging behind) but today i had to....kyunki kal raat sapne mein bhi dekh rhi hoon mein code kar rhi hoon(for loop ye sabb)... pta nhin Love Bhaiya comment dekhenge ya nhin...But had to share this... thanks bhaiya itna accha dsa course kliye❤️❤️❤️
Maza agaya bhaiya. im in 4th sem right now from kolkata. im from a tier 4 college ,watching your lectures and solving problems to make my base strong from scratch. thanks for everything you did. and wish you well for your health. waiting for your web dev videos. im making promise that im gonna be more consistent and get myself placed in a good company. baas apka saath ho and i will follow your guided path. pranam lijiye bhaiya.🙏
Bs bhaiya ese basic se utha ke le chalo thanku very much bhaiya ..........I am from tier 3 college but from your course I will crack the off campuses..... Bs bhaiya level basic se hi leke chlna
to all the guys who thinks why we done use use reverse here we can use that also but for understanding us the concepts bhaiya told us that we can also used reverse(a[m+1],a[end]);
vaiya aj to maja agaya...out of 3 i solved 2question.. also i build the logic...thank you so much for your priceless effort.. lots of love from kolkata.
@CodeHelp - by Babbar Ques 2 - Merger sorted array class Solution { public: void merge(vector& nums1, int m, vector& nums2, int n) { vector nums3; nums3 = nums1; int i = 0; int j = 0; int k = 0; while (i
I personally loved the merge two sorted arrays prob coz it made me ponder for a while lot longer and made me look like a fool in front of myself,... a pretty odd comment but it let's me hit off some air and let's others resonate and feel good bout themslvs
Thanku soo muchh bhaiya ya strategy unique aur sabsee bestt hai aap padhai k saath acche platform k questions bhi kara rahe thanku soo much bhaiya #PlacementHogiApni
![Lecture21: Solving LeetCode/CodeStudio Questions [Arrays]](http://i.ytimg.com/vi/Z7_nMTHROZo/mqdefault.jpg)
![Lecture21: Solving LeetCode/CodeStudio Questions [Arrays]](/img/tr.png)
Due to your help and guidance I have cleared Amazon SDE-1's coding round . Wish me luck for the interview .
all the best dude, btw you must have got the result, how was it?
?
@@piyushsinha9989 Rejected O_O
ruclips.net/video/tAQIKe0UGH4/видео.html
Result DUDE ????
Feedback: Again I'm saying problem solving is this course's speciality which no other yt channel or resource has ..lage raho Bhaiya ji...sath me hain bilkul aapke 💯❤️
100 percent true
🔥🔥🔥💞💞
ruclips.net/video/tAQIKe0UGH4/видео.html
not true
32:50 for(int j=i; j
Present bhaiya . What you said about this course before start is Turning out to be 100 percent true . Keep going bhaiya. You are like our professor from money heist.
waah kya comment hai yaar ~~~!!!
25:44 Homework code:
class Solution {
public:
void merge(vector& nums1, int m, vector& nums2, int n) {
int i=0, j=0, k=0;
vector nums3;
while(i
thx bro
thx
There is mistake in this inside while loop the condition for i should be i
@@omprakashtiwari1412No bro if you look at the question value of m denotes the number of elements present in nums1 excetpt the empty space denoted by zero
what's the need of k iterator in this?
Personally a JS Learner, Learned C++ amd loved it, but there were less problem solving focused lectures in RUclips. This playlist of DSA series fullfills the issue. Thnx vaiya
this playlist is destined to change the life of upcoming undergrads. Really thank you for what you have done for the cs
community.
solved 2 questions of arrays first time by myself...thankx alot to u man this playlist is really a gem!
Small correction bhaiya
23:37 At line no - 32 it should be arr3[k++] = arr2[j++]; instead of arr2[k++] = arr2[j++];
yes
yes i noticed it too but still the code ran flawlessly
because array1 is larger then array2 here and counter consider i
yes you are right
@@fuasteriskkbecause the second loop didn't get executed for that particular sample test case
Bhai Yrr you totally nailed it.....All the questions asked in my Nagarro and TCS interview is from your series........Thanks Bhai
:)
are u placed?
25:44 Homework, it is self explanatory
class Solution {
public:
void merge(vector& nums1, int m, vector& nums2, int n) {
int i=0;
int j=0;
vectorans;
while(i
Time Stamp 25:44 Re: Homework
The way to think about the solution is that we will have to do a reverse sorting.
We initialize k=m+n-1 as that will be the last location of nums1.
We will keep checking for the greater element of the two arrays(i=m-1,j=n-1) and insert the values.
nums1 = [1,2,3,0,0,0], m = 3
nums2 = [2,5,6], n = 3
nums1 = [1,2,3,0,0,0]
| |
i k
nums2 = [2,5,6]
|
j
nums2[j]>nums1[i] thus nums1[k]=6
k and j are decremented.
nums1 = [1,2,3,0,0,6]
| |
i k
nums2 = [2,5,6]
|
j
nums2[j]>nums1[i] thus nums1[k]=5
k and j are decremented.
nums1 = [1,2,3,0,5,6]
| |
i k
nums2 = [2,5,6]
|
j
We keep following up this procedure and we get the desired reult.
void merge(vector& nums1, int m, vector& nums2, int n) {
int i=m-1,j=n-1,k=m+n-1;
while(i>=0&&j>=0)
{
if(nums1[i]>nums2[j])
{
nums1[k]=nums1[i];
i--;
k--;
}
else
{
nums1[k]=nums2[j];
j--;
k--;
}
}
while(i>=0)
nums1[k--]=nums1[i--];
while(j>=0)
nums1[k--]=nums2[j--];
}
Good Work Brother
Thank you brother
Why can't we do that problem the way we did the normal merge 2 sorted arrays problem in the video?
@@rangamdeka6178 It can be done. Space complexity is increasing. ig, it was given in the solution section of leetcode.
@@aditya-9431 yess so true...
In the second question merge two sorted arrays - 12:48 I used this approach
class Solution {
public:
void merge(vector& nums1, int m, vector& nums2, int n) {
// removing zeroes
for(int i = 0; i
Very good approach
apni buddhi apne pas rakh bhaiya ko samjhane de
Ye bhi sahi hai bs time complexity zyada hai iski
O(n+m) hogai approach sahi hai but time complexity badh gai compare to o(n)
@@ashishvinod2193 bhai sorting ki bhi T.C. add hogi n + m to sitf shuru k 2 loop ki h
Bhaiya ab pata nahi but jyada maja ata hai approach ka intuition thora thora ane lagta hai . Thank you ❤️
Maja aa gaya dekh ke bhaiya♥️ U r video improving my logic building …….. in this video i am able to think brute force approch ……thank you bhaiya ♥️
What a consistency bhiyaa
Aakho me neend ye phir bhi video bana rahe ho 🔥🔥🔥🔥
Explanation is on top
Lecture 20 - completed
Homework 26:38
class Solution {
public:
void merge(vector& nums1, int m, vector& nums2, int n) {
int i = 0, j = 0,k=0;
int nums3[m+n];
while(i
This way we can solve but in question, it is given without making any third vector or array. do you know any other method
hii, last mein for loop kyu lagaya hai
@@GauravJadhav-ml2my kiuki usne bola h ki answer nums1 m store krna h isliye
just use single loop
int mergesort = m ;
for(int i = 0 ; i < n ; i++){
nums1[mergesort++] = nums2[i];
}
And sort the array 😁
Present sir ,array toh sab padhate h but bhaiya array ka postmortem karte h. Thank you bhaiya.Roz bas ese hi video ane dijiye.
Question1:
void reverseArray(vector &arr , int m)
{
// Write your code here.
int i = m+1;
int j = arr.size()-1;
int temp = -1;
while(i
you're the best sir. I really had a hard time learning coding and solving problems. But you have made everything so easy.
if at the non zero index value is non zero then this code will be wrong
example:arr[]={2,0,1,2,0,3,0}
solution:
#include
#include
using namespace std;
vector reverse(vector,int);
void print(vector);
vector reverse(vectorv,int i){
for(int j=i+1;j
you are so cute and beautiful🙂😊
@@dhruvikmevada5155 bsdk padhle
\
@@KaiCenatLOLClips bhai bande ne pehle ans bhi reply mai kiya fir likha 🤣
Feedback: Kindly also discuss the solution of the previous class homework in the next video
hit like if you agree
what is the point of giving homework if we have to discuss it in the lecture
@@15priyanshupratapsingh24 because kid every problem can be solved in many ways ,By seeing best solution u get better idea, u can compare with your solution to see which code is better in terms of length and time complexity and in this way u will learn a lot
bhai jaake discussion me check krona yaar
@@abdulrehmaan153 Kaunse discussion mai? If you are talking about Discord ka discussion then wahaan pe kaunse channel mai discuss hoti hai homework problems?
@@shiv.shankarAre coding platform ke discussion me
wah bhaiya samajh aa gya bahut asan ho gya aapke padhane ke baad isse pahle aisa lagta tha ki coding mere liye bani hi nhi hai lekin ab mja aa rha hai.Thanks bhaiya ❤
Q MERGE TWO SORTED ARRAYS
class Solution {
public:
void merge(vector& nums1, int m, vector& nums2, int n) {
for(int i=0;i
You teach really well , really waiting for the trees data structures as that is my weakest part and I really struggle to solve even a single tree question.
ekdum makhhan lagega trees toh, jab karwaenge
@@CodeHelp Thanks for all the content and this course.
One request though: Please don't post content everyday. It's getting harder to keep up. Every other day is fine.
bhai love bhaiya ne kha hai iss pace se chlega tabhi jake 17 march tak course khtm hoga so plz chalne do :)
@@CodeHelp plz try to continue language independent course as you are doing now,. so if somebody wants to solve in java/python they can do.
@@ashishtomer9962 din raat ek krdo
Thank you bhaiyya for couse and giving motivation and confidance This couse is just next level far better than any cource in india ❤️
Iss chanel ko jo cheez sabse alag aur ekdum khaas aur effective banati hai vo hai real life problem solving practice jonki aur koi yt channel nhi krta that's the big+++ for this channel.... Keep it up bhaiya 👏👏🙌❤❤
28:48 Use bubble sort and if arr[j] == 0 swap this moves zeroes to last
bhai apka samjhane ka tarika kuch aisa hai jaise ki nurssary ke bache ko abcd sikhaya ja rha hai , op explanation , all clear , love babbar OP
void merge(vector& nums1, int m, vector& nums2, int n) {
for( int i=m, j=0; i
nice
nice
nice
bro great code samja sakte ho kya kese run ho raha hai ye.....
yeh nums2.size() tk nhi chlna chahiye loop?
mja sa aa gya bhiya aaaj muje apka solution dekhne ki jrurt hi nhi pdi, khud se hi solve kr diye, abbb dhere dhere lg rha h amazon microsoft jase m selection ho jaeyga.. thanku you bhiya.
solid logic and industry level ki coding experience de rhe hai aap, paisa deke bhi nhi milta bhaiya , i mean kon Amazon ki job chhor ke hmko padhayega , u r great bhaiya time diya apne hum juniour ko thanku so much
Reverse array
vectorans;
int i=0;
int k=arr.size()-1;
while(i
Kindly check line no 26 @ 25:35
it should be arr3[k++]=arr2[j++];
Yes baad me correct kr lia bhaiya ne
yup this is a mistake
@@AaBb-zd5gk nope nahi kiya
@@priyamtiwari391 yeah I wrote code by myself then saw on screen that y has he written that😂
25:44 Homework
class Solution {
public:
void merge(vector& nums1, int m, vector& nums2, int n) {
int i=0,j=0,k=0;
vector nums3=nums1;
while(i
19:50
we can add INT_MAX at the end of both arrays, this way we can avoid writing two extra while loops for remaining elements!!
thank you Babbar Bhaiya for teaching us so well!
how? bro can u explain
but then you will also end up adding the int_max values, in the last position in the new array, since they are also elements of your array
Ek dum se maja aa gaya bhaiya and End sem chal rahe he but...... aap lage raho hum time nikal ke bhi kar lege bus aapki video aani chahiye ......................Love from Gujarat
23:20 there is error. It should be
arr3[k++]=arr2[j++];
not in VS
Catch up🙌
True
Yeah, and it is left unnoticed because for our sample input that while loop never got executed.
Yess obviously...that's why for this particular example code has runned smoothly
Bhaiya kuch samay baad inn videos ke views millions me honge , thnx a lot bhaiya 🔥🔥🔥
Bhaiya please make more nd more videos on only problem solving....
Becoz these videos helps to improve logics and also tells that how to approach a problem and how to think about particular problem ❤️❤️
Yess i agree with you 😊
H.W. 25:44
void merge(vector& nums1, int m, vector& nums2, int n) {
nums1.resize(m);
for(int i=0;i
can you explain this please?
Thank you for this placement series Bhaiya
We're learning and enjoying a lot.
Solved all questions in 1st try by myself.
Ab to confidence aane laga h.
for second question, just add the nums2 to nums1 after nums 1 ends, then simply use insertion sort in the whole nums 1, itll give the fastest result in leetcode. here we dont make another array and convert nums1 to that array so it does save time
class Solution {
public:
void merge(std::vector& nums1, int m, std::vector& nums2, int n) {
for(int i=0;i= 0; j--) {
if (nums1[j] > temp) {
nums1[j + 1] = nums1[j];
} else {
break;
}
}
nums1[j + 1] = temp;
}
}
};
Thanks Brother
you can also try this one
class Solution {
public:
void merge(vector& nums1, int m, vector& nums2, int n) {
int i = m - 1;
int j = n - 1;
while (i >= 0 && j >= 0) {
if (nums1[i] > nums2[j]) {
nums1[i + j + 1] = nums1[i];
i--;
} else {
nums1[i + j + 1] = nums2[j];
j--;
}
}
while (j >= 0) {
nums1[j] = nums2[j];
j--;
}
}
};
I never comment on Bhaiya's videos as I'm currently on video 9 (yeah lagging behind) but today i had to....kyunki kal raat sapne mein bhi dekh rhi hoon mein code kar rhi hoon(for loop ye sabb)... pta nhin Love Bhaiya comment dekhenge ya nhin...But had to share this... thanks bhaiya itna accha dsa course kliye❤️❤️❤️
Sapne me bhi DSA wow dedication 😳
@@CodeHelp 😂😂😂...ss le rhi hoon aapke reply ka🥺...thanks a lot
@@bananipanja2704 phir compilation error aate he neend khul gayi hogi 😅😅
I was looking for a well structured dsa course and this is helping a lot❤
r u placed?
Q1 Reversing an array after m position -->
#include
#include
using namespace std;
vector reverse(vectorv){
int s=v.front()+2,e=v.size()-1; //here m=3 i.e., change array after 3rd position
while(s
void reverseArray(vector &arr , int m)
{
// Write your code here.
int start=m+1;
int end=arr.size()-1;
while(start
Solving Questions at Leetcode && at Codestudio has Motivate Me alot 🔥🔥
Yaar kitna achey se smjhate ho aap 😀
Done!!❤
This is the best course i have ever seen!! Thank you soo much sir!
Maza agaya bhaiya. im in 4th sem right now from kolkata. im from a tier 4 college ,watching your lectures and solving problems to make my base strong from scratch. thanks for everything you did. and wish you well for your health. waiting for your web dev videos. im making promise that im gonna be more consistent and get myself placed in a good company. baas apka saath ho and i will follow your guided path. pranam lijiye bhaiya.🙏
You teach really well ,Really thank you for what you have done for the cs
community.
U are maahan bhaiya 🔥🔥 aisa couurse paise deke bhi naa milta 🥺🥺🔥🔥
class Solution {
public:
void merge(vector& nums1, int m, vector& nums2, int n) {
for(int i=0;i
Bhaiya BINARY SEARCH aap se padatha to aaj practical exam mein ka 45 min ka paper ko 6 min mein kardia
LOVE YOU BRO.❤❤
best content bhaiya..
bhot bacho ki good wishes aap k sath h
Bs bhaiya ese basic se utha ke le chalo thanku very much bhaiya ..........I am from tier 3 college but from your course I will crack the off campuses.....
Bs bhaiya level basic se hi leke chlna
Bhaiya dekh li video!
Mazza aa gaya.....
Homework done!
to all the guys who thinks why we done use use reverse here we can use that also but for understanding us the concepts bhaiya told us that we can also used reverse(a[m+1],a[end]);
Marked the attendance!💯
Commeting for better reach!👊🏽
Bhaiya aap macha rahe ho ,dsa ki duniya ka kingkong
Thank you bhaiya
Deep down my heart u r one of my favourite teacher of my life
vaiya aj to maja agaya...out of 3 i solved 2question.. also i build the logic...thank you so much for your priceless effort.. lots of love from kolkata.
coding is beauty when someone like yyou is there to help us.
Bhaiya kyuki ye vector h to simply ye bhi kr sakte h kya?
int j=0;
for(int i=m;i
bhiayaa bahut pyra solution tha last wale question ka
Mastay talent hai yaar superb coding!
Bahut badhiya samjhaya hai bhaiya Love U😍❤❤
Bhot badhiya bhaiya 🤗🤗 thank you for this consistency.........bhaiya aap morning wale pr soch kr bta dena kya kr rahe ho uska
Attendence done will watch after previous video 🔥
Bhaiya sach me aapke vajh se samjh gaya itna bas ab practice karna hai thanku bhaiya🙏
hamesha ki tarah ek aur lazwaab video lage raho bhaiyya ham bhi hain bhaiyya
Qn 2 my solution : --
class Solution {
public:
void merge(vector& nums1, int m, vector& nums2, int n) {
for(int i=0;i
25:45
class Solution {
public:
void merge(vector& nums1, int m, vector& nums2, int n) {
int i=m-1;
int j=n-1;
int k=m+n-1;
while(j>=0){
if(i>=0 && nums1[i]>nums2[j]){
nums1[k]=nums1[i];
i--;
k--;
}
else{
nums1[k]=nums2[j];
k--;
j--;
}
}
}
};
Bilkul maza hi aa gya bhaiya . and i noticed ,i could think of logic immediately.🧡🧡🧡🧡
I Know the video will be awesome as always ❤️
Maja aa gaya bhaiya done abhi dekha..👏
reverse array
void reverseArray(vector &arr , int m) {
int s=m+1;
int e=arr.size()-1;
while (s
Thanks, bhaiya for solving the problem too.... Great fan of your hard work and dedication
Nice explanation. It would be great if you also make some videos on Low Level design(oops concepts) and design patterns.
ANSWER OF SECOND QUESTION
Merge 2 sorted arrays:
void merge(vector& nums1, int m, vector& nums2, int n)
{
vectorans;
int i=0,j=0;
while(i
Attendance ✅
Videos roj upload kro bhaiya hum dekh rahe h daily videos
All the 20 videos payoff when you are watching 21th and getting each and everything .
Respect to LOVE BABBER
Bhaiya,you are a very good teacher🥳😎
(23:28 ) you write arr2[k++]=arr2[ j++] instead of arr3[k++]=arr 2[j++]
you write arr2 instead of arr3
Move zeros:
class Solution {
public:
void moveZeroes(vector& nums) {
int i=0;
int j=0;
while(i
Aagye bhaiya aagye....aane de content...hajm kr lenge...🤤🤤🤤✌✌
do*
1st HomeWork done:
class Solution {
public:
void merge(vector& nums1, int m, vector& nums2, int n) {
int i= m;
int j =0;
while(j
void reverseArray(vector &arr , int m)
{
// Write your code here.
int e=arr.size()-1;
for(int s=m+1;s
class Solution {
public:
void merge(vector& nums1, int m, vector& nums2, int n)
{
for(int i=0;i
In Question2 -> we can directly add elements of arr2 in arr1 and then simply use sort
Try this
For (int i=0;i
Present bhaiya... abhi to class chal rahe he afternoon me hi dekh lunga kal ki tarah...
Video dalte raho gyan batte raho...🤘🤘
Wahh bhaiyaa mast laga🤘🙌🙌👏❤❤
Thanks, bhaiya for being a really excellent lecture.
Maza aa gaya Mere 2 array m ♥️♥️
@CodeHelp - by Babbar
Ques 2 - Merger sorted array
class Solution {
public:
void merge(vector& nums1, int m, vector& nums2, int n) {
vector nums3;
nums3 = nums1;
int i = 0;
int j = 0;
int k = 0;
while (i
I personally loved the merge two sorted arrays prob coz it made me ponder for a while lot longer and made me look like a fool in front of myself,... a pretty odd comment but it let's me hit off some air and let's others resonate and feel good bout themslvs
Bhaiya exam khatam hone ke baad 1 week deke 20 videos khatam kar diya...
Ab saath saath chalenge 🧡🧡🧡
Thank you for this amazing course🔥🔥🔥🔥🔥
Aatankwadi tu office me boom hi laga dega
Thanku soo muchh bhaiya ya strategy unique aur sabsee bestt hai aap padhai k saath acche platform k questions bhi kara rahe thanku soo much bhaiya #PlacementHogiApni