Pymetrics Software Engineer Interview Guide

The 60-second brief

A Software Engineer at Pymetrics plays a critical role in building and scaling a platform that merges behavioral science, artificial intelligence, and enterprise SaaS. The engineering team is responsible for developing robust, secure, and highly scalable systems that process complex assessment data to help global enterprises make unbiased hiring decisions. Because the core product relies on processing rich behavioral data from interactive assessments, the engineering challenges here span high-throughput data pipelines, secure enterprise integrations, and intuitive user interfaces. As a Software Engineer, your work directly impacts how millions of job seekers interact with employers. You will collaborate closely with data scientists, product managers, and UI/UX designers to translate complex neuroscience-based assessment models into seamless, reliable software.

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

Focus areas

• Coding Interviews
• Algorithms (General)
• Time Complexity Analysis

The Pymetrics interview process

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

Recruiter Call

Initial call with a recruiter to discuss your background and the role.

What to demonstrate

• Initial call with a recruiter to discuss your background and the role
• Depth in Coding Interviews

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.

Automated Technical Screen

A technical screening process conducted automatically to assess coding skills.

What to demonstrate

• A technical screening process conducted automatically to assess coding skills
• Depth in Coding Interviews

How to prepare

• Answer aloud and timed: Design and implement a function to solve a classic dynamic programming problem, such as the knapsack problem or coin change problem, and explain your complexity trade-offs.
• Answer aloud and timed: Write a function to detect cycles in a directed graph.

Technical Conversations

Engage in deeper technical discussions with engineering leaders, possibly including a take-home project or live pairing session.

What to demonstrate

• Engage in deeper technical discussions with engineering leaders, possibly including a take-home project or live pairing session
• Depth in Coding Interviews

How to prepare

• Answer aloud and timed: Implement a search algorithm to locate specific elements in a highly nested data structure.
• Answer aloud and timed: How would you design a high-throughput API that ingests and processes real-time user interaction data from a web-based game?

Onsite Interview

Multi-round onsite interview simulating a typical workday, focusing on collaboration and problem-solving.

What to demonstrate

• Multi-round onsite interview simulating a typical workday
• Focusing on collaboration and problem-solving

How to prepare

• Answer aloud and timed: Design a secure system for storing and processing sensitive candidate assessment results while complying with strict data privacy regulations like GDPR.
• Answer aloud and timed: How would you architect a notification system that alerts enterprise recruiters when candidates complete their assessments?

Where candidates lose points

Master Time Complexity

Do not just focus on getting a working solution during your technical assessments. Interviewers are highly focused on optimization, so always analyze and discuss the time and space complexity of your code.

Be Ready for Dynamic Programming

Multiple candidates have reported encountering multi-step dynamic programming questions during the online assessment. Refresh your knowledge of memoization and tabulation strategies before starting the test.

Communicate Professionally and Diplomatically

You may find yourself discussing the company's product model or scientific validity during the interview. Approach these conversations with professional curiosity and respect, focusing on how engineering supports the product's goals.

Avoid challenging the scientific validity of the product aggressively during the interview

While curiosity is welcome, defensive reactions have been reported when candidates push too hard on the neuroscience methodology.

Questions & practice

Implement an algorithm to find the longest common subsequence between two strings, ensuring optimal time and s

Medium · Algorithmic & Coding Questions

Implement an algorithm to find the longest common subsequence between two strings, ensuring optimal time and space 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?

