cswork / libraryOpen practice workspace

Interview guides · Kobie Marketing

Kobie Marketing Software Engineer Interview Guide

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

The 60-second brief

A Software Engineer at Kobie Marketing plays a pivotal role in designing, developing, and maintaining enterprise-grade loyalty marketing technologies. Kobie Marketing is a global leader in loyalty program management, and its proprietary platform, Kobie Alchemy®, handles millions of high-throughput transactions, complex customer data integrations, and real-time reward calculations daily. As an engineer in this space, you are not just writing code; you are building the core engines that power consumer engagement and brand loyalty for some of the world's largest retail, financial, and hospitality brands. The impact of this position is substantial. The loyalty landscape requires highly secure, scalable, and responsive systems.

This guide is scoped to a Software Engineer candidate at Kobie Marketing.

Focus areas

  • SOLID Principles
  • Unit Testing
  • SQL

The Kobie Marketing interview process

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

Phone Screen

Initial conversation with an internal recruiter focusing on background, career goals, and basic technical concepts.

What to demonstrate

  • Initial conversation with an internal recruiter focusing on background, career goals, and basic technical concepts
  • Depth in SOLID Principles

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 Phone Interview

In-depth discussion with a developer or hiring manager about specific technical domains like Java, C#, Angular, or database design.

What to demonstrate

  • In-depth discussion with a developer or hiring manager about specific technical domains like Java, C#, Angular, or database design
  • Depth in SOLID Principles

How to prepare

  • Answer aloud and timed: Describe your approach to unit testing in C# or Java. How do you mock external dependencies?
  • Answer aloud and timed: What are the differences between an abstract class and an interface, and when would you choose one over the other?

Onsite or Virtual Interview

Half-day interview with multiple small groups, focusing on behavioral questions, past experiences, and practical exercises.

What to demonstrate

  • Half-day interview with multiple small groups
  • Focusing on behavioral questions, past experiences, and practical exercises

How to prepare

  • Answer aloud and timed: What is your experience with J2EE web services and creating scalable web service clients?
  • Answer aloud and timed: Write a query on the whiteboard to demonstrate how an INNER JOIN and a LEFT JOIN differ in terms of data output and performance.

Where candidates lose points

Emphasize Design Patterns

When discussing your coding experience, explicitly mention how you apply SOLID principles and design patterns. This shows that you write code with long-term maintenance and scalability in mind.

Be Ready to Whiteboard

Practice writing SQL queries by hand. Focus on clarity, correct join syntax, and explaining your thought process out loud as you write on the board.

If you run into a technical concept you are unfamiliar with during the interview, be honest about it

The interviewers appreciate candidates who can admit their limitations and explain how they would go about researching and finding the solution.

Questions & practice

Track a rolling failure rate per destination for circuit decisions

Easy · sliding window · ring buffer · circuit breaker

The egress service delivers about 1,500 webhooks per second across roughly 40,000 destinations, each call bounded by a 10 second timeout. Maintain, per destination, the failure rate over the trailing 60 seconds so a caller can ask before dispatch whether the circuit should open. Attempts arrive as (destination_id, finished_at_ms, outcome). Requirement: amortised O(1) per attempt, with total memory bounded by the destination count rather than by traffic. Give the structure, its exact memory, and the rule that stops a destination with three attempts from opening a circuit.

Approach

  1. Name the exact-deque version and then reject it as the default. Holding timestamps and advancing a tail pointer past anything older than now minus 60 seconds is a correct two-pointer window at amortised O(1) per attempt, but its memory tracks in-window traffic, so one destination in a retry storm holds hundreds of thousands of entries while thousands of quiet destinations hold none.
  2. Use a ring of 60 one-second buckets per destination, each bucket a pair of counters for attempts and failures. On an attempt, advance the ring by the elapsed whole seconds, zeroing at most min(elapsed, 60) buckets, then increment the head. That is amortised O(1) with a fixed footprint per destination.
  3. State the footprint: 60 buckets times two 4-byte counters is 480 bytes of payload per destination, so 40,000 destinations is roughly 20 to 25 MB with per-entry overhead, bounded by the catalogue rather than by the rate. The cost is granularity, since the oldest bucket ages out in whole seconds, which is far tighter than the decision needs.
  4. Require a minimum sample before the circuit may open. A destination with three attempts and three failures reads as 100 percent and is not evidence; a floor of roughly 20 attempts in the window makes the ratio meaningful, and below that floor use a run of consecutive failures as the trigger instead.

Follow-up

  • The fleet is 30 instances and each sees roughly a thirtieth of a destination's traffic. Where does the rate actually live, and what does a per-instance answer get wrong?
  • A destination answers in 9.5 seconds and succeeds. It is not failing but it is consuming your per-destination concurrency. What signal should open the circuit here?

Find overlapping job attempts and peak concurrency from lease records

Medium · sweep line · intervals · leases

