Given a string str and a string array arr[], the task is to find the minimum count of substrings this can be splitted into such that every substring is present in the given string array arr[].
Examples:
Input: str = “111112”, arr[] = {“11”, “111”, “11111”, “2”}
Output: 2
“11111” and “2” are the required substrings.
“11”, “111” and “2” can also be a valid answer
but it is not the minimum.Input: str = “123456”, arr[] = {“1”, “12345”, “2345”, “56”, “23”, “456”}
Output: 3
Approach: Iterate the string from index 0 and build the prefix string, if the prefix string exists in the given array (a set can be used to check this) then call the function again from the next position in the string and keep track of the overall minimum count of substrings.
Below is the implementation of the above approach:
C++
// C++ implementation of the approach #include <bits/stdc++.h> using namespace std; // Set to store all the strings // from the given array unordered_set<string> uSet; // To store the required count int minCnt = INT_MAX; // Recursive function to find the count of // substrings that can be splitted starting // from the index start such that all // the substrings are present in the map void findSubStr(string str, int cnt, int start) { // All the chosen substrings // are present in the map if (start == str.length()) { // Update the minimum count // of substrings minCnt = min(cnt, minCnt); } // Starting from the substrings of length 1 // that start with the given index for (int len = 1; len <= (str.length() - start); len++) { // Get the substring string subStr = str.substr(start, len); // If the substring is present in the set if (uSet.find(subStr) != uSet.end()) { // Recursive call for the // rest of the string findSubStr(str, cnt + 1, start + len); } } } // Function that inserts all the strings // from the given array in a set and calls // the recursive function to find the // minimum count of substrings str can be // splitted into that satisfy the given condition void findMinSubStr(string arr[], int n, string str) { // Insert all the strings from // the given array in a set for (int i = 0; i < n; i++) uSet.insert(arr[i]); // Find the required count findSubStr(str, 0, 0); } // Driver code int main() { string str = "123456"; string arr[] = { "1", "12345", "2345", "56", "23", "456" }; int n = sizeof(arr) / sizeof(string); findMinSubStr(arr, n, str); cout << minCnt; return 0; } |
chevron_right
filter_none
Java
//Java implementation of above approach import java.util.*; class GFG { // Set to store all the Strings // from the given array static Set<String> uSet = new HashSet<String>(); // To store the required count static int minCnt = Integer.MAX_VALUE; // Recursive function to find the count of // subStrings that can be splitted starting // from the index start such that all // the subStrings are present in the map static void findSubStr(String str, int cnt, int start) { // All the chosen subStrings // are present in the map if (start == str.length()) { // Update the minimum count // of subStrings minCnt = Math.min(cnt, minCnt); } // Starting from the subStrings of length 1 // that start with the given index for (int len = 1; len <= (str.length() - start); len++) { // Get the subString String subStr = str.substring(start, start + len); // If the subString is present in the set if (uSet.contains(subStr)) { // Recursive call for the // rest of the String findSubStr(str, cnt + 1, start + len); } } } // Function that inserts all the Strings // from the given array in a set and calls // the recursive function to find the // minimum count of subStrings str can be // splitted into that satisfy the given condition static void findMinSubStr(String arr[], int n, String str) { // Insert all the Strings from // the given array in a set for (int i = 0; i < n; i++) uSet.add(arr[i]); // Find the required count findSubStr(str, 0, 0); } // Driver code public static void main(String args[]) { String str = "123456"; String arr[] = {"1", "12345", "2345", "56", "23", "456" }; int n = arr.length; findMinSubStr(arr, n, str); System.out.print(minCnt); } } // This code is contributed by Arnab Kundu |
chevron_right
filter_none
Python3
# Python3 implementation of the approach import sys # Set to store all the strings # from the given array uSet = set(); # To store the required count minCnt = sys.maxsize; # Recursive function to find the count of # substrings that can be splitted starting # from the index start such that all # the substrings are present in the map def findSubStr(string, cnt, start) : global minCnt; # All the chosen substrings # are present in the map if (start == len(string)) : # Update the minimum count # of substrings minCnt = min(cnt, minCnt); # Starting from the substrings of length 1 # that start with the given index for length in range(1, len(string) - start + 1) : # Get the substring subStr = string[start : start + length]; # If the substring is present in the set if subStr in uSet : # Recursive call for the # rest of the string findSubStr(string, cnt + 1, start + length); # Function that inserts all the strings # from the given array in a set and calls # the recursive function to find the # minimum count of substrings str can be # splitted into that satisfy the given condition def findMinSubStr(arr, n, string) : # Insert all the strings from # the given array in a set for i in range(n) : uSet.add(arr[i]); # Find the required count findSubStr(string, 0, 0); # Driver code if __name__ == "__main__" : string = "123456"; arr = ["1", "12345", "2345", "56", "23", "456" ]; n = len(arr); findMinSubStr(arr, n, string); print(minCnt); # This code is contributed by AnkitRai01 |
chevron_right
filter_none
C#
// C# implementation of above approach using System; using System.Collections.Generic; class GFG { // Set to store all the Strings // from the given array static HashSet<String> uSet = new HashSet<String>(); // To store the required count static int minCnt = int.MaxValue; // Recursive function to find the count of // subStrings that can be splitted starting // from the index start such that all // the subStrings are present in the map static void findSubStr(String str, int cnt, int start) { // All the chosen subStrings // are present in the map if (start == str.Length) { // Update the minimum count // of subStrings minCnt = Math.Min(cnt, minCnt); } // Starting from the subStrings of length 1 // that start with the given index for (int len = 1; len <= (str.Length - start); len++) { // Get the subString String subStr = str.Substring(start, len); // If the subString is present in the set if (uSet.Contains(subStr)) { // Recursive call for the // rest of the String findSubStr(str, cnt + 1, start + len); } } } // Function that inserts all the Strings // from the given array in a set and calls // the recursive function to find the // minimum count of subStrings str can be // splitted into that satisfy the given condition static void findMinSubStr(String []arr, int n, String str) { // Insert all the Strings from // the given array in a set for (int i = 0; i < n; i++) uSet.Add(arr[i]); // Find the required count findSubStr(str, 0, 0); } // Driver code public static void Main(String []args) { String str = "123456"; String []arr = {"1", "12345", "2345", "56", "23", "456" }; int n = arr.Length; findMinSubStr(arr, n, str); Console.WriteLine(minCnt); } } // This code is contributed by 29AjayKumar |
chevron_right
filter_none
Output:
3
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
Recommended Posts:
- Generate a string consisting of characters 'a' and 'b' that satisfy the given conditions
- Number of strings in two array satisfy the given conditions
- Count pairs of strings that satisfy the given conditions
- Check if a string can be split into even length palindromic substrings
- Check if a string can be split into substrings starting with N followed by N characters
- Remove minimum characters from string to split it into three substrings under given constraints
- Minimum flips required to convert given string into concatenation of equal substrings of length K
- Minimum operations required to make the string satisfy the given condition
- Generate a string whose all K-size substrings can be concatenated to form the given string
- Split the binary string into substrings with equal number of 0s and 1s
- Split a given string into substrings of length K with equal sum of ASCII values
- Minimize cost to convert given string into concatenation of equal substrings of length K
- Split the array into equal sum parts according to given conditions
- Split the string into substrings using delimiter
- Split string into three palindromic substrings with earliest possible cuts
- Count ways to split a Binary String into three substrings having equal count of zeros
- Check if a Palindromic String can be formed by concatenating Substrings of two given Strings
- Check if a palindromic string can be obtained by concatenating substrings split from same indices of two given strings
- Check if a string can be transformed to another by sorting substrings
- Number of strings that satisfy the given condition
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
