How to use XOR Operation In Javascript
Using XOR operation, XOR all characters in both strings. If the result is zero, the strings have the same characters with the same frequency, indicating they are permutations of each other.
Example: In this example The function arePermutations compares lengths, then bitwise XORs character codes of each string. Returns true if the XOR result is 0, indicating permutation
function arePermutations(str1, str2) {
if (str1.length !== str2.length) {
return false;
}
let result = 0;
for (let i = 0; i < str1.length; i++) {
result ^= str1.charCodeAt(i) ^ str2.charCodeAt(i);
}
return result === 0;
}
const string1 = "abc";
const string2 = "bca";
console.log(arePermutations(string1, string2));
const string3 = "abc";
const string4 = "def";
console.log(arePermutations(string3, string4));
Output
true false
Check if two strings are permutation of each other in JavaScript
In this approach, we are going to discuss how we can check if two strings are permutations of each other or not using JavaScript language. If two strings have the same number of characters rather than having the same position or not it will be a permutation.
Example:
Input: "pqrs" , "rpqs"
Output: True
Explanation: Both strings have a same number of characters.
These are the approaches by using these we can Check if two strings are permutations of each other or not:
Table of Content
- Using Sorting
- Count characters
- Using Map
- Using XOR Operation