<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 isSubsequence(string a,string b){
    //     int i=0,j=0;
    //     if(b.length()>a.length()) return false;
    //     while(i<a.length() && j<b.length()){
    //         if(a[i]==b[j]) j++;
    //         i++;
    //     }
    //     return j==b.length();
    // }
    // string findLongestWord(string s, vector<string>& dict) {
    //     sort(dict.begin(), dict.end(), [](const string &a, const string &b) {
    //     return a.length() > b.length() || (a.length() == b.length() && a < b);
    //     });
    //     for(auto d:dict){
    //         if(isSubsequence(s,d)){
    //             return d;
    //         }
    //     }
    //     return "";
    // }
    bool isSubsequence(string a,string b){
        int i=0,j=0;
        if(b.length()>a.length()) return false;
        while(i<a.length() && j<b.length()){
            if(a[i]==b[j]) j++;
            i++;
        }
        return j==b.length();
    }
    string findLongestWord(string s, vector<string>& dict) {
        string longest = "";
        for(auto d:dict){
            if(d.size() > longest.size() || (d.size()==longest.size() && d < longest)){
                if(isSubsequence(s, d)){
                    longest = d;
                }
            }
        }
        return longest;
    }
};
28683