LeetCode 3011: Find if Array Can Be Sorted Solution

Master LeetCode problem 3011 (Find if Array Can Be Sorted), 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.

3011. Find if Array Can Be Sorted

Medium

Array Bit Manipulation Sorting

Problem Explanation

Explanation

To solve this problem, we can iterate through the array and check if each pair of adjacent elements can be swapped based on the condition provided. We can use a helper function to count the number of set bits in a given number. If we encounter a pair of elements that cannot be swapped, we return false. If we are able to swap all elements and sort the array in ascending order, we return true.

Algorithm:

Implement a helper function countSetBits(num) to count the number of set bits in a given number.
Iterate through the array and check if adjacent elements can be swapped based on the condition.
If we encounter a pair of elements that cannot be swapped, return false.
If we are able to swap all elements and sort the array in ascending order, return true.

Time Complexity:

The time complexity of this approach is O(n*log(n)) where n is the number of elements in the input array.

Space Complexity:

The space complexity is O(1) as we are using constant extra space.

Solution Code

class Solution {
    public boolean canBeSorted(int[] nums) {
        for (int i = 0; i < nums.length - 1; i++) {
            if (countSetBits(nums[i]) > countSetBits(nums[i + 1])) {
                return false;
            }
        }
        return true;
    }
    
    private int countSetBits(int num) {
        int count = 0;
        while (num > 0) {
            count += num & 1;
            num >>= 1;
        }
        return count;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 3011 (Find if Array Can Be Sorted)?

This page provides optimized solutions for LeetCode problem 3011 (Find if Array Can Be Sorted) 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 3011 (Find if Array Can Be Sorted)?

The time complexity for LeetCode 3011 (Find if Array Can Be Sorted) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 3011 on DevExCode?

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

Back to LeetCode Solutions