cswork / libraryOpen practice workspace

Interview guides · Linden Lab

Linden Lab Software Engineer Interview Guide

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

The 60-second brief

A Software Engineer at Linden Lab is at the heart of maintaining and evolving one of the most enduring and complex virtual world platforms in existence. You will work on massive-scale systems that require a deep understanding of distributed architectures, real-time data synchronization, and the unique challenges of maintaining a persistent, user-generated environment. Your contributions directly impact the stability, performance, and feature set of the platform, ensuring millions of user interactions remain seamless and engaging. This role is both technically demanding and intellectually stimulating, as you will often be tasked with solving problems that do not have off-the-shelf solutions. You will collaborate with cross-functional teams, including product managers and fellow engineers, to translate complex technical requirements into elegant code.

This guide is scoped to a Software Engineer candidate at Linden Lab.

Focus areas

  • REST API Design
  • System Architecture
  • System Design (Scalability/Architecture)

The Linden Lab interview process

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

Initial Screening

The process begins with initial screens conducted by a recruiter and manager to assess basic qualifications.

What to demonstrate

  • The process begins with initial screens conducted by a recruiter and manager to assess basic qualifications
  • Depth in REST API Design

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 Deep-Dives

Following the initial screening, candidates undergo deeper technical evaluations with multiple team members.

What to demonstrate

  • Following the initial screening, candidates undergo deeper technical evaluations with multiple team members
  • Depth in REST API Design

How to prepare

  • Answer aloud and timed: How do you approach building RESTful applications that maintain high performance under heavy load?
  • Answer aloud and timed: Describe a time you had to debug a complex, multi-threaded issue in a production environment.

Onsite/Virtual Onsite

Candidates participate in onsite or virtual onsite interviews, focusing on high-level system design and coding concepts.

What to demonstrate

  • Candidates participate in onsite or virtual onsite interviews
  • Focusing on high-level system design and coding concepts

How to prepare

  • Answer aloud and timed: How would you optimize a system that requires low-latency synchronization across global servers?
  • Answer aloud and timed: Given a set of constraints, how do you determine the most efficient algorithm for a specific data processing task?

Where candidates lose points

Show your work

Always explain your thought process while solving problems. The interviewer is more interested in how you think than in the final code on the whiteboard.

Master the fundamentals

Review your computer science basics, including Big O notation and common design patterns.

Be authentic

Linden Lab places a high premium on character. Be honest about what you know and what you don't.

Ask thoughtful questions

Use your time with engineers and leadership to ask about the long-term technical challenges the company is facing.

Questions & practice

Given a set of constraints, how do you determine the most efficient algorithm for a specific data processing t

Medium · Problem-Solving and Logic

Given a set of constraints, how do you determine the most efficient algorithm for a specific data processing task?

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 a whiteboard coding problem when the requirements are intentionally ambiguous?

Medium · Problem-Solving and Logic

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?

Can you explain the time and space complexity of your proposed solution?

Medium · Problem-Solving and Logic

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?

Keep soft-deleted accounts from blocking re-registration

Easy · soft delete · unique constraints · engine differences

app_user holds user_id, tenant_id, email CITEXT, password_hash (NULL for SSO principals), email_verified_at, auth_version, status ('invited','active','suspended','deactivated'), created_at, updated_at, deleted_at. Two live accounts for one address inside a tenant must be impossible, but an address freed by a soft delete must be reusable, and the same tenant may delete and re-register it repeatedly. Write the uniqueness DDL for PostgreSQL 16, then the equivalent for MySQL 8 where partial indexes do not exist, and say what each permits once three deleted rows already hold that address.

Approach

  1. Start from what is actually unique: not (tenant_id, email), but (tenant_id, email) among live rows. PostgreSQL says that directly — CREATE UNIQUE INDEX app_user_live_email ON app_user (tenant_id, email) WHERE deleted_at IS NULL. A full constraint over the same two columns burns the address permanently the first time someone deletes an account.
  2. Keep case-insensitivity in the type or the index, never in the application: CITEXT as given, or UNIQUE (tenant_id, lower(email)) as an expression index where the extension is unavailable. A case-sensitive unique column is exactly how two accounts for one human appear.
  3. For MySQL 8 the predicate has to move inside the key: add a discriminator column that is a constant 0 while the row is live and is set to user_id on delete, with UNIQUE (tenant_id, email, deleted_marker). Live rows share the constant and still collide; deleted rows differ from each other and stop colliding.
  4. State the NULL variant and its dependency: leaving the marker NULL for deleted rows also works, because a unique index treats NULLs as distinct — true in MySQL, and true in PostgreSQL only under the default NULLS DISTINCT, which PostgreSQL 15 lets you reverse. Check the polarity against the three existing deleted rows: constant-on-live is what preserves the collision you want, and reversing it silently admits duplicate live accounts.

Follow-up

  • A deleted account re-registers with the same address the next day. Do the old resource rows follow the new user_id, and how does the API keep the two principals apart?
  • How do you honour an erasure request while resource_revision.actor_user_id still references this table?

Stop tag and share joins from fanning out a page

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

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

Approach

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

Follow-up

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

How would you design a highly available, distributed system to handle massive concurrent user traffic?

Medium · Technical Architecture and Systems

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?

What are the trade-offs between different database architectures in the context of real-time virtual environme

