Leetcode 2397. Maximum Rows Covered by Columns | Biweekly Contest 86.

Use coupon ALISHA on any GeeksforGeeks course to get 10% discount:
practice.geeks...
Connect with me on LinkedIn : / alisha-parveen-80579850
Check out our other playlists:
Dynamic Programming:
• Dynamic Programming
Trees:
• Trees
Heaps and Maps:
• Heaps and Maps
Arrays and Maths:
• Arrays and Maths
Bit Manipulation:
• Bit Manipulation
Greedy Algorithms:
• Greedy Algorithms
Sorting and Searching:
• Sorting and Searching
Strings:
• Strings
Linked Lists:
• Linked Lists
Stack and Queues:
• Stacks and Queues
Two Pointers:
• Two pointers
Graphs, BFS, DFS:
• Graphs, DFS, BFS
Backtracking:
• Backtracking
Non- DSA playlists:
Probability:
• Probability
SQL-Basic Join functions:
• SQL - Basic JOIN Funct...
SQL-Basic Aggregate functions:
• SQL-Basic Aggregate Fu...

[@probabilitycodingisfunis1]

leetcode.com/contest/biweekly-contest-86/problems/maximum-rows-covered-by-columns/
int maximumRows(vector& mat, int cols) {

int currentCols = 0;
vectorvisited(mat[0].size(),false);
int ans = 0;
pickColumns(mat, cols, 0, currentCols, visited, ans);
return ans;
}

void pickColumns(vector& mat, int cols, int index, int currentCols,
vector&visited, int&ans)
{
if(index == mat[0].size())
{
int count = 0;
for(int i=0;i

[@thetechmasum]

awesome coding style. I liked the way you go and declare variables depending on requirements. 👍

[@PRIYAKUMARI-ey1hh]

Your explanations are awesome

[@curosity276]

great explanations ,and u were looking great.

[@iamgroot20]

great explanation

[@maheriyajatinbharatbhai3538]

Nice explanation 😇

[@kwakukusi4094]

fantastic explanation.

[@chandraprakashsahu8557]

problem is beautiful as you are Thank you for the explanation 🙏