LeetCode Experience

#2389 Longest Subsequence With Limited Sum

SWE coding Easy
Sign in to bookmark Original →

Interview Experience

LeetCode #2389: Longest Subsequence With Limited Sum. Difficulty: Easy. Topics: Array, Binary Search, Greedy, Sorting, Prefix Sum. Asked at Uber in the last 6 months.

Original Source

This is a frequency-tagged signal. The full problem statement lives on the original source.

View original →

Topics

Prefix Sum Arrays Binary Search Greedy Sorting

More from Uber

Reddit Left industry for 5 years, how fucked am I? Reddit Uber | System Design Round | L5 Reddit Uber SWE-1 India Hiring – Cleared OA but Ended Up Waitlisted (Which Basically Means Rejected) Reddit Uber EM Interview Experience Reddit Uber Strategic Operations Interview
← All Uber questions Uber Software Engineer Questions → All Arrays,Binary Search,Greedy,Sorting,Prefix Sum Questions →