Office Hours Software Engineer Interview Guide

The 60-second brief

A Software Engineer at Office Hours is responsible for building and scaling the technological engine that powers the modern knowledge economy. At its core, Office Hours is an on-demand expert network and marketplace that connects leading global organizations with trusted experts across various knowledge domains. While the user experience appears simple—search, match, connect, and pay—the underlying systems are highly complex, deeply interconnected, and built entirely in-house. As a Software Engineer or Staff Software Engineer, you will own product experiences end-to-end. You will work across a modern tech stack to build search and discovery engines, recommendation systems, data pipelines, automated scheduling logistics, secure payment rails, and robust compliance workflows.

This guide is scoped to a Software Engineer candidate at Office Hours.

Focus areas

• Full-Stack Software Engineering
• TypeScript
• System Design

The Office Hours interview process

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

Recruiter Call

Initial conversation with a recruiter to discuss your background, career goals, and alignment with the company's mission.

What to demonstrate

• Initial conversation with a recruiter to discuss your background, career goals, and alignment with the company's mission
• Depth in Full-Stack Software Engineering

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 Screening

Practical coding or system design exercise conducted over a video call, focusing on core software engineering fundamentals.

What to demonstrate

• Practical coding or system design exercise conducted over a video call
• Focusing on core software engineering fundamentals

How to prepare

• Answer aloud and timed: How would you architect a background job processing system to handle automated scheduling, reminders, and calendar sync across thousands of users?
• Answer aloud and timed: Design a knowledge graph schema that models relationships between experts, industries, companies, and specific technology domains to improve search recommendations.

Virtual Onsite Interview

Structured interview loops assessing technical depth, architectural skills, product mindset, and behavioral alignment with multiple team members.

What to demonstrate

• Structured interview loops assessing technical depth, architectural skills, product mindset, and behavioral alignment with multiple team members
• Depth in Full-Stack Software Engineering

How to prepare

• Answer aloud and timed: How would you design a rate-limiting and access-control system to protect sensitive expert data and prevent platform abuse?
• Answer aloud and timed: Implement a robust scheduling component in React that handles timezone conversions, conflicting availabilities, and dynamic booking slots.

Where candidates lose points

Focus on the "Why

When writing code or designing a system, always explain the reasoning behind your decisions. Your interviewers care more about your thought process and trade-off analysis than a single "correct" answer.

Emphasize Product Impact

Throughout your behavioral interviews, highlight how your technical contributions directly solved user pain points or drove business growth in your previous roles.

Keep Solutions Simple

Avoid the temptation to over-engineer. Start with a simple, working solution that addresses the core requirements, and then discuss how you would optimize, scale, or refactor it for production.

Questions & practice

Build a custom hook in React to manage complex, multi-step wizard state (e.g., expert onboarding) with support

Medium · Full-Stack Coding & Practical Problem So

Build a custom hook in React to manage complex, multi-step wizard state (e.g., expert onboarding) with support for draft saving and validation.

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 an efficient auto-complete search component that queries a mock backend, handles debouncing, and man

Medium · Full-Stack Coding & Practical Problem So

Implement an efficient auto-complete search component that queries a mock backend, handles debouncing, and manages loading and error states gracefully.

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 do you approach gathering requirements and defining technical scope when handed an ambiguous product speci

Medium · Behavioral & Product Intuition

How do you approach gathering requirements and defining technical scope when handed an ambiguous product specification?

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 data migration script to normalize a nested MongoDB document structure into a relational Postgres sche

Medium · Full-Stack Coding & Practical Problem So

Write a data migration script to normalize a nested MongoDB document structure into a relational Postgres schema without downtime.

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?

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?

How would you design a real-time expert search and discovery system that indexes millions of professional prof

Medium · System Design & Architecture

How would you design a real-time expert search and discovery system that indexes millions of professional profiles and supports complex filtering?

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 resilient, multi-step transaction and payout workflow that handles compliance checks, escrow, and ext

Medium · System Design & Architecture

Design a resilient, multi-step transaction and payout workflow that handles compliance checks, escrow, and external payment processor failures.

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 background job processing system to handle automated scheduling, reminders, and cale

Medium · System Design & Architecture

How would you architect a background job processing system to handle automated scheduling, reminders, and calendar sync across thousands of users?

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 knowledge graph schema that models relationships between experts, industries, companies, and specific

Medium · System Design & Architecture

Design a knowledge graph schema that models relationships between experts, industries, companies, and specific technology domains to improve search recommendations.

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-limiting and access-control system to protect sensitive expert data and prevent pl

Medium · System Design & Architecture

How would you design a rate-limiting and access-control system to protect sensitive expert data and prevent platform abuse?

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?

Write a clean, type-safe API endpoint in Node.js and TypeScript that aggregates expert profile data from multi

Medium · Full-Stack Coding & Practical Problem So

Write a clean, type-safe API endpoint in Node.js and TypeScript that aggregates expert profile data from multiple database collections while optimizing query performance.

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?

Edge instances grow 400 MB per hour until the nightly restart

