cswork / libraryOpen practice workspace

Interview guides · Perforce

Perforce Software Engineer Interview Guide

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

The 60-second brief

At Perforce, a Software Engineer does not just build standard consumer applications; they design and maintain the foundational tools, version control systems, static analysis engines, and DevOps infrastructure that power the world's most innovative technology companies. From industry standards like Helix Core to static analysis solutions like Klocwork and automation platforms like Puppet, the software you write directly impacts the productivity, security, and velocity of millions of developers globally. This means you will tackle challenges related to extreme scale, high performance, and deep technical precision. Working in this role requires a unique blend of systems-level thinking and practical application.

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

Focus areas

  • Problem Solving (Algorithmic)
  • Data Structures & Algorithms (DSA)
  • C++

The Perforce interview process

Perforce candidates report 5 rounds over 4-6 weeks. The stages below are what candidates describe, not a published process.

Conversational Screen

Initial discussion to evaluate your background and fit for the role.

What to demonstrate

  • Initial discussion to evaluate your background and fit for the role
  • Depth in Problem Solving (Algorithmic)

How to prepare

  • Answer aloud and timed: Explain the difference between a deep copy and a shallow copy in C++, and demonstrate how you would safely implement a custom copy constructor.
  • Answer aloud and timed: What are smart pointers in C++, and how do std::unique_ptr and std::shared_ptr manage memory under the hood?

Technical Evaluations

Involves a take-home coding challenge or a practical whiteboard session.

What to demonstrate

  • Involves a take-home coding challenge or a practical whiteboard session
  • Depth in Problem Solving (Algorithmic)

How to prepare

  • Answer aloud and timed: Walk through a design pattern you have used to solve a complex structural problem in a compiled language, explaining the trade-offs of your approach.
  • Answer aloud and timed: How does static code analysis identify potential null pointer dereferences or resource leaks without executing the code?

Deep-Dive Technical Discussions

Engage in detailed discussions about your technical decisions and approaches.

What to demonstrate

  • Engage in detailed discussions about your technical decisions and approaches
  • Depth in Problem Solving (Algorithmic)

How to prepare

  • Answer aloud and timed: Explain the concept of virtual destructors in C++ and why they are critical when working with inheritance.
  • Answer aloud and timed: Explain the concept of closures in JavaScript and provide a practical, real-world use case for them.

Code Reviews

Review of your submitted work to assess coding quality and design.

What to demonstrate

  • Review of your submitted work to assess coding quality and design
  • Depth in Problem Solving (Algorithmic)

How to prepare

  • Answer aloud and timed: How do you handle asynchronous operations in Python, and when would you choose asyncio over multi-threading?
  • Answer aloud and timed: What are the key design principles of a RESTful API, and how do you ensure scalability and security when designing endpoints?

Behavioral Assessment

Assessment with hiring managers and team members focusing on collaboration.

What to demonstrate

  • Assessment with hiring managers and team members focusing on collaboration
  • Depth in Problem Solving (Algorithmic)

How to prepare

  • Prepare three examples from your own work, each with a decision you made and an outcome you can quantify.
  • Re-read the description of the behavioral assessment above and write down what you would ask to confirm before it.

Where candidates lose points

Tailor your answers to the job description

Perforce has a wide variety of product teams working on very different technologies. Make sure you understand whether the role is focused on low-level systems (like static analysis), backend APIs, or DevOps automation, and center your answers around those specific domain requirements.

Be ready to explain things simply

One of the key soft skills evaluated is your communication. Practice walking through your projects and technical decisions in a clear, structured manner, avoiding unnecessary jargon and focusing on the "why" behind your choices.

Trusting input because it came from your own front end

Anything crossing a trust boundary is hostile: parameterise queries instead of building SQL by concatenation, validate against an allow-list rather than a deny-list, and bound the size of anything you allocate from a request. Raising this unprompted in an API or design question is a cheap and unusually strong signal.

Questions & practice

Explain the difference between a deep copy and a shallow copy in C++, and demonstrate how you would safely imp

