<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:
    def findLongestWord(self, s: str, dictionary: List[str]) -> str:
        l=[]
        l1=[]
        s2=""
        for i in dictionary:
            i1=0
            s1=0
            while(s1<len(s) and i1<len(i)):
                if(i[i1]==s[s1]):
                    i1+=1
                    s1+=1
                else:
                    s1+=1
            if(i1==len(i)):
                l.append(i)
        l.sort()
        print(l)
        for i in l:
            l1.append(len(i))
        print(l1)
        d=dict(zip(l,l1))
        print(d)
        m=0
        for key,val in d.items():
            if(val>m):
                m=val
                s2=key
        if(len(l)==0):
            return ""
        return s2

19100