LeetCode Experience

#1877 Minimize Maximum Pair Sum in Array

SWE coding Medium
Sign in to bookmark Original →

Interview Experience

LeetCode #1877: Minimize Maximum Pair Sum in Array. Difficulty: Medium. Topics: Array, Two Pointers, Greedy, Sorting. Asked at Google 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

Arrays Greedy Sorting Two Pointers

More from Google

Reddit Why did you create those day in a life video? Reddit It works Reddit Brave Software director screening went south fast, these companies are weird Reddit Job finished Reddit Anxiety and brain freeze during interview
← All Google questions Google Software Engineer Questions → All Greedy Questions →