cswork / libraryOpen practice workspace

Interview guides · Forsta

Forsta Software Engineer Interview Guide

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

The 60-second brief

The role of a Software Engineer at Forsta is pivotal in driving the development and enhancement of innovative data collection and analysis solutions. As a Software Engineer, you will be integral in building scalable applications that empower clients to make informed decisions based on real-time data insights. This position not only impacts the products delivered to clients but also enhances user experiences, ensuring that the tools are intuitive and effective. At Forsta, Software Engineers work on a variety of projects that involve complex problem solving and collaboration across teams. You'll have the opportunity to engage with cutting-edge technologies and methodologies, contributing to products that facilitate advanced analytics and customer feedback solutions. The role is critical in a fast-paced environment where adaptability and technical acumen are essential for success.

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

Focus areas

  • Python
  • React
  • JavaScript

The Forsta interview process

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

Initial Screening Call

Begin with a call with a recruiter to discuss your background and fit for the role.

What to demonstrate

  • Begin with a call with a recruiter to discuss your background and fit for the role
  • Depth in Python

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 Interviews

Participate in one or more technical interviews that may include coding challenges.

What to demonstrate

  • Participate in one or more technical interviews that may include coding challenges
  • Depth in Python

How to prepare

  • Answer aloud and timed: Can you describe the principles of Object-Oriented Programming?
  • Answer aloud and timed: What is your experience with cloud services, particularly AWS?

Coding Assessment

Solve coding challenges in real-time on a whiteboard or in a shared coding environment.

What to demonstrate

  • Solve coding challenges in real-time on a whiteboard or in a shared coding environment
  • Depth in Python

How to prepare

  • Answer aloud and timed: Discuss how you would optimize a slow-performing application.
  • Answer aloud and timed: Solve a problem involving tree traversal algorithms.

Interviews with Managers

Engage in interviews with hiring managers or team leads focusing on behavioral questions.

What to demonstrate

  • Engage in interviews with hiring managers or team leads focusing on behavioral questions
  • Depth in Python

How to prepare

  • Answer aloud and timed: Write a function in Python to reverse a linked list.
  • Answer aloud and timed: Implement a basic CRUD application using a framework of your choice.

Where candidates lose points

Communication is Key

Be prepared to articulate your thought process clearly during technical interviews. This can help interviewers understand your approach to problem-solving.

Demonstrate Adaptability

Show how you can adjust to new challenges and learn quickly in a fast-paced environment.

Prepare for Behavioral Questions

Think about past experiences that highlight your teamwork and leadership skills.

Familiarize Yourself with Company Values

Understanding and aligning with Forsta's mission can help you connect with interviewers on a deeper level.

Questions & practice

Solve a problem involving tree traversal algorithms.

Medium · Coding / Algorithms

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 a function in Python to reverse a linked list.

Medium · Coding / Algorithms

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?

Implement a basic CRUD application using a framework of your choice.

Medium · Coding / Algorithms

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?

Create a unit test for a given function in JavaScript.

Medium · Coding / Algorithms

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?

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?

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?

Explain the difference between REST and SOAP.

Medium · Technical / Domain Questions

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?

Can you describe the principles of Object-Oriented Programming?

Medium · Technical / Domain Questions

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?

Discuss how you would optimize a slow-performing application.

Medium · Technical / Domain Questions

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?

Explain how you would debug a piece of code that isn't functioning as expected.

Medium · Coding / Algorithms

Approach

  1. Establish what changed and when, before forming any theory.
  2. Pick a bisection that eliminates candidates whichever way it turns out.
  3. Check the instrumentation before believing the symptom.
  4. Separate the trigger from the cause; the deploy is rarely the bug.

Follow-up

  • What would you look at first, and what would it rule out?
  • How would you tell a cause from a coincidence here?

Suggested practice checklist

Built from the rounds and topics Forsta candidates report.

Day 1 — Map the Forsta loop

  • Write out the reported sequence: Initial Screening Call, Technical Interviews, Coding Assessment, Interviews with Managers.
  • 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 Python

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

Deliverable: One timed worked example in Python.

Day 3 — Work React

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

Deliverable: One timed worked example in React.

Day 4 — Work JavaScript

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

Deliverable: One timed worked example in JavaScript.

Day 5 — Answer out loud: Technical / Domain Questions

  • Answer aloud, timed: Explain the difference between REST and SOAP.
  • Answer aloud, timed: How do you handle memory management in Java?

Deliverable: Spoken answers to 2 reported Technical / Domain Questions question(s), under time.

Day 6 — Answer out loud: Coding / Algorithms

  • Answer aloud, timed: Solve a problem involving tree traversal algorithms.
  • Answer aloud, timed: Write a function in Python to reverse a linked list.

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

Day 7 — Answer out loud: Behavioral / Leadership

  • Answer aloud, timed: Describe a time when you faced a significant challenge at work and how you overcame it.
  • Answer aloud, timed: How do you prioritize tasks when working on multiple projects?

Deliverable: Spoken answers to 2 reported Behavioral / Leadership question(s), under time.

Behavioural preparation

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

How do you handle memory management in Java?

Medium · Technical / Domain Questions

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?

What is your experience with cloud services, particularly AWS?

Medium · Technical / Domain Questions

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 faced a significant challenge at work and how you overcame it.

Medium · Behavioral / Leadership

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 working on multiple projects?

Medium · Behavioral / Leadership

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?

Can you give an example of how you handled a conflict within your team?

Medium · Behavioral / Leadership

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?

What motivates you to perform well in your role?

Medium · Behavioral / Leadership

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?

Discuss how you ensure quality and accuracy in your work.

Medium · Behavioral / Leadership

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?