3760. Maximum Substrings With Distinct Start

You are given a string s consisting of lowercase English letters. Return an integer denoting the maximum number of substrings you can split s into such that each substring starts with a distinct character (i.e., no two substrings start with the same character). Example 1: Input: s = "abab" Output: 2 Explanation: - Split "abab" into "a" and "bab". - Each substring starts with a distinct ch