Search
⌘K
Get Premium
Leetcode 3309. Maximum Possible Number by Binary Concatenation
Given three integers, permute and concatenate their binary representations (without leading zeros) to form the largest possible binary number and return its integer value. The core challenge is choosing the order that maximizes the concatenated binary string — effectively sorting by a custom comparator that compares a+b versus b+a.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.