At Scribe, a Software Engineer is not just a code writer; you are a product builder who directly influences how millions of users capture, share, and consume institutional knowledge. Scribe is dedicated to making process documentation completely effortless by automatically turning any digital workflow into a step-by-step visual guide. Because of this unique product mission, engineers here must balance highly complex technical challenges—such as browser extension architecture, screen capture optimization, and smart step-generation algorithms—with an elegant, seamless user experience. As a Software Engineer on the team, your work has a direct line of sight to the company's growth and user engagement. Whether you are building features for the core editor, refining the sharing flow, or working within a dedicated growth team to run data-driven product experiments, your engineering decisions will impact key business metrics. You will write clean, reliable code in a modern tech stack heavily anchored in React, while collaborating closely with product managers, designers, and other engineers to deliver highly intuitive user interfaces. The engineering organization at Scribe values autonomy, speed, and pragmatic problem-solving. This is an environment where you are encouraged to take ownership of features from ideation to deployment.
Recruiter Call
reportedInitial conversation with a recruiter to discuss your background, career goals, and salary expectations.
What to demonstrate
- Initial conversation with a recruiter to discuss your background, career goals, and salary expectations
- Depth in React
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.
Hiring Manager Round
reportedDiscussion with the hiring manager or VP of Engineering focusing on past experiences and alignment with team culture.
What to demonstrate
- Discussion with the hiring manager or VP of Engineering focusing on past experiences and alignment with team culture
- Depth in React
How to prepare
- Prepare two projects you led end to end, each with the decision you owned and what it cost.
- Have three questions about the team's roadmap and how success is measured in the first six months.
Technical Assessments
reportedEngagement in practical technical assessments, including a live coding pairing session and a technical presentation.
What to demonstrate
- Engagement in practical technical assessments
- Including a live coding pairing session and a technical presentation
How to prepare
- Answer aloud and timed: Explain how you would implement an efficient real-time collaborative editing feature on the frontend.
- Answer aloud and timed: How would you design a system to run multiple concurrent A/B tests on a high-traffic landing page?
Behavioral Conversations
reportedDeeper discussions with product leadership and executive founders to assess cultural fit and long-term alignment.
What to demonstrate
- Deeper discussions with product leadership and executive founders to assess cultural fit and long-term alignment
- Depth in React
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 conversations above and write down what you would ask to confirm before it.
PracHub editorial advice for the preparation topics above.
Think like a product owner
Throughout your technical and behavioral rounds, demonstrate that you care about why a feature is being built, not just how. Show that you understand the business goals and the user experience behind your technical decisions.
Communicate your trade-offs explicitly
In both system design and coding sessions, there is rarely a single "correct" answer. Explain the pros and cons of your chosen approach, and mention what alternatives you considered and why you ruled them out.
During the live React pairing session, treat the interviewer as a teammate
If you get stuck or are unsure about an API, ask questions, think out loud, and collaborate on a solution just as you would on the job.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
How do you approach building features when the initial product requirements are highly ambiguous or rapidly ch
How do you approach building features when the initial product requirements are highly ambiguous or rapidly changing?
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- 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?
Identify the heaviest tenants in a five-minute window under memory pressure
The edge service handles about 3,000 requests per second across roughly 50,000 tenants, peaking near 9,000. Expose the 50 heaviest tenants by request count over the trailing five minutes so limits can be tightened before one tenant's backfill starves the fleet. You may not retain five minutes of raw records. Give the exact solution and its memory, then the bounded-memory approximation with its error stated as a formula, and say which you would ship and at what tenant cardinality that choice changes.
Approach
- Do the exact version first, because it is affordable at this cardinality: a ring of 300 one-second counters per tenant, advanced lazily, is 1,200 bytes of counters per tenant and roughly 60 to 90 MB for 50,000 tenants with overhead. Carry a running total and subtract the bucket you overwrite so a window read is O(1) rather than 300 adds.
- Extract the top 50 with a size-k min-heap over the tenant sums: O(d log k) for d tenants, against O(d log d) to sort them all. Maintaining the heap continuously instead of on query requires a tenant-to-heap-index map, because incrementing a count already inside the heap means sifting from a known position, and without that map you rebuild the heap on every request.
- State the approximation precisely rather than gesturing at sketches. Misra-Gries with m counters retains every item whose true count exceeds N/(m+1), and each retained count underestimates the truth by at most N/(m+1). With m = 1,000 and N = 900,000 requests in the window the error is roughly 900 requests, which is fine for spotting a tenant sending 50,000 and useless for ranking two tenants 200 apart.
- Say what breaks when the window slides: Misra-Gries and Space-Saving are insert-only and cannot be decremented as records age out. The workable construction is one summary per sub-window, say ten seconds, with 30 summaries merged at query time, and the merged error is the sum of the per-summary errors, so the bound degrades linearly in the number of sub-windows.
Follow-up
- The heaviest tenant is heavy because of one export job rather than user traffic. Should the limiter treat those as the same tenant?
- Two tenants sit tied at the boundary of the top 50. Does your answer flap, and does the flapping matter?
Collapse a redelivered event batch into per-aggregate high-water marks
You drain a batch of up to 5,000,000 events, each (aggregate_id BIGINT, aggregate_version INT, event_type, payload). The log guarantees order within one aggregate only; the batch merges 64 partitions, and a relay failover has redelivered a range, so an older version for an aggregate can appear after a newer one. Given a map of last_applied_version per aggregate, produce the events worth applying, at most one per (aggregate_id, version), plus the count discarded. Target O(n) time. State the memory for 2,000,000 distinct aggregates and what you do when it does not fit.
Approach
- One pass, one hash map from aggregate_id to the highest version kept, and a discard counter. An event whose version is at or below last_applied_version for its aggregate is dropped without further work, which is the whole reason the event carries its version rather than a delta. O(n) expected time, O(d) space in distinct aggregates.
- Keep the maximum, never the last occurrence. The redelivered range means the final appearance of an aggregate in the batch can be an older version than one seen earlier in the same batch, so last-wins applies stale state over newer state and the projection regresses with no error anywhere.
- Cost the memory instead of calling it large: an 8-byte key plus a 4-byte version is 12 bytes of payload, and an open-addressed table held at a 0.7 load factor costs roughly 17 bytes per entry before per-slot metadata, so 2,000,000 aggregates is tens of megabytes in a native layout and several times that in a runtime that boxes both key and value.
- If the distinct set exceeds memory, partition on hash(aggregate_id) mod P and reduce each partition independently. Every event for one aggregate hashes to the same partition, so the per-partition result is exact and the merge is concatenation rather than a second reduction.
Follow-up
- The payload is a patch rather than a snapshot, so applying only the highest version loses the intermediate changes. What changes in your reduction?
- How do you detect that version 7 arrived while version 6 was never delivered, and what should the consumer do about the gap?
Hold a per-tenant active cap against concurrent creates
A tenant on the standard plan may hold at most 50 resources with status='active'. The create handler runs SELECT count(*) FROM resource WHERE tenant_id = $1 AND status = 'active', compares to 50, then inserts. Two creates arrive 3 ms apart on different instances and the tenant lands at 51. Name the anomaly, say whether PostgreSQL 16 READ COMMITTED or REPEATABLE READ prevents it and why, then give an implementation that holds the cap at READ COMMITTED with the exact statements. Finally, say what changes when the cap is 'at most one running export per tenant' on job_run.
Approach
- Name it: write skew. The two transactions read an overlapping set and write disjoint rows, so there is no row-level conflict for the engine to detect and each commit is individually legal.
- Rule out the levels precisely. READ COMMITTED takes a fresh snapshot per statement and takes no lock on the counted rows, so both see 49. PostgreSQL's REPEATABLE READ is snapshot isolation: it removes non-repeatable reads and phantoms within the snapshot but still admits write skew, because the anomaly is not a re-read of a changed row, it is a read of a set that a concurrent transaction invalidates. Only SERIALIZABLE closes it, by tracking the read dependency and aborting one transaction with SQLSTATE 40001 — a guarantee that exists only if the application re-runs the whole transaction from the read.
- Convert the set predicate into a single-row conflict: keep tenant.active_resource_count and run UPDATE tenant SET active_resource_count = active_resource_count + 1 WHERE tenant_id = $1 AND active_resource_count < 50 in the same transaction as the INSERT. Zero affected rows is the cap, returned as 409. The row lock serialises the decision at any isolation level, and contention is bounded to one tenant's row — which is also the fair-scheduling unit, unlike a global counter that would convoy every tenant behind one row.
- State the cost you just took on: a counter is a second source of truth that can drift, so every path that changes status must adjust it inside the same transaction, and a periodic reconciliation has to exist, with resource_revision as the authority for what the count should have been.
Follow-up
- A resource moves from archived back to active. Which statements change, and what breaks if the counter update and the status change land in different transactions?
- The cap becomes plan-dependent and a plan can change mid-month. Where does the number 50 live, and who reads it?
Find version gaps and relay lag with window functions
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
- 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.
- 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.
- 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.
- 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 do you manage complex, nested state in a React application without sacrificing rendering performance?
How do you manage complex, nested state in a React application without sacrificing rendering performance?
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- 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 scenario where you had to optimize a slow-rendering React component. What tools did you use to diag
Describe a scenario where you had to optimize a slow-rendering React component. What tools did you use to diagnose the issue, and how did you resolve it?
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- 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 reusable component library that supports consistent styling and accessibility across mu
How would you design a reusable component library that supports consistent styling and accessibility across multiple product lines?
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- 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 are the trade-offs between using context providers versus a dedicated state management library in a growi
What are the trade-offs between using context providers versus a dedicated state management library in a growing application?
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- 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?
Explain how you would implement an efficient real-time collaborative editing feature on the frontend.
Explain how you would implement an efficient real-time collaborative editing feature on the frontend.
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- 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 system to run multiple concurrent A/B tests on a high-traffic landing page?
How would you design a system to run multiple concurrent A/B tests on a high-traffic landing page?
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- 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 balance the pressure to ship rapid product experiments with the need to maintain clean, maintainabl
How do you balance the pressure to ship rapid product experiments with the need to maintain clean, maintainable code?
Approach
- Clarify what is being asked and what a complete answer contains.
- State your assumptions explicitly before working the problem.
- Say what you would check first and why it is the highest-information step.
- 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 metrics would you track to determine the success of a new onboarding feature, and how would you instrumen
What metrics would you track to determine the success of a new onboarding feature, and how would you instrument your code to capture them?
Approach
- Clarify what is being asked and what a complete answer contains.
- State your assumptions explicitly before working the problem.
- Say what you would check first and why it is the highest-information step.
- Work from the requirement backwards to the design.
Follow-up
- What assumption would you test first?
- How would you know your answer was wrong?
Every query on one table stalls for forty seconds mid-deploy
During a release on PostgreSQL, every query touching resource times out for about 40 seconds and then recovers with no intervention. The release ran one migration, ALTER TABLE resource ADD COLUMN archived_reason TEXT, and the migration log shows it completing in 6 ms. Unrelated tables showed no change in error rate. Explain how a 6 ms statement caused a 40-second stall, give the ordered checks you would run on a live system to confirm it, and give the migration procedure that prevents a repeat.
Approach
- Separate the statement's duration from the lock's duration. ADD COLUMN with no default is a catalogue-only change and genuinely runs in milliseconds, but it requires ACCESS EXCLUSIVE, and it cannot acquire that until every transaction already touching the table has finished.
- Account for the queueing, which is the part that surprises people. A lock request that is waiting blocks later requests for conflicting modes behind it rather than letting them overtake, so one long-open transaction holds the DDL and the DDL holds all the traffic. The stall length is set by the longest open transaction, not by the size of the change.
- Confirm on a live system in this order: pg_stat_activity for that table ordered by xact_start, looking for the oldest transaction and specifically for state = idle in transaction; then pg_locks where granted = false to find the waiter; then join them on pid to name blocker and blocked. pg_blocking_pids() does that join for you and is the fastest single call.
- Prevent rather than merely time it better. Set lock_timeout to a second or two on the migration session so the DDL abandons the queue after a bounded wait and is retried, instead of holding it for as long as the oldest transaction lives. Be exact about what that buys: queries arriving during the wait still queue behind the pending ACCESS EXCLUSIVE request, so each attempt costs them up to one lock_timeout of added latency. The outage goes from 40 seconds to about one second per attempt, not to zero. Also run migrations away from deploy-time peaks, and put a statement timeout and an idle-in-transaction timeout on the analytics role that opens the long transactions.
Follow-up
- The same release also wants NOT NULL on that column. What is the sequence that gets there without a long lock?
- Your lock_timeout retry fails ten times in a row because the analytics transaction is always open. What do you change?
Built from the rounds and topics Scribe candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the Scribe loop
- Write out the reported sequence: Recruiter Call, Hiring Manager Round, Technical Assessments, Behavioral Conversations.
- 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.
02Work React
- Spend the session on React, which Scribe candidates report being tested on.
- Write one worked example in React and time yourself on it.
Deliverable: One timed worked example in React.
03Work Data-Driven Product Experiments
- Spend the session on Data-Driven Product Experiments, which Scribe candidates report being tested on.
- Write one worked example in Data-Driven Product Experiments and time yourself on it.
Deliverable: One timed worked example in Data-Driven Product Experiments.
04Work Frontend Engineering
- Spend the session on Frontend Engineering, which Scribe candidates report being tested on.
- Write one worked example in Frontend Engineering and time yourself on it.
Deliverable: One timed worked example in Frontend Engineering.
05Answer out loud: React & Frontend Architecture
- Answer aloud, timed: How do you manage complex, nested state in a React application without sacrificing rendering performance?
- Answer aloud, timed: Describe a scenario where you had to optimize a slow-rendering React component. What tools did you use to diagnose the issue, and how did you resolve it?
Deliverable: Spoken answers to 2 reported React & Frontend Architecture question(s), under time.
06Answer out loud: Product & Growth Engineering
- Answer aloud, timed: How would you design a system to run multiple concurrent A/B tests on a high-traffic landing page?
- Answer aloud, timed: Describe a time when you used user analytics or product data to identify a bottleneck in a user flow and engineered a solution to fix it.
Deliverable: Spoken answers to 2 reported Product & Growth Engineering question(s), under time.
07Answer out loud: Behavioral & Collaboration
- Answer aloud, timed: Tell me about a time you had a strong disagreement with a Product Manager regarding a feature's scope. How did you resolve it?
- Answer aloud, timed: Describe a situation where you had to quickly learn a new technology or domain to deliver a critical project.
Deliverable: Spoken answers to 2 reported Behavioral & Collaboration question(s), under time.
Expand any day for tasks and deliverables. Your progress is saved on this device.
Behavioural rounds judge the decision you made and what it cost.
Describe a time when you used user analytics or product data to identify a bottleneck in a user flow and engin
Describe a time when you used user analytics or product data to identify a bottleneck in a user flow and engineered a solution to fix it.
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- 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 you had a strong disagreement with a Product Manager regarding a feature's scope. How did
Tell me about a time you had a strong disagreement with a Product Manager regarding a feature's scope. How did you resolve it?
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- 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 situation where you had to quickly learn a new technology or domain to deliver a critical project.
Describe a situation where you had to quickly learn a new technology or domain to deliver a critical project.
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- 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 constructive feedback on your code during peer reviews, and how do you deliver feedback to o
How do you handle constructive feedback on your code during peer reviews, and how do you deliver feedback to others?
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- 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?
Share an experience where a project you were leading fell behind schedule. How did you communicate this to sta
Share an experience where a project you were leading fell behind schedule. How did you communicate this to stakeholders, and what steps did you take to get back on track?
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- 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?
Why do you want to work at Scribe, and how does our product mission align with your career goals?
Why do you want to work at Scribe, and how does our product mission align with your career goals?
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- 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?
- 01
Describe a time when you used user analytics or product data to identify a bottleneck in a user flow and engineered a solution to fix it.
- 02
Tell me about a time you had a strong disagreement with a Product Manager regarding a feature's scope. How did you resolve it?
- 03
Describe a situation where you had to quickly learn a new technology or domain to deliver a critical project.
- 04
How do you handle constructive feedback on your code during peer reviews, and how do you deliver feedback to others?
Does Scribe ask traditional Leetcode questions in the technical rounds?
No. Scribe's technical assessments are highly practical and designed to mirror real-world engineering tasks. You will participate in live coding pairing sessions focusing on React application development and system design rather than abstract data structures and algorithmic puzzles.
Scribe Software Engineer candidate reports ↗How long does the entire interview process typically take?
The process is designed to be highly efficient and respectful of your time. From the initial recruiter screen to a final decision, the loop typically takes between two to four weeks, with clear communication and fast turnaround times between rounds.
Scribe Software Engineer candidate reports ↗What is the engineering culture like at Scribe?
The culture is highly collaborative, passionate, and transparent. Engineers work closely with product and design, take immense pride in their craftsmanship, and are deeply committed to building a product that delivers real value to millions of users.
Scribe Software Engineer candidate reports ↗What should I prepare for the Technical Project Presentation?
Choose a project where you played a significant technical role. Be prepared to explain the architecture, the technical and business challenges you faced, the trade-offs you made, and what you learned from the experience. Use visual aids like slides or diagrams to make your presentation engaging.
Scribe Software Engineer candidate reports ↗Are there remote or hybrid work options for this position?
Scribe supports a flexible working environment. Depending on the team and location, roles are offered on a hybrid basis (with offices in hubs like San Francisco and Belgrade) or fully remote within supported jurisdictions. Be sure to clarify your location preferences with your recruiter during the initial call.
Scribe Software Engineer candidate reports ↗What topics does Scribe test in interviews?
Scribe interviews most often cover React, Customer Success (CS) Fundamentals, Data-Driven Product Experiments, Enterprise Customer Success Experience, and Role-Play / Scenario-Based Interviewing. The exact emphasis depends on the specific role you apply for.
Scribe Software Engineer candidate reports ↗Sources & methodology 3 sources ↗
No official company page is cited. Rounds and questions come from candidate reports and PracHub editorial material; each source shows the date it was read.
- 01Scribe Software Engineer candidate reports ↗
Company-reported rounds, questions and FAQ.
Candidate reports · Accessed 2026-09-22 - 02PracHub Software Engineer practice ↗
PracHub practice material, not company-reported.
PracHub page · Accessed 2026-09-22 - 03PracHub preparation framework ↗
PracHub preparation guidance.
PracHub page · Accessed 2026-09-22
Explore related engineering environments and compare the preparation focus.
Discord Software Engineer Interview Guide
Database practice for Discord candidates: how an index changes a query plan, and which anomalies survive a given isolation level, since read committed still permits non-repeatable reads.
Rystad Energy Software Engineer Interview Guide
Prepare for Rystad Energy software interviews with worked Python validation, OOP and decorator examples, plus an ingestion case and practical checks.
Zwift Software Engineer Interview Guide
What Zwift asks Software Engineer candidates, from reported rounds and questions.
Zumper Software Engineer Interview Guide
What Zumper asks Software Engineer candidates, from reported rounds and questions.