Uber Software Engineer Interview Questions and Answers

Question on Bellman Ford Algorithm

Priority Queue with linked list

4 question
2 very easy, one meduim but constraints were relaced, last question related to segment tree for traversing words

Questions asked 2
1. Group Anagrams
2. Question based kn recursion

Over the questions asked were difficult

Q1. Technical roud was about Maps and how to represent maps in Python using 2D Array
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

it was time bound coding test round. The questions were from array and string. There were 2 questions.

Q1. 
K-Palindrome Problem Statement
Determine whether a given string str can be considered a K-Palindrome.
A string is considered a K-Palindrome if it can be transformed into a palindrome after removing up to...read more
Ans. 
The problem is to determine whether a given string can be considered a K-Palindrome by removing up to 'k' characters.
• Iterate through the string from both ends and check if characters match, if not increment removal count

• If removal count is less than or equal to k, return True, else return False

• Use dynamic programming to optimize the solution by storing subproblem results
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

in this round manager spoke to me and explained about project and joining date later hr spoke to me regarding on boarding process