LeetCode 2207: Maximize Number of Subsequences in a String Solution

Master LeetCode problem 2207 (Maximize Number of Subsequences in a String), 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.

2207. Maximize Number of Subsequences in a String

Medium

String Greedy Prefix Sum

Problem Explanation

Explanation:

To maximize the number of times the given pattern can occur as a subsequence in the modified text, we need to consider all possible positions where we can add either character of the pattern. By trying out all valid positions and counting the occurrences of the pattern, we can identify the maximum number of subsequences.

Iterate through all possible positions to add pattern[0] and pattern[1].
For each position, simulate adding the character and count the occurrences of the pattern as a subsequence.
Keep track of the maximum count obtained and return it as the answer.

Time Complexity: O(n) Space Complexity: O(1)

Solution Code

class Solution {
    public int maxSubsequences(String text, String pattern) {
        int count = 0;
        for (int i = 0; i <= text.length(); i++) {
            for (char c : pattern.toCharArray()) {
                StringBuilder sb = new StringBuilder(text);
                sb.insert(i, c);
                count = Math.max(count, countSubsequences(sb.toString(), pattern));
            }
        }
        return count;
    }
    
    private int countSubsequences(String text, String pattern) {
        int count = 0;
        int j = 0;
        for (int i = 0; i < text.length() && j < pattern.length(); i++) {
            if (text.charAt(i) == pattern.charAt(j)) {
                j++;
                if (j == pattern.length()) {
                    count++;
                    j = 0;
                }
            }
        }
        return count;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2207 (Maximize Number of Subsequences in a String)?

This page provides optimized solutions for LeetCode problem 2207 (Maximize Number of Subsequences in a String) 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 2207 (Maximize Number of Subsequences in a String)?

The time complexity for LeetCode 2207 (Maximize Number of Subsequences in a String) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2207 on DevExCode?

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

Back to LeetCode Solutions