At Fuku, a Software Engineer is more than just a developer writing code. You are a core builder of the core systems, infrastructure, and user-facing products that power our growing platform. Whether you are joining as a Senior Go Developer, a Member of Technical Staff, or a Software Engineer - Product, your work directly impacts our ability to scale, maintain high availability, and deliver exceptional user experiences. The engineering team at Fuku tackles complex distributed systems challenges, high-throughput API designs, and rapid product iterations. Because we support a diverse stack ranging from high-performance Go microservices to robust PHP backends, engineers here must be highly adaptable and capable of moving across the stack when necessary. We value technical excellence, product intuition, and a strong sense of ownership over the entire software development lifecycle. As a Software Engineer, you will collaborate closely with product managers, designers, and fellow engineers to translate ambitious business goals into production-ready software. You will have the opportunity to architect new services from scratch, optimize existing databases, and establish engineering best practices that will shape the technical direction of for years to come. Fuku
Recruiter Screen
reportedInitial conversation to align on your background, career goals, and compensation expectations.
What to demonstrate
- Initial conversation to align on your background, career goals, and compensation expectations
- Depth in Go
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 Screen
reportedLive coding session or practical system design discussion to evaluate technical skills.
What to demonstrate
- Live coding session or practical system design discussion to evaluate technical skills
- Depth in Go
How to prepare
- Answer aloud and timed: How do you handle database write bottlenecks in a system experiencing rapid, unpredictable traffic spikes?
- Answer aloud and timed: Design a distributed job scheduler that guarantees at least-once delivery.
Virtual Onsite Loop
reportedDeep dives into architecture, coding, product engineering, and behavioral scenarios.
What to demonstrate
- Deep dives into architecture, coding, product engineering, and behavioral scenarios
- Depth in Go
How to prepare
- Answer aloud and timed: How would you migrate a legacy monolithic service to a microservices architecture without causing downtime?
- Answer aloud and timed: Implement a thread-safe in-memory cache with an LRU eviction policy.
PracHub editorial advice for the preparation topics above.
Communicate your trade-offs
In system design interviews, there is rarely a single "correct" answer. Explain why you chose SQL over NoSQL, or why you opted for asynchronous processing over synchronous API calls.
Write production-grade code
Treat your coding interview like a production task. Write tests, handle edge cases, and ensure your variable names are descriptive.
Do not rush through the coding rounds
Fuku interviewers prioritize clean, readable, and maintainable code over a fast, unoptimized solution.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
Implement a thread-safe in-memory cache with an LRU eviction policy.
Implement a thread-safe in-memory cache with an LRU eviction policy.
Approach
- Say what the runtime actually does before reasoning about the code.
- Name what is shared across threads and what owns each piece of state.
- Identify the window where an invariant is briefly untrue.
- 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?
Write a function to detect cycles in a directed graph and explain its time and space complexity.
Write a function to detect cycles in a directed graph and explain its time and space complexity.
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?
Given a stream of incoming data points, how would you efficiently find the median value at any given moment?
Given a stream of incoming data points, how would you efficiently find the median value at any given moment?
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?
Implement a rate-limiting algorithm using the token bucket approach.
Implement a rate-limiting algorithm using the token bucket approach.
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?
Write a program to merge overlapping intervals in an array of time blocks.
Write a program to merge overlapping intervals in an array of time blocks.
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?
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?
Replace offset paging on the resource feed with keyset
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
- 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.
- 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.
- 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.
- 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 rate limiter for a high-traffic public API?
How would you design a rate limiter for a high-traffic public API?
Approach
- Say who the caller is and what they do when the call fails halfway.
- Define the identity of a request so a retry cannot double-apply it.
- Separate accepted, pending, failed and confirmed; they are different facts.
- Design the error taxonomy before the success shape; callers branch on it.
Follow-up
- What happens if the caller retries after a timeout?
- How does a client discover it is on an old version of this contract?
Explain how you would architect a real-time notification service that supports multiple delivery channels (SMS
Explain how you would architect a real-time notification service that supports multiple delivery channels (SMS, Email, Push).
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?
Design a distributed job scheduler that guarantees at least-once delivery.
Design a distributed job scheduler that guarantees at least-once delivery.
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 migrate a legacy monolithic service to a microservices architecture without causing downtime?
How would you migrate a legacy monolithic service to a microservices architecture without causing downtime?
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?
Design the database schema and API endpoints for a collaborative document editing tool.
Design the database schema and API endpoints for a collaborative document editing tool.
Approach
- Say who the caller is and what they do when the call fails halfway.
- Define the identity of a request so a retry cannot double-apply it.
- Separate accepted, pending, failed and confirmed; they are different facts.
- 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?
How would you structure a RESTful API to support complex filtering, pagination, and sorting?
How would you structure a RESTful API to support complex filtering, pagination, and sorting?
Approach
- Say who the caller is and what they do when the call fails halfway.
- Define the identity of a request so a retry cannot double-apply it.
- Separate accepted, pending, failed and confirmed; they are different facts.
- Design the error taxonomy before the success shape; callers branch on it.
Follow-up
- What happens if the caller retries after a timeout?
- How does a client discover it is on an old version of this contract?
Explain how you would design an idempotent payment processing API.
Explain how you would design an idempotent payment processing API.
Approach
- Say who the caller is and what they do when the call fails halfway.
- Define the identity of a request so a retry cannot double-apply it.
- Separate accepted, pending, failed and confirmed; they are different facts.
- 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?
How do you ensure backward compatibility when introducing breaking changes to a production API?
How do you ensure backward compatibility when introducing breaking changes to a production API?
Approach
- Say who the caller is and what they do when the call fails halfway.
- Define the identity of a request so a retry cannot double-apply it.
- Separate accepted, pending, failed and confirmed; they are different facts.
- 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?
Exports duplicate a row range about once a week
Roughly once a week an export writes a file containing a duplicated range of rows. The affected job_run rows show attempt = 1, status = succeeded, one started_at, and a lease_owner naming a different host from the one whose logs show the job starting. Leases last 30 seconds and are heartbeated every 10 from inside the handler; lease_expires_at is computed on the worker and compared against the database's now(). Find the mechanism, and give a fix that holds even if you cannot fix the clocks.
Approach
- Start from the fact that eliminates the obvious answer. attempt = 1 means no retry was recorded, so this is not a re-run after failure; two workers ran the same row concurrently and the takeover path never touched the counter. lease_owner naming a host other than the one that started the job is the same statement from the other side.
- Enumerate the mechanisms that cause a premature takeover, then find the signal that separates them. Either the lease genuinely expired because the heartbeat did not fire, which is what happens when the heartbeat runs on the handler's own thread and the handler makes a long blocking call, or it only appeared expired because two clocks disagree, since lease_expires_at is written from the worker's clock and evaluated against the database's. The discriminator is the distribution: incidents clustered on the longest exports indict the heartbeat, incidents clustered on one host indict skew. Measure both, and measure each host's offset against the database directly.
- Read the reclaim query precisely. In PostgreSQL now() is transaction start time, not statement time, so a reclaimer holding a long transaction compares against an older timestamp than expected; clock_timestamp() is the statement-time function. This is worth ruling in or out before you redesign anything, because it changes which rows look expired.
- Remove the second clock rather than trying to synchronise it. Issue and extend the lease in the database, with lease_expires_at = now() + interval '30 seconds' in both the claim and the heartbeat, so exactly one clock is ever compared and worker skew stops mattering to this predicate.
Follow-up
- The displaced worker has already streamed half the file to object storage. What makes that side effect safe to repeat?
- You now count takeovers. What alert fires on that counter, and at what threshold?
Built from the rounds and topics Fuku candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the Fuku loop
- Write out the reported sequence: Recruiter Screen, Technical Screen, Virtual Onsite Loop.
- 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.
02Work Go
- Spend the session on Go, which Fuku candidates report being tested on.
- Write one worked example in Go and time yourself on it.
Deliverable: One timed worked example in Go.
03Work Backend Engineering
- Spend the session on Backend Engineering, which Fuku candidates report being tested on.
- Write one worked example in Backend Engineering and time yourself on it.
Deliverable: One timed worked example in Backend Engineering.
04Work Full-Stack Engineering
- Spend the session on Full-Stack Engineering, which Fuku candidates report being tested on.
- Write one worked example in Full-Stack Engineering and time yourself on it.
Deliverable: One timed worked example in Full-Stack Engineering.
05Answer out loud: System Design & Architecture
- Answer aloud, timed: How would you design a rate limiter for a high-traffic public API?
- Answer aloud, timed: Explain how you would architect a real-time notification service that supports multiple delivery channels (SMS, Email, Push).
Deliverable: Spoken answers to 2 reported System Design & Architecture question(s), under time.
06Answer out loud: Coding & Algorithms
- Answer aloud, timed: Implement a thread-safe in-memory cache with an LRU eviction policy.
- Answer aloud, timed: Write a function to detect cycles in a directed graph and explain its time and space complexity.
Deliverable: Spoken answers to 2 reported Coding & Algorithms question(s), under time.
07Answer out loud: Product & API Design
- Answer aloud, timed: Design the database schema and API endpoints for a collaborative document editing tool.
- Answer aloud, timed: How would you structure a RESTful API to support complex filtering, pagination, and sorting?
Deliverable: Spoken answers to 2 reported Product & API Design 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.
How do you handle database write bottlenecks in a system experiencing rapid, unpredictable traffic spikes?
How do you handle database write bottlenecks in a system experiencing rapid, unpredictable traffic spikes?
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 to make a technical compromise to meet a tight business deadline.
Tell me about a time you had to make a technical compromise to meet a tight business deadline.
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 disagreed with a peer or manager on an architectural decision. How did you reso
Describe a situation where you disagreed with a peer or manager on an architectural decision. 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?
How do you mentor junior engineers and help them grow technically?
How do you mentor junior engineers and help them grow technically?
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 complex technical post-mortem you led. What did you learn from the outage?
Tell me about a complex technical post-mortem you led. What did you learn from the outage?
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
How do you handle database write bottlenecks in a system experiencing rapid, unpredictable traffic spikes?
- 02
Tell me about a time you had to make a technical compromise to meet a tight business deadline.
- 03
Describe a situation where you disagreed with a peer or manager on an architectural decision. How did you resolve it?
- 04
How do you mentor junior engineers and help them grow technically?
What programming languages are most common in the Fuku interview?
We primary look for proficiency in the languages relevant to our stack, such as Go or PHP. However, we are generally language-agnostic during coding interviews and care more about your problem-solving process and coding fundamentals.
Fuku Software Engineer candidate reports ↗How long does the entire interview process take?
We aim to complete the entire process—from the initial recruiter call to an offer decision—within 2 to 4 weeks, depending on your availability and scheduling speed.
Fuku Software Engineer candidate reports ↗How heavily does Fuku weigh system design versus coding?
Both are highly critical. For senior and staff-level roles (like Senior Software Engineer or Member of Technical Staff), system design and architectural trade-offs carry significantly more weight in the final decision.
Fuku Software Engineer candidate reports ↗Does Fuku support remote work?
While we have hubs in San Francisco, New York, and Austin, we offer flexible hybrid and remote work arrangements depending on the specific team and role requirements.
Fuku Software Engineer candidate reports ↗What topics does Fuku test in interviews?
Fuku interviews most often cover Full-Stack Engineering, LLM-Powered Code Review, Go, New Product Development, and AI Engineer (Applied AI Development). The exact emphasis depends on the specific role you apply for.
Fuku 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.
- 01Fuku 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.
Cognition Software Engineer Interview Guide
What Cognition asks Software Engineer candidates, from reported rounds and questions.
Viber Software Engineer Interview Guide
What Viber asks Software Engineer candidates, from reported rounds and questions.
The Coca-Cola Software Engineer Interview Guide
What The Coca-Cola asks Software Engineer candidates, from reported rounds and questions.
Red Ventures Software Engineer Interview Guide
What Red Ventures asks Software Engineer candidates, from reported rounds and questions.