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

  • anarod_val25
     + 0 comments

    Thing is, you need to use exactly k moves, no more, no less. Else, fail.

    string appendAndDelete(string s, string t, int k) {
    int n = s.size();
    int m = t.size();
    int i = 0;

    while (i < n && i < m && s[i] == t[i]) {
        i++;
    }

    int opsNeeded = (n - i) + (m - i);

    if (opsNeeded > k) {
        return "No";
    }
    else if ((k - opsNeeded) % 2 == 0 || k >= n + m) {
        return "Yes";
    }
    else {
        return "No";
    }
}