Question Details
1st Round DSA Interview 1. Water Jug Problem Reference: LeetCode Question 365. 2. Maximum Elements Made Equal With k Updates
Problem Statement: Given an array nums[] and a value k,
Full Details
1st Round DSA Interview 1. Water Jug Problem Reference: LeetCode Question 365. 2. Maximum Elements Made Equal With k Updates
Problem Statement: Given an array nums[] and a value k, find the maximum number of elements that can be made equal using at most k increments.
Examples: *
Input: nums[] = { 2, 4, 9 }, k = 3 *
Output: 2 *
Explanation: By incrementing the element 2 by 2, it becomes 4. This utilizes 2 updates, leaving k=1. Two elements are now 4. It is not possible to target 9 because converting 4 to 9 requires 5 increments, which exceeds k. *
Input: nums[] = { 5, 5, 3, 1 }, k = 5 *
Output: 3 *
Explanation: Two elements are already 5. Increasing the element 3 to 5 costs 2 updates, reducing k to 3. Increasing 1 to 5 would cost 4 updates, which exceeds the remaining k. Therefore, the maximum number of equal elements is 3. *
Input: nums[] = { 5, 5, 3, 1 }, k = 6 *
Output: 4 *
Explanation: With k=6, there are enough updates to increment both 3 (cost: 2) and 1 (cost: 4) to become 5, making all 4 elements equal.
About This Question
This is a reported interview question from a wex interview for a swe role reported in 2025.
It covers the following topics: Arrays .
Topics
More Wex Interview Questions
About Wex Interview Reports
This question was reported by a candidate who interviewed at Wex. LeakCode aggregates interview reports from 10+ sources, including 1Point3Acres, Glassdoor, LeetCode Discuss, Blind, Reddit, Indeed, and Nowcoder. Each report is translated where necessary, deduplicated against existing entries, and tagged by company, role, round type, and reporting date.
Use this question as one calibration data point, not a memorization target. Companies typically rotate their question pools every 2-4 months; the exact wording of a 2024 question may differ from what you encounter today. The underlying pattern, difficulty level, and follow-up depth at Wex are the higher-signal extractions to take from this report.
For broader preparation context, the Wex interview process typically includes a recruiter screen, one or two technical phone screens, and a 4-5 round on-site loop covering coding, system design (at L4+ levels), and behavioral. Reports tagged on LeakCode show the round-by-round distribution and typical difficulty calibration. To browse questions filtered by round type and seniority, use the company hub linked above.
How To Practice This Type of Question
Solve similar problems on LeetCode under timed conditions (25-35 minutes per medium difficulty). The goal is pattern recognition: recognize the underlying technique (sliding window, two-pointer, BFS, memoized recursion, etc.) within 60-90 seconds of reading. Strong candidates verbalize their hypothesis out loud before coding, then iterate based on feedback. Weak candidates dive into implementation immediately, lose time on the wrong approach, and run out of time for follow-ups.
Companies update their question pools every 2-4 months. The exact wording of any given question may have been retired by the time you interview. Focus your prep on the pattern, not the specific problem. The patterns that appear in Wex reports consistently are the ones worth investing in; one-off niche problems are not.
During Your Wex Round
Apply the standard interview round template: clarify requirements (2-3 minutes), state your approach out loud and confirm direction with the interviewer (3-5 minutes), code with narration (15-25 minutes), test with concrete examples including edge cases (5 minutes), discuss optimization or trade-offs if time permits (5 minutes). This template is universally accepted across FAANG and adjacent companies; deviating from it produces weaker interviewer feedback signal.
The single most predictive failure mode in Wex reports tagged "no hire": not asking clarifying questions. Interviewers are explicitly trained to weight this. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's written notes.