UiPath coding interview
questions, leaked.
10 problems reported across recent UiPath interviews. Top patterns: array, string, breadth first search. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
UiPath's coding assessment hits you with 8 medium problems and 2 hard ones, no easy wins. Arrays dominate the diet: 7 of 10 problems use them. You'll see graph traversal (BFS, DFS, union-find) paired with arrays and strings constantly. The mix rewards pattern recognition over brute force. If you blank on a maze-escape or island-counting problem mid-assessment, StealthCoder reads the prompt in real time and surfaces a working solution invisible to the proctor. You're not studying for theory here. You're drilling the exact patterns UiPath runs.
Top problems at UiPath
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Sorting Three Groups | MEDIUM | 100.0 | 42% | Array · Binary Search · Dynamic Programming |
| 02 | Escape a Large Maze | HARD | 100.0 | 35% | Array · Hash Table · Depth-First Search |
| 03 | As Far from Land as Possible | MEDIUM | 100.0 | 52% | Array · Dynamic Programming · Breadth-First Search |
| 04 | Number of Islands | MEDIUM | 72.1 | 62% | Array · Depth-First Search · Breadth-First Search |
| 05 | Satisfiability of Equality Equations | MEDIUM | 62.7 | 51% | Array · String · Union Find |
| 06 | Longest Repeating Character Replacement | MEDIUM | 62.7 | 57% | Hash Table · String · Sliding Window |
| 07 | Making A Large Island | HARD | 62.7 | 55% | Array · Depth-First Search · Breadth-First Search |
| 08 | Longest Palindromic Substring | MEDIUM | 62.7 | 36% | Two Pointers · String · Dynamic Programming |
| 09 | Integer to Roman | MEDIUM | 62.7 | 69% | Hash Table · Math · String |
| 10 | Boats to Save People | MEDIUM | 62.7 | 60% | Array · Two Pointers · Greedy |
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 UiPath 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 · 70%
- string4 · 40%
- breadth first search4 · 40%
- union find3 · 30%
- hash table3 · 30%
- depth first search3 · 30%
- matrix3 · 30%
- dynamic programming3 · 30%
- two pointers2 · 20%
- graph1 · 10%
Array problems are the backbone: don't waste time on weak fundamentals there. BFS and union-find appear in 4 and 3 problems respectively, often combined with arrays and matrices. The hard problems (Escape a Large Maze, Making A Large Island) weaponize BFS and DFS on grids. Dynamic programming and string work show up as secondary layers on array and traversal problems. Start with array sorting and searching basics, then move to graph traversal on grids. Hash tables and sliding windows are lower frequency but appear on string problems like Longest Repeating Character Replacement. This isn't a balanced assessment. It's designed to separate candidates who can chain array indexing with graph algorithms. StealthCoder acts as your safety net if you hit a pattern you didn't have time to internalize.
Companies with similar patterns
If you prepped for UiPath, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass UiPath.
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.
UiPath interview FAQ
How many array problems should I solve before the UiPath assessment?+
Focus on 15 to 20 array problems that mix sorting, searching, and two-pointer work. Seven of the ten UiPath problems use arrays, so gaps here compound. Prioritize problems that pair arrays with other patterns like BFS or dynamic programming, not isolated array drills.
Is graph traversal essential for UiPath's assessment?+
Yes. BFS and DFS appear in 4 problems each. Union-find shows up in 3. These almost always run on grid or matrix structures, not standalone graphs. Make sure you've solved island-counting and maze-escape patterns before the assessment.
What should I drill first for UiPath?+
Start with array sorting and two-pointer techniques. Then move to BFS on grids and union-find for connected components. String and hash-table problems are secondary. You have 8 medium problems, so speed and pattern recognition matter more than memorization.
Are dynamic programming problems common on UiPath's assessment?+
They appear in 3 of 10 problems, often layered with arrays or strings. Don't treat DP as a standalone skill. Focus on DP patterns that sit on top of array manipulation or matrix traversal, like Longest Palindromic Substring and Sorting Three Groups.
How do I prepare for the two hard problems on UiPath's assessment?+
Both hard problems (Escape a Large Maze, Making A Large Island) combine arrays, matrices, and graph traversal. Practice BFS and DFS on grids extensively. The difficulty isn't the algorithm; it's managing state and optimization on large inputs. Solve similar grid traversal problems with strict time limits.