← Back to Directory

Together AI

Mid-sized

Screna has 4 Together AI interview write-ups. The most reported round is the technical phone screen (3).

4 interview notes · updated Jul 2026

Together AI·Software Engineer·Technical Phone Screen

Jun 2026
Interviewed at together.ai and got a graph theory problem that I've seen before but still managed to overthink in the moment.
  • Given a set of pods where each pod can depend on other pods, detect whether the dependency graph contains a cycle.

“I knew this problem.”

View Post

Together AI·Software Engineer·Onsite - System Design / Architecture

Apr 2026
System design round at Together AI for a software engineer role. The whole thing was a deep dive into building a GPU-aware pod scheduler from scratch, and they really pushed on every layer of it.
  • Design an object-oriented, GPU-aware pod scheduler and cluster manager. Nodes track total GPUs and running pods, pods track GPU requirements. Implement APIs for adding/removing nodes and pods, scheduling a pod to a node with sufficient free GPUs, and querying utilization and listings.
  • What placement strategy would you use for scheduling pods onto nodes, and how do you justify that choice? Walk through how your indexes get updated on every add, remove, schedule, and evict operation.
  • How would you handle concurrency, specifically simultaneous pod scheduling requests and node additions? What guarantees do you provide around idempotency and failure handling?
  • Write pseudocode for the schedule_pod function using your chosen placement strategy. Include time and space complexity analysis for each API.
  • How would you handle edge cases like a pod requiring more GPUs than any single node has, or fragmentation where many small pods occupy a large node leaving no contiguous capacity for a bigger pod?

“This was the core question and it took the whole session.”

View Post

Together AI·Software Engineer·Technical Phone Screen

Apr 2026
Technical phone screen for a software engineer role at Together AI. The whole thing was a graph problem, two parts, and it moved faster than I expected.
  • Given a directed graph representing software pod dependencies, detect whether the graph contains a cycle.
  • If the dependency graph contains a cycle, identify a single edge that can be removed to make the graph acyclic.

“Classic topological sort or DFS with a visited-state tracker.”

View Post

Together AI·Software Engineer·Technical Phone Screen

Apr 2026
Interviewed at together.ai and got a graph problem that I've seen before but still managed to overthink in the moment. Pretty standard technical screen, nothing too surprising about the format.
  • Given a set of pods with shared dependencies modeled as an undirected graph, detect whether a cycle exists and return any single edge whose removal would eliminate it.

“Classic redundant connection problem.”

View Post