cswork / libraryOpen practice workspace

Interview guides · Wizeline

Wizeline Software Engineer Interview Guide

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

The 60-second brief

A Software Engineer at Wizeline plays a critical role in designing, building, and scaling cutting-edge digital products for some of the world's most prominent brands. As a global technology services provider, Wizeline operates on an agency and consulting model, meaning engineers work directly with external clients to solve complex business challenges. You will not just be writing code in isolation; you will act as a strategic consultant, helping clients adopt modern methodologies, integrate artificial intelligence, and transform their digital landscapes. The impact of this role is exceptionally broad. Because Wizeline partners with diverse industries—ranging from media and entertainment to finance and healthcare—you will have the opportunity to work on highly scalable architectures, migrate legacy systems to cloud-native platforms, and build AI-powered applications from the ground up.

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

Focus areas

  • Pair Programming
  • Live Coding
  • API Integration (REST/HTTP)

The Wizeline interview process

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

Recruiter Outreach

Initial contact from a recruiter to discuss the opportunity and assess interest.

What to demonstrate

  • Initial contact from a recruiter to discuss the opportunity and assess interest
  • Depth in Pair 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.

Automated Testing

Candidates undergo automated tests to evaluate coding skills.

What to demonstrate

  • Candidates undergo automated tests to evaluate coding skills
  • Depth in Pair Programming

How to prepare

  • Answer aloud and timed: Implement an algorithm to find the first non-repeating character in a string and optimize its time complexity.
  • Answer aloud and timed: Given a list of dates or timestamps, write a utility to format, sort, and filter them based on specific business rules.

Live Coding

Interactive coding session where candidates solve problems in real-time.

What to demonstrate

  • Interactive coding session where candidates solve problems in real-time
  • Depth in Pair Programming

How to prepare

  • Answer aloud and timed: How would you optimize a search algorithm to run in logarithmic time instead of linear time?
  • Answer aloud and timed: Review this legacy PHP or Java codebase, identify two performance bottlenecks, and refactor the code to improve readability and execution speed.

Architectural Discussions

Candidates engage in discussions about system design and architecture.

What to demonstrate

  • Candidates engage in discussions about system design and architecture
  • Depth in Pair Programming

How to prepare

  • Answer aloud and timed: There is a bug in this CSV file reader that causes it to crash on malformed rows; locate the bug and write a robust error-handling mechanism.
  • Answer aloud and timed: Refactor a monolithic component into smaller, reusable functional components while maintaining state management and testability.

Final Decision

The final evaluation stage where the decision is made regarding the offer.

What to demonstrate

  • The final evaluation stage where the decision is made regarding the offer
  • Depth in Pair Programming

How to prepare

  • Answer aloud and timed: Analyze this block of code that does not follow industry design patterns (such as PEP 8 or clean code standards) and rewrite it to adhere to proper conventions.
  • Answer aloud and timed: Optimize a series of nested database queries or API calls that are causing severe latency in a backend service.

Where candidates lose points

Over-communicate during pair programming

Your interviewer is evaluating how you think, not just your final code. Explain your logic, state your assumptions, and voice any potential edge cases as you write code.

If you get stuck during a live coding session, do not hesitate to ask your interviewer questions or search Google

Wizeline encourages realistic problem-solving, and showing that you know how to find information is viewed as a positive trait.

Brush up on clean code and design patterns

Wizeline interviewers place a high value on code structure. Avoid quick-and-dirty solutions; instead, write modular, readable code that follows industry standards.

Questions & practice

Given an array of strings, group the anagrams together.

Medium · Coding and Algorithmic Problem Solving

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 an algorithm to find the first non-repeating character in a string and optimize its time complexity.

Medium · Coding and Algorithmic Problem Solving

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 dates or timestamps, write a utility to format, sort, and filter them based on specific busine

Medium · Coding and Algorithmic Problem Solving