Given an array of integers, write a function to find the contiguous subarray with the largest sum (Kadane's Al

Medium · Algorithmic & Coding Questions

Given an array of integers, write a function to find the contiguous subarray with the largest sum (Kadane's Algorithm).

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?

Design and implement a function to solve a classic dynamic programming problem, such as the knapsack problem o

Medium · Algorithmic & Coding Questions

Design and implement a function to solve a classic dynamic programming problem, such as the knapsack problem or coin change problem, and explain your complexity trade-offs.

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?

Write a function to detect cycles in a directed graph.

Medium · Algorithmic & Coding Questions

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 search algorithm to locate specific elements in a highly nested data structure.

Medium · Algorithmic & Coding Questions

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?

Stop tag and share joins from fanning out a page

Medium · join fan-out · semi-joins · many-to-many

resource_tag is (resource_id, tag_id) with PK (resource_id, tag_id); resource_share is (resource_id, shared_with_user_id, permission). The tagged-and-shared listing inner-joins resource to both, filters tenant_id, tag_id = ANY($2) and shared_with_user_id = $3, orders by updated_at DESC and takes 50. Pages come back with fewer than 50 distinct resources and the total in the header is far too high. Explain the row multiplication, rewrite both the page query and the count query so each is correct, and name the index each one needs. PostgreSQL 16.

Approach

1. Do the arithmetic against the predicates that are actually there. An inner join emits one row per matching child row, and both joins are filtered: tag_id = ANY($2) admits only the requested tags, shared_with_user_id = $3 admits one user's share rows. So a resource holding three of the requested tags and shared with $3 once yields three rows, not one — the multiplier is its count of matching tags times its share rows for that single user, and that second factor is 1 unless the table admits duplicate (resource_id, shared_with_user_id) pairs. LIMIT 50 then limits rows rather than resources, and COUNT(*) counts pairs — the header is the product, not the population.
2. Reject DISTINCT as the fix. It deduplicates after the product has been built, so the planner must materialise and sort the fanned-out set before the LIMIT can apply, and it leaves any SUM or AVG in the same select list wrong.
3. Rewrite both filters as semi-joins, keeping resource as the only row source: AND EXISTS (SELECT 1 FROM resource_tag rt WHERE rt.resource_id = r.resource_id AND rt.tag_id = ANY($2)) and the same shape against resource_share. A semi-join stops at the first match per resource and preserves the driving index order, so ORDER BY updated_at DESC, resource_id DESC LIMIT 50 still stops after 50 rows.
4. Count with the same predicates and no join at all: SELECT count(*) FROM resource r WHERE r.tenant_id = $1 AND r.status = 'active' AND EXISTS (...) AND EXISTS (...). Nothing multiplies a resource, so the number is the population.

Follow-up

• The filter changes from 'any of these tags' to 'all of these tags'. Rewrite it and state what it costs relative to the ANY form.
• A resource can be shared with the same user twice under different permissions. Does your count change, and should it?

Find version gaps and relay lag with window functions

Medium · window functions · event tables · frame semantics

outbox_event holds event_id, aggregate_type, aggregate_id, aggregate_version, event_type, payload, status ('pending','published','dead'), attempts, created_at, published_at. A projection is missing rows and you must decide whether the relay skipped events or the consumer dropped them. Write three queries over the last seven days: one listing every aggregate_id whose published aggregate_version sequence has a hole, one giving per-day counts with a running total, and one returning the newest published event per aggregate. For each, say where the window function is evaluated relative to WHERE and LIMIT. PostgreSQL 16.

Approach

1. Gaps: compute lead(aggregate_version) OVER (PARTITION BY aggregate_id ORDER BY aggregate_version) in a subquery, then filter next_version <> aggregate_version + 1 in the outer query. Window functions are evaluated after WHERE, GROUP BY and HAVING and before the outer ORDER BY and LIMIT, so the predicate cannot sit in the same WHERE clause and PostgreSQL 16 has no QUALIFY.
2. Say what the seven-day filter does to the answer: it truncates every partition, so the first row per aggregate has no predecessor inside the window and a hole spanning the boundary is invisible. Widen the window, or join to resource.version as the authority for the true maximum.
3. Running total: SELECT date_trunc('day', created_at) AS d, count() AS n, sum(count()) OVER (ORDER BY date_trunc('day', created_at) ROWS UNBOUNDED PRECEDING). An aggregate inside a window call is legal because grouping runs before windowing. The grouping key is unique per row here so ROWS and RANGE agree, but write the frame anyway — over ungrouped rows with tied timestamps the default RANGE frame pulls in every peer row and the total jumps.
4. Newest per aggregate: DISTINCT ON (aggregate_id) ... ORDER BY aggregate_id, aggregate_version DESC is the cheap PostgreSQL-only form when an index matches that order; row_number() OVER (PARTITION BY aggregate_id ORDER BY aggregate_version DESC) = 1 is the portable form and needs a subquery for the same evaluation-order reason as the gap query.

Follow-up

• Relay failover redelivers events. Does a duplicate break the gap query, and how would you detect one from this table alone?
• Turn the gap check into a continuous monitor rather than a query someone runs after an incident. What does it watch?

How would you design a high-throughput API that ingests and processes real-time user interaction data from a w

Medium · System Design & Architecture

How would you design a high-throughput API that ingests and processes real-time user interaction data from a web-based game?

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?

Design a secure system for storing and processing sensitive candidate assessment results while complying with

Medium · System Design & Architecture

Design a secure system for storing and processing sensitive candidate assessment results while complying with strict data privacy regulations like GDPR.

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 architect a notification system that alerts enterprise recruiters when candidates complete their

Medium · System Design & Architecture

How would you architect a notification system that alerts enterprise recruiters when candidates complete their assessments?

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 handle database scaling and caching strategies for an application experiencing sudden s

Medium · System Design & Architecture

Describe how you would handle database scaling and caching strategies for an application experiencing sudden spikes in traffic during peak hiring seasons.

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?

One customer endpoint stalls deliveries to every other destination

Medium · bulkhead · timeouts · saturation

The egress service delivers about 1.5k webhooks/second across 40,000 destinations, with a per-destination concurrency cap of 4 and a 10-second connect-plus-read timeout. Throughput falls to 300/second, queue depth climbs, and p99 delivery latency for unaffected destinations goes from 200 ms to minutes, while the error rate barely moves. One tenant holds 900 destination rows whose URLs share a hostname that now answers in 9.5 seconds. Explain the mechanism with the arithmetic, then give the containment in the order you would apply it.

Approach

1. Look at saturation before errors. A flat error rate with collapsing throughput says nothing is failing, things are waiting, so the first signal to pull is in-flight request count or pool wait time rather than the error counter. This is the distinction that decides the whole investigation.
2. Group in-flight work by resolved host, not by destination id. The cap is keyed per destination row, so 900 rows sharing one hostname buy 3,600 concurrent slots against a single host, each held for 9.5 seconds. The bulkhead was never a bulkhead for that host, and grouping by the wrong dimension is why the dashboard looked healthy.
3. Do the arithmetic in both directions. Required concurrency is arrival rate times latency, so 1.5k/second at 200 ms needs about 300 in flight, which is entirely consumed by 3,600 slow slots; conversely whatever concurrency is left sustains rate equals concurrency divided by 9.5 seconds, which is the 300/second you are seeing. Matching both numbers is what promotes this from a plausible story to the mechanism.
4. Explain why the circuit breaker never helped. It opens on consecutive failures, and a 9.5-second response inside a 10-second timeout is a success. Slow is not failing, so an error-rate breaker cannot see this; you need a slow-call ratio, a deadline propagated from the caller's remaining budget, or a concurrency limiter.

Follow-up

• The host recovers to 80 ms. How long does the queue take to drain, and what does the drain do to the recovered host?
• Where should the 10-second timeout number actually come from?

Suggested practice checklist

Built from the rounds and topics Pymetrics candidates report.

Day 1 — Map the Pymetrics loop

• Write out the reported sequence: Recruiter Call, Automated Technical Screen, Technical Conversations, Onsite Interview.
• 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 4 reported rounds, with the weakest marked.

Day 2 — Work Coding Interviews

• Spend the session on Coding Interviews, which Pymetrics candidates report being tested on.
• Write one worked example in Coding Interviews and time yourself on it.

Deliverable: One timed worked example in Coding Interviews.

Day 3 — Work Algorithms (General)

• Spend the session on Algorithms (General), which Pymetrics candidates report being tested on.
• Write one worked example in Algorithms (General) and time yourself on it.

Deliverable: One timed worked example in Algorithms (General).

Day 4 — Work Time Complexity Analysis

• Spend the session on Time Complexity Analysis, which Pymetrics candidates report being tested on.
• Write one worked example in Time Complexity Analysis and time yourself on it.

Deliverable: One timed worked example in Time Complexity Analysis.

Day 5 — Answer out loud: Algorithmic & Coding Questions

• Answer aloud, timed: Implement an algorithm to find the longest common subsequence between two strings, ensuring optimal time and space complexity.
• Answer aloud, timed: Given an array of integers, write a function to find the contiguous subarray with the largest sum (Kadane's Algorithm).

Deliverable: Spoken answers to 2 reported Algorithmic & Coding Questions question(s), under time.

Day 6 — Answer out loud: System Design & Architecture

• Answer aloud, timed: How would you design a high-throughput API that ingests and processes real-time user interaction data from a web-based game?
• Answer aloud, timed: Design a secure system for storing and processing sensitive candidate assessment results while complying with strict data privacy regulations like GDPR.

Deliverable: Spoken answers to 2 reported System Design & Architecture question(s), under time.

Day 7 — Answer out loud: Behavioral & Cultural Fit

• Answer aloud, timed: Why are you interested in working at Pymetrics, and how do you view the intersection of technology and fair hiring?
• Answer aloud, timed: Tell me about a time when you had a disagreement with a team member or product manager regarding a technical decision. How did you resolve it?

Deliverable: Spoken answers to 2 reported Behavioral & Cultural Fit question(s), under time.

Behavioural preparation

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

Why are you interested in working at Pymetrics, and how do you view the intersection of technology and fair hi

Medium · Behavioral & Cultural Fit

Why are you interested in working at Pymetrics, and how do you view the intersection of technology and fair hiring?

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?

Tell me about a time when you had a disagreement with a team member or product manager regarding a technical d

Medium · Behavioral & Cultural Fit

Tell me about a time when you had a disagreement with a team member or product manager regarding a technical decision. How did you resolve it?

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 a challenging technical project you worked on. What went wrong, and how did you adapt to overcome tho

Medium · Behavioral & Cultural Fit

Describe a challenging technical project you worked on. What went wrong, and how did you adapt to overcome those challenges?

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 handle feedback on your code during peer reviews, especially when you disagree with the reviewer's

Medium · Behavioral & Cultural Fit

How do you handle feedback on your code during peer reviews, especially when you disagree with the reviewer's approach?

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?