Distinct substrings
Given a string s, return the number of distinct non-empty substrings of s. Two substrings are the same if they are equal as strings (positions don't matter). 1 <= len(s) <= 1000, lowercase letters. Example: 'aba' has substrings a, b, ab, ba, aba = 5 distinct.
Implement
count_distinct_substrings(s: str) → intExamples
in
["aba"]out5What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 28 min
solution.py
InputExpectedGot
["aba"]5not run yetsample