Given a list of dates or timestamps, write a utility to format, sort, and filter them based on specific business rules.

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 search algorithm to run in logarithmic time instead of linear time?

Medium · Coding and Algorithmic Problem Solving

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?

Analyze this block of code that does not follow industry design patterns (such as PEP 8 or clean code standard

Medium · Pair Programming, Debugging, and Refacto

Analyze this block of code that does not follow industry design patterns (such as PEP 8 or clean code standards) and rewrite it to adhere to proper conventions.

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

Find version gaps and relay lag with window functions

Medium · window functions · event tables · frame semantics

outbox_event holds event_id, aggregate_type, aggregate_id, aggregate_version, event_type, payload, status ('pending','published','dead'), attempts, created_at, published_at. A projection is missing rows and you must decide whether the relay skipped events or the consumer dropped them. Write three queries over the last seven days: one listing every aggregate_id whose published aggregate_version sequence has a hole, one giving per-day counts with a running total, and one returning the newest published event per aggregate. For each, say where the window function is evaluated relative to WHERE and LIMIT. PostgreSQL 16.

Approach

  1. Gaps: compute lead(aggregate_version) OVER (PARTITION BY aggregate_id ORDER BY aggregate_version) in a subquery, then filter next_version <> aggregate_version + 1 in the outer query. Window functions are evaluated after WHERE, GROUP BY and HAVING and before the outer ORDER BY and LIMIT, so the predicate cannot sit in the same WHERE clause and PostgreSQL 16 has no QUALIFY.
  2. Say what the seven-day filter does to the answer: it truncates every partition, so the first row per aggregate has no predecessor inside the window and a hole spanning the boundary is invisible. Widen the window, or join to resource.version as the authority for the true maximum.
  3. Running total: SELECT date_trunc('day', created_at) AS d, count() AS n, sum(count()) OVER (ORDER BY date_trunc('day', created_at) ROWS UNBOUNDED PRECEDING). An aggregate inside a window call is legal because grouping runs before windowing. The grouping key is unique per row here so ROWS and RANGE agree, but write the frame anyway — over ungrouped rows with tied timestamps the default RANGE frame pulls in every peer row and the total jumps.
  4. Newest per aggregate: DISTINCT ON (aggregate_id) ... ORDER BY aggregate_id, aggregate_version DESC is the cheap PostgreSQL-only form when an index matches that order; row_number() OVER (PARTITION BY aggregate_id ORDER BY aggregate_version DESC) = 1 is the portable form and needs a subquery for the same evaluation-order reason as the gap query.

Follow-up

  • Relay failover redelivers events. Does a duplicate break the gap query, and how would you detect one from this table alone?
  • Turn the gap check into a continuous monitor rather than a query someone runs after an incident. What does it watch?

Write a function to consume data from a public REST API and display it dynamically in a UI component using Rea

Medium · Coding and Algorithmic Problem Solving

Write a function to consume data from a public REST API and display it dynamically in a UI component using React or TypeScript.

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?

Optimize a series of nested database queries or API calls that are causing severe latency in a backend service

Medium · Pair Programming, Debugging, and Refacto

Optimize a series of nested database queries or API calls that are causing severe latency in a backend service.

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?

How would you design a high-level architecture for an API gateway that handles rate limiting and token-based a

Medium · System Design and Architecture

How would you design a high-level architecture for an API gateway that handles rate limiting and token-based authentication?

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?

Explain how you would design a system to ingest, process, and store large volumes of real-time analytical data

Medium · System Design and Architecture

Explain how you would design a system to ingest, process, and store large volumes of real-time analytical data.

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?

Describe the component architecture you would use to integrate a Large Language Model (LLM) into an existing w

Medium · System Design and Architecture

Describe the component architecture you would use to integrate a Large Language Model (LLM) into an existing web application, keeping in mind latency and cost.

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?

How do you handle state synchronization across microservices in a distributed system?

Medium · System Design and Architecture

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?

Design a scalable notifications system that can send email, SMS, and push notifications to millions of users d

Medium · System Design and Architecture

Design a scalable notifications system that can send email, SMS, and push notifications to millions of users daily.

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?

Review this legacy PHP or Java codebase, identify two performance bottlenecks, and refactor the code to improv

Medium · Pair Programming, Debugging, and Refacto

Review this legacy PHP or Java codebase, identify two performance bottlenecks, and refactor the code to improve readability and execution speed.

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?

There is a bug in this CSV file reader that causes it to crash on malformed rows; locate the bug and write a r

Medium · Pair Programming, Debugging, and Refacto

There is a bug in this CSV file reader that causes it to crash on malformed rows; locate the bug and write a robust error-handling mechanism.

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?

Refactor a monolithic component into smaller, reusable functional components while maintaining state managemen

Medium · Pair Programming, Debugging, and Refacto

Refactor a monolithic component into smaller, reusable functional components while maintaining state management and testability.

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?

Describe a situation where you had to debug a critical issue under tight time constraints. What was your proce

Medium · Behavioral and Cultural Fit

Describe a situation where you had to debug a critical issue under tight time constraints. What was your process?

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 Wizeline candidates report.

Day 1 — Map the Wizeline loop

  • Write out the reported sequence: Recruiter Outreach, Automated Testing, Live Coding, Architectural Discussions, Final Decision.
  • 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 5 reported rounds, with the weakest marked.

Day 2 — Work Pair Programming

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

Deliverable: One timed worked example in Pair Programming.

Day 3 — Work Live Coding

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

Deliverable: One timed worked example in Live Coding.

Day 4 — Work API Integration (REST/HTTP)

  • Spend the session on API Integration (REST/HTTP), which Wizeline candidates report being tested on.
  • Write one worked example in API Integration (REST/HTTP) and time yourself on it.

Deliverable: One timed worked example in API Integration (REST/HTTP).

Day 5 — Answer out loud: Coding and Algorithmic Problem Solving

  • Answer aloud, timed: Given an array of strings, group the anagrams together.
  • Answer aloud, timed: Write a function to consume data from a public REST API and display it dynamically in a UI component using React or TypeScript.

Deliverable: Spoken answers to 2 reported Coding and Algorithmic Problem Solving question(s), under time.

Day 6 — Answer out loud: Pair Programming, Debugging, and Refactoring

  • Answer aloud, timed: Review this legacy PHP or Java codebase, identify two performance bottlenecks, and refactor the code to improve readability and execution speed.
  • Answer aloud, timed: There is a bug in this CSV file reader that causes it to crash on malformed rows; locate the bug and write a robust error-handling mechanism.

Deliverable: Spoken answers to 2 reported Pair Programming, Debugging, and Refactoring question(s), under time.

Day 7 — Answer out loud: System Design and Architecture

  • Answer aloud, timed: How would you design a high-level architecture for an API gateway that handles rate limiting and token-based authentication?
  • Answer aloud, timed: Explain how you would design a system to ingest, process, and store large volumes of real-time analytical data.

Deliverable: Spoken answers to 2 reported System Design and Architecture question(s), under time.

Behavioural preparation

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

Describe a time when you had to work with a technology or framework you had never used before. How did you han

Medium · Behavioral and Cultural Fit

Describe a time when you had to work with a technology or framework you had never used before. How did you handle the learning curve?

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 a situation where a client demands a feature or timeline that you believe is technically unf

Medium · Behavioral and Cultural Fit

How do you handle a situation where a client demands a feature or timeline that you believe is technically unfeasible?

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 challenging technical conflict you had with a teammate and how you resolved it.

Medium · Behavioral and Cultural Fit

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 do you want to work at Wizeline, and how do you stay updated with emerging technologies like AI and LLMs?

Medium · Behavioral and Cultural Fit

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?