Hard · memory leak · heap analysis · metric cardinality

Edge API instances start at 700 MB resident and grow about 400 MB/hour; a nightly rolling restart has hidden it for weeks. Growth continues unchanged when request rate halves overnight, p99 degrades in the last hours before an instance is recycled, and heap used immediately after a forced full GC rises monotonically. The service holds no product state. Name the discriminating measurement that separates the plausible causes, give the most likely cause, and give the fix and how you would verify it.

Approach

1. Separate resident memory from live heap first, because they fail differently. Resident size can grow from fragmentation, native buffers or thread stacks while the heap is flat; heap used after a full GC rising monotonically is the measurement that says objects are reachable and not being released. You already have it, so this is retention, not fragmentation, and that closes off half the candidate list.
2. Use the rate's independence from traffic as the discriminator. Growth that continues at half the request rate rules out per-request objects that are merely slow to collect and points at a structure that grows with distinct values observed rather than with call volume. Write the candidates that have that property: a metrics registry keyed on a high-cardinality label, an unevicted cache, an interner, a per-key lock map.
3. Take two heap snapshots an hour apart and diff by retained size, reading the dominator tree, not by allocation count or instance count. Expect one root holding a map with millions of entries, then follow the reference chain to the code that inserts and never removes. Allocation profilers point at churn, which is the wrong signal here.
4. The candidate that fits this service is an observability label carrying an identifier, such as a request path recorded before templating so that /v1/resources/48213 becomes its own metric series. That grows with distinct ids seen, is independent of rate, and explains the late p99 degradation, since GC cost rises with the size of the live set.

Follow-up

• Post-GC heap is now flat but resident size still creeps. What are you looking at, and does it matter?
• How would you have detected this before an OOM, given the nightly restart masked the trend?

Suggested practice checklist

Built from the rounds and topics Office Hours candidates report.

Day 1 — Map the Office Hours loop

• Write out the reported sequence: Recruiter Call, Technical Screening, Virtual 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 3 reported rounds, with the weakest marked.

Day 2 — Work Full-Stack Software Engineering

• Spend the session on Full-Stack Software Engineering, which Office Hours candidates report being tested on.
• Write one worked example in Full-Stack Software Engineering and time yourself on it.

Deliverable: One timed worked example in Full-Stack Software Engineering.

Day 3 — Work TypeScript

• Spend the session on TypeScript, which Office Hours candidates report being tested on.
• Write one worked example in TypeScript and time yourself on it.

Deliverable: One timed worked example in TypeScript.

Day 4 — Work System Design

• Spend the session on System Design, which Office Hours candidates report being tested on.
• Write one worked example in System Design and time yourself on it.

Deliverable: One timed worked example in System Design.

Day 5 — Answer out loud: System Design & Architecture

• Answer aloud, timed: How would you design a real-time expert search and discovery system that indexes millions of professional profiles and supports complex filtering?
• Answer aloud, timed: Design a resilient, multi-step transaction and payout workflow that handles compliance checks, escrow, and external payment processor failures.

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

Day 6 — Answer out loud: Full-Stack Coding & Practical Problem Solving

• Answer aloud, timed: Implement a robust scheduling component in React that handles timezone conversions, conflicting availabilities, and dynamic booking slots.
• Answer aloud, timed: Write a clean, type-safe API endpoint in Node.js and TypeScript that aggregates expert profile data from multiple database collections while optimizing query performance.

Deliverable: Spoken answers to 2 reported Full-Stack Coding & Practical Problem Solving question(s), under time.

Day 7 — Answer out loud: Behavioral & Product Intuition

• Answer aloud, timed: Describe a time when you had to make a difficult technical trade-off to meet a tight product deadline. What was the outcome, and what did you learn?
• Answer aloud, timed: How do you collaborate with product managers and designers when a technical limitation impacts a proposed user experience?

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

Behavioural preparation

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

Implement a robust scheduling component in React that handles timezone conversions, conflicting availabilities

Medium · Full-Stack Coding & Practical Problem So

Implement a robust scheduling component in React that handles timezone conversions, conflicting availabilities, and dynamic booking slots.

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 time when you had to make a difficult technical trade-off to meet a tight product deadline. What wa

Medium · Behavioral & Product Intuition

Describe a time when you had to make a difficult technical trade-off to meet a tight product deadline. What was the outcome, and what did you learn?

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 collaborate with product managers and designers when a technical limitation impacts a proposed user

Medium · Behavioral & Product Intuition

How do you collaborate with product managers and designers when a technical limitation impacts a proposed user 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?

Tell me about a complex production outage or bug you owned. How did you diagnose, resolve, and prevent it from

Medium · Behavioral & Product Intuition

Tell me about a complex production outage or bug you owned. How did you diagnose, resolve, and prevent it from happening again?

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?

Give an example of how you have mentored junior engineers or set a high bar for code quality within your previ

Medium · Behavioral & Product Intuition

Give an example of how you have mentored junior engineers or set a high bar for code quality within your previous team.

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?