Maximum Word Break Count

Problem Statement

Maximum Word Break Count Problem Description You are given a string S and a dictionary of valid words. Split the string into the maximum number of substrings such that each substring is a valid word present in the dictionary. Return the maximum possible count of substrings after such a split.