RepostedCresta logo

Cresta · Phone screen

In process

Cresta Senior SWE Coding Round Interview Experience: 1 Experience

Software engineer · Full-timeMaster's degreeReported Nov 17, 2026
Shared byjanebeingjane

A 2026 Cresta senior engineer's first coding round: find the peak chat load across agents from inclusive time periods, solved with a sweep line.

At a glance

  • Process: recruiter call → two one-hour coding rounds; this was the problem-solving round (report 01)
  • Asked recently: peak load from overlapping inclusive periods (report 01)
  • Difficulty: the candidate rated it average; the inclusive end is the detail to watch
  • Practise first: Peak Chat Load Across Agents

Coverage: One experienced engineer with a Master's degree, changing jobs, who applied online for a senior software engineer role. The report covers the first of two one-hour coding rounds that follow a recruiter call. It gives October to December 2026 as the interview period and went up on November 17, 2026.

What came up

The process is a recruiter call, then two one-hour coding rounds. This was the problem-solving round: find the peak chat load across agents from their active periods.

Topic Reports Last seen
Coding: peak load from overlapping periods with inclusive ends 1 of 1 Nov 2026 (report date)

Questions we found

Algorithms / Data Structures

Question Reports Last seen
Each agent has active periods with a start, an end (both inclusive) and a chat count; return the highest total load at any time and one time it occurs (practice) 1 Nov 2026 (report date)

1 detailed candidate timeline, loops, and screens

01: Senior SWE, first coding round

Interview period: 2026 Q4 · Report date: November 17, 2026 · Role: Senior software engineer · Degree listed: Master's · Channel: Online application · Candidate's rating: Neutral, average difficulty · Result: Pending when posted

The input maps each agent to a list of active periods, each with a start, an end and a number of chats; both ends count. The load at time t is the sum of chats over every period that contains t. Return the maximum load and a time when it happens. The candidate used a sweep line: flatten all periods, add the chats at the start and subtract them one step after the end (because the end is inclusive), then walk the changes in time order while tracking the current and best load. They compared with a strict greater-than so a tie keeps the earliest time, and say the inclusive end is the detail that's easy to miss. FastPrep's practice version is Peak Chat Load Across Agents.

Result

No result yet; the candidate planned to update the post.

Keep practicing

Sources: Anywhere useful interview info can be found.

0 total reactions. Your reactions: none.
0 comments

Comments

0

No comments yet — be the first to share what you know.