Problem database last updated: June 20, 2025
10 problems · 0 Easy, 8 Medium, 2 Hard · Ranked #144 of 458
0 Easy
0% · avg 23%
8 Medium
80% · avg 59%
2 Hard
20% · avg 18%
Based on 10 reported problems, UiPath interviews are in line with industry averages - 20% Hard vs 18% overall. The majority (80%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, UiPath puts unusual emphasis on union-find (30% of problems, 10.2x the industry average), breadth-first-search (40% of problems, 4.8x the industry average), matrix (30% of problems, 3.4x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (70%), breadth-first-search (40%), string (40%), hash-table (30%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Escape a Large Maze There is a 1 million by 1 million grid on an XY-plane, and the coordinates of each grid square are (x, y). | Hard | Very Likely | arrayhash-tabledepth-first-search | Solve |
Sorting Three Groups You are given an integer array nums. Each element in nums is 1, 2 or 3. In each operation, you can remove an element from nums. Return the minimum number of ope... | Medium | Very Likely | arraybinary-searchdynamic-programming | Solve |
As Far from Land as Possible Given an n x n grid containing only values 0 and 1, where 0 represents water and 1 represents land, find a water cell such that its distance to the nearest land... | Medium | Very Likely | arraydynamic-programmingbreadth-first-search | Solve |
Number of Islands Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands. | Medium | Likely | arraydepth-first-searchbreadth-first-search | Solve |
Longest Palindromic Substring Given a string s, return the longest palindromic substring in s. | Medium | Likely | two-pointersstringdynamic-programming | Solve |
Satisfiability of Equality Equations You are given an array of strings equations that represent relationships between variables where each string equations[i] is of length 4 and takes one of two di... | Medium | Likely | arraystringunion-find | Solve |
Longest Repeating Character Replacement You are given a string s and an integer k. You can choose any character of the string and change it to any other uppercase English character. You can perform th... | Medium | Likely | hash-tablestringsliding-window | Solve |
Integer to Roman Seven different symbols represent Roman numerals with the following values: | Medium | Likely | hash-tablemathstring | Solve |
Making A Large Island You are given an n x n binary matrix grid. You are allowed to change at most one 0 to be 1. | Hard | Likely | arraydepth-first-searchbreadth-first-search | Solve |
Boats to Save People You are given an array people where people[i] is the weight of the ith person, and an infinite number of boats where each boat can carry a maximum weight of lim... | Medium | Likely | arraytwo-pointersgreedy | Solve |
Escape a Large Maze
SolveThere is a 1 million by 1 million grid on an XY-plane, and the coordinates of each grid square are (x, y).
Sorting Three Groups
SolveYou are given an integer array nums. Each element in nums is 1, 2 or 3. In each operation, you can remove an element from nums. Return the minimum number of ope...
As Far from Land as Possible
SolveGiven an n x n grid containing only values 0 and 1, where 0 represents water and 1 represents land, find a water cell such that its distance to the nearest land...
Number of Islands
SolveGiven an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands.
Longest Palindromic Substring
SolveGiven a string s, return the longest palindromic substring in s.
Satisfiability of Equality Equations
SolveYou are given an array of strings equations that represent relationships between variables where each string equations[i] is of length 4 and takes one of two di...
Longest Repeating Character Replacement
SolveYou are given a string s and an integer k. You can choose any character of the string and change it to any other uppercase English character. You can perform th...
Integer to Roman
SolveSeven different symbols represent Roman numerals with the following values:
Making A Large Island
SolveYou are given an n x n binary matrix grid. You are allowed to change at most one 0 to be 1.
Boats to Save People
SolveYou are given an array people where people[i] is the weight of the ith person, and an infinite number of boats where each boat can carry a maximum weight of lim...
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent UiPath interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
UiPath interviews focus heavily on array, breadth-first-search, string problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. UiPath interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
UiPath has been reported to ask 10 distinct coding problems. The most common topics are array, breadth-first-search, string. 0 are Easy difficulty, 8 are Medium, and 2 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 10 reported problems, UiPath interviews are in line with industry averages - 20% Hard vs 18% overall. 80% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, breadth-first-search, string. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real UiPath coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a UiPath interview with AIarrow_forward
