วีดีโอ

what is time complxity and space?

Thank you for the dry run

Is there a more optimized solution for this? As , on leetcode , it's the second best solution to the problem.

try to speak fully in english mam

Coding wo bhi Java se thanks uuu best approach seekhne ko milega 🥹🥹🥹mast daily krana di 🤩

sorry but was breaking for matrix = [[-1,0,-1],[-2,1,3],[3,2,2]]

buy a ticket and restore your streak.

congratulations for 5k subscribes

// // The below problem has 4 test cases // // 1) All are +ve, no issues // // 2) Even no. of -ve, no issues // // 3) Odd no. of -ve // // 4) Odd no. of -ve & a zero (Here's the c++ soln) class Solution { public: long long maxMatrixSum(vector<vector<int>>& matrix) { int r = matrix.size(); int c = matrix[0].size(); int neg = 0; // Count of negative numbers long long sum = 0; // Total sum of absolute values int minAbs = INT_MAX; // Minimum absolute value in the matrix bool hasZero = false; // Flag to check for zero for (int i = 0; i < r; i++) { for (int j = 0; j < c; j++) { int val = matrix[i][j]; if (val < 0) neg++; if (val == 0) hasZero = true; sum += abs(val); minAbs = min(minAbs, abs(val)); } } if ((neg & 1) == 0 || hasZero) { // All positive,even negatives or zero present return sum; } else { // Odd negatives and no zero return sum - 2 * minAbs; } } };

Haina, please, next time try to elucidate more "Why", thank you:)

I didn't get the 2 deduction part, one more query how you come this logic does it follow some pattern. if there any related problems please share those too for reference thank you.

thank you for the video, well explain . radhe radhe

thank you madam ji for the solution. Radhe Radhe.

Just In Time.!!

Understood the concept

How to sol any questions/ also logic ? Lot's of people say sol question on leetcode 200+ then logic automatically come it's true?

Okay! Haina 😄 Thank you for taking the time for us.

Thanks, Hena? It's quite knotty to understand but well try!

thank you for the solution. Radhe Radhe. create a youtube community to post updates..

I think you should Improve your Audio quality, as audio is too low

the audio base is very low...

Why don't you start your java course ? You explain wonderful

thank you for the video, well explain. Radhe Radhe

Great work !

Great to see you back, I hope everything is good

Thank you didi for this amazing explanation 😊

thank you for the solution. please try to upload every day problem. Radhe Radhe

Thank you di. Will solve after 5 days. End semester exams going on.

i am back couldnt do this one so had to see ur video. going strong 62 days

Please post solutions regularly.

181 days of streak gone

be consistent

Nice and detailed Explanation

here's the c++ code for the above question: class Solution { public: #define ll long long vector<string> ans; void helper(ll open, ll close, ll total, string x) { if(x.size() == total) { ans.push_back(x); return; } if(open < total / 2) { x += '('; helper(open + 1, close, total, x); x.pop_back(); } if(open > close) { x += ')'; helper(open, close + 1, total, x); } } vector<string> generateParenthesis(int n) { string x = ""; ll total = 2 * n; helper(0, 0, total, x); return ans; } };

good explanation

what a simple way explanation didi,, thanx

good explaination😇 Radhe Radhe😀

12 Nov ka POTD ??

very nice expanation

great approach

What's the time and space complexity and their percentage among others

how you developed your logic skill.. i am trying hard but still lacking can you help me please

Please create videos in English, I am from Telugu I also understand English but not Hindi

at 9:20 why r u taking the ans =n+1 or 4 ?

Thankyou so much maam , Radhe radhe !

Radhe Radhe. thanx you for the solution. really very helpful.

aur voice bhi thoda tej kar dijiye mam

good explain mam....sath me thod concept bhi explain kr diya karo

Thank you di. solved today's problem of the day 😃

❤❤