Https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/

#1

Is this approach correct


Or Do I have to do like this
For each I, I will have to check for each j or

We can check for consecutive only.

#2

Just count the number of soldiers in each row, store it in a vector of pairs where first value will be number of soldiers and second value will be row index. Sort the vector and display the first k row indices.

#3

Thanks for this Awesome Method Sir.

#4

Welcome. Please mark your doubt as resolved now.

#5

Bro wo pehle waala doubt please clear krdete
Ya rehnedu?

#6

The approach of your code is not right I guess. So I suggest you to attempt this question with the approach I told you as it is easy to understand and code.

#7

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.