cswork / libraryOpen practice workspace

Interview guides · Study

Study Software Engineer Interview Guide

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

The 60-second brief

A Software Engineer at Study plays a pivotal role in maintaining and scaling the platforms that empower learners and educators. You are not just writing code; you are building the digital infrastructure that delivers educational content to a broad audience. Your work directly impacts how users interact with course materials, assessments, and the underlying systems that keep the platform performing efficiently. The environment at Study is demanding and high-paced, characterized by a focus on full-stack versatility and algorithmic problem-solving. You will often work in cross-functional teams, collaborating with product managers and other engineers to turn complex requirements into clean, performant solutions. Because the platform bridges the gap between educational accessibility and technical reliability, the work is both strategically significant and technically challenging.

This guide is scoped to a Software Engineer candidate at Study.

Focus areas

  • Java
  • Data Structures & Algorithms (general)
  • HTML

The Study interview process

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

Recruiter Screen

Initial screening to establish logistics and cultural alignment.

What to demonstrate

  • Initial screening to establish logistics and cultural alignment
  • Depth in Java

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 Rounds

One or more technical interviews focusing on coding and problem-solving.

What to demonstrate

  • One or more technical interviews focusing on coding and problem-solving
  • Depth in Java

How to prepare

  • Answer aloud and timed: How do you optimize your code for time and space complexity?
  • Answer aloud and timed: Given a list of objects, what is the most efficient way to identify if a specific target exists?

Onsite/Virtual Loop

Comprehensive evaluation loop with multiple back-to-back sessions.

What to demonstrate

  • Comprehensive evaluation loop with multiple back-to-back sessions
  • Depth in Java

How to prepare

  • Answer aloud and timed: How do you handle edge cases when implementing search or sort algorithms?
  • Answer aloud and timed: Can you replicate a specific navigation bar design from a provided image?

Where candidates lose points

Talk through your code

Never code in silence. Narrate your logic so the interviewer understands your decision-making process.

Clarify requirements

If a question seems confusing or ambiguous, ask questions before you start coding to ensure you and the interviewer are aligned.

Master the basics

Do not neglect foundational topics like SQL and basic data structures, as these are frequently tested alongside more complex problems.

Stay calm under pressure

The interviewers may test your limits by adding complexity to problems. Remain professional and methodical, even if you feel stuck.

Questions & practice

How would you implement a divide and conquer strategy to locate a specific object within a list?

Medium · Algorithmic & Data Structures

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 and implement a binary search algorithm?

Medium · Algorithmic & Data Structures

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 optimize your code for time and space complexity?

Medium · Algorithmic & Data Structures

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?

Given a list of objects, what is the most efficient way to identify if a specific target exists?

Medium · Algorithmic & Data Structures

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 write a query to retrieve specific records from a relational database?

Medium · SQL & Database Logic

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. Handle the rows that do not match: that is usually the actual question.

Follow-up

  • How does the query change if that join becomes one-to-many?
  • What happens to this when the table is ten times larger?

Can you explain how to perform a join between two tables to aggregate data?

Medium · SQL & Database Logic

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. Handle the rows that do not match: that is usually the actual question.

Follow-up

  • How does the query change if that join becomes one-to-many?
  • What happens to this when the table is ten times larger?

How do you optimize SQL queries for better performance?

Medium · SQL & Database Logic

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. Handle the rows that do not match: that is usually the actual question.

Follow-up

  • How does the query change if that join becomes one-to-many?
  • What happens to this when the table is ten times larger?

What is the difference between various join types in a real-world scenario?

Medium · SQL & Database Logic

Approach

  1. Name the grain you start from and join outward from it.
  2. Check whether any join is one-to-many before aggregating, or the sums inflate.
  3. Say which index the query would use, and what makes it unusable.
  4. Handle the rows that do not match: that is usually the actual question.

Follow-up

  • How does the query change if that join becomes one-to-many?
  • What happens to this when the table is ten times larger?

Can you replicate a specific navigation bar design from a provided image?

Medium · Front-End Development

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 structure HTML and CSS to ensure a responsive and clean UI?

Medium · Front-End Development

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 is your approach to positioning elements in CSS?

Medium · Front-End Development

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 ensure your front-end code is maintainable and scalable?

Medium · Front-End Development

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?

One log partition stops advancing while the others drain

Easy · poison message · head-of-line blocking · consumer lag

