cswork / libraryOpen practice workspace

Interview guides · Unify

Unify Software Engineer Interview Guide

Unify Software Engineer interview guide: reported rounds, questions and how candidates describe the process.

The 60-second brief

A Software Engineer at Unify plays a pivotal role in building and scaling the foundation of go-to-market technology. As part of an ambitious engineering team, you are responsible for architecting high-throughput systems, building intelligent AI-driven product workflows, and scaling critical infrastructure. Unify powers warm outbound sales platforms for fast-growing technology companies, replacing legacy cold outreach with intelligent, signal-based customer engagement. In this role, your technical contributions directly dictate system performance, reliability, and product execution. You will tackle complex engineering problems that span real-time event streaming, large-scale distributed data processing, durable workflow orchestration, and generative AI integrations.

This guide is scoped to a Software Engineer candidate at Unify.

Focus areas

  • DSA (Data Structures & Algorithms)
  • Problem Solving (Algorithmic Thinking)
  • Technical Fundamentals

The Unify interview process

Unify candidates report 3 rounds over 3-5 weeks. The stages below are what candidates describe, not a published process.

Initial Screens

Initial assessments to evaluate candidate's fit for the role.

What to demonstrate

  • Initial assessments to evaluate candidate's fit for the role
  • Depth in DSA (Data Structures & Algorithms)

How to prepare

  • Be able to walk your CV end to end in two minutes, and say why this company specifically.
  • Have your salary expectations, notice period and location constraints ready, and ask for the rest of the loop in writing.

Technical Interviews

In-depth technical assessments to gauge problem-solving skills and technical knowledge.

What to demonstrate

  • In-depth technical assessments to gauge problem-solving skills and technical knowledge
  • Depth in DSA (Data Structures & Algorithms)

How to prepare

  • Answer aloud and timed: Implement memory-efficient string matching and string parsing functions.
  • Answer aloud and timed: Traverse complex graph structures to find short paths or dependency cycles.

Final Evaluations

Final assessments with team leads or executives to determine overall fit within the team.

What to demonstrate

  • Final assessments with team leads or executives to determine overall fit within the team
  • Depth in DSA (Data Structures & Algorithms)

How to prepare

  • Answer aloud and timed: Solve algorithmic scenarios involving hash tables, pointers, and custom sorting implementations.
  • Answer aloud and timed: Explain virtual functions and runtime polymorphism in C++ or object-oriented languages.

Where candidates lose points

Master Core Fundamentals

Ensure you are comfortable explaining core operating system mechanics, object-oriented principles, multi-threading synchronization, and database query execution.

Practice Algorithmic Clarity

Speak out loud while solving coding problems. Clearly explain your initial thoughts, complexity trade-offs ($O(N)$ time vs. $O(1)$ space), edge case handling, and testing steps before writing final code.

Demonstrate Customer Obsession

Highlight how your technical decisions positively impact end users and business metrics. Unify deeply values engineers who sweat product details and care about real customer value.

Be Prepared to Discuss System Trade-offs

When designing architectures, do not just present a single solution. Compare alternatives (e.g., synchronous HTTP endpoints vs. asynchronous message queues with Apache Pulsar or Temporal) and justify your choice.

{$info

During project deep dives, highlight specific metrics such as throughput improvements, query latency reductions, or system uptime stats to make your engineering impact concrete.}

Questions & practice

Implement a function to detect if an undirected graph is bipartite.

Medium · Data Structures & Algorithms

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Solve array manipulation problems requiring optimal time complexity $O(N)$ and space complexity $O(1)$.

Medium · Data Structures & Algorithms

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Implement memory-efficient string matching and string parsing functions.

Medium · Data Structures & Algorithms

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

Traverse complex graph structures to find short paths or dependency cycles.

Medium · Data Structures & Algorithms

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Solve algorithmic scenarios involving hash tables, pointers, and custom sorting implementations.

Medium · Data Structures & Algorithms

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Explain virtual functions and runtime polymorphism in C++ or object-oriented languages.

Medium · Computer Science & Systems Fundamentals

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

