<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 s1,string s2){
      int n=s1.size();
      int m=s2.size();
      int i=0;
      int j=0;
      while(i<n && j<m){
          if(s1[i]==s2[j]){
              i++;
              j++;
              continue;
          }
          i++;
      }
      if(j==m)return true;
      return false;
  }
    string findLongestWord(string S, vector<string> d) {
        // code here
        int maxi=0;
        string ans;
        sort(d.begin(),d.end());
        for(int i=0;i<d.size();i++){
            if(isSubsequence(S,d[i])){
                int len=d[i].length();
                if(len>maxi){
                    maxi=len;
                    ans=d[i];
                }
            }
        }
        return ans;
    
    }
};
29481