RepostedVanta logo

Vanta · Phone screen

In process

Vanta SWE Phone Screen: Task Order and Reruns: 1 Experience

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

A 2026 Vanta first-round phone screen: 60 minutes of runnable coding on task build order, then which tasks rerun when files change.

At a glance

  • Process: one 60-minute coding screen where the code had to run (report 01)
  • Asked recently: output every task needed for a target in dependency order; then find the tasks to rerun after files change (report 01)
  • Difficulty: the candidate rated it average and was waitlisted
  • Practise first: Task Build Order and File-Change Reruns

Coverage: One experienced engineer with a Master's degree, changing jobs, who came in through a recruiter. The report covers the first-round phone screen. It gives October to December 2026 as the interview period and went up on November 18, 2026.

What came up

Both parts are graph questions on the same task-dependency data, and the second reuses the first. The candidate first tried breadth-first search for the ordering, found it did not produce a correct order, and switched to depth-first search.

Topic Reports Last seen
Coding: dependency order for a target task 1 of 1 Nov 2026 (report date)
Coding: tasks to rerun after files change 1 of 1 Nov 2026 (report date)

Questions we found

Algorithms / Data Structures

Question Reports Last seen
Given tasks and their dependencies, output every task a list of tasks needs, in a valid order; then, with files attached to tasks, find the tasks to rerun (practice) 1 Nov 2026 (report date)

1 detailed candidate timeline, loops, and screens

01: Experienced SWE, first-round phone screen

Interview period: 2026 Q4 · Report date: November 18, 2026 · Role: Software engineer · Degree listed: Master's · Channel: Recruiter · Candidate's rating: Positive experience, average difficulty · Result: Waitlisted

  1. Part 1. Each task has a list of tasks it depends on. Given a list of tasks, output every task that must run, in an order where dependencies come first. In the example the list holds just task1, which depends on task2 and task3, and the expected output is task3, task2, task1. You may assume there are no cycles. The candidate first planned a breadth-first search, walked through it, saw it couldn't produce a correct order, and switched to depth-first search.
  2. Part 2. Tasks now also list the files they use. Given some changed files, which tasks need to rerun? The candidate built reversed adjacency lists, from each task to the tasks that depend on it and from each file to the tasks that use it, then reused the depth-first function from part 1. They note breadth-first search would also work here, but reusing their code saved time.

FastPrep's practice version is Task Build Order and File-Change Reruns.

Result

The candidate was waitlisted when they posted.

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.