Open piyushkumar4021 opened 5 days ago
LeetCode Support commented: Hi piyush_kumar41,
Thank you for reaching out with your concern. From the details provided, it seems the goal of the problem is to maximize the number of unique substrings you can get from the string. It appears there might be a misunderstanding regarding the problem's requirement to achieve the maximum count of unique substrings rather than a specific arrangement. Kindly re-examine the problem statement and examples to ensure alignment with the expectations. Additionally, reviewing community discussions on the problem page might provide further insights or alternative perspectives that may help.
If you have any further questions or need additional assistance, please feel free to reach out.
Best regards,
LeetCode Support Team
You can split it into ["a","ba","b","ab"], which is 4
LeetCode Username
piyush_kumar41
Problem Number, Title, and Link
Bug Category
Incorrect test case (Output of test case is incorrect as per the problem statement)
Bug Description
Output for the testcase "ababab" is 4 but it should be 3 because the unique strings will be ["a", "b", "abab"].
Language Used for Code
C++
Code used for Submit/Run operation
Expected behavior
Invalid answer for the testcase for "ababab".
Screenshots
Additional context
No response