Medium · C++ & Systems Programming

Explain the difference between a deep copy and a shallow copy in C++, and demonstrate how you would safely implement a custom copy constructor.

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?

What are smart pointers in C++, and how do std::unique_ptr and std::shared_ptr manage memory under the hood?

Medium · C++ & Systems Programming

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?

Walk through a design pattern you have used to solve a complex structural problem in a compiled language, expl

Medium · C++ & Systems Programming

Walk through a design pattern you have used to solve a complex structural problem in a compiled language, explaining the trade-offs of your approach.

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 does static code analysis identify potential null pointer dereferences or resource leaks without executing

Medium · C++ & Systems Programming

How does static code analysis identify potential null pointer dereferences or resource leaks without executing the code?

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 the concept of virtual destructors in C++ and why they are critical when working with inheritance.

Medium · C++ & Systems Programming

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 the concept of closures in JavaScript and provide a practical, real-world use case for them.

Medium · Web Technologies & Scripting

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 handle asynchronous operations in Python, and when would you choose asyncio over multi-threading?

Medium · Web Technologies & Scripting

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?

Solve this basic array manipulation problem using JavaScript, but do not use any built-in prototype methods li

Medium · Web Technologies & Scripting

Solve this basic array manipulation problem using JavaScript, but do not use any built-in prototype methods like map, filter, or reduce.

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?

How does the event loop work in JavaScript, and how does it handle asynchronous callbacks versus microtasks?

Medium · Web Technologies & Scripting

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?

Given a complex grid or decision tree, write a backtracking algorithm to find all valid paths and explain its

Medium · Data Structures & Algorithms

Given a complex grid or decision tree, write a backtracking algorithm to find all valid paths and explain its time complexity.

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 a basic caching strategy, such as an LRU (Least Recently Used) Cache, and explain how you would achi

Medium · Data Structures & Algorithms

Implement a basic caching strategy, such as an LRU (Least Recently Used) Cache, and explain how you would achieve O(1) time complexity for reads and writes.

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?

How would you detect a cycle in a directed graph using depth-first search (DFS)?

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?

Given an array of integers, find the contiguous subarray with the largest sum and explain your approach.

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 the difference between a hash map and a binary search tree in terms of lookup, insertion, and deletion

Medium · Data Structures & Algorithms

Explain the difference between a hash map and a binary search tree in terms of lookup, insertion, and deletion performance.

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?

Replace offset paging on the resource feed with keyset

Easy · keyset pagination · composite index · sort order

resource holds resource_id, tenant_id, owner_user_id, title, body_ref, version, status ('draft','active','archived','deleted'), created_at, updated_at, deleted_at, with an index on (tenant_id, status, updated_at DESC, resource_id DESC). The listing endpoint returns active resources for one tenant, newest update first, 50 per page, today with LIMIT 50 OFFSET n. Tenants reach page 400 and rows are created while they read. Write the keyset query, define what the cursor carries and how it is encoded, and say which part of the index each predicate uses. Assume PostgreSQL 16.

Approach

  1. Name the two failures separately. OFFSET 20000 makes the server produce and discard 20,000 rows, so page cost grows with depth rather than with page size. Independently, any write that changes how many rows sort above the offset moves the window between two fetches, and the direction decides which anomaly you get: an insert lands at the head of updated_at DESC and pushes already-returned rows down past the boundary, so they are returned a second time; a delete above the offset, or a row whose updated_at is bumped above the cursor, pulls rows up and one is never returned at all. Nothing in the response reveals either.
  2. Write the seek: WHERE tenant_id = $1 AND status = 'active' AND (updated_at, resource_id) < ($2, $3) ORDER BY updated_at DESC, resource_id DESC LIMIT 50. The row-value comparison is one index range rather than a disjunction, and both columns are NOT NULL, which is what makes that comparison well defined.
  3. Map each predicate onto the index: tenant_id and status are equality on the leading columns, (updated_at, resource_id) is the range, and the ORDER BY matches the index order so no Sort node appears and the scan stops after 50 rows. The DESC in the definition only matters for mixed directions — a plain ascending btree on the same columns is read backwards for this query.
  4. Put both sort columns in the cursor and nothing the client can tamper with into another tenant: base64 of (updated_at, resource_id), validated server-side, with tenant_id taken from the principal.

