LeetCode Question

#2163 Minimum Difference in Sums After Removal of Elements

SWE coding Hard
Sign in to bookmark Original →

Question Details

LeetCode #2163: Minimum Difference in Sums After Removal of Elements. Difficulty: Hard. Topics: Array, Dynamic Programming, Heap (Priority Queue). 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

Heap (Priority Queue) Arrays Dynamic Programming Heap Queue

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,Dynamic Programming,Heap Questions →