Validate grid complete
Last updated: March 20, 2026
Quick Overview
Given a 2D grid consisting of '0's and '1's, write a function to determine if the grid is complete, meaning that every row and every column contains at least one '1'. The function should return a boolean value: true if the grid is complete, and false otherwise.
10
5
58 solved
Given a 2D grid consisting of '0's and '1's, write a function to determine if the grid is complete, meaning that every row and every column contains at least one '1'. The function should return a boolean value: true if the grid is complete, and false otherwise.
Coding interviews at LinkedIn focus on problem-solving approach as much as the final solution. The interviewer wants to see you break down the problem, consider edge cases, and optimize iteratively. Communication throughout the process is key.
What the Interviewer Expects
- Recognize the underlying problem pattern (sliding window, two pointers, BFS/DFS, etc.)
- Discuss multiple approaches and trade-offs before coding
- Implement an optimal solution with clean, production-quality code
- Handle all edge cases including boundary conditions and invalid input
- Optimize both time and space complexity with clear justification
- Test your solution systematically with well-chosen examples
Key Topics to Cover
How to Approach This
- Clarify input constraints and edge cases before writing code.
- Walk through your approach verbally and confirm with the interviewer before coding.
- Start with a brute force solution, then optimize. Mention time and space complexity.
- Test your solution with examples, including edge cases like empty input or duplicates.
- Consider common patterns: sliding window, two pointers, hash map, BFS/DFS, dynamic programming.
Possible Follow-up Questions
- What if the input doesn't fit in memory?
- How would you parallelize this solution?
- Can you solve this in a single pass?
Sharpen Your Skills on Codemia
Practice similar problems with our interactive workspace, get AI feedback, and track your progress.
Practice DSA ProblemsSample Answer
Problem Analysis
To determine if the 2D grid is complete, we need to ensure that every row and every column contains at least one '1'. This problem can be approached using a frequency counting method, where we maintai...
Approach
- Initialize two lists to keep track of the counts of '1's in each row and each column. Let's call them
row_countandcol_count, both initialized to zero for each index. - Iterate through each c...
Submit Your Answer