Search results for a subset of tenants are hours stale; the rest are current. The projection consumer reports lag of zero on 15 of 16 partitions and 400,000 on one. Its error rate is flat and its CPU is idle. outbox_event has no pending rows older than a second, so the relay has published everything it holds. Identify the mechanism, give the ordered checks, and state what you do in the first ten minutes versus what you change permanently.

Approach

  1. Read the lag distribution first. A slow consumer lags everywhere; zero on fifteen partitions and 400,000 on one is not throughput. Idle CPU on the stuck partition means the consumer is not advancing its offset at all, which points at one message it cannot get past rather than at a rate problem.
  2. Exonerate the producer before touching the consumer. No pending outbox rows older than a second means the relay published, so the event exists in the log. This separates never sent from sent and never applied, which are different code paths and usually different owners.
  3. Read the message at the stuck offset and the handler's log lines for its event_id. A flat error rate with no progress has two explanations and you must distinguish them: the handler is throwing and the retry loop is swallowing it, or the handler is blocking on something and never returning. Idle CPU with no error lines favours the second.
  4. Mitigate before diagnosing further. Move the offending event to a dead-letter store and commit the offset past it. Adding consumers does nothing here, because a partition is consumed by exactly one member of the group, and the blast radius is every aggregate hashed to that partition, not only the aggregate that produced the bad event.

Follow-up

  • The dead-lettered event carried aggregate_version 7 and the projection had applied 6. What must the replay do differently if 8 and 9 landed in the meantime?
  • How do you show staleness to the user while the partition is behind, given the API already returns the projection's watermark?

Suggested practice checklist

Built from the rounds and topics Study candidates report.

Day 1 — Map the Study loop

  • Write out the reported sequence: Recruiter Screen, Technical Rounds, Onsite/Virtual 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.

Day 2 — Work Java

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

Deliverable: One timed worked example in Java.

Day 3 — Work Data Structures & Algorithms (general)

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

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

Day 4 — Work HTML

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

Deliverable: One timed worked example in HTML.

Day 5 — Answer out loud: Algorithmic & Data Structures

  • Answer aloud, timed: How would you implement a divide and conquer strategy to locate a specific object within a list?
  • Answer aloud, timed: Can you explain and implement a binary search algorithm?

Deliverable: Spoken answers to 2 reported Algorithmic & Data Structures question(s), under time.

Day 6 — Answer out loud: Front-End Development

  • Answer aloud, timed: Can you replicate a specific navigation bar design from a provided image?
  • Answer aloud, timed: How do you structure HTML and CSS to ensure a responsive and clean UI?

Deliverable: Spoken answers to 2 reported Front-End Development question(s), under time.

Day 7 — Answer out loud: SQL & Database Logic

  • Answer aloud, timed: How would you write a query to retrieve specific records from a relational database?
  • Answer aloud, timed: Can you explain how to perform a join between two tables to aggregate data?

Deliverable: Spoken answers to 2 reported SQL & Database Logic question(s), under time.

Behavioural preparation

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

How do you handle edge cases when implementing search or sort algorithms?

Medium · Algorithmic & Data Structures

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 state or interactivity using JavaScript?

Medium · Front-End Development

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?

Argue against a design, lose, and commit anyway

Medium · disagreement · service boundaries · decision records

Describe a design you argued against and lost. State the failure you predicted as a named mechanism, not a feeling about complexity: two services that would need one transaction, a projection with no rebuild path, a write path with no idempotency key. Say what evidence you brought, what the decision maker weighed instead, and what you did after the decision was made: what you instrumented, what you wrote down, and whether the prediction came true. Five minutes.

Approach

  1. State the prediction in falsifiable form up front: the mechanism, the condition that triggers it, and the observable outcome. A prediction that cannot be checked also cannot be credited to you later.
  2. Show the evidence you had at the time and label each piece honestly as measured, analogous, or intuition. Keeping the intuition is fine; disguising it as data is the thing that erodes your standing in the next argument.
  3. Represent the opposing case at full strength, including the constraint you did not control: a fixed date, a team boundary, or the fact that the decision was cheap to reverse and yours was not.
  4. Make disagree-and-commit concrete. Name the artefact you left behind so the prediction could be settled without you: the alert and its threshold, the counter on the dashboard, the decision note that recorded the trade-off and the condition that would revisit it.

Follow-up

  • What threshold on that alert would have proved you right, and did anyone ever look at it?
  • If the same proposal arrived tomorrow with the same deadline, would you argue it the same way?