Follow-up

  • The client asks for 'jump to page 400'. What do you offer instead, and what does the honest version cost?
  • Sort order becomes user-selectable across four columns. How many indexes is that, and which would you refuse to add?

Denormalise tenant onto revisions and backfill it live

Hard · denormalisation · online migration · backfill

resource_revision (revision_id, resource_id, version, actor_user_id, change_kind, patch, request_id, created_at) has 400M rows and no tenant column; tenant_id lives only on resource. Two reads need it: a tenant-scoped audit feed ordered by created_at DESC, and an offboarding purge. Both join back to resource today. Justify adding tenant_id to resource_revision against those two reads, name the anomaly the copy introduces and the constraint that prevents it, then give the ordered migration for a live table taking 1.2k writes/second — the lock each step takes, how the backfill is batched, and where each step stops being reversible. PostgreSQL 16.

Approach

  1. Justify from the access path rather than from taste. Without the column, the audit feed either scans resource_revision by created_at and discards other tenants' rows, or resolves the tenant's resource_ids first and probes with them — both proportional to the tenant's whole history rather than to one page. With (tenant_id, created_at DESC, revision_id DESC) it is a seek that stops at 50 rows, and the purge becomes a ranged delete instead of a join.
  2. Name the cost exactly: a second copy of a fact can disagree with the first. Make the disagreement unwritable rather than documented — add UNIQUE (resource_id, tenant_id) on resource so it can serve as a foreign-key target, then FOREIGN KEY (resource_id, tenant_id) REFERENCES resource (resource_id, tenant_id) on the revision table. A revision can then only ever carry its parent's tenant.
  3. Step one, expand: ALTER TABLE resource_revision ADD COLUMN tenant_id BIGINT NULL, with no default, so it is a catalogue change and no rewrite. It still needs ACCESS EXCLUSIVE for an instant, and that instant queues behind the longest open transaction on the table while every later query queues behind it — set lock_timeout to 2s and retry rather than wait.
  4. Step two, dual-write: deploy the writer that populates tenant_id on every new revision while reads still use the join. Reversible by redeploying the previous build, because nothing reads the column yet.

Follow-up

  • The backfill is half finished and a rollback is required. What state is the table in, and what does the previous build do with a half-populated column?
  • How do you verify the backfill actually finished, given rows are still being inserted while it runs?

What are the key design principles of a RESTful API, and how do you ensure scalability and security when desig

Medium · Web Technologies & Scripting

What are the key design principles of a RESTful API, and how do you ensure scalability and security when designing endpoints?

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?

Draw and explain how you would design a scalable system that processes high-volume, real-time log data from mu

Medium · System Design & Architecture

Draw and explain how you would design a scalable system that processes high-volume, real-time log data from multiple sources.

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 would you design a distributed version control component that safely handles concurrent file writes and pr

Medium · System Design & Architecture

How would you design a distributed version control component that safely handles concurrent file writes and prevents data corruption?

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?

What strategies would you employ to reduce latency in a database-heavy backend application experiencing high r

Medium · System Design & Architecture

What strategies would you employ to reduce latency in a database-heavy backend application experiencing high read traffic?

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 would you design a rate-limiter for an API to prevent abuse while ensuring fair resource distribution?

Medium · System Design & Architecture

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?

Read latency spikes on a sixty-second sawtooth

Medium · cache stampede · single-flight · ttl

The cached listing read path serves about 14k reads/second at an 85% hit rate. p99 sits at 35 ms for 57 seconds, jumps to 900 ms for 3, and repeats. During each spike the primary shows several hundred identical listing queries starting within the same millisecond, all carrying one large tenant's id. Cache entries use a 60-second TTL. Give the mechanism, the ordered checks, the fix, and the correctness hazard your fix must not introduce.

