3309. Maximum Possible Number by Binary Concatenation

LeetCodeArrayBit ManipulationEnumerationOpen on judge ↗

You are given an array of integers nums of size 3. Return the maximum possible number whose binary representation can be formed by concatenating the binary representation of all elements in nums in some order. Note that the binary representation of any number does not contain leading zeros. Example 1: Input: nums = [1,2,3] Output: 30 Explanation: Concatenate the numbers in the order [3, 1

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI