ConsultAdd coding interview
questions, leaked.
11 problems reported across recent ConsultAdd interviews. Top patterns: array, string, sorting. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
ConsultAdd's assessment hits you with 11 problems spread across arrays, strings, and greedy logic. Two are easy, eight medium, one hard. The array topic shows up in 7 problems, so you'll spend most of your time there. If you're solid on array manipulation and sorting, you're already ahead. But if you blank on a greedy or dynamic-programming pattern mid-assessment, StealthCoder runs invisibly during screen share and surfaces a working solution in seconds. That's your safety net when time pressure hits.
Top problems at ConsultAdd
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Zigzag Conversion | MEDIUM | 100.0 | 52% | String |
| 02 | Rotate Image | MEDIUM | 100.0 | 78% | Array · Math · Matrix |
| 03 | Coin Change | MEDIUM | 92.0 | 46% | Array · Dynamic Programming · Breadth-First Search |
| 04 | Candy | HARD | 92.0 | 47% | Array · Greedy |
| 05 | Transpose Matrix | EASY | 80.8 | 74% | Array · Matrix · Simulation |
| 06 | Count and Say | MEDIUM | 80.8 | 61% | String |
| 07 | Minimum Deletions to Make Character Frequencies Unique | MEDIUM | 80.8 | 61% | Hash Table · String · Greedy |
| 08 | Jump Game II | MEDIUM | 80.8 | 42% | Array · Dynamic Programming · Greedy |
| 09 | Group Anagrams | MEDIUM | 80.8 | 71% | Array · Hash Table · String |
| 10 | Merge Intervals | MEDIUM | 80.8 | 49% | Array · Sorting |
| 11 | Valid Anagram | EASY | 80.8 | 67% | Hash Table · String · Sorting |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual ConsultAdd OA. The proctor cannot see it. Screen share cannot detect it. Built by an Amazon engineer who used it to pass JPMorgan's OA and system design loop.
Get StealthCoder- array7 · 64%
- string5 · 45%
- sorting4 · 36%
- greedy3 · 27%
- hash table3 · 27%
- matrix2 · 18%
- dynamic programming2 · 18%
- math1 · 9%
- breadth first search1 · 9%
- simulation1 · 9%
The problem set is heavily array-focused (7 of 11), with string work as the secondary demand (5 problems). Sorting and greedy both appear frequently, and you'll see them combined in problems like Merge Intervals and Minimum Deletions to Make Character Frequencies Unique. Candy is the outlier hard problem, a greedy challenge that requires careful logic. Most of the weight is medium difficulty, so expect to nail the fundamentals fast and then spend time on greedy intuition. Hash tables show up 3 times but usually paired with arrays or strings. If you haven't drilled Rotate Image, Jump Game II, and Coin Change yet, those are your pressure points. StealthCoder is the hedge if a DP or greedy problem doesn't click on the live OA.
Companies with similar patterns
If you prepped for ConsultAdd, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass ConsultAdd.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built by an Amazon engineer who used it to pass JPMorgan's OA and system design loop. Works on HackerRank, CodeSignal, CoderPad, and Karat.
ConsultAdd interview FAQ
Should I study greedy or dynamic programming first for ConsultAdd?+
Hit arrays and sorting first. Greedy shows up 3 times and DP shows up 2 times, but greedy problems here (Candy, Jump Game II, Minimum Deletions) often test sorting and iteration first. Nail array patterns before you optimize with greedy logic.
How many string problems should I expect?+
Five of the eleven problems involve strings: Zigzag Conversion, Count and Say, Group Anagrams, Minimum Deletions, and Valid Anagram. Most are medium. String work here is usually paired with hashing or sorting, not isolation drills.
Is one hard problem enough to worry about?+
Candy is the only hard problem reported. It's greedy and array-based, so if you're confident with greedy logic on arrays, you're in shape. The real risk is hitting a medium that requires non-obvious DP or greedy reasoning under time pressure.
What should I drill if I have limited time?+
Array manipulation (7 problems), then sorting (4 problems), then greedy patterns (3 problems). Rotate Image, Merge Intervals, and Jump Game II show up in the top problems. Hash-table problems almost always pair with strings or arrays, so they're secondary.
Are matrix problems a major focus?+
No. Matrix appears in 2 problems (Rotate Image and Transpose Matrix). Transpose is easy. Rotate is medium and tests rotation logic and math. Don't over-prepare matrix theory; focus on the array and string bulk instead.