Detect permutation in matrix

Last updated: April 25, 2026

Quick Overview

Given a matrix of integers, determine if any row or column is a permutation of another row or column. You should return a boolean value indicating whether such a permutation exists. The input will be a 2D array of integers, and the output will be true if a permutation is found, otherwise false.

HubSpot
Coding & Algorithms
Machine Learning Engineer
HubSpot
April 25, 2026
Machine Learning Engineer
Technical Screen
Coding & Algorithms
Medium

100

7

3,508 solved


Given a matrix of integers, determine if any row or column is a permutation of another row or column. You should return a boolean value indicating whether such a permutation exists. The input will be a 2D array of integers, and the output will be true if a permutation is found, otherwise false.

Coding interviews at HubSpot 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
Binary search and divide and conquer
Graph algorithms and traversal
Data structure selection and trade-offs
Time and space complexity analysis
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
  • What if the input doesn't fit in memory?
  • How would you modify your solution to handle streaming input?
  • Can you solve this iteratively instead of recursively (or vice versa)?
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 any row or column in a given matrix is a permutation of another, we need to identify the underlying pattern of how permutations work. A permutation of an array contains the same elemen...

Approach
  1. Extract Rows and Columns: First, we will extract all rows and columns from the matrix into separate lists. For example, given the matrix:
    [[1, 2, 3], [3, 2, 1], [4, 5, 6]] ...

Submit Your Answer
Markdown supported

Related Questions