cswork / libraryOpen practice workspace

Interview guides · Kāladi Consulting

Kāladi Consulting Software Engineer Interview Guide

Kāladi Consulting Software Engineer interview guide: reported rounds, questions and how candidates describe the process.

The 60-second brief

At Kāladi Consulting, the Software Engineer role is central to our mission of delivering robust, scalable, and innovative technology solutions for a global client base. Engineers here are not merely coders; they are problem solvers who translate complex business requirements into high-performance technical products. Whether you are working as a Product Developer, a Snowflake Developer, or an OIC Developer, your contributions directly impact how our clients manage their data, workflows, and digital infrastructure. This position is designed for engineers who thrive in dynamic environments where technical precision meets strategic business objectives. You will be expected to navigate diverse problem spaces, from optimizing data pipelines to building intuitive software interfaces.

This guide is scoped to a Software Engineer candidate at Kāladi Consulting.

Focus areas

  • C Programming
  • Programming Problem Solving
  • Pattern Generation / Sequence Incrementing

The Kāladi Consulting interview process

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

Application Review

Initial assessment of your foundational skills and qualifications.

What to demonstrate

  • Initial assessment of your foundational skills and qualifications
  • Depth in C Programming

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 Evaluation

Deeper technical evaluations to assess your problem-solving abilities.

What to demonstrate

  • Deeper technical evaluations to assess your problem-solving abilities
  • Depth in C Programming

How to prepare

  • Answer aloud and timed: How do you handle edge cases when writing programs to ensure robustness?
  • Answer aloud and timed: Describe your process for debugging a segment of code that is not performing as expected.

Behavioral Evaluation

Assessment of your collaborative mindset and fit within the team.

What to demonstrate

  • Assessment of your collaborative mindset and fit within the team
  • Depth in C Programming

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 evaluation above and write down what you would ask to confirm before it.

Final HR Evaluation

Concluding review by HR to discuss overall fit and next steps.

What to demonstrate

  • Concluding review by HR to discuss overall fit and next steps
  • Depth in C Programming

How to prepare

  • Answer aloud and timed: Explain the trade-offs of using different data structures in your implementation.
  • Answer aloud and timed: What motivated you to pursue a career in software engineering?

Where candidates lose points

Think out loud

During technical rounds, narrate your thought process. This allows interviewers to understand your logic even if you hit a snag.

Clarify the requirements

Never start coding until you have fully understood the constraints of the problem. Ask questions to verify your assumptions.

Prioritize readability

Even in a time-constrained coding test, write clean, well-commented code. It reflects your professionalism and attention to detail.

Align with our values

Research Kāladi Consulting and be ready to discuss why our focus on client-centric technology resonates with your career goals.

Questions & practice

Can you explain the logic behind your chosen approach for a given algorithmic challenge?

Medium · Technical and Logical Reasoning

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 program in C to perform a specific data transformation or logic task.

Medium · Coding Proficiency

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 optimize a given code snippet for better performance or memory usage?

Medium · Coding Proficiency

Approach

  1. Say what the runtime actually does before reasoning about the code.
  2. Name what is shared across threads and what owns each piece of state.
  3. Identify the window where an invariant is briefly untrue.
  4. Distinguish a value from a reference to it, and say which one you handed out.

Follow-up

  • What happens if two callers reach this at the same time?
  • Where could this allocate more than you expect?

Explain the trade-offs of using different data structures in your implementation.

Medium · Coding Proficiency

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?

Replace offset paging on the resource feed with keyset

Easy · keyset pagination · composite index · sort order

resource holds resource_id, tenant_id, owner_user_id, title, body_ref, version, status ('draft','active','archived','deleted'), created_at, updated_at, deleted_at, with an index on (tenant_id, status, updated_at DESC, resource_id DESC). The listing endpoint returns active resources for one tenant, newest update first, 50 per page, today with LIMIT 50 OFFSET n. Tenants reach page 400 and rows are created while they read. Write the keyset query, define what the cursor carries and how it is encoded, and say which part of the index each predicate uses. Assume PostgreSQL 16.

Approach

  1. Name the two failures separately. OFFSET 20000 makes the server produce and discard 20,000 rows, so page cost grows with depth rather than with page size. Independently, any write that changes how many rows sort above the offset moves the window between two fetches, and the direction decides which anomaly you get: an insert lands at the head of updated_at DESC and pushes already-returned rows down past the boundary, so they are returned a second time; a delete above the offset, or a row whose updated_at is bumped above the cursor, pulls rows up and one is never returned at all. Nothing in the response reveals either.
  2. Write the seek: WHERE tenant_id = $1 AND status = 'active' AND (updated_at, resource_id) < ($2, $3) ORDER BY updated_at DESC, resource_id DESC LIMIT 50. The row-value comparison is one index range rather than a disjunction, and both columns are NOT NULL, which is what makes that comparison well defined.
  3. Map each predicate onto the index: tenant_id and status are equality on the leading columns, (updated_at, resource_id) is the range, and the ORDER BY matches the index order so no Sort node appears and the scan stops after 50 rows. The DESC in the definition only matters for mixed directions — a plain ascending btree on the same columns is read backwards for this query.
  4. Put both sort columns in the cursor and nothing the client can tamper with into another tenant: base64 of (updated_at, resource_id), validated server-side, with tenant_id taken from the principal.

