<p>Given two strings <code>s</code> and <code>goal</code>, return <code>true</code><em> if you can swap two letters in </em><code>s</code><em> so the result is equal to </em><code>goal</code><em>, otherwise, return </em><code>false</code><em>.</em></p>

<p>Swapping letters is defined as taking two indices <code>i</code> and <code>j</code> (0-indexed) such that <code>i != j</code> and swapping the characters at <code>s[i]</code> and <code>s[j]</code>.</p>

<ul>
	<li>For example, swapping at indices <code>0</code> and <code>2</code> in <code>&quot;abcd&quot;</code> results in <code>&quot;cbad&quot;</code>.</li>
</ul>

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

<pre>
<strong>Input:</strong> s = &quot;ab&quot;, goal = &quot;ba&quot;
<strong>Output:</strong> true
<strong>Explanation:</strong> You can swap s[0] = &#39;a&#39; and s[1] = &#39;b&#39; to get &quot;ba&quot;, which is equal to goal.
</pre>

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

<pre>
<strong>Input:</strong> s = &quot;ab&quot;, goal = &quot;ab&quot;
<strong>Output:</strong> false
<strong>Explanation:</strong> The only letters you can swap are s[0] = &#39;a&#39; and s[1] = &#39;b&#39;, which results in &quot;ba&quot; != goal.
</pre>

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

<pre>
<strong>Input:</strong> s = &quot;aa&quot;, goal = &quot;aa&quot;
<strong>Output:</strong> true
<strong>Explanation:</strong> You can swap s[0] = &#39;a&#39; and s[1] = &#39;a&#39; to get &quot;aa&quot;, which is equal to goal.
</pre>

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

<ul>
	<li><code>1 &lt;= s.length, goal.length &lt;= 2 * 10<sup>4</sup></code></li>
	<li><code>s</code> and <code>goal</code> consist of lowercase letters.</li>
</ul>

class Solution {
public:
    bool buddyStrings(string s, string goal) {
        string k ="";
        int A1[1000]={0};
        int p1=-1;
        int p2=-1;
        if(s.length()!=goal.length()){
            return false;
        }

        for(int i=0;i<s.length();i++){
            if(s[i]==goal[i]){
                A1[s[i]] +=1; 
            }
            else{
                if(p1==-1){
                    p1=i;
                }
                else{
                    p2=i;
                    k = s.substr(0,p1)+s[p2]+s.substr(p1+1,p2-p1-1)+s[p1]+s.substr(p2+1,s.length()-p2-1);
                    return k==goal;
                }
                
            }
            // for(int j=i+1;j<s.length();j++){
            //     if(j==i+1){
            //         k = s.substr(0,i)+s[j]+s[i]+s.substr(j+1,s.length()-j-1);
            //     }
            //     else if(j == s.length()-1){
            //         k = s.substr(0,i)+s[j]+s.substr(i+1,j-i-1)+s[i];
            //     }
            //     else{
            //         k = s.substr(0,i)+s[j]+s.substr(i+1,j-i-1)+s[i]+s.substr(j+1,s.length()-j-1);
            //     }
            //     if(k==goal){
            //         return true;
            //     }
            // }
        }
        if(p1 !=-1 && p2==-1){
            return false;
        }
        for(int i=0;i<1000;i++){
            if(A1[i]>=2){
                return true;
            }
        }
        return false;

    }
};
8900