Software Development Engineer 2
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).
This question was asked in
Uber Software Development Engineer 2 Interview Experience
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.