Follow-up

  • The client asks for 'jump to page 400'. What do you offer instead, and what does the honest version cost?
  • Sort order becomes user-selectable across four columns. How many indexes is that, and which would you refuse to add?

How would you approach a string-manipulation problem involving incrementing a counter embedded within a alphan

Medium · Technical and Logical Reasoning

How would you approach a string-manipulation problem involving incrementing a counter embedded within a alphanumeric string?

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?

Design the bulk write endpoint a migration script retries blindly

Medium · batch api · partial failure · idempotency

A customer's migration script pushes 2 million resources through POST /v1/resources:batch, up to 500 items per call, and retries any call that errors or times out. Within a call some items fail validation, some collide with rows that already exist, and some succeed. Specify the request and response shape, whether a batch is atomic or per-item, how idempotency works for the call and for each item, the status code for a mixed outcome, the size and item-count limits with their error codes, and exactly what the script does after a timeout mid-batch.

Approach

  1. Choose atomicity deliberately and price it. All-or-nothing means one transaction holding locks for the whole batch on a primary already absorbing about 1.2k writes/second, which bounds batch size by lock duration, and it turns one bad row into 499 rejections the script must resend. Per-item partial success is the right default for a migration, and the contract's job is then to make a partial outcome impossible to miss.
  2. Require a client-supplied id on every item and echo it in every result. Deriving a per-item key from the array index breaks the first time the script resends a batch with the failures removed: the indices shift, previously-succeeded items acquire new keys, and they are created a second time.
  3. Key the effects at two levels. The call's Idempotency-Key covers an exact resend of the same bytes; per-item keys of (tenant_id, client_item_id) make a partially-applied batch safe to resend whole. Resending an identical batch must reproduce the same per-item results, not 500 conflicts the script has to interpret.
  4. Answer a mixed outcome with one status plus per-item detail: 200, or 207 borrowed from WebDAV if you prefer it - document whichever you pick - carrying an array of client_item_id, per-item status, and either resource_id or an error code from the same taxonomy the single-item endpoint uses. Reserve 4xx for the request as a whole: unparseable body, too many items, payload over the limit (413). Put a failed count at the top level so that even a script checking only the cheapest thing cannot conclude success while rows were dropped.

Follow-up

  • At 500 items per call, what is the wall-clock time for 2 million rows, and what pacing do you publish so the migration does not become an incident?
  • One item in every batch fails with the same code. How does the script discover that without a human reading logs?

Describe your process for debugging a segment of code that is not performing as expected.

Medium · Technical and Logical Reasoning

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 Kāladi Consulting candidates report.

Day 1 — Map the Kāladi Consulting loop

  • Write out the reported sequence: Application Review, Technical Evaluation, Behavioral Evaluation, Final HR Evaluation.
  • 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 C Programming

  • Spend the session on C Programming, which Kāladi Consulting candidates report being tested on.
  • Write one worked example in C Programming and time yourself on it.

Deliverable: One timed worked example in C Programming.

Day 3 — Work Programming Problem Solving

  • Spend the session on Programming Problem Solving, which Kāladi Consulting candidates report being tested on.
  • Write one worked example in Programming Problem Solving and time yourself on it.

Deliverable: One timed worked example in Programming Problem Solving.

Day 4 — Work Pattern Generation / Sequence Incrementing

  • Spend the session on Pattern Generation / Sequence Incrementing, which Kāladi Consulting candidates report being tested on.
  • Write one worked example in Pattern Generation / Sequence Incrementing and time yourself on it.

Deliverable: One timed worked example in Pattern Generation / Sequence Incrementing.

Day 5 — Answer out loud: Technical and Logical Reasoning

  • Answer aloud, timed: How would you approach a string-manipulation problem involving incrementing a counter embedded within a alphanumeric string?
  • Answer aloud, timed: Can you explain the logic behind your chosen approach for a given algorithmic challenge?

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

Day 6 — Answer out loud: Coding Proficiency

  • Answer aloud, timed: Write a program in C to perform a specific data transformation or logic task.
  • Answer aloud, timed: How would you optimize a given code snippet for better performance or memory usage?

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

Day 7 — Answer out loud: Behavioral and HR

  • Answer aloud, timed: What motivated you to pursue a career in software engineering?
  • Answer aloud, timed: How do you handle deadlines and pressure when working on complex technical tasks?

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

Behavioural preparation

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

How do you handle edge cases when writing programs to ensure robustness?

Medium · Technical and Logical Reasoning

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 motivated you to pursue a career in software engineering?

Medium · Behavioral and HR

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 deadlines and pressure when working on complex technical tasks?

Medium · Behavioral and HR

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 learn a new technology or tool quickly to solve a problem.

Medium · Behavioral and HR

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?

Why are you interested in joining Kāladi Consulting specifically?

Medium · Behavioral and HR

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?