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, 2] to get the result "11110", which is the binary representation of 30.
Example 2:
Input: nums = [2,8,16]
Output: 1296
Explanation:
Concatenate the numbers in the order [2, 8, 16] to get the result "10100010000", which is the binary representation of 1296.
Constraints:
nums.length == 31 <= nums[i] <= 127Solutions for this problem are being prepared.
Try solving it yourselfMaximum Length of a Concatenated String with Unique Characters - Leetcode 1239 - Python • NeetCode • 30,976 views views
Watch 9 more video solutions →Practice Maximum Possible Number by Binary Concatenation with our built-in code editor and test cases.
Practice on FleetCodePractice this problem
Open in Editor