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. Implementation
  4. Append and Delete
  5. Discussions

Append and Delete

  • alban_tyrex
     + 0 comments

    Here is my O(k) c++ solution, you can watch the explanation here : https://youtu.be/8ZOmXfo6k0Y

    string appendAndDelete(string s, string t, int k) {
    if(k >= t.size() + s.size()) return "Yes";
    int same = min(t.size(), s.size());
    for(int i = 0; i< min(t.size(), s.size()); i++){
        if(s[i] != t[i]){
            same = i;
            break;
        }
    }
    k -= (s.size() - same);
    k -= (t.size() - same);
    return (k >= 0 && k%2 == 0)? "Yes":"No";
}