Check if characters of one string can be swapped to form other
Last Updated :
07 Oct, 2022
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 = "geeksforgeeks"
str2 = "geegeeksksfor"
Output : YES
Input : str1 = "geeksfor"
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 (l1 != l2)
return false ;
int map[MAX] = { 0 };
for ( int i = 0; i < l1; i++)
map[str1[i] - 'a' ]++;
for ( int i = 0; i < l2; i++) {
map[str2[i] - 'a' ]--;
if (map[str2[i] - 'a' ] < 0)
return false ;
}
return true ;
}
int main()
{
string str1 = "geeksforgeeks" ;
string str2 = "geegeeksksfor" ;
if (targetstring(str1, str2))
cout << "YES" ;
else
cout << "NO" ;
return 0;
}
|
Java
class GFG
{
static int MAX = 26 ;
static boolean targetstring(String str1,
String str2)
{
int l1 = str1.length();
int l2 = str2.length();
if (l1 != l2)
return false ;
int []map = new int [MAX];
for ( int i = 0 ; i < l1; i++)
map[str1.charAt(i) - 'a' ]++;
for ( int i = 0 ; i < l2; i++)
{
map[str2.charAt(i) - 'a' ]--;
if (map[str2.charAt(i) - 'a' ] < 0 )
return false ;
}
return true ;
}
public static void main(String args[])
{
String str1 = "geeksforgeeks" ;
String str2 = "geegeeksksfor" ;
if (targetstring(str1, str2))
System.out.print( "YES" );
else
System.out.print( "NO" );
}
}
|
Python3
MAX = 26
def targetstring(str1, str2):
l1 = len (str1)
l2 = len (str2)
if (l1 ! = l2):
return False
map = [ 0 ] * MAX
for i in range (l1):
map [ ord (str1[i]) - ord ( 'a' )] + = 1
for i in range (l2) :
map [ ord (str2[i]) - ord ( 'a' )] - = 1
if ( map [ ord (str2[i]) - ord ( 'a' )] < 0 ):
return False
return True
if __name__ = = "__main__" :
str1 = "geeksforgeeks"
str2 = "geegeeksksfor"
if (targetstring(str1, str2)):
print ( "YES" )
else :
print ( "NO" )
|
C#
using System;
class GFG
{
static int MAX = 26;
static bool targetstring( string str1,
string str2)
{
int l1 = str1.Length;
int l2 = str2.Length;
if (l1 != l2)
return false ;
int []map = new int [MAX];
Array.Clear(map, 0, 26);
for ( int i = 0; i < l1; i++)
map[str1[i] - 'a' ]++;
for ( int i = 0; i < l2; i++)
{
map[str2[i] - 'a' ]--;
if (map[str2[i] - 'a' ] < 0)
return false ;
}
return true ;
}
static void Main()
{
string str1 = "geeksforgeeks" ;
string str2 = "geegeeksksfor" ;
if (targetstring(str1, str2))
Console.Write( "YES" );
else
Console.Write( "NO" );
}
}
|
PHP
<?php
$MAX = 26;
function targetstring( $str1 , $str2 )
{
global $MAX ;
$l1 = strlen ( $str1 );
$l2 = strlen ( $str2 );
if ( $l1 != $l2 )
return false;
$map [ $MAX ] = array (0);
for ( $i = 0; $i < $l1 ; $i ++)
$map [ $str1 [ $i ] - 'a' ]++;
for ( $i = 0; $i < $l2 ; $i ++)
{
$map [ $str2 [ $i ] - 'a' ]--;
if ( $map [ $str2 [ $i ] - 'a' ] < 0)
return false;
}
return true;
}
$str1 = "geeksforgeeks" ;
$str2 = "geegeeksksfor" ;
if (targetstring( $str1 , $str2 ))
echo "YES" ;
else
echo "NO" ;
?>
|
Javascript
<script>
let MAX = 26;
function targetstring(str1,str2)
{
let l1 = str1.length;
let l2 = str2.length;
if (l1 != l2)
return false ;
let map = new Array(MAX);
for (let i = 0; i < map.length; i++)
{
map[i] = 0;
}
for (let i = 0; i < l1; i++)
map[str1[i].charCodeAt(0) - 'a' .charCodeAt(0)]++;
for (let i = 0; i < l2; i++)
{
map[str2[i].charCodeAt(0) - 'a' .charCodeAt(0)]--;
if (map[str2[i] - 'a' .charCodeAt(0)] < 0)
return false ;
}
return true ;
}
let str1 = "geeksforgeeks" ;
let str2 = "geegeeksksfor" ;
if (targetstring(str1, str2))
document.write( "YES" );
else
document.write( "NO" );
</script>
|
Time Complexity: O(n)
Auxiliary Space: O(1)
Share your thoughts in the comments
Please Login to comment...