i've no words for the way you explained everything. I'm grateful i found you and your yt channel. lots of love ❤ May God Bless you❤
@Sachin.-sd3gx7 күн бұрын
@Anad Pandey self doubt is the main reason
@Rama_banthula15 күн бұрын
Bro my friend answered 9 out of 11 questions correct in video interview technical round 1 will he able to pass the chances of round 1? How many days took for round 1 result? In optum
@seifgad4_516 күн бұрын
impressive, very useful video thank you
@chandanpandey345925 күн бұрын
Jo company me coding question aate hai to uska input bhi likte jai ke kevol logic like leetcode jaise
@Thisisganpati27 күн бұрын
Sir mai abhi nit Delhi me 1st year student hu kya aap bataoge aapka kitana ka pakage laga tha❤
@akepatithrisaileswari1763Ай бұрын
Does the interview goes with in person or remotely ??
@aashu90Ай бұрын
9:07
@aashu90Ай бұрын
8:02
@himanshukumar-po2jvАй бұрын
First year wale bhi new building me padhenge
@padmavathikoduru8120Ай бұрын
Hi
@kushalsinhabikerways3004Ай бұрын
Cheating is possible or not ?
@TonyStark-br8osАй бұрын
Very clear video, please upload more with github link for the same.
@aryand73042 ай бұрын
Nice video, can you make a video on novartis, it is organizing a challenge called NEST & hiring students through it
@nagarajutalada72042 ай бұрын
Hello sir I am Nagaraju Talada i am studying master of commerce completed.if any vechancy s in your organisation in accounts department
@aarjavjain30742 ай бұрын
Please provide the github code for the same
@SaurabhJeena-sh4gh2 ай бұрын
done by myself no hints class Solution { public int maxSumMinProduct(int[] nums) { long max=Long.MIN_VALUE; Stack<Integer> stack=new Stack<>(); long [] prefixSum=new long [nums.length]; int [] ns=new int [nums.length]; int [] ps=new int [nums.length]; long sum=0; for(int i=0;i<nums.length;i++){ sum=sum+nums[i]; prefixSum[i]=sum; } for(int i=ns.length-1;i>=0;i--){ while(!stack.isEmpty()&&nums[stack.peek()]>=nums[i]){ stack.pop(); } if(stack.isEmpty()){ ns[i]=nums.length; } else{ ns[i]=stack.peek(); } stack.push(i); } stack.clear(); for(int i=0;i<nums.length;i++){ while(!stack.isEmpty()&&nums[stack.peek()]>nums[i]){ stack.pop(); } if(stack.isEmpty()){ ps[i]=-1; } else{ ps[i]=stack.peek(); } stack.push(i); } for(int i=0;i<nums.length;i++){ long leftsum; if(ps[i]==-1){ leftsum=0; } else{ leftsum=prefixSum[ps[i]]; } long rightsum=prefixSum[ns[i]-1]; long maxMinProd=nums[i]*(rightsum-leftsum); max=Math.max(max,maxMinProd); } int mod=1000000007; return(int) (max%mod); } }
@pragyaprabirranjandeka15833 ай бұрын
Thank you....very much informative✨️
@sourav_22_113 ай бұрын
SQL resume m ho ya na ho , phir bhi question puchte hi puchte h kya ?? hmesha puchte hi h kya sql queries s questions??????????
@sourav_22_113 ай бұрын
SQL resume m ho ya na ho , phir bhi question puchte hi puchte h kya ?? hmesha puchte hi h kya sql queries s questions??
@sourav_22_113 ай бұрын
SQL resume m ho ya na ho , phir bhi question puchte hi puchte h kya ?? hmesha puchte hi h kya sql queries s questions??
@sourav_22_113 ай бұрын
kaafi sahi bnda h bhai tu !!!
@ChaitraS-o6c3 ай бұрын
How to cheat in coding ? Round
@princekirar48904 ай бұрын
Hi nice video , can you share the Github link for same ?
@anushkasoni284 ай бұрын
optum mnc hai ?
@sangeeta58834 ай бұрын
Heello
@shreyasachdeva45484 ай бұрын
Tomorrow is my optum hr round for the intern role, how should i prepare for it? Should I go for preparation of the technical questions also?
@AnandPandeyHere4 ай бұрын
@@shreyasachdeva4548 HR won’t ask you technical questions, relax
@prishasingh15904 ай бұрын
Hi how did your interview go? I have mine in 2 days..can you please share details?
@manviiiiiiii4 ай бұрын
hi shreya! Congrats on making it till hr. How did it go? I have mine tomorrow, can we connect somewhere?
@thegeekb0y4 ай бұрын
Bro, just curious - If you get some issue on prod, and you solve it in lower environments and approved by qa, do you immediately push to prod or wait for the release day?
@AnandPandeyHere4 ай бұрын
@@thegeekb0y can’t wait for release day if it’s an on call escalation
@ranjanpandey43395 ай бұрын
Keep Posting 👌👌👌
@ranjanpandey43395 ай бұрын
✌️✌️✌️✌️✌️
@HamariKirtanPooja5 ай бұрын
,,,👌👌👌
@peakyblinderzz5 ай бұрын
😂😂😂
@gunjanpandey4685 ай бұрын
👍
@AakuChelsea5 ай бұрын
Very informative video Sir
@Programming-for-all-u2l5 ай бұрын
English please
@3lpme5 ай бұрын
brilliant idea mate but how to develop such an idea
@AnandPandeyHere5 ай бұрын
Practice Practice Practice
@dhruvinmehta535 ай бұрын
Where should i learn dsa and what should be the roadmap or techniques.
@zhatu216 ай бұрын
perfect crisp explanation bhai
@jayeshpatil57576 ай бұрын
19:02 21 july 2024
@Ankit_nit-B6 ай бұрын
Bhaiya nit Agartala electrical and nit Delhi mechanical which is better
@ipranavprashant6 ай бұрын
😂
@anubhavpandey69477 ай бұрын
Very helpful
@AnandPandeyHere5 ай бұрын
Glad to hear that
@HamariKirtanPooja7 ай бұрын
Very nice containts 🎉
@shivaniozra.7 ай бұрын
Customer support walo ko bhi milti h kya. Welcome kit.
@AnandPandeyHere5 ай бұрын
No idea
@achalatwal57 ай бұрын
And false positives?
@AnandPandeyHere7 ай бұрын
Good point. Bloom filter can contain false positive but never the other way around. We can reduce the false positives by creating better hash functions. Lesser the collisions, lesser the false positives.
@HamariKirtanPooja7 ай бұрын
Very nice containts
@nareshbabugunji42223 ай бұрын
How did u calculated hash for bloom to get the value
@biratraj39907 ай бұрын
mms mil gai ab toh
@amanbarnawal17037 ай бұрын
I got selected as tdp intern at optum and have some shark tank thing going on, will they convert to ppo?
@AmarKumar-uk8ktАй бұрын
Hello Bhai aapse baat karni thi about Optum TDP intern as I am selected in that too now plz tell me kese kya hota hai?? PPO mil jaata hai kya isme??