Distinct substrings count
Given a string s of lowercase letters (0 <= len(s) <= 10^4), return the number of DISTINCT non-empty substrings of s. Duplicates are counted once. The answer fits in a 64-bit integer.
Implement
count_distinct_substrings(s: str) → intExamples
in
["abc"]out6What 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 35 min
solution.py
InputExpectedGot
["abc"]6not run yetsample