A day of job_run history yields about 50,000,000 attempt records: (job_run_id, job_type, attempt, started_at, finished_at which is NULL when the worker died, lease_expires_at). Leases expire on a clock, so a job that outran its lease ran twice. Produce (a) every job_run_id whose attempts overlapped in wall-clock time and (b) the peak number of simultaneously running attempts per job_type with the minute it occurred. Target O(n log n). State how you treat a NULL finished_at and what clock skew does to your answer.

Approach

  1. Define the interval before sorting anything: an attempt occupies [started_at, COALESCE(finished_at, lease_expires_at)). finished_at is observed and lease_expires_at is only a promise, so every attempt without a finish contributes an estimate and the whole result is a lower bound on overlap rather than an exact count.
  2. For peak concurrency, sweep: emit 2n endpoints, sort by (timestamp, kind) with ends ordered before starts at equal timestamps, then walk the sequence maintaining a counter per job_type and record each type's maximum with its timestamp. O(n log n) dominated by the sort, O(n) space, or O(1) extra if the sort is external and the walk streams.
  3. For overlap detection, do not compare attempts pairwise. A single global sort by (job_run_id, started_at) gives both the grouping and the order; within a group, keep the maximum end seen so far and report an overlap exactly when the next start is less than that running maximum, which is one linear pass after the sort.
  4. Half-open intervals matter and are easy to get wrong: with closed intervals an attempt ending at the same millisecond another begins reads as concurrency two, and across 50,000,000 records that artefact swamps the real signal.

Follow-up

  • A handler is not idempotent and you have found 400 overlapping jobs. Which of them actually caused damage, and what would you query to find out?
  • Peak concurrency for one job_type is 4 against a configured cap of 4. Is the cap working, or is the data hiding attempts that never started?

Collapse a redelivered event batch into per-aggregate high-water marks

Easy · hashing · at-least-once · aggregation

You drain a batch of up to 5,000,000 events, each (aggregate_id BIGINT, aggregate_version INT, event_type, payload). The log guarantees order within one aggregate only; the batch merges 64 partitions, and a relay failover has redelivered a range, so an older version for an aggregate can appear after a newer one. Given a map of last_applied_version per aggregate, produce the events worth applying, at most one per (aggregate_id, version), plus the count discarded. Target O(n) time. State the memory for 2,000,000 distinct aggregates and what you do when it does not fit.

Approach

  1. One pass, one hash map from aggregate_id to the highest version kept, and a discard counter. An event whose version is at or below last_applied_version for its aggregate is dropped without further work, which is the whole reason the event carries its version rather than a delta. O(n) expected time, O(d) space in distinct aggregates.
  2. Keep the maximum, never the last occurrence. The redelivered range means the final appearance of an aggregate in the batch can be an older version than one seen earlier in the same batch, so last-wins applies stale state over newer state and the projection regresses with no error anywhere.
  3. Cost the memory instead of calling it large: an 8-byte key plus a 4-byte version is 12 bytes of payload, and an open-addressed table held at a 0.7 load factor costs roughly 17 bytes per entry before per-slot metadata, so 2,000,000 aggregates is tens of megabytes in a native layout and several times that in a runtime that boxes both key and value.
  4. If the distinct set exceeds memory, partition on hash(aggregate_id) mod P and reduce each partition independently. Every event for one aggregate hashes to the same partition, so the per-partition result is exact and the merge is concatenation rather than a second reduction.

Follow-up

  • The payload is a patch rather than a snapshot, so applying only the highest version loses the intermediate changes. What changes in your reduction?
  • How do you detect that version 7 arrived while version 6 was never delivered, and what should the consumer do about the gap?

Write a query on the whiteboard to demonstrate how an INNER JOIN and a LEFT JOIN differ in terms of data outpu

Medium · Backend & Database Technologies

Write a query on the whiteboard to demonstrate how an INNER JOIN and a LEFT JOIN differ in terms of data output and performance.

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 a slow-running SQL query that involves multiple joins on large transactional tables?

Medium · Backend & Database Technologies

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 SOLID principles and provide a real-world scenario where you applied them to improve a system's de

Medium · Object-Oriented Programming & Design Pri

Explain the SOLID principles and provide a real-world scenario where you applied them to improve a system's design.

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 dependency injection in your projects, and what are the primary benefits of doing so?

Medium · Object-Oriented Programming & Design Pri

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?

Describe your approach to unit testing in C# or Java. How do you mock external dependencies?

Medium · Object-Oriented Programming & Design Pri

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 differences between an abstract class and an interface, and when would you choose one over the ot

Medium · Object-Oriented Programming & Design Pri

What are the differences between an abstract class and an interface, and when would you choose one over the other?

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 the difference between optimistic and pessimistic locking in a relational database.

Medium · Backend & Database Technologies

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 and manage state in a modern Angular application?

Medium · Frontend & Frameworks

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?

Describe the fundamentals of Angular testing. What tools and strategies do you use to test components and serv

Medium · Frontend & Frameworks

