Check if characters of one string can be swapped to form other

0 0 5 minutes read

Two strings are given, we need to find whether we can form second string by swapping the character of the first string.

Examples:

Input : str1 = "zambiatek" 
        str2 = "geezambiatekksfor"
Output : YES

Input : str1 = "zambiatekfor"  
        str2 = "geeekfor"
Output : NO

First of all, we will find the length of strings and if lengths are not equal that means we can not form the target string by swapping characters of the first string. If lengths are equal then we iterate through the first string and create a map for it and after that, we will iterate through the second string and decrease the count of the map if any of the indexes go negative in the map that means we can not form the target string otherwise we can form the target string.

Algorithm:
1- l1 = str1.length()  &&   l2 = str2.length()
2- if (l1 != l2)
    print "NO" 
3- Else
   map[26] = {0};
   for i=0 to l1
    map[str1[i]-'a']++;
   for i=0 to l2
     map[str2[i]-'a']--;
     if (map[str[2]-'a'<0)
      print "NO"
4- if no index goes negative print "YES"
5- End

Implementation:

C++

#include <bits/stdc++.h>
using namespace std;
const int MAX = 26;
 
bool targetstring(string str1, string str2)
{
    int l1 = str1.length();
    int l2 = str2.length();
 
    // if length is not same print no
    if (l1 != l2)
        return false;
 
    int map[MAX] = { 0 };
 
    // Count frequencies of character in
    // first string.
    for (int i = 0; i < l1; i++)
        map[str1[i] - 'a']++;
 
    // iterate through the second string 
    // decrement counts of characters in
    // second string
    for (int i = 0; i < l2; i++) {
        map[str2[i] - 'a']--;
 
        // Since lengths are same, some
        // value would definitely become
        // negative if result is false.
        if (map[str2[i] - 'a'] < 0)
            return false;
    }
 
    return true;
}
 
// driver function
int main()
{
    string str1 = "zambiatek";
    string str2 = "geezambiatekksfor";
    if (targetstring(str1, str2))
        cout << "YES";
    else
        cout << "NO";
 
    return 0;
}

Java

// Java program to check if 
// characters of one string
// can be swapped to form other
class GFG
{
static int MAX = 26;
 
static boolean targetstring(String str1, 
                            String str2)
{
    int l1 = str1.length();
    int l2 = str2.length();
 
    // if length is not same print no
    if (l1 != l2)
        return false;
 
    int []map = new int[MAX];
     
    // Count frequencies of 
    // character in first string.
    for (int i = 0; i < l1; i++)
        map[str1.charAt(i) - 'a']++;
 
    // iterate through the second
    // string decrement counts of 
    // characters in second string
    for (int i = 0; i < l2; i++) 
    {
        map[str2.charAt(i) - 'a']--;
 
        // Since lengths are same, 
        // some value would definitely 
        // become negative if result 
        // is false.
        if (map[str2.charAt(i) - 'a'] < 0)
            return false;
    }
 
    return true;
}
 
// Driver Code
public static void main(String args[])
{
    String str1 = "zambiatek";
    String str2 = "geezambiatekksfor";
    if (targetstring(str1, str2))
        System.out.print("YES");
    else
        System.out.print("NO");
}
}
 
// This code is contributed by 
// Akanksha Rai

Python3

# Python3 program to check if 
# characters of one string
# can be swapped to form other
MAX = 26
 
def targetstring(str1, str2):
 
    l1 = len(str1)
    l2 = len(str2)
 
    # if length is not same print no
    if (l1 != l2):
        return False
 
    map = [0] * MAX
 
    # Count frequencies of character 
    # in first string.
    for i in range (l1):
        map[ord(str1[i]) - ord('a')] += 1
 
    # iterate through the second string 
    # decrement counts of characters in
    # second string
    for i in range(l2) :
        map[ord(str2[i]) - ord('a')] -= 1
 
        # Since lengths are same, some
        # value would definitely become
        # negative if result is false.
        if (map[ord(str2[i]) - ord('a')] < 0):
            return False
 
    return True
 
# Driver Code
if __name__ == "__main__":
 
    str1 = "zambiatek"
    str2 = "geezambiatekksfor"
    if (targetstring(str1, str2)):
        print("YES")
    else:
        print("NO")
 
# This code is contributed by ita_c

C#

// C# program to check if 
// characters of one string
// can be swapped to form other
using System;
 
class GFG
{
    static int MAX = 26;
     
    static bool targetstring(string str1, 
                             string str2)
    {
        int l1 = str1.Length;
        int l2 = str2.Length;
     
        // if length is not
        // same print no
        if (l1 != l2)
            return false;
     
        int []map = new int[MAX];
        Array.Clear(map, 0, 26);
     
        // Count frequencies of 
        // character in first string.
        for (int i = 0; i < l1; i++)
            map[str1[i] - 'a']++;
     
        // iterate through the second
        // string decrement counts of 
        // characters in second string
        for (int i = 0; i < l2; i++) 
        {
            map[str2[i] - 'a']--;
     
            // Since lengths are same, 
            // some value would definitely 
            // become negative if result 
            // is false.
            if (map[str2[i] - 'a'] < 0)
                return false;
        }
     
        return true;
    }
     
    // Driver Code
    static void Main()
    {
        string str1 = "zambiatek";
        string str2 = "geezambiatekksfor";
        if (targetstring(str1, str2))
            Console.Write("YES");
        else
            Console.Write("NO");
    }
}
 
// This code is contributed by 
// Manish Shaw(manishshaw1)

PHP

<?php
// PHP program to check if 
// characters of one string
// can be swapped to form other
$MAX = 26;
 
function targetstring($str1, $str2)
{
    global $MAX;
    $l1 = strlen($str1);
    $l2 = strlen($str2);
 
    // if length is not same print no
    if ($l1 != $l2)
        return false;
 
    $map[$MAX] = array(0);
 
    // Count frequencies of character 
    // in first string.
    for ($i = 0; $i < $l1; $i++)
        $map[$str1[$i] - 'a']++;
 
    // iterate through the second string 
    // decrement counts of characters in
    // second string
    for ($i = 0; $i < $l2; $i++) 
    {
        $map[$str2[$i] - 'a']--;
 
        // Since lengths are same, some
        // value would definitely become
        // negative if result is false.
        if ($map[$str2[$i] - 'a'] < 0)
            return false;
    }
 
    return true;
}
 
// Driver Code
$str1 = "zambiatek";
$str2 = "geezambiatekksfor";
if (targetstring($str1, $str2))
    echo "YES";
else
    echo "NO";
 
// This code is contributed
// by Akanksha Rai
?>

Javascript

<script>
// Javascript program to check if 
// characters of one string
// can be swapped to form other
let MAX = 26;
     
function targetstring(str1,str2)
{
    let l1 = str1.length;
    let l2 = str2.length;
   
    // if length is not same print no
    if (l1 != l2)
        return false;
   
    let map = new Array(MAX);
    for(let i = 0; i < map.length; i++)
    {
        map[i] = 0;
    }
       
    // Count frequencies of 
    // character in first string.
    for (let i = 0; i < l1; i++)
        map[str1[i].charCodeAt(0) - 'a'.charCodeAt(0)]++;
   
    // iterate through the second
    // string decrement counts of 
    // characters in second string
    for (let i = 0; i < l2; i++) 
    {
        map[str2[i].charCodeAt(0) - 'a'.charCodeAt(0)]--;
   
        // Since lengths are same, 
        // some value would definitely 
        // become negative if result 
        // is false.
        if (map[str2[i] - 'a'.charCodeAt(0)] < 0)
            return false;
    }  
    return true;
}
 
// Driver Code
let str1 = "zambiatek";
let str2 = "geezambiatekksfor";
if (targetstring(str1, str2))
    document.write("YES");
else
    document.write("NO");
     
    // This code is contributed by avanitrachhadiya2155
</script>

Output

YES

Time Complexity: O(n)
Auxiliary Space: O(1)

Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 zambiatek!