Search
⌘K
Get Premium
Leetcode 1316. Distinct Echo Substrings
Count the number of distinct non-empty substrings of the given string that are "echoes" — even-length contiguous substrings whose first half equals the second half (i.e., can be written as a + a); n ≤ 2000.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.