wex logo
Wex· SDE 2

WEX | SDE 2 | Interview Experience

Experience
4 years
Posted
30 Aug 2026
69 reads

Summary

I completed three interview rounds for an SDE 2 position at WEX, solving several DSA problems, discussing OOP concepts, and presenting a high‑level design, with the entire process spanning multiple weeks.

How it went

Round 1 - DSA

I was asked to write pseudocode for 2 DSA problems.

  1. Paint House
  2. Candy

I was able to complete the first problem, including optimizing the solution. For the second problem, I initially provided a solution with higher time complexity. After receiving a hint from the interviewer, I was able to arrive at the optimized solution.

Round 2 - DSA + OOPS

I was asked to write working code for 2 DSA problems.

  1. Word Search
  2. Frequency of the Most Frequent Element

I was able to solve both problems completely. After the coding section, the interviewer asked OOP concepts (4 core pillars) and SOLID principles.

Round 3 - Hiring Manager

After introductions, I was asked to design the architecture (HLD) of the project I had recently worked on in my current organization. The interviewer then evaluated my understanding of several fundamental concepts, including:

  • API Design
  • OOP - objects, classes, abstract classes, interfaces
  • Exception handling
  • Thread-safe Singleton design pattern
  • SQL Joins

Finally, the round ended with some situational and behavioral questions.

Overall Experience

All the rounds were eliminatory and the interviews were scheduled once a week. Because of this, it took a considerable amount of time to complete the entire interview process.

Questions asked (4)

  1. 01

    Paint House

    Data Structures & Algorithms

    Given a row of houses, each house can be painted one of three colors. The cost of painting each house with a particular color is provided. Find the minimum total cost to paint all houses such that no two adjacent houses have the same color.

    Open the problem
  2. 02

    Candy

    Data Structures & Algorithms

    There are N children standing in a line, each with a rating. Distribute candies to the children such that each child gets at least one candy, and any child with a higher rating than an immediate neighbor receives more candies than that neighbor. Minimize the total number of candies distributed.

    Open the problem
  3. 03

    Word Search

    Data Structures & Algorithms

    Given a 2D board of characters and a word, determine if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same cell may not be used more than once.

    Open the problem
  4. 04

    Frequency of the Most Frequent Element

    Data Structures & Algorithms

    Given an integer array nums and an integer k, you can increment any element of the array by 1 at most k times in total. Return the maximum possible frequency of an element after performing the operations.

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Wex recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!