cswork / libraryOpen practice workspace

Interview guides · Startup Germany

Startup Germany Software Engineer Interview Guide

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

The 60-second brief

As a Software Engineer at Startup Germany, you will be at the forefront of building scalable, highly performant applications that drive our core business forward. The engineering team is tasked with solving complex technical challenges, ranging from optimizing high-traffic systems to automating robust deployment pipelines. Your work will directly impact our global user base, ensuring our platform remains fast, reliable, and secure. This role is critical because Startup Germany operates in a dynamic, rapidly growing market where engineering agility and system reliability are paramount. You will not just write code; you will shape the architecture of our products, influence our technical roadmap, and contribute to a culture of engineering excellence.

This guide is scoped to a Software Engineer candidate at Startup Germany.

Focus areas

  • DSA (Data Structures & Algorithms)
  • System Design
  • React Deployment Automation

The Startup Germany interview process

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

Introductory Call

Discuss your background, interests, and working expectations.

What to demonstrate

  • Discuss your background, interests, and working expectations
  • Depth in DSA (Data Structures & Algorithms)

How to prepare

  • Answer aloud and timed: Explain the key components of a GitHub Actions workflow.
  • Answer aloud and timed: How do you optimize a workflow for faster execution?

Technical Round - DSA

Focus on data structures and algorithms through coding challenges.

What to demonstrate

  • Focus on data structures and algorithms through coding challenges
  • Depth in DSA (Data Structures & Algorithms)

How to prepare

  • Answer aloud and timed: How would you deploy a React application using GitHub Actions?
  • Answer aloud and timed: Walk us through how you would set up automated testing within a deployment pipeline.

Technical Round - System Design

Deep dive into system design concepts and your past projects.

What to demonstrate

  • Deep dive into system design concepts and your past projects
  • Depth in DSA (Data Structures & Algorithms)

How to prepare

  • Answer aloud and timed: Implement a solution to a standard Data Structures and Algorithms (DSA) problem (e.g., array manipulation, tree traversal, or dynamic programming).
  • Answer aloud and timed: Analyze the time and space complexity of your coding solution and explain how you would optimize it.

HR Interview

Discuss team fit, compensation, and logistics.

What to demonstrate

  • Discuss team fit, compensation, and logistics
  • Depth in DSA (Data Structures & Algorithms)

How to prepare

  • Answer aloud and timed: How do you handle edge cases and error states in your algorithms?
  • Answer aloud and timed: Walk us through a complex project you previously worked on, explaining your architectural decisions and the trade-offs you made.

Where candidates lose points

Optimize for Speed and Safety

When discussing deployment pipelines, always highlight the balance between fast execution (caching, parallel jobs) and safety (automated testing, linting).

Address the "Inexperienced Worker" Scenario

Be prepared to discuss how you write code and design systems that are self-documenting and hard to break, especially for junior team members.

Explain Your Trade-offs

In system design, there is rarely a single "correct" answer. Always explain the trade-offs of your choices (e.g., consistency vs. availability).

Questions & practice

