Validate matrix complete

Last updated: October 17, 2025

Quick Overview

Given a matrix, write a function to validate whether it is a complete matrix, meaning all rows except possibly the last are of the same length, and the last row has all its elements filled from the left to the right without any gaps. The function should return a boolean value indicating whether the matrix is complete.

Figma
Coding & Algorithms
Software Engineer
Figma
October 17, 2025
Software Engineer
Technical Screen
Coding & Algorithms
Hard

36

0

5,000 solved


Given a matrix, write a function to validate whether it is a complete matrix, meaning all rows except possibly the last are of the same length, and the last row has all its elements filled from the left to the right without any gaps. The function should return a boolean value indicating whether the matrix is complete.

This coding problem is frequently asked during Technical Screen at Figma. The interviewer is testing your ability to translate a problem into clean, working code while discussing time and space complexity. Figma expects candidates to write production-quality code, not just solve the puzzle.

What the Interviewer Expects
  • Quickly identify the optimal approach and its theoretical basis
  • Handle complex algorithm design with multiple interacting components
  • Write concise, elegant code under time pressure
  • Prove correctness of your approach and discuss alternative solutions
  • Optimize beyond the obvious: discuss constant factor improvements
  • Address follow-up variations and explain how the solution generalizes
Key Topics to Cover
Time and space complexity analysis
Tree structures and recursion
Common algorithm patterns (sliding window, two pointers, BFS/DFS)
Data structure selection and trade-offs
How to Approach This
  1. Clarify input constraints and edge cases before writing code.
  2. Walk through your approach verbally and confirm with the interviewer before coding.
  3. Start with a brute force solution, then optimize. Mention time and space complexity.
  4. Test your solution with examples, including edge cases like empty input or duplicates.
  5. Consider common patterns: sliding window, two pointers, hash map, BFS/DFS, dynamic programming.
Possible Follow-up Questions
  • Can you optimize the space complexity of your solution?
  • How would you test this solution thoroughly?
  • How would your solution change if the input was sorted?
  • How would you parallelize this solution?
Sharpen Your Skills on Codemia

Practice similar problems with our interactive workspace, get AI feedback, and track your progress.

Practice DSA Problems
Sample Answer
Problem Analysis

To determine if a matrix is complete, we need to identify its structure: all rows except possibly the last must have the same length, and the last row must be filled from left to right without any gap...

Approach
  1. Initialize a variable to store the expected length of rows based on the first row of the matrix.
  2. Iterate through each row of the matrix:
    • For each row, check if its length matches the expect...

Submit Your Answer
Markdown supported

Related Questions