Uber Software Development Engineer 2 Interview Experience
Software Development Engineer 2
Summary
AI Powered
The Uber interview process for the SDE-2 role was comprehensive and technically demanding. Candidates went through multiple rounds, starting with online assessments focused on data structures and algorithms, followed by machine coding and system design challenges. The complexity of the interview increased, covering various topics such as advanced DSA and system scalability concepts. Overall, the experience at Uber appears to rigorously evaluate both algorithmic skills and design principles critical for a software engineering role.
1
#1Longest Increasing Subsequence
Medium
dynamic-programming
longest-increasing-subsequence
Implement an algorithm to find the longest increasing subsequence in a given array of integers. You can use dynamic programming with a time complexity of O(n²) or optimize your solution with binary search to achieve a time complexity of O(n log n).
#1
Longest Increasing Subsequence
Implement an algorithm to find the longest increasing subsequence in a given array of integers. You can use dynamic programming with a time complexity of O(n²) or optimize your solution with binary search to achieve a time complexity of O(n log n).
dynamic-programming
longest-increasing-subsequence
Medium
#2Valid Palindrome with One Removal
Medium
two-pointers
string-manipulation
Determine if a given string can become a palindrome by removing at most one character. Use the two-pointer technique to efficiently validate the condition in O(n) time.
#2
Valid Palindrome with One Removal
Determine if a given string can become a palindrome by removing at most one character. Use the two-pointer technique to efficiently validate the condition in O(n) time.
two-pointers
string-manipulation
Medium
2
#1Two Sum
Easy
hashmap
arrays
Given an array of integers, find indices of the two numbers such that they add up to a specific target. Implement an optimal solution using a HashMap with a time complexity of O(n).
#1
Two Sum
Given an array of integers, find indices of the two numbers such that they add up to a specific target. Implement an optimal solution using a HashMap with a time complexity of O(n).
hashmap
arrays
Easy
#2Kth Largest in BST
Medium
binary-search-tree
in-order-traversal
Find the kth largest element in a binary search tree (BST). Use in-order traversal to retrieve elements in sorted order and manage edge cases effectively.
#2
Kth Largest in BST
Find the kth largest element in a binary search tree (BST). Use in-order traversal to retrieve elements in sorted order and manage edge cases effectively.
binary-search-tree
in-order-traversal
Medium
3
#1Longest Common Prefix
Medium
sorting
trie
Write a function to find the longest common prefix string amongst an array of strings. Initial implementations could use sorting with a time complexity of O(n log n), followed by a more efficient solution using a Trie with O(n).
#1
Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings. Initial implementations could use sorting with a time complexity of O(n log n), followed by a more efficient solution using a Trie with O(n).
sorting
trie
Medium
4
#1File System Design
Medium
machine-coding
file-system
Design a simplified file system that supports create, read, write, and delete operations. Discuss core features while considering aspects of scalability, concurrency, and versioning.
#1
File System Design
Design a simplified file system that supports create, read, write, and delete operations. Discuss core features while considering aspects of scalability, concurrency, and versioning.
machine-coding
file-system
Medium
5
#1Design a Parking Lot System
Hard
system-design
parking-lot
scalability
Create a system design for a parking lot which accommodates multiple floors and different types of vehicles. Ensure to include fee calculation, but also try to cover aspects of scalability, concurrency, and fault tolerance.
#1
Design a Parking Lot System
Create a system design for a parking lot which accommodates multiple floors and different types of vehicles. Ensure to include fee calculation, but also try to cover aspects of scalability, concurrency, and fault tolerance.
system-design
parking-lot
scalability
Hard
uberinterviewsde2systemdesignmachinecodingdsaroundssoftwareengineeringtechinterviewscodinginterviewuber
A
Anonymous
Anonymous User