Kalypso Software Engineer Interview Guide

The 60-second brief

As a Software Engineer at Kalypso, you will play a pivotal role in designing and developing software solutions that drive innovation and efficiency across various industries. This position is crucial not only for enhancing product functionality but also for ensuring that our systems can scale effectively to meet the demands of our clients. Your contributions will directly impact the user experience and the overall success of Kalypso's projects, making your role both challenging and rewarding. In this dynamic environment, you will engage with diverse teams to tackle complex problems, leveraging your technical skills to create robust applications that enhance business operations. You'll find yourself working on exciting projects that integrate cutting-edge technologies, thus pushing the boundaries of what is possible in software development.

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

Focus areas

• Algorithmic problem solving
• Coding in chosen programming language
• Explaining reasoning / verbalizing thought process

The Kalypso interview process

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

Initial Screening Call

A call with a recruiter to assess background and role fit.

What to demonstrate

• A call with a recruiter to assess background and role fit
• Depth in Algorithmic problem solving

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

Interviews that test coding abilities and problem-solving skills.

What to demonstrate

• Interviews that test coding abilities and problem-solving skills
• Depth in Algorithmic problem solving

How to prepare

• Answer aloud and timed: Describe the process of normalizing a database.
• Answer aloud and timed: How would you optimize a slow-running SQL query?

Behavioral Interviews

Interviews focusing on behavioral aspects and team fit.

What to demonstrate

• Interviews focusing on behavioral aspects and team fit
• Depth in Algorithmic problem solving

How to prepare

• Prepare three examples from your own work, each with a decision you made and an outcome you can quantify.
• Re-read the description of the behavioral interviews above and write down what you would ask to confirm before it.

Where candidates lose points

Practice coding on a whiteboard

Being comfortable with this format is crucial, as many interviews will require you to demonstrate your coding skills live.

Research Kalypso’s projects

Familiarizing yourself with the company’s work will help you connect your experiences to their needs during the interview.

Prepare for behavioral questions

Use the STAR method (Situation, Task, Action, Result) to structure your responses to behavioral questions.

Questions & practice

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

Given an array of integers, find two numbers that add up to a specific target.

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 binary search algorithm.

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?

How would you determine if a string contains all unique characters?

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 how to merge two sorted arrays into one sorted array.

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?

Describe the process of normalizing a database.

Medium · Technical / Domain Questions

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 would you optimize a slow-running SQL query?

Medium · Technical / Domain Questions

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?

Explain the concept of polymorphism in 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?

What is the difference between a stack and a queue?

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?

What are the key principles of RESTful API design?

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?

p99 jumped on one listing filter while p50 stayed flat

Medium · query planning · composite index · percentiles

After a release that added an owner_user_id filter to the resource listing, p99 rose from 90 ms to 1.9 s while p50 stayed at 40 ms. Traffic and row counts are unchanged. resource carries the index (tenant_id, status, updated_at DESC, resource_id DESC). The new query filters tenant_id and owner_user_id, orders by updated_at DESC, resource_id DESC, and takes 20 rows. On PostgreSQL, explain the shape of the regression, prove it from a query plan, and give the index you would add.

Approach

1. Start from the shape. A flat p50 with a moved p99 means a subset of requests changed cost, not all of them, so the first job is naming the subset. Bucket the endpoint's latency by the tenant's row count; the natural hypothesis is that large tenants are a small share of requests and all of the tail.
2. Get the plan for the new query on a large tenant with EXPLAIN (ANALYZE, BUFFERS). Expect an index scan over the tenant's range, a filter discarding most of it, then a Sort feeding the Limit, possibly reporting Sort Method: external merge Disk. Read actual rows on the scan node, not estimated.
3. Explain why the existing index cannot serve it. A composite B-tree is seekable only as a left prefix, and with no equality predicate on status the scan cannot treat updated_at as an ordering, because rows in the tenant's range are ordered by status first. Everything matching must be read and sorted before LIMIT 20 can apply, so a tenant with 400,000 rows pays 400,000 rows to return 20.
4. Add (tenant_id, owner_user_id, updated_at DESC, resource_id DESC). Equality on the first two columns leaves the index ordered by updated_at within that pair, so the plan becomes an index scan that stops after 20 rows with no Sort node. PostgreSQL can scan a B-tree backwards, so the DESC markers matter only if the two sort columns ever disagree in direction; keeping them explicit documents the order the keyset cursor depends on.

Follow-up

• The endpoint paginates with OFFSET. What does page 500 cost with your index, and what does the keyset version cost?
• How would you have caught this before release, given that a 10,000-row seed database produces the same plan shape at an unnoticeable cost?

Suggested practice checklist

Built from the rounds and topics Kalypso candidates report.

Day 1 — Map the Kalypso loop

• Write out the reported sequence: Initial Screening Call, Technical Interviews, Behavioral 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 3 reported rounds, with the weakest marked.

Day 2 — Work Algorithmic problem solving

• Spend the session on Algorithmic problem solving, which Kalypso candidates report being tested on.
• Write one worked example in Algorithmic problem solving and time yourself on it.

Deliverable: One timed worked example in Algorithmic problem solving.

Day 3 — Work Coding in chosen programming language

• Spend the session on Coding in chosen programming language, which Kalypso candidates report being tested on.
• Write one worked example in Coding in chosen programming language and time yourself on it.

Deliverable: One timed worked example in Coding in chosen programming language.

Day 4 — Work Explaining reasoning / verbalizing thought process

• Spend the session on Explaining reasoning / verbalizing thought process, which Kalypso candidates report being tested on.
• Write one worked example in Explaining reasoning / verbalizing thought process and time yourself on it.

Deliverable: One timed worked example in Explaining reasoning / verbalizing thought process.

Day 5 — Answer out loud: Technical / Domain Questions

• Answer aloud, timed: Explain the concept of polymorphism in object-oriented programming.
• Answer aloud, timed: What is the difference between a stack and a queue?

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

Day 6 — Answer out loud: Coding / Algorithms

• Answer aloud, timed: Write a function to reverse a linked list.
• Answer aloud, timed: Given an array of integers, find two numbers that add up to a specific target.

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

Day 7 — Answer out loud: Behavioral / Leadership

• Answer aloud, timed: Describe a challenging project you worked on and how you overcame obstacles.
• Answer aloud, timed: How do you prioritize tasks when you have multiple deadlines?

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.

Describe a challenging project you worked on and how you overcame obstacles.

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 you have multiple deadlines?

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?

Give an example of a time when you had to work with a difficult team member.

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

How do you handle constructive criticism?

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?