Describe the fundamentals of Angular testing. What tools and strategies do you use to test components and services?

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 web applications are optimized for performance and fast load times?

Medium · Frontend & Frameworks

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?

Listing latency scales with page size, not with filters

Easy · n+1 · latency · query batching

The tenant listing endpoint reads resource filtered by tenant_id and status, ordered by updated_at DESC, and returns each row plus the owner's display name from app_user and the actor of that resource's latest resource_revision. p99 is 55 ms at 10 rows per page and 1.4 s at 200. Database telemetry shows 401 statements per request, each under 1 ms, and nothing in the slow-query log. Diagnose the cause and give the fix, stating the statement count per request and the p99 you expect afterwards.

Approach

  1. Read the counters before forming a theory. 401 statements for 200 rows is one driver query plus two per row, and sub-millisecond execution with an empty slow-query log rules out a bad plan. The time is round trips, which is why it is invisible in every per-query metric and scales with rows returned rather than with filter selectivity.
  2. Name the two per-row statements from their normalised text: a single-row app_user lookup by user_id, and a resource_revision lookup by resource_id ordered by version DESC LIMIT 1. Confirm by dropping those two response fields and watching the statement count fall to one. That locates the calls in the serialisation layer, not the repository.
  3. Check that the arithmetic accounts for the whole gap. Measure one round trip to the replica in isolation; 400 trips at roughly 3 ms of network plus 0.2 ms of execution is about 1.3 s on top of a 55 ms baseline, which matches. If the multiplication had fallen short, the N+1 would only be part of the story and you would keep looking.
  4. Batch both lookups. Collect owner_user_ids and resource_ids from the driver query, then issue WHERE tenant_id = $1 AND user_id = ANY($2) for the users, and PostgreSQL's SELECT DISTINCT ON (resource_id) ... WHERE resource_id = ANY($2) ORDER BY resource_id, version DESC for the latest revision, which the UNIQUE (resource_id, version) index serves directly. On an engine without DISTINCT ON, use a lateral join or a row_number window. Three statements per request at any page size.

Follow-up

  • The page size is capped at 200 today. What breaks first if it is raised to 2,000, and is it still this bug?
  • How do you stop the next N+1 from reaching production, given that no individual query is slow and the endpoint's tests pass?

Suggested practice checklist

Built from the rounds and topics Kobie Marketing candidates report.

Day 1 — Map the Kobie Marketing loop

  • Write out the reported sequence: Phone Screen, Technical Phone Interview, Onsite or Virtual Interview.
  • 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 SOLID Principles

  • Spend the session on SOLID Principles, which Kobie Marketing candidates report being tested on.
  • Write one worked example in SOLID Principles and time yourself on it.

Deliverable: One timed worked example in SOLID Principles.

Day 3 — Work Unit Testing

  • Spend the session on Unit Testing, which Kobie Marketing candidates report being tested on.
  • Write one worked example in Unit Testing and time yourself on it.

Deliverable: One timed worked example in Unit Testing.

Day 4 — Work SQL

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

Deliverable: One timed worked example in SQL.

Day 5 — Answer out loud: Object-Oriented Programming & Design Principles

  • Answer aloud, timed: Explain the SOLID principles and provide a real-world scenario where you applied them to improve a system's design.
  • Answer aloud, timed: How do you implement dependency injection in your projects, and what are the primary benefits of doing so?

Deliverable: Spoken answers to 2 reported Object-Oriented Programming & Design Principles question(s), under time.

Day 6 — Answer out loud: Backend & Database Technologies

  • Answer aloud, timed: What is your experience with J2EE web services and creating scalable web service clients?
  • Answer aloud, timed: Write a query on the whiteboard to demonstrate how an INNER JOIN and a LEFT JOIN differ in terms of data output and performance.

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

Day 7 — Answer out loud: Frontend & Frameworks

  • Answer aloud, timed: How do you structure and manage state in a modern Angular application?
  • Answer aloud, timed: Describe the fundamentals of Angular testing. What tools and strategies do you use to test components and services?

Deliverable: Spoken answers to 2 reported Frontend & Frameworks question(s), under time.

Behavioural preparation

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

What is your experience with J2EE web services and creating scalable web service clients?

Medium · Backend & Database Technologies

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 time you had to explain a complex technical concept to a non-technical stakeholder or team mem

Medium · Behavioral & Experience

Tell me about a time you had to explain a complex technical concept to a non-technical stakeholder or team member.

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 challenging technical problem you faced in a past project and the step-by-step process you used to

Medium · Behavioral & Experience

Describe a challenging technical problem you faced in a past project and the step-by-step process you used to resolve it.

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 situations where there is ambiguity in the product requirements?

Medium · Behavioral & Experience

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 your experience collaborating with cross-functional teams, including product managers, QA, and other

Medium · Behavioral & Experience

Describe your experience collaborating with cross-functional teams, including product managers, QA, and other developers.

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?