codingstuff.io
ExploreTutorialsProblemsCS Subjects
Get Started
ExploreTutorialsProblemsCS Subjects
Get Started
codingstuff.io

Master the art of building software through interactive tutorials, real-world problems, and guided projects.

Pune, Maharashtra, India

codingstuffmail@gmail.com

Product

  • Explore
  • Tutorials
  • Problems
  • CS Subjects

Company

  • About
  • Contact
  • Privacy Policy
  • Terms & Conditions
  • Sitemap

© 2026 codingstuff.io. All rights reserved.

Built with ❤️ for developers everywhere

ProblemsSplit String Into Max Number of Unique Substrings

Split String Into Max Number of Unique Substrings

Medium
BacktrackingStrings

Given a string s, return the maximum number of unique substrings that the given string can be split into.

 

Example 1:

Input: s = "ababccc"
Output: 5
Explanation: One way to split maximally is ['a', 'b', 'ab', 'c', 'cc'].

Example 2:

Input: s = "aba"
Output: 2
Explanation: One way to split maximally is ['a', 'ba'].

 

Constraints:

  • 1 <= s.length <= 16

Related Problems

View all
Subsets
Medium•Recursion
Combination Sum
Medium•Recursion
Permutations
Medium•Recursion
Subsets II
Medium•Recursion
Combination Sum II
Medium•Recursion
Word Search
Medium•Recursion
Input:
s = "ababccc"