Leetcode 820. Short Encoding of Words || code + explanation with example

A valid encoding of an array of words is any reference string s and array of indices indices such that:

The reference string s ends with the '#' character.
For each index indices[i], the substring of s starting from indices[i] and up to (but not including) the next '#' character is equal to words[i].
Given an array of words, return the length of the shortest reference string s possible of any valid encoding of words.



Example 1:

Input: words = ["time", "me", "bell"]
Output: 10
Explanation: A valid encoding would be s = "time#bell#" and indices = [0, 2, 5].
words[0] = "time", the substring of s starting from indices[0] = 0 to the next '#' is underlined in "time#bell#"
words[1] = "me", the substring of s starting from indices[1] = 2 to the next '#' is underlined in "time#bell#"
words[2] = "bell", the substring of s starting from indices[2] = 5 to the next '#' is underlined in "time#bell#"

[vimalslab]

awesome explanation

btw we don't need two sets

class Solution {
public:
int words) {
int n = words.size();

unordered_set<string> se(words.begin(), words.end());

for(auto &s : se){
int m = s.size();

for(int i = 1 ;i < m ;i++){
string str = s.substr(i, m);

if(se.find(str) != se.end()){
se.erase(str);
}
}
}
int ans = 0;
for(auto &s : se){
ans += s.size()+1;
}
return ans;
}
};

[crisag.]

Thank you! This was an awesome explanation!