Approach

  1. Match the period to a configured number before theorising about load. A spike every 60 seconds against a 60-second TTL is an entry expiring, and you confirm it by correlating spike timestamps with the entry's write time rather than with the traffic curve. If the period had matched a cron or a GC interval instead, this is a different investigation.
  2. Establish the concurrency of the miss. Several hundred identical queries in one millisecond means the miss path has no coalescing: every request that arrives between expiry and repopulation recomputes. The herd size is that key's arrival rate times its recompute time, so at 1.2k reads/second for the hot key and a 250 ms recompute you expect about 300 concurrent misses, which matches what is observed.
  3. Add single-flight on the miss path so one caller per key recomputes under a short-lived lock while the rest wait for its result. Prefer stale-while-revalidate where the read tolerates it: return the expired value immediately and refresh asynchronously, which removes the latency spike rather than serialising it into a queue of waiters.
  4. De-synchronise the keys. Write TTLs with jitter, for example 60 seconds plus or minus 10%, so a deploy or a mass invalidation does not align every key on the same second and turn a per-key herd into a fleet-wide one.

Follow-up

  • The same sawtooth appears on a key that is invalidated on write rather than expired. Is that the same bug?
  • How does your answer change if the recompute takes 4 seconds instead of 250 ms?

Suggested practice checklist

Built from the rounds and topics Perforce candidates report.

Day 1 — Map the Perforce loop

  • Write out the reported sequence: Conversational Screen, Technical Evaluations, Deep-Dive Technical Discussions, Code Reviews, Behavioral Assessment.
  • 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 5 reported rounds, with the weakest marked.

Day 2 — Work Problem Solving (Algorithmic)

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

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

Day 3 — Work Data Structures & Algorithms (DSA)

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

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

Day 4 — Work C++

  • Spend the session on C++, which Perforce candidates report being tested on.
  • Write one worked example in C++ and time yourself on it.

Deliverable: One timed worked example in C++.

Day 5 — Answer out loud: C++ & Systems Programming

  • Answer aloud, timed: Explain the difference between a deep copy and a shallow copy in C++, and demonstrate how you would safely implement a custom copy constructor.
  • Answer aloud, timed: What are smart pointers in C++, and how do std::unique_ptr and std::shared_ptr manage memory under the hood?

Deliverable: Spoken answers to 2 reported C++ & Systems Programming question(s), under time.

Day 6 — Answer out loud: Web Technologies & Scripting

  • Answer aloud, timed: Explain the concept of closures in JavaScript and provide a practical, real-world use case for them.
  • Answer aloud, timed: How do you handle asynchronous operations in Python, and when would you choose asyncio over multi-threading?

Deliverable: Spoken answers to 2 reported Web Technologies & Scripting question(s), under time.

Day 7 — Answer out loud: Data Structures & Algorithms

  • Answer aloud, timed: Given a complex grid or decision tree, write a backtracking algorithm to find all valid paths and explain its time complexity.
  • Answer aloud, timed: Implement a basic caching strategy, such as an LRU (Least Recently Used) Cache, and explain how you would achieve O(1) time complexity for reads and writes.

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

Behavioural preparation

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

Tell me about a time you had to explain a highly complex technical concept to a non-technical stakeholder or t

Medium · Behavioral & Experience

Tell me about a time you had to explain a highly complex technical concept to a non-technical stakeholder or team member. How did you structure your explanation?

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 a code review when you disagree with a senior engineer's architectural choice or implement

Medium · Behavioral & Experience

How do you approach a code review when you disagree with a senior engineer's architectural choice or implementation details?

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?

Walk me through your most challenging software project. What went wrong, how did you pivot, and what did you l

Medium · Behavioral & Experience

Walk me through your most challenging software project. What went wrong, how did you pivot, and what did you learn from the experience?

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 prioritize technical debt versus delivering new features when working under tight deadlines?

Medium · Behavioral & Experience

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?