We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Strings
  4. Two Strings
  5. Discussions

Two Strings

Sort by

recency

|

2297 Discussions

|

  • whiland
     + 0 comments

    My minimaist O(n + m) solution:

        public static String twoStrings(String s1, String s2) {
    boolean[] s1_array = new boolean[26];
    int base = (int)'a';
    
    for (int i = 0 ; i < s1.length() ; i++){
        int position = (int)s1.charAt(i) - base;
        
        s1_array[position] = true;
    }
    
    for (int i = 0 ; i < s2.length() ; i++){
        int position = (int)s2.charAt(i) - base;
        
        if (s1_array[position] == true) return "YES";
    }
    
    return "NO";
    }

  • greivin_lopez
     + 0 comments
    # Two Strings
def two_strings(s1, s2):
    return 'YES' if set(s1) & set(s2) else 'NO'

  • singhlalit843
     + 0 comments

    for(let i =0; i

  • rezl_jaws
     + 0 comments

    My recursive C++ solution

    string _str( string & s, string & s1, int n1, int n2)
{
    if (n1 == 0 || n2 == 0)
    {   
        if( s[0]== s1[0] ) return "YES";

        return "NO";
    }
    if (s[n1] == s1[n2])
        return "YES";

    return _str(s, s1, n1 - 1, n2 - 1);
}

string twoStrings(string s1, string s2) 
{
    return _str(s1, s2, s1.size() - 1, s2.size() - 1);
}

  • abrahamvs1163
     + 1 comment

    Is there any O(n) solution to solve this. In c++.