<p>Given a string <code>s</code> and a string array <code>dictionary</code>, return <em>the longest string in the dictionary that can be formed by deleting some of the given string characters</em>. If there is more than one possible result, return the longest word with the smallest lexicographical order. If there is no possible result, return the empty string.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;abpcplea&quot;, dictionary = [&quot;ale&quot;,&quot;apple&quot;,&quot;monkey&quot;,&quot;plea&quot;]
<strong>Output:</strong> &quot;apple&quot;
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;abpcplea&quot;, dictionary = [&quot;a&quot;,&quot;b&quot;,&quot;c&quot;]
<strong>Output:</strong> &quot;a&quot;
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 1000</code></li>
	<li><code>1 &lt;= dictionary.length &lt;= 1000</code></li>
	<li><code>1 &lt;= dictionary[i].length &lt;= 1000</code></li>
	<li><code>s</code> and <code>dictionary[i]</code> consist of lowercase English letters.</li>
</ul>

class Solution {
public:
    bool check(std::string& s, std::string& w, std::vector<int> chars) {
        int l = 0, r = 0;
        while(l < s.size() && r < w.size()) {
            if (chars[w[r]] == 0)
                return false;
            if (w[r] == s[l]) {
                chars[w[r]]--;
                r++;
            }
            l++;
        }
        return r == w.size();
    }
    string findLongestWord(string s, vector<string>& dictionary) {
        // std::sort(dictionary.begin(), dictionary.end());
        std::string res = "";
        std::vector<int> chars(128, 0);
        for (auto& c: s)
            chars[c]++;
        for (auto& w: dictionary) {
            if(check(s, w, chars))
                if (w.size() > res.size())
                    res = w;
                else if (w.size() == res.size() && w < res) 
                    res = w;
        }
        return res;
    }
};
22293