New
The Learning module is now live
See what's new
×
Question Bank
Learning
NEW
Pricing
Blog
Forum
HOT
JobRadar
Description
Solution
Discussion
Submissions
Ask AI
Question Bank
Coinbase
Coding Question
AI Insights
Quick Summary
Select transactions to maximize total fees without exceeding a fixed block capacity.
Prioritize items based on a fee-to-size ratio with explicit multi-level tie-breaking rules.
Requires an efficient O(N log N) approach to handle up to 10^5 transactions.
What This Tests
Custom comparator implementation for complex sorting criteria
Greedy strategy for constrained resource allocation
Avoiding floating-point precision errors in mathematical comparisons
Data aggregation and linear scan techniques
Common Patterns
Greedy
Sorting
Collapse
Hint 1
Hint 2
Hint 3
What Interviewers May Ask Next
Accepted
2.9k
/4k
Acceptance Rate
72.2%
Ask AI Assistant
Ask AI Assistant
Ask me anything about this coding question!
Qwen
Qwen3.6-Flash
0/2000
Auto
Debug
Run
Submit
Test Cases
Input
transactionIds =
fees =
sizes =
blockSize =
Output
Expected
