LeetCode 3133: Minimum Array End Solution

Master LeetCode problem 3133 (Minimum Array End), a medium challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

3133. Minimum Array End

Medium

Bit Manipulation

Problem Explanation

Explanation

To find the minimum possible value of the last element in the array, we need to construct an array of positive integers such that the result of the bitwise AND operation between all elements is x. We can achieve this by setting the last element to x and then filling the remaining elements with increasing values to satisfy the condition.

Find the highest set bit position in x.
Create a mask with all bits set to 1 up to the highest set bit position.
Initialize the last element nums[n-1] as x.
Fill the array backwards starting from nums[n-2] with values that maintain the bitwise AND operation to be x.
Return the minimum possible value of nums[n-1].

Time complexity: O(log x)
Space complexity: O(1)

Solution Code

class Solution {
    public int findMinimumLastElement(int n, int x) {
        int highestSetBit = 31 - Integer.numberOfLeadingZeros(x);
        int mask = (1 << (highestSetBit + 1)) - 1;
        int[] nums = new int[n];
        nums[n - 1] = x;
        for (int i = n - 2; i >= 0; i--) {
            nums[i] = mask | (mask - 1);
        }
        return nums[n - 1];
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 3133 (Minimum Array End)?

This page provides optimized solutions for LeetCode problem 3133 (Minimum Array End) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 3133 (Minimum Array End)?

The time complexity for LeetCode 3133 (Minimum Array End) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 3133 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 3133 in Java, C++, or Python.

Back to LeetCode Solutions