class Solution {
public:
int leastBricks(vector<vector<int>>& wall) {
int row=(int)wall.size();
unordered_map<int ,int> hash;
int sum=0;
for(int i=0;i<=row-1;i++)
{
sum=0;
for(int j=0;j<=wall[i].size()-1;j++)
{
sum+=wall[i][j];
if(j!=wall[i].size()-1)
hash[sum]++;
}
}
int max=0;
for(const pair<int,int>&p:hash )
max=max>p.second? max:p.second;
return row-max;
}
};
public:
int leastBricks(vector<vector<int>>& wall) {
int row=(int)wall.size();
unordered_map<int ,int> hash;
int sum=0;
for(int i=0;i<=row-1;i++)
{
sum=0;
for(int j=0;j<=wall[i].size()-1;j++)
{
sum+=wall[i][j];
if(j!=wall[i].size()-1)
hash[sum]++;
}
}
int max=0;
for(const pair<int,int>&p:hash )
max=max>p.second? max:p.second;
return row-max;
}
};