← AT&T Interview Insights

AT&T·Software Engineer·Technical Phone Screen·Intermediate

Intermediate
Jun 2026

Summary

Phone screen for a software engineer role, just one coding question with a follow-up variant. Pretty straightforward, nothing that should trip you up if you've done any interval-type problems before.

Questions Asked (1)

Q1

Given a list of entries each containing a timestamp and an intensity value, plus a threshold, return all contiguous time periods where the intensity exceeds that threshold.

Algorithms & Data Structures
Author's notes

Not a hard problem once you see it as a simple scan and merge intervals thing.

Create a free account to read the full note

AI HintsAI Generated

Suggested Approach

Clarify the input format and edge cases, then propose a single-pass linear scan that tracks the start of each above-threshold period and closes it when the intensity drops to or below the threshold. Discuss time and space complexity, and consider whether the list is sorted by timestamp or requires sorting first.

Pro tip: Mention that you would handle boundary conditions explicitly, such as periods that start at the first entry or end at the last entry, and ask whether the threshold comparison is strict or inclusive. This shows attention to detail and prevents off-by-one errors.

1. Clarify requirements and assumptions

Ask about input ordering, threshold inclusivity, and output format (e.g., start/end timestamps or indices). Confirm whether entries are sorted by timestamp and if timestamps are unique.

2. Design the algorithm

Propose a single-pass scan: iterate through entries, and when intensity exceeds threshold, record the start if not already in a period; when it drops to or below threshold, close the period and add it to results. Handle the case where a period extends to the end.

3. Analyze complexity and edge cases

State O(n) time and O(1) extra space (excluding output). Discuss edge cases: empty list, all above threshold, none above threshold, and single entry.

4. Implement and test

Write clean code with clear variable names, then walk through a few test cases to verify correctness, including boundary conditions.

Key Points to Mention

  • Single-pass linear scan with O(n) time complexity
  • Handling of period start and end, including open-ended periods
  • Threshold comparison: strict vs. inclusive
  • Edge cases: empty input, all above/below threshold, single entry
  • Output format: list of (start, end) timestamps or indices
  • Assumption about sorted input; if unsorted, sort first (O(n log n))

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