
UiPath Software Engineer Interview Questions
& Process
Real candidates share what happened, how many rounds they had,
and how the experience turned out.
Based on 107 interview experiences · FREE TO READ
Candidate interview experiences
First-hand accounts from people who interviewed at UiPath.
Software Engineer
Went through a really long interview process, like 7 rounds total. Had to go into the office for the HLD and hiring manager rounds. Started with a recruiter chat. Then the hiring manager did an intro round for about 45 mins, explaining the role and asking about my background. After that, it was the full interview loop: 2 technical DSA rounds, 2 design rounds, and 1 more HM round. It was super tiring and took up a lot of time.
- I don't remember the exact DSA questions, but they were like standard LeetCode medium problems. We were given a very long list of documents, where each document had strings separated by spaces. We were also given a list of queries, each with word1, word2, and a distance. For every query, we had to find the documents where word1 and word2 were present with less than 'distance' words between them. The goal was to find the most optimal algorithm for this.
- For the HLD round, the task was to design a document platform that the service engineering team or end-users could use for documentation. High availability wasn't critical, and immediate consistency wasn't required, but it needed to be easy to fetch and edit documents. It also had to be very cost-effective and scale well during peak times, like right after a product release when documentation is accessed heavily.
- The HM round question was to design a service that replicates data received from upstream services and then forwards it to other microservices that consume this data.
Software Engineer Intern
The interview process had 4 rounds. First was an Online Assessment with 3 questions (1 medium, 1 medium-hard, 1 hard) that took 2 hours. Getting through the OA was the main shortlist, not CG. Then came 3 offline rounds. Round 1 was technical, covering resume, DSA, CS fundamentals, and a comprehensive mix, lasting about 1 hour 10 mins. Round 2 was purely technical, a live coding session with one difficult DP-based question that needed heavy optimization. They wanted to see coding of all approaches from brute force to optimized DP, and especially how I debugged. Round 3 was with a Hiring Manager, a mix of technical and real-life scenario questions. I was randomly grouped with one of the HMs, and it was a very chill, supportive round focusing on questions about me.
- Tell me about your resume and projects.
- Describe your approach to basic DSA problems.
- Solve a DSA coding question (easy to medium).
Software Engineer
The hiring process has a few parts. First, there was a HackerRank test with 3 problems, and you had to get at least 2 right. You could pick your programming language. But, there were issues with the platform for 2 out of the 3 problems. For the first one, I couldn't select Python. For the second, the checker wasn't working right. The problem said the output order didn't matter, but it did. I told them, and they were kind of aggressive in their response. They said they'd fix the first problem. For the second, they said some test cases failed because the line count was different, even though I thought the output was the same. I wasted a lot of time figuring that out, but it didn't matter to them. For the third problem, my solution wasn't efficient enough. So, my question is, how was I supposed to pass if 2 out of 3 problems had platform issues?
- Questions about Data Structures were asked.
- Questions about Dynamic Programming were asked.
- Questions about Regular Expressions were asked.
UiPath Software Engineer Interview Questions
Quoted word for word from UiPath interview reports.
“Write the code to remove nodes that have a depth exceeding a specific given value.”
Read reports →“Given an positive integers unsorted array. Find one number, if removed the GCD of the remaining array is maximized”
Read reports →“Solve the problem: given an integer K, remove nodes from a binary tree if their leaf node is less than K distance from the root.”
Read reports →“What is the least positive integer missing from an array of n elements?”
Read reports →“Given an integers unsorted array, find maximum number between two indexes. Discussion on space and time complexity. Finding the optimized solution with heap”
Read report →“Given a binary tree, how can you create a copy where each node's value is the sum of all nodes in its subtree?”
Read report →“Given a linked list, can you reverse it in groups of size k?”
Read report →“Can you sort an array with only 0s, 1s, and 2s in linear time?”
Read report →“What is the Big O notation for a given algorithm, and what's its significance?”
Read report →Formats, difficulty and experience
Across all 107 UiPath interview reports.