LeetCode 2554: Maximum Number of Integers to Choose From a Range I Solution

Master LeetCode problem 2554 (Maximum Number of Integers to Choose From a Range I), 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.

2554. Maximum Number of Integers to Choose From a Range I

Medium

Array Hash Table Binary Search Greedy Sorting

Problem Explanation

Explanation

To solve this problem, we can iterate through the range [1, n] and check if the current integer is not in the banned array and adding it to the sum still keeps the sum within maxSum. We can use a HashSet to efficiently check if an integer is in the banned array. By iterating through the range and applying these conditions, we can find the maximum number of integers that can be chosen. We need to keep track of the maximum number of integers chosen so far and return that as the result.

Time complexity: O(n) where n is the range of integers [1, n]
Space complexity: O(m) where m is the size of the banned array

Solution Code

import java.util.HashSet;

class Solution {
    public int maxNumOfSubstrings(String s) {
        HashSet<Integer> bannedSet = new HashSet<>();
        for (int b : banned) {
            bannedSet.add(b);
        }

        int maxCount = 0;
        for (int i = 1; i <= n; i++) {
            if (!bannedSet.contains(i) && i <= maxSum) {
                maxCount++;
                maxSum -= i;
            }
        }

        return maxCount;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2554 (Maximum Number of Integers to Choose From a Range I)?

This page provides optimized solutions for LeetCode problem 2554 (Maximum Number of Integers to Choose From a Range I) 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 2554 (Maximum Number of Integers to Choose From a Range I)?

The time complexity for LeetCode 2554 (Maximum Number of Integers to Choose From a Range I) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2554 on DevExCode?

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

Back to LeetCode Solutions