Implement a solution to a standard Data Structures and Algorithms (DSA) problem (e.g., array manipulation, tre

Medium · Coding & Algorithms (DSA)

Implement a solution to a standard Data Structures and Algorithms (DSA) problem (e.g., array manipulation, tree traversal, or dynamic programming).

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?

Analyze the time and space complexity of your coding solution and explain how you would optimize it.

Medium · Coding & Algorithms (DSA)

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?

Canonicalise a request body into a stable idempotency fingerprint

Medium · parsing · canonicalisation · hashing

idempotency_key.request_fingerprint is a SHA-256 over the method, path and canonicalised body, and a retry whose fingerprint differs must be rejected with 422 rather than served the stored response. Write the canonicaliser. Bodies are JSON up to 256 KB nested at most 32 levels; clients vary key order, whitespace and unicode escaping, and some send 64-bit ids as JSON numbers. Produce a deterministic byte string such that semantically identical bodies match and any semantic difference does not. State your complexity and name two normalisations you refuse to perform.

Approach

  1. Parse once into a tree, then re-serialise under fixed rules: object keys sorted, array order preserved, one escaping convention, no insignificant whitespace. Parsing is O(n) and sorting keys is O(k log k) per object, so O(n log n) overall with O(depth) stack, and the 32-level cap is enforced during parsing because hostile nesting is how a canonicaliser becomes a stack overflow.
  2. Sort keys by their UTF-8 bytes and say why the obvious implementation is wrong in some runtimes: a default string comparison that orders by UTF-16 code units places surrogate pairs, meaning code points from U+10000 up, below U+E000 to U+FFFF, which is not UTF-8 byte order, so two services written in different languages disagree on the same document.
  3. Do not re-encode numbers through a double. IEEE-754 binary64 represents integers exactly only up to 2^53, so normalising a 19-digit id through a float changes it, and 1 against 1.0 cannot be reconciled without deciding whether they are the same value. Preserve the literal token, and require ids as strings at the API boundary if you want them comparable.
  4. Reject duplicate keys rather than picking one. JSON permits them and parsers disagree, most keeping the last, so any choice you make ties the fingerprint to a parser detail that the code handling the request does not necessarily share.

Follow-up

  • A client sends the same logical request with an extra field your API ignores. Same key, different fingerprint, so you return 422. Is that the right answer?
  • Where does the fingerprint get computed relative to request decompression and the body-size limit?

Write the update path that detects a concurrent edit

Medium · optimistic concurrency · transactional outbox · audit history

resource carries version INT NOT NULL DEFAULT 1. resource_revision holds revision_id, resource_id, version, actor_user_id, change_kind, patch JSONB, request_id, created_at with UNIQUE (resource_id, version). outbox_event holds aggregate_type, aggregate_id, aggregate_version, event_type, payload, status. A PUT carries the version the client read. Write the exact statements for the single transaction that applies the edit, records the revision and enqueues 'resource.updated', and give the handler's branch on zero affected rows. Then say what PostgreSQL 16 does under READ COMMITTED when two of these updates hit one row at once.

Approach

  1. One transaction, three writes, no network call inside it: UPDATE resource SET title = $3, version = version + 1, updated_at = now() WHERE resource_id = $1 AND tenant_id = $4 AND version = $2; then INSERT the resource_revision row at version $2 + 1; then INSERT the outbox_event row at the same aggregate_version. The event goes to a table rather than a broker because no transaction spans both.
  2. Branch on the affected-row count before doing anything else. Zero has three causes — stale version, wrong tenant, row gone — so re-read once and map to 409 carrying the current version, or 404 for an id outside the caller's tenant, which also stops the endpoint confirming that another tenant's id exists.
  3. State the engine behaviour instead of assuming it. Under READ COMMITTED the second UPDATE blocks on the row lock, and when the first commits PostgreSQL re-evaluates the WHERE clause against the newly committed row, so the version predicate now fails and the statement reports zero rows. Under REPEATABLE READ the identical collision raises SQLSTATE 40001 instead, so the handler must fold both shapes into one conflict response.
  4. Keep UNIQUE (resource_id, version) even though the predicate already serialises writers. It is what makes a lost update unwritable if any other path ever reaches the revision table, and it converts a logic bug into 23505 rather than into a silently missing history row.

Follow-up

  • A client sends the version it read ten minutes ago and the resource has moved three versions. What is in your 409 so it can resolve the conflict without a full re-fetch?
  • Two editors, two disjoint fields, no overlap. Does your answer still refuse the second write, and should it?

Explain why the owner filter ignores the listing index

Medium · composite index · query plans · sort elimination

The only index on resource is (tenant_id, status, updated_at DESC, resource_id DESC). A new endpoint returns one user's resources across all statuses, newest created first: WHERE tenant_id = $1 AND owner_user_id = $2 ORDER BY created_at DESC LIMIT 20. On a tenant with 2M rows it takes 900 ms and EXPLAIN shows a sort above a large scan. Explain precisely why the existing index cannot serve it, give the index that can, and state which of these the new index still will not help: owner_user_id alone across tenants; the same query ordered by updated_at. PostgreSQL 16.

Approach

  1. Separate the two jobs an index does. For filtering, a composite btree is seekable only on a left prefix, so with no predicate on status the scan can at best range over tenant_id and test owner_user_id per row; PostgreSQL 16 has no btree skip scan to jump the unconstrained column.
  2. For ordering, the index is sorted by (status, updated_at) within a tenant and not by created_at, so the LIMIT cannot stop early: every matching row is read and then sorted. That is the 'Sort Method: top-N heapsort' line, and it is why the plan reads 2M rows to answer with 20.
  3. Derive the replacement from the access path — equality, equality, then the ordering column: CREATE INDEX CONCURRENTLY ON resource (tenant_id, owner_user_id, created_at DESC). The scan seeks to the (tenant, owner) range and walks 20 entries in order, so the Sort node disappears along with the row-read.
  4. Treat INCLUDE (title, status) as conditional, not free. An index-only scan still visits the heap for any row whose page is not marked all-visible, so on a table taking 1.2k writes/second the win depends on autovacuum keeping the visibility map current, and the wider index costs more on every insert.

Follow-up

  • 90% of rows are status='active'. Would a partial index WHERE status = 'active' change your answer, and for which of the three queries?
  • A dashboard runs this for 40 owners in one page load. What changes about the design?

Explain the key components of a GitHub Actions workflow.

Medium · CI/CD & DevOps Automation

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

How do you optimize a workflow for faster execution?

Medium · CI/CD & DevOps Automation

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

How would you deploy a React application using GitHub Actions?

Medium · CI/CD & DevOps Automation

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

Walk us through how you would set up automated testing within a deployment pipeline.

Medium · CI/CD & DevOps Automation

Approach

  1. Clarify what is being asked and what a complete answer contains.
  2. State your assumptions explicitly before working the problem.
  3. Say what you would check first and why it is the highest-information step.
  4. Work from the requirement backwards to the design.

Follow-up

  • What assumption would you test first?
  • How would you know your answer was wrong?

Walk us through a complex project you previously worked on, explaining your architectural decisions and the tr

Medium · System Design & Scenario-Based Architect

Walk us through a complex project you previously worked on, explaining your architectural decisions and the trade-offs you made.

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 software architecture specifically to solve complex issues that inexperienced developers

Medium · System Design & Scenario-Based Architect

How would you design software architecture specifically to solve complex issues that inexperienced developers on your team might face?

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 do you design systems to handle sudden spikes in user traffic?

Medium · System Design & Scenario-Based Architect

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?

Exports duplicate a row range about once a week

Hard · leases · clock skew · idempotency

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

  1. 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.
  2. 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.
  3. 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.
  4. 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?

Suggested practice checklist

Built from the rounds and topics Startup Germany candidates report.

Day 1 — Map the Startup Germany loop

  • Write out the reported sequence: Introductory Call, Technical Round - DSA, Technical Round - System Design, HR 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 DSA (Data Structures & Algorithms)

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

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

Day 3 — Work System Design

  • Spend the session on System Design, which Startup Germany 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 4 — Work React Deployment Automation

  • Spend the session on React Deployment Automation, which Startup Germany candidates report being tested on.
  • Write one worked example in React Deployment Automation and time yourself on it.

Deliverable: One timed worked example in React Deployment Automation.

Day 5 — Answer out loud: CI/CD & DevOps Automation

  • Answer aloud, timed: Explain the key components of a GitHub Actions workflow.
  • Answer aloud, timed: How do you optimize a workflow for faster execution?

Deliverable: Spoken answers to 2 reported CI/CD & DevOps Automation question(s), under time.

Day 6 — Answer out loud: Coding & Algorithms (DSA)

  • Answer aloud, timed: Implement a solution to a standard Data Structures and Algorithms (DSA) problem (e.g., array manipulation, tree traversal, or dynamic programming).
  • Answer aloud, timed: Analyze the time and space complexity of your coding solution and explain how you would optimize it.

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

Day 7 — Answer out loud: System Design & Scenario-Based Architecture

  • Answer aloud, timed: Walk us through a complex project you previously worked on, explaining your architectural decisions and the trade-offs you made.
  • Answer aloud, timed: How would you design software architecture specifically to solve complex issues that inexperienced developers on your team might face?

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

Behavioural preparation

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

How do you handle edge cases and error states in your algorithms?

Medium · Coding & Algorithms (DSA)

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 yourself and your journey as a Software Engineer.

Medium · Behavioral & Alignment

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 align your technical interests and skills with our working expectations?

Medium · Behavioral & Alignment

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 resolve a technical disagreement within your team.

Medium · Behavioral & Alignment

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?