Role: Software Engineer 2
College: Not Specified
Interview Date: September 23, 2025
Interview Type: Full-Time
Result: Not Specified
Difficulty: Medium
Rounds: At least 1 round (Data Structures and Algorithms)
Topics Asked: Data Structures, Algorithms
Experience:
The interview process for the Software Engineer 2 role at Wex Inc. began with a dedicated Data Structures and Algorithms round. This round presented two distinct coding challenges designed to test problem-solving abilities.
Coding Questions:
- Q1. Water Jug Problem: This is the classic Water Jug Problem, also known as LeetCode problem 365. The problem asks if it's possible to measure exactly `targetCapacity` liters using two jugs with given capacities `jug1Capacity` and `jug2Capacity`, with an infinite supply of water.
- Q2. Maximum Elements Equal with K Updates: Given an array `nums[]` and a value `k`, the task is to find the maximum number of elements that can be made equal with at most `k` updates/increments. For example, if `nums[] = {2, 4, 9}` and `k = 3`, the output is 2, as you can make two elements 4 by increasing 2 by 2. Another example: if `nums[] = {5, 5, 3, 1}` and `k = 5`, the output is 3, because the first two elements are already equal, and the third element (3) can be increased to 5 (costing 2 increments), leaving `k = 3`. Increasing 1 to 5 would cost 4 increments, which is not possible with the remaining `k`.