Maximum Matrix Sum | Simple Thought Process | Leetcode 1975 | codestorywithMIK

[@crazygamerrohan9899]

Definitely, things take time, and I am ready to give my time.

[@jain5184]

end sem exams are there and here i m solving daily problems obsessed hogaya hu roz new sikhna thought process clg ki padhai touch tak nhi kari but hum engineer hai aaj rat bhar baithkr pass hona jitna likhdenge thnku mik bhaiya for being consistently uploading daily videos bas apki wajah se coding me interest aya hai ..

[@shigoeditz7079]

Same bhai

[@DrOnZeR2022]

bro also take care of your cgpa if u want to sit in campus placement bcz if u dont able to clear the cutoff then u r not allowed to sit in placements

[@jain5184]

@ han yes bhai 7 ke upar hai

[@DrOnZeR2022]

@@jain5184 that's good❤️

[@DrOnZeR2022]

@@jain5184 kha se ho bhai or konse year me ho konse clg me?

[@deepakd6252]

Bro maine jab question deka tho hope chod diya tha ki kaise manuplate kare simulation kare. Par apne tho alag hi level pe , really yaar thank you so much

[@fr4nkyyy720]

very help full approach , thank you!!

[@hare_krishna8411]

its never too late..❤

[@amanpaliwalvlogs6860]

Radhe Radhe ❤

[@codestorywithMIK]

Radhe Radhe ❤️🙏

[@DEEPJAIN_]

wow the thought process blown my mind thnku so much aisa intutuion pata nhi kab build hoga

[@thekindspill]

Keep practising. Hojaega

[@sumithitsyt4093]

awesome explanation you are my one of the favorite youtuber thanks a lot🧡

[@thekindspill]

I liked this problem . Good one

[@basu8870]

solve by own more than 3 months I following mik it was very helpful for me thanku🤞🤞 this is my approach class Solution { public: long long maxMatrixSum(vector& matrix) { long long ans=0; int minval=INT_MAX; int countneg=0; for(int i=0;i

[@aws_handles]

0:35 It’s never too late ❤

[@mohd-afnan-shahab]

Assalamualaikum Bhaiyya, my Amazon SDE interview is scheduled for 3rd December. I’d really appreciate some last-minute tips...

[@codestorywithMIK]

Dear Afnan, First of all, best of luck for your Amazon SDE interview. You have got this! For last-minute tips: Don’t study anything new. Focus on common patterns like sliding window, binary search, recursion, and dynamic programming. Revise problems you've already solved. System Design (if you are experienced 1-2 years) : If applicable, keep concepts like scalability and database choices in mind. Behavioral Questions: Use the STAR method (Situation, Task, Action, Result) to frame your answers. Amazon loves leadership principles, so align your responses with them. Relax and get a good night’s sleep before the interview to stay sharp and confident. You’re well-prepared - trust your hard work. Do let us know how it goes 😇🙏❤️

[@ugcwithaddi]

Thank you so much

[@ritikgupta1196]

What if there is a zero in the matrix? Even if the negative number count is odd, we can still make all numbers positive. Is this actually an edge case or am I just overthinking? I wrote this solution: class Solution { public: long long maxMatrixSum(vector& matrix) { int n=matrix.size(); bool iszero=false; int count=0; int element_to_delete=INT_MAX; long long ans=0; for(int i=0;i

[@rushabhlegion2560]

class Solution { public: long long maxMatrixSum(vector& matrix) { long long sum = 0; int negCount = 0, minNum = INT_MAX, n = matrix.size(); for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) { sum += abs(matrix[i][j]); if(matrix[i][j]

[@himadrinath1502]

segment tree sa kiya bhai mena.

[@rushabhlegion2560]

@@himadrinath1502 Can you share your solution over here?

[@AtulBhadouriya-m8s]

Sir,,please post solutions of leetcode biweekly as well as weekly contest ,,,it would be of great use for all of us in terms of learning through those problems...

[@codestorywithMIK]

I got some time today and posting Qn-3 of today’s contest. It’s a very good problem and an ideal candidate to come in interview. Make sure you try it. If i find some more time today, i will post other Qns as well ❤️🙏

[@asutoshbikun]

​@@codestorywithMIKplease sir, try to post contest questions also.

[@asutoshbikun]

​@@codestorywithMIK atleast last two questions