Medium · Technical Architecture and Systems

What are the trade-offs between different database architectures in the context of real-time virtual environments?

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 approach building RESTful applications that maintain high performance under heavy load?

Medium · Technical Architecture and Systems

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 optimize a system that requires low-latency synchronization across global servers?

Medium · Technical Architecture and Systems

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?

Walk me through your process for decomposing a large, monolithic problem into manageable components.

Medium · Problem-Solving and Logic

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?

Why do you want to work on a platform as unique and complex as Second Life?

Medium · Cultural Alignment and Professionalism

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 balance the need for high-quality code with the pressure of tight deadlines?

Medium · Cultural Alignment and Professionalism

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?

Describe a situation where you had to learn a new technology or tool quickly to meet a project requirement.

Medium · Cultural Alignment and Professionalism

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?

Read latency spikes on a sixty-second sawtooth

Medium · cache stampede · single-flight · ttl

The cached listing read path serves about 14k reads/second at an 85% hit rate. p99 sits at 35 ms for 57 seconds, jumps to 900 ms for 3, and repeats. During each spike the primary shows several hundred identical listing queries starting within the same millisecond, all carrying one large tenant's id. Cache entries use a 60-second TTL. Give the mechanism, the ordered checks, the fix, and the correctness hazard your fix must not introduce.

Approach

  1. Match the period to a configured number before theorising about load. A spike every 60 seconds against a 60-second TTL is an entry expiring, and you confirm it by correlating spike timestamps with the entry's write time rather than with the traffic curve. If the period had matched a cron or a GC interval instead, this is a different investigation.
  2. Establish the concurrency of the miss. Several hundred identical queries in one millisecond means the miss path has no coalescing: every request that arrives between expiry and repopulation recomputes. The herd size is that key's arrival rate times its recompute time, so at 1.2k reads/second for the hot key and a 250 ms recompute you expect about 300 concurrent misses, which matches what is observed.
  3. Add single-flight on the miss path so one caller per key recomputes under a short-lived lock while the rest wait for its result. Prefer stale-while-revalidate where the read tolerates it: return the expired value immediately and refresh asynchronously, which removes the latency spike rather than serialising it into a queue of waiters.
  4. De-synchronise the keys. Write TTLs with jitter, for example 60 seconds plus or minus 10%, so a deploy or a mass invalidation does not align every key on the same second and turn a per-key herd into a fleet-wide one.

Follow-up

  • The same sawtooth appears on a key that is invalidated on write rather than expired. Is that the same bug?
  • How does your answer change if the recompute takes 4 seconds instead of 250 ms?

Suggested practice checklist

Built from the rounds and topics Linden Lab candidates report.

Day 1 — Map the Linden Lab loop

  • Write out the reported sequence: Initial Screening, Technical Deep-Dives, Onsite/Virtual Onsite.
  • 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 REST API Design

  • Spend the session on REST API Design, which Linden Lab candidates report being tested on.
  • Write one worked example in REST API Design and time yourself on it.

Deliverable: One timed worked example in REST API Design.

Day 3 — Work System Architecture

  • Spend the session on System Architecture, which Linden Lab candidates report being tested on.
  • Write one worked example in System Architecture and time yourself on it.

Deliverable: One timed worked example in System Architecture.

Day 4 — Work System Design (Scalability/Architecture)

  • Spend the session on System Design (Scalability/Architecture), which Linden Lab candidates report being tested on.
  • Write one worked example in System Design (Scalability/Architecture) and time yourself on it.

Deliverable: One timed worked example in System Design (Scalability/Architecture).

Day 5 — Answer out loud: Technical Architecture and Systems

  • Answer aloud, timed: How would you design a highly available, distributed system to handle massive concurrent user traffic?
  • Answer aloud, timed: What are the trade-offs between different database architectures in the context of real-time virtual environments?

Deliverable: Spoken answers to 2 reported Technical Architecture and Systems question(s), under time.

Day 6 — Answer out loud: Problem-Solving and Logic

  • Answer aloud, timed: Given a set of constraints, how do you determine the most efficient algorithm for a specific data processing task?
  • Answer aloud, timed: How do you approach a whiteboard coding problem when the requirements are intentionally ambiguous?

Deliverable: Spoken answers to 2 reported Problem-Solving and Logic question(s), under time.

Day 7 — Answer out loud: Cultural Alignment and Professionalism

  • Answer aloud, timed: Tell me about a time you had to resolve a technical disagreement with a team member.
  • Answer aloud, timed: Why do you want to work on a platform as unique and complex as Second Life?

Deliverable: Spoken answers to 2 reported Cultural Alignment and Professionalism question(s), under time.

Behavioural preparation

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

Describe a time you had to debug a complex, multi-threaded issue in a production environment.

Medium · Technical Architecture and Systems

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

How do you handle edge cases when implementing core platform features?

Medium · Problem-Solving and Logic

Approach

  1. Pick a story where you made the decision, not one where you watched it.
  2. State the situation in two sentences and spend the rest on the reasoning.
  3. Give the blast radius: what could have broken, and what you measured.
  4. Name the disagreement and how you resolved it with evidence.

Follow-up

  • What would you do differently if you ran that again?
  • How did you know your change caused the improvement?

Tell me about a time you had to resolve a technical disagreement with a team member.

Medium · Cultural Alignment and Professionalism

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?