cswork / libraryOpen practice workspace

Interview guides · SHOPLINE Limited

SHOPLINE Limited Software Engineer Interview Guide

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

The 60-second brief

A Software Engineer at SHOPLINE Limited plays a vital role in building and scaling the commerce ecosystem that empowers merchants globally. You will be responsible for developing robust, high-performance features that directly impact how businesses manage their inventory, process payments, and engage with customers. Your work is central to the company’s mission of providing an intuitive, seamless, and scalable omnichannel commerce platform. This role offers significant technical challenges, as you will be operating within a fast-paced environment where reliability and efficiency are paramount. You will collaborate with cross-functional teams to translate complex business requirements into elegant technical solutions.

This guide is scoped to a Software Engineer candidate at SHOPLINE Limited.

Focus areas

  • React
  • React Hooks
  • React Component Lifecycle

The SHOPLINE Limited interview process

SHOPLINE Limited candidates report 5 rounds over 4-6 weeks. The stages below are what candidates describe, not a published process.

Technical Assessment

Rigorous assessment of your hands-on coding skills.

What to demonstrate

  • Rigorous assessment of your hands-on coding skills
  • Depth in React

How to prepare

  • Answer aloud and timed: What database structure do you know?
  • Answer aloud and timed: How do you implement an API in a backend system?

Professional History Discussion

Deep-dive discussions into your professional history.

What to demonstrate

  • Deep-dive discussions into your professional history
  • Depth in React

How to prepare

  • Answer aloud and timed: Explain the React lifecycle and how hooks function.
  • Answer aloud and timed: What are the common challenges when managing state in a frontend application?

Algorithmic Tests

Tests focusing on your algorithmic problem-solving abilities.

What to demonstrate

  • Tests focusing on your algorithmic problem-solving abilities
  • Depth in React

How to prepare

  • Answer aloud and timed: Code test: Deduplicate the smallest elements in an array.
  • Answer aloud and timed: Can you explain the time complexity of your proposed solution?

Architecture Conversations

Discussions ensuring you possess the technical aptitude for architecture.

What to demonstrate

  • Discussions ensuring you possess the technical aptitude for architecture
  • Depth in React

How to prepare

  • Answer aloud and timed: How would you handle an edge case where the input data is malformed?
  • Answer aloud and timed: What is the toughest part of your last job?

Final Management Interviews

Interviews with team leads and management to assess overall fit.

What to demonstrate

  • Interviews with team leads and management to assess overall fit
  • Depth in React

How to prepare

  • Answer aloud and timed: Describe a time you had to deal with a technical disagreement within your team.
  • Answer aloud and timed: How do you prioritize tasks when faced with conflicting deadlines?

Where candidates lose points

Structure your answers

Use the STAR method (Situation, Task, Action, Result) when answering behavioral questions. This keeps your answers concise and impactful.

Practice live coding

Even if you are an experienced developer, practice coding in a shared document or on a whiteboard. Thinking out loud is just as important as the code itself.

Know your resume

Be prepared to explain every bullet point on your resume in detail. If you list a technology, expect a question about how you used it in a real-world scenario.

Research the product

Spend time using the SHOPLINE Limited platform. Understanding the merchant's perspective will give you a significant advantage during system design discussions.

Questions & practice

Code test: Deduplicate the smallest elements in an array.

Medium · Problem-Solving & Coding

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 complexity of your proposed solution?

Medium · Problem-Solving & Coding

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 would you handle an edge case where the input data is malformed?

Medium · Problem-Solving & Coding

Approach

  1. Restate the input: its shape, its size, and what is guaranteed about it.
  2. Name the brute-force solution and its complexity before improving on it.
  3. Choose the data structure from the access pattern, not from familiarity.
  4. State the target complexity and say which constraint rules the naive version out.

Follow-up

  • How does this change if the input no longer fits in memory?
  • What is the worst case, and how likely is it on real data?

Write 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?

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?

What database structure do you know?

Medium · Technical Foundations & Domain Knowledge

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 implement an API in a backend system?

Medium · Technical Foundations & Domain Knowledge

Approach

  1. Say who the caller is and what they do when the call fails halfway.
  2. Define the identity of a request so a retry cannot double-apply it.
  3. Separate accepted, pending, failed and confirmed; they are different facts.
  4. Design the error taxonomy before the success shape; callers branch on it.

Follow-up

  • What happens if the caller retries after a timeout?
  • How does a client discover it is on an old version of this contract?

Explain the React lifecycle and how hooks function.

Medium · Technical Foundations & Domain Knowledge

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?

What are the common challenges when managing state in a frontend application?

Medium · Technical Foundations & Domain Knowledge

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?

Edge instances grow 400 MB per hour until the nightly restart

Hard · memory leak · heap analysis · metric cardinality

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

Approach

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

Follow-up

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

Suggested practice checklist

Built from the rounds and topics SHOPLINE Limited candidates report.

Day 1 — Map the SHOPLINE Limited loop

  • Write out the reported sequence: Technical Assessment, Professional History Discussion, Algorithmic Tests, Architecture Conversations, Final Management Interviews.
  • 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 5 reported rounds, with the weakest marked.

Day 2 — Work React

  • Spend the session on React, which SHOPLINE Limited candidates report being tested on.
  • Write one worked example in React and time yourself on it.

Deliverable: One timed worked example in React.

Day 3 — Work React Hooks

  • Spend the session on React Hooks, which SHOPLINE Limited candidates report being tested on.
  • Write one worked example in React Hooks and time yourself on it.

Deliverable: One timed worked example in React Hooks.

Day 4 — Work React Component Lifecycle

  • Spend the session on React Component Lifecycle, which SHOPLINE Limited candidates report being tested on.
  • Write one worked example in React Component Lifecycle and time yourself on it.

Deliverable: One timed worked example in React Component Lifecycle.

Day 5 — Answer out loud: Technical Foundations & Domain Knowledge

  • Answer aloud, timed: What database structure do you know?
  • Answer aloud, timed: How do you implement an API in a backend system?

Deliverable: Spoken answers to 2 reported Technical Foundations & Domain Knowledge question(s), under time.

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

  • Answer aloud, timed: Code test: Deduplicate the smallest elements in an array.
  • Answer aloud, timed: Can you explain the time complexity of your proposed solution?

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

Day 7 — Answer out loud: Behavioral & Experience-Based

  • Answer aloud, timed: What is the toughest part of your last job?
  • Answer aloud, timed: Describe a time you had to deal with a technical disagreement within your team.

Deliverable: Spoken answers to 2 reported Behavioral & Experience-Based question(s), under time.

Behavioural preparation

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

What is the toughest part of your last job?

Medium · Behavioral & Experience-Based

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 you had to deal with a technical disagreement within your team.

Medium · Behavioral & Experience-Based

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 prioritize tasks when faced with conflicting deadlines?

Medium · Behavioral & Experience-Based

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 project where you had to learn a new technology on the fly.

Medium · Behavioral & Experience-Based

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?