3132 & 3131 Find the Integer Added to Array II | 3131. Find the Integer Added to Array I

In this video, I'll talk about how to solve Leetcode 3132 & 3131 Find the Integer Added to Array II | 3131. Find the Integer Added to Array I
Let's Connect:
📱Discord (Join Community) : / discord
📝Linkedin: / aryan-mittal-0077
📸 Instagram: / ez.pz.dsa
💻 Twitter - / aryan_mittal007
🤖 Github: github.com/ary...
About Me:
I am Aryan Mittal - A Software Engineer in Goldman Sachs, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)
✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms

[@HimanshuYadav-pp2ue]

because of you i can easily and consistently upsolving the contest love your consistency

[@MB-hn5qk]

In the first brute force approach of the Second problem, wouldn't the TC be O(n^3) instead of O(n^2)? Because rechecking for the diff would be O(n) too, not O(1). Because, after removing 2 elements from nums1, we would need to check the validity of the difference throughout the arrays (modified nums1 and nums2), as the diff could be inconsistent for some cases of removing 2 elements from nums1. Nice Explanation BTW!

[@gauravagrawal7988]

exactly

[@pranavreddy-do9ck]

since you have sorted it taking diff would be O(1) only because, suppose consider 1st array of size 5 and 2nd array of size 3 now ,if you remove 1st and 3rd element of 1st array you could directly take diff nums2[0] - nums1[1] 2nd element and keep on checking min of diff throught O(n^2) iterations

[@user-wj5jt6zf8h]

Firstly I thought the same generating all pair in o(n2) then for checking the diff in o(n) make it o(n3)
But no need to generate pair as element are sorted check for single element only and number of same diff should be greater than or equal to num2.size then in similar fashion check for each element make it o(n2)
And he further optimize it in o(3n) by taking element first second and 3rd only

[@vinayaksinghal]

@@pranavreddy-do9ck no bro, we would have to go through it all only

[@vinayaksinghal]

yes, exactly
class Solution {
private:
int solve(vector& nums1, vector& nums2){
int n=nums1.size();
int m=nums2.size();
int i=0;
int j=0;
while(nums1[j]==-1){
j++;
}
int ans=nums2[i]-nums1[j];
j++;
i++;
while(i

[@apputadhiyal9451]

well explained!

[@maddycoder1294]

very good explanation

[@nikhillasinkar2233]

👍👍

[@ujjwalrockriser]

I solved 2nd using O (n ^ 3) brute force of brute force approach 😂 and It worked too 😂

[@bhuvanak4157]

could you please share the code

[@YashMalav-kh1ov]

@@bhuvanak4157 int minimumAddedInteger(vector& nums1, vector& nums2) {
int n = nums1.size();
int m = nums2.size();
sort(nums1.begin(),nums2.end());
sort(nums2.begin(),nums2.end());
int j=0;
int ans = 1e9;
int index = 0;
int i = index;
while(index

[@shashanksahu9230]

Me too😅

[@vinayaksinghal]

@@bhuvanak4157
class Solution {
private:
int solve(vector& nums1, vector& nums2){
int n=nums1.size();
int m=nums2.size();
int i=0;
int j=0;
while(nums1[j]==-1){
j++;
}
int ans=nums2[i]-nums1[j];
j++;
i++;
while(i

[@goyaldeekshant]

very well

[@monilcharola6873]

:)

[@ARYANMITTAL]

Problem3 of today's Contest - ua-cam.com/video/eA1xIDUqIDc/v-deo.html
.
Do make sure to join Discord for doubts, discussion & active problem Solving ❤

[@YashMalav-kh1ov]

my 2nd part approach was just similar and even after so many bound and checks i got run time error🥲