← Circle Interview Insights

Circle·Software Engineer·Online Assessment (OA)·Intermediate

Intermediate
May 2026

Summary

Did an online assessment for a Software Engineer role at Circle. The coding problem wasn't conceptually hard but it ate up more time than expected just dealing with string filtering and sorting mechanics.

Questions Asked (1)

Q1

Given a list of tasks at a specific point in time, filter out tasks whose names contain a given substring, then sort and print the results.

Algorithms & Data Structures
Author's notes

The logic itself wasn't the issue.

Create a free account to read the full note

AI HintsAI Generated

Suggested Approach

Start by clarifying the requirements: input format, substring matching (case-sensitive?), sorting criteria (lexicographical?), and output format. Then outline an algorithm: iterate through tasks, filter by substring, sort the filtered list, and print. Discuss time/space complexity and potential optimizations.

Pro tip: Mention that you would use the language's built-in filter and sort functions for clarity and efficiency, but also be prepared to implement them manually if asked. Highlight edge cases like empty list, no matches, and case sensitivity.

1. Clarify Requirements

Ask about input format (list of strings?), substring matching (case-sensitive?), sorting order (ascending?), and output format (print each on new line?).

2. Outline Algorithm

Describe a step-by-step approach: filter tasks containing substring, sort the filtered list, then print each task.

3. Discuss Implementation

Choose a programming language and write pseudocode or actual code. Use built-in functions like filter and sort for simplicity.

4. Analyze Complexity

State time complexity: O(n) for filtering, O(m log m) for sorting (m = filtered size), overall O(n + m log m). Space complexity: O(m) for filtered list.

5. Test with Examples

Walk through a sample input, including edge cases like empty list, no matches, and case sensitivity.

Key Points to Mention

  • Case sensitivity in substring matching
  • Sorting algorithm choice and stability
  • Time and space complexity analysis
  • Edge cases: empty list, no matches, duplicate tasks
  • Use of built-in functions vs manual implementation
  • Output format: printing each task on a new line

AI-generated suggestions, not part of the candidate's original notes. May be inaccurate — verify before relying on them.