Explain multi-threading concepts, synchronization primitives, race conditions, and deadlocks.

Medium · Computer Science & Systems Fundamentals

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

Explain how memory allocation and garbage collection operate under heavy system loads.

Medium · Computer Science & Systems Fundamentals

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

Explain event bubbling, target propagation, and asynchronous execution loops in JavaScript.

Medium · Web Development & Full-Stack Capabilitie

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

How do you optimize complex SQL queries and design optimal database indexes in PostgreSQL or ClickHouse?

Medium · Backend Systems & Data Engineering

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. Handle the rows that do not match: that is usually the actual question.

Follow-up

  • How does the query change if that join becomes one-to-many?
  • What happens to this when the table is ten times larger?

Explain why the owner filter ignores the listing index

Medium · composite index · query plans · sort elimination

The only index on resource is (tenant_id, status, updated_at DESC, resource_id DESC). A new endpoint returns one user's resources across all statuses, newest created first: WHERE tenant_id = $1 AND owner_user_id = $2 ORDER BY created_at DESC LIMIT 20. On a tenant with 2M rows it takes 900 ms and EXPLAIN shows a sort above a large scan. Explain precisely why the existing index cannot serve it, give the index that can, and state which of these the new index still will not help: owner_user_id alone across tenants; the same query ordered by updated_at. PostgreSQL 16.

Approach

  1. Separate the two jobs an index does. For filtering, a composite btree is seekable only on a left prefix, so with no predicate on status the scan can at best range over tenant_id and test owner_user_id per row; PostgreSQL 16 has no btree skip scan to jump the unconstrained column.
  2. For ordering, the index is sorted by (status, updated_at) within a tenant and not by created_at, so the LIMIT cannot stop early: every matching row is read and then sorted. That is the 'Sort Method: top-N heapsort' line, and it is why the plan reads 2M rows to answer with 20.
  3. Derive the replacement from the access path — equality, equality, then the ordering column: CREATE INDEX CONCURRENTLY ON resource (tenant_id, owner_user_id, created_at DESC). The scan seeks to the (tenant, owner) range and walks 20 entries in order, so the Sort node disappears along with the row-read.
  4. Treat INCLUDE (title, status) as conditional, not free. An index-only scan still visits the heap for any row whose page is not marked all-visible, so on a table taking 1.2k writes/second the win depends on autovacuum keeping the visibility map current, and the wider index costs more on every insert.

Follow-up

  • 90% of rows are status='active'. Would a partial index WHERE status = 'active' change your answer, and for which of the three queries?
  • A dashboard runs this for 40 owners in one page load. What changes about the design?

How does context switching work in operating systems, and what are its performance costs?

Medium · Computer Science & Systems Fundamentals

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

What are the key differences between abstract classes and interfaces in object-oriented design?

Medium · Computer Science & Systems Fundamentals

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

Compare synchronous REST API architecture with asynchronous message brokers like Apache Pulsar or Kafka.

Medium · Backend Systems & Data Engineering

Approach

  1. Say who the caller is and what they do when the call fails halfway.
  2. Define the identity of a request so a retry cannot double-apply it.
  3. Separate accepted, pending, failed and confirmed; they are different facts.
  4. Design the error taxonomy before the success shape; callers branch on it.

Follow-up

  • What happens if the caller retries after a timeout?
  • How does a client discover it is on an old version of this contract?

Explain the principles of database sharding, partitioning, and read-replica replication.

Medium · Backend Systems & Data Engineering

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

Describe how you would build scalable backend endpoints using TypeScript, Prisma, Python, or Java Spring Boot.

Medium · Backend Systems & Data Engineering

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

How do HTML5 web workers and modern browser APIs optimize client-side computation?

Medium · Web Development & Full-Stack Capabilitie

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

Discuss techniques for optimizing web asset delivery, page render times, and CSS3 layout performance.

Medium · Web Development & Full-Stack Capabilitie

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

How do you secure web APIs against cross-site scripting (XSS) and cross-site request forgery (CSRF)?

Medium · Web Development & Full-Stack Capabilitie

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

Explain how state is synchronized between client-side state managers and server backend services.

