Uber interview sde1
- Posted
- 13 Nov 2025
477 reads
Summary
I interviewed for an SDE1 position at Uber and was challenged with a problem to find the kth smallest square in a sorted array, focusing on optimal time complexity.
How it went
I recently had my interview for the SDE1 role at Uber. It was a focused session on problem-solving, and I encountered a specific coding challenge. The interviewer asked me to find the kth smallest square in a given sorted array, with a particular emphasis on achieving a time complexity better than O(k), which made the problem quite interesting.
Questions asked (1)
- 01
Kth Smallest Square in Sorted Array
Data Structures & Algorithms
Given a sorted array of integers, find the kth smallest square of an element from the array. The solution should aim for a time complexity smaller than O(k).