Question d’entretien chez Meta
Let A be an nxm Boolean 2D array. Find the largest subarray containing only 1s.
Réponse à la question d'entretien
Utilisateur anonyme
31 janv. 2015
This question had a "black ninja" designation in the "Elements of Programming Interviews". So I found it a bit unfair expecting me to solve it from scratch in 20 minutes over phone.