Split a String into two Substring such that the sum of unique characters is maximum

Maximize partitions such that no two substrings have any common character

Last Updated : 26 Apr, 2025

Try it on GfG Practice

Given string s of size n, the task is to print the number of substrings formed after maximum possible partitions such that no two substrings have a common character.

Examples:

Input : s = "ababcbacadefegdehijhklij"
Output : 3
Explanation: Partitioning at the index 8 and at 15 produces three substrings "ababcbaca", "defegde" and "hijhklij" such that none of them have a common character. So, the maximum partitions are 3.
Input: s = "aaa"
Output: 1
Explanation: Since, the string consists of a single character, no partition can be performed.

We have discussed three different approaches to solve this problem in Maximize String Partitions with No Common Characters

Split a String into two Substring such that the sum of unique characters is maximum

V

vabzcode12

Improve

Article Tags :

Practice Tags :

Similar Reads

Maximize String Partitions with No Common Characters

Given a string s consisting of lowercase English letters, partition s into the maximum number of substrings such that no two substrings share a common character. Return the total number of such substrings.Examples:Input: s = "acbbcc" Output: 2Explanation: "a" and "cbbcc" are two substrings that do n

Split a String into two Substring such that the sum of unique characters is maximum

Given a string str, the task is to partition the string into two substrings such that the sum of unique characters of both substrings is the maximum possible. Examples: Input: str = "abcabcdâ€ Output: 7Explanation: Partition the given string into "abc" and "abcd", the sum of unique characters is 3 +

Longest substring such that no three consecutive characters are same

Given string str, the task is to find the length of the longest substring of str such that no three consecutive characters in the substring are same.Examples: Input: str = "baaabbabbb" Output: 7 "aabbabb" is the required substring.Input: str = "babba" Output: 5 Given string itself is the longest sub

Maximize product of lengths of strings having no common characters

Given an array arr[] consisting of N strings, the task is to find the maximum product of the length of the strings arr[i] and arr[j] for all unique pairs (i, j), where the strings arr[i] and arr[j] contain no common characters. Examples: Input: arr[] = {"abcw", "baz", "foo", "bar", "xtfn", "abcdef"}

Check if two strings have a common substring

You are given two strings str1 and str2. You have to check if the two strings share a common substring. Examples : Input : str1 = "HELLO" str2 = "WORLD" Output : YES Explanation : The substrings "O" and "L" are common to both str1 and str2 Input : str1 = "HI" str2 = "ALL" Output : NO Explanation : B

Split string to get maximum common characters

Given a string S of length, N. Split them into two strings such that the number of common characters between the two strings is maximized and return the maximum number of common characters. Examples: Input: N = 6, S = abccbaOutput: 3Explanation: Splitting two strings as "abc" and "cba" has at most 3

Maximum count of Strings to be selected such that there is a majority character

Given an array A[]of N strings of lowercase characters, the task is to find maximum number of strings, such that one character has majority i.e. the occurrence of one character in all of the strings is greater than all the other characters combined. Examples: Input: A[] = {"aba", "abcde", "aba"}Outp

Maximize minority character deletions that can be done from given Binary String substring

Python Given binary string str of size, N. Select any substring from the string and remove all the occurrences of the minority character (i.e. the character having less frequency) from the substring. The task is to find out the maximum number of characters that can be removed from performing one suc

Minimize length of Substrings containing at least one common Character

Given a string str, the task is to find the minimum length of substrings such that all the sub strings of that length from str contains at least one common character. If no such length can be obtained, print -1. Example: Input: str = "saad" Output: 2 Explanation: All the substrings of length two of

Maximum sum of lengths of a pair of strings with no common characters from a given array

Given an array arr[] consisting of N strings, the task is to find the maximum sum of length of the strings arr[i] and arr[j] for all unique pairs (i, j), where the strings arr[i] and arr[j] contains no common characters. Examples: Input: arr[] = ["abcd", "cat", "lto", "car", "wxyz", "abcdef"]Output: