Find longest subsequence in array
Last updated: May 5, 2026
Quick Overview
Given a array, find the connected components efficiently using BFS.
Compass
May 5, 202616
10
3,079 solved
Given a array, find the connected components efficiently using BFS.
This coding problem is frequently asked during Onsite at Compass. The interviewer is testing your ability to translate a problem into clean, working code while discussing time and space complexity. Compass expects candidates to write production-quality code, not just solve the puzzle.
What the Interviewer Expects
- Identify the correct data structure and algorithm for the problem
- Write clean, bug-free code with proper variable naming
- Analyze time and space complexity correctly
- Handle basic edge cases (empty input, single element)
- Communicate your thought process while coding
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
- Can you solve this iteratively instead of recursively (or vice versa)?
- Can you solve this in a single pass?
- What if the input doesn't fit in memory?
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
The problem requires us to find the longest connected components in an array using BFS (Breadth-First Search). This is applicable here because we can treat the array elements as nodes in a graph, wher...
Approach
- Prepare a Graph Representation: Use a dictionary (hash map) to represent the connections between elements of the array. Each key will be an element, and its value will be a list of connected el...
Submit Your Answer
