LeetCode Experience

#3627 Maximum Median Sum of Subsequences of Size 3

SWE coding Medium
Sign in to bookmark Original →

Interview Experience

LeetCode #3627: Maximum Median Sum of Subsequences of Size 3. Difficulty: Medium. Topics: Array, Math, Greedy, Sorting, Game Theory. Asked at IBM 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

Game Theory Arrays Greedy Math Sorting

More from IBM

Reddit Ibm sde intern 1p3a IBM AI Developer Entry Level Interview Questions: REST API and LeetCode 1p3a IBM Java Backend Online Assessment on HackerRank Experience 1p3a IBM Platform Intern Technical Phone Screen - SDE Internship Reddit Advice for Legacy App Migration
← All IBM questions IBM Software Engineer Questions → All Greedy Questions →