3371. Identify the Largest Outlier in an Array | Hash Table | Math

[@ARYANMITTAL]

C++ Code - leetcode.com/problems/identify-the-largest-outlier-in-an-array/submissions/1467120998/
Please do share with your friends or social media, it will be super super helpful 🥺

[@goldenx2417]

Thank you Bhaiya for cpp solution ❤

[@stith_pragya]

Thanks a ton for the help......🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻
Great Explaination.......
Keep posting such videos, it is really helpful.....🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

[@debaratighatak2211]

your explanation is soo good 🙏 thanks for covering all the edge cases so well

[@travellingsim2174]

Great explanation!

[@neversettle756]

Great explanation

[@MANIKANTAKORIMILLI-k8r]

Great video aryan.!

[@VK_BRANDING]

great man >>

[@Its_Shubham_Negi]

Thanks bhaiya !!!!

[@devsharma181]

Why are we maximising the outlier ? Why not simply assigning answer to the potential outlier

[@user-oi3iu7np9l]

question requires us to maximize it

[@dayashankarlakhotia4943]

public int getLargestOutlier(int[]nums){
int ans=Integer.MIN_VALUE,totSum=0;
Mapmpp=new HashMap();
for(int num:nums){
totSum+=num;
mpp.put(num*2,mpp.getOrDefault(num*2,0)+1);
}
for(int num:nums){
int sum=totSum-num;
if(mpp.getOrDefault(sum,0)>=2||(mpp.getOrDefault(sum,0)==1)&&(sum!=num*2))
ans=Math.max(ans,num);
}
return ans;
}
🎉❤