12 curated coding interview questions directly asked in Uipath technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 155 | Min Stack | Medium | Stack / Queue | Monotonic Stack / Simulation | 58.2% | 100.0% | 30d |
| 12 | Integer to Roman | Medium | Strings | Hashing / Sliding Window | 71.0% | 100.0% | 6m |
| 1036 | Escape a Large Maze | Hard | Core DSA | Implementation / Reasoning | 36.6% | 100.0% | all |
| 2826 | Sorting Three Groups | Medium | Arrays | Sorting / Prefix / Scan | 43.1% | 100.0% | all |
| 1162 | As Far from Land as Possible | Medium | Core DSA | Implementation / Reasoning | 52.3% | 100.0% | all |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 62.5% | all |
| 827 | Making A Large Island | Hard | Graphs | BFS / DFS / Topological Sort | 56.6% | 62.5% | all |
| 881 | Boats to Save People | Medium | Core DSA | Implementation / Reasoning | 61.8% | 62.5% | all |
| 990 | Satisfiability of Equality Equations | Medium | Core DSA | Implementation / Reasoning | 51.9% | 62.5% | all |
| 424 | Longest Repeating Character Replacement | Medium | Strings | Hashing / Sliding Window | 59.7% | 62.5% | all |
| 2603 | Collect Coins in a Tree | Hard | Trees; Dynamic Programming | DFS / BFS; State Transition | 40.1% | 62.5% | all |
| 312 | Burst Balloons | Hard | Core DSA | Implementation / Reasoning | 63.5% | 62.5% | all |