Medium · Web Development & Full-Stack Capabilitie

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

Walk through the technical architecture of a complex system or master's thesis project you delivered.

Medium · Architecture, Projects & Leadership

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

How do you translate ambiguous business requirements into a clear engineering architecture and rollout plan?

Medium · Architecture, Projects & Leadership

Approach

  1. Fix the scope first: who calls this, how often, and what they do when it fails.
  2. Name the read and write paths separately; they rarely have the same bottleneck.
  3. Choose a partition key and say what query it makes expensive.
  4. State the consistency you need, and where you are willing to be stale.

Follow-up

  • What breaks first when traffic grows ten times?
  • How does this behave when that dependency is down for an hour?

Describe a situation where a production service failed and how you debugged and resolved the outage.

Medium · Architecture, Projects & Leadership

Approach

  1. Establish what changed and when, before forming any theory.
  2. Pick a bisection that eliminates candidates whichever way it turns out.
  3. Check the instrumentation before believing the symptom.
  4. Separate the trigger from the cause; the deploy is rarely the bug.

Follow-up

  • What would you look at first, and what would it rule out?
  • How would you tell a cause from a coincidence here?

Suggested practice checklist

Built from the rounds and topics Unify candidates report.

Day 1 — Map the Unify loop

  • Write out the reported sequence: Initial Screens, Technical Interviews, Final Evaluations.
  • For each round, write one sentence on what it is judging, from the description above, and mark the one you are least ready for.

Deliverable: A one-page map of the 3 reported rounds, with the weakest marked.

Day 2 — Work DSA (Data Structures & Algorithms)

  • Spend the session on DSA (Data Structures & Algorithms), which Unify candidates report being tested on.
  • Write one worked example in DSA (Data Structures & Algorithms) and time yourself on it.

Deliverable: One timed worked example in DSA (Data Structures & Algorithms).

Day 3 — Work Problem Solving (Algorithmic Thinking)

  • Spend the session on Problem Solving (Algorithmic Thinking), which Unify candidates report being tested on.
  • Write one worked example in Problem Solving (Algorithmic Thinking) and time yourself on it.

Deliverable: One timed worked example in Problem Solving (Algorithmic Thinking).

Day 4 — Work Technical Fundamentals

  • Spend the session on Technical Fundamentals, which Unify candidates report being tested on.
  • Write one worked example in Technical Fundamentals and time yourself on it.

Deliverable: One timed worked example in Technical Fundamentals.

Day 5 — Answer out loud: Data Structures & Algorithms

  • Answer aloud, timed: Implement a function to detect if an undirected graph is bipartite.
  • Answer aloud, timed: Solve array manipulation problems requiring optimal time complexity $O(N)$ and space complexity $O(1)$.

Deliverable: Spoken answers to 2 reported Data Structures & Algorithms question(s), under time.

Day 6 — Answer out loud: Computer Science & Systems Fundamentals

  • Answer aloud, timed: Explain virtual functions and runtime polymorphism in C++ or object-oriented languages.
  • Answer aloud, timed: How does context switching work in operating systems, and what are its performance costs?

Deliverable: Spoken answers to 2 reported Computer Science & Systems Fundamentals question(s), under time.

Day 7 — Answer out loud: Backend Systems & Data Engineering

  • Answer aloud, timed: How do you optimize complex SQL queries and design optimal database indexes in PostgreSQL or ClickHouse?
  • Answer aloud, timed: Compare synchronous REST API architecture with asynchronous message brokers like Apache Pulsar or Kafka.

Deliverable: Spoken answers to 2 reported Backend Systems & Data Engineering question(s), under time.

Behavioural preparation

Behavioural rounds judge the decision you made and what it cost.

How do you handle durable workflow execution and task retries using engines like Temporal?

Medium · Backend Systems & Data Engineering

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

How do you approach trade-offs between rapid product shipping and long-term technical debt reduction?

Medium · Architecture, Projects & Leadership

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

Describe how you handle conflicting technical opinions or feedback from team members and technical leads.

Medium · Architecture, Projects & Leadership

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?