JavaScript Program to Check if Two Strings are Same or Not
Last Updated :
19 Jul, 2024
In this article, we are going to implement a JavaScript program to check whether two strings are the same or not. If they are the same then we will return true else we will return false.
Examples:
Input: str1 = Geeks, str2 = Geeks
Output: True. Strings are the Same
Input: str1 = Geeks, str2 = Geek
Output: False. Strings are not Same
Using localCompare() Method
In this approach, we are using the localCompare() method in JavaScript. This method is mainly used to compare the two strings according to their locale-specific collation order. If the strings are the same, then 0 is returned; otherwise, -1 or 1 is returned.
Syntax:
str1.localeCompare(str2)
Example: This example shows the use of the above-explained approach.
JavaScript
const sameStrings = (
inputString1,
inputString2) => {
return (
inputString1.localeCompare(
inputString2 ) === 0
);};
console.log(
sameStrings("Geeks", "Geeks")
);
Using startsWith() and endsWith() Methods
In this approach, we are using the startsWith() and endsWith() methods in JavaScript. Here, we are checking if str1 starts and ends with str2. If both considerations are satisfied, then the strings are the same when they are not the same.
Syntax:
str1.startsWith(str2) && str1.endsWith(str2)
Example: This example shows the use of the above-explained approach.
JavaScript
const stringsSame = (
inputString1,
inputString2) => {
return (
inputString1.startsWith(
inputString2
) &&
inputString2.endsWith(
inputString1
)
);};
console.log(
stringsSame("Geeks", "Geeks")
);
Using the String.prototype.match() Method
In this approach, we are using the match() method along with the regular expression. Here we are checking if str1 is the same as str2 using the regular expression pattern. If they are the same, then the true message is printed; otherwise, the false method is printed.
Syntax:
str1.match(new RegExp(`^${str2}$`)) !== null
Example: This example shows the use of the above-explained approach.
JavaScript
const sameString = (
inputString1,
inputString2) => {
return (
inputString1.match(
new RegExp(
`^${inputString2}$`
)
) !== null
);};
console.log(
sameString("geeks", "geeks")
);
Using Array.from() and Array.prototype.join() Methods
In this approach, we are using the from() and join() methods in JavaScript. Here, we are converting the input strings into an array of characters, then comparing these characters using the (===) operator, and then joining them back to strings. If the strings are the same, then the output is true; otherwise, it is false.
Syntax:
Array.from(str1).join('') === Array.from(str2).join('')
Example: This example shows the use of the above-explained approach.
JavaScript
const sameString = (
inputString1,
inputString2 ) => {
return (
Array.from(inputString1).join(
"") ===
Array.from(inputString2).join(
"")
);};
console.log(
sameString("geeks", "geeks")
);
Using Iterative Character Comparison
Using iterative character comparison involves first checking if the lengths of the strings are equal. If they are, compare each character one by one using a loop. If all characters match, the strings are considered the same.
Example:
JavaScript
function areStringsSame(str1, str2) {
if (str1.length !== str2.length) return false;
for (let i = 0; i < str1.length; i++) {
if (str1[i] !== str2[i]) return false;
}
return true;
}
console.log(areStringsSame("hello", "hello")); // Output: true
console.log(areStringsSame("hello", "world")); // Output: false
Using localeCompare() with Case-Insensitive Comparison
In this approach, we use the localeCompare() method to compare the two strings after converting them to lowercase. This ensures that the comparison is case-insensitive.
Example: This example demonstrates the use of the localeCompare() method for case-insensitive comparison.
JavaScript
const sameStringsIgnoreCase = (inputString1, inputString2) => {
return inputString1.toLowerCase().localeCompare(inputString2.toLowerCase()) === 0;
};
console.log(sameStringsIgnoreCase("Geeks", "geeks")); // Output: true
console.log(sameStringsIgnoreCase("Geeks", "Geek")); // Output: false
Using JSON.stringify Method
In this approach, we use the JSON.stringify method to convert the strings into their JSON string representations and then compare them. If they are the same, the output is true; otherwise, it is false.
Example: This example shows the use of the above-explained approach.
JavaScript
const sameStringsUsingJSONStringify = (inputString1, inputString2) => {
return JSON.stringify(inputString1) === JSON.stringify(inputString2);
};
console.log(sameStringsUsingJSONStringify("Geeks", "Geeks"));
console.log(sameStringsUsingJSONStringify("Geeks", "Geek"));
Using localeCompare with Sensitivity Options and Ignoring Punctuation
In this approach, we will use the localeCompare method with options to consider sensitivity and ignoring punctuation. This is particularly useful when comparing strings with diacritics or different case and punctuation.
Example: This example demonstrates the use of the localeCompare method with sensitivity options and ignoring punctuation to compare two strings.
JavaScript
const sameStringsIgnorePunctuation = (inputString1, inputString2) => {
return inputString1.localeCompare(inputString2, undefined, { sensitivity: 'base', ignorePunctuation: true }) === 0;
};
console.log(sameStringsIgnorePunctuation("café", "cafe")); // Output: true
console.log(sameStringsIgnorePunctuation("Geeks!", "Geeks")); // Output: true
console.log(sameStringsIgnorePunctuation("Geeks", "Geek")); // Output: false
Similar Reads
JavaScript Program to Check if Two Numbers have Same Last Digit
In this article, we will discuss how to check if two numbers have the same last digit in JavaScript. Checking the last digit of a number is a common requirement in programming tasks, and it can be useful in various scenarios. We will explore an approach using JavaScript to accomplish this task. Meth
4 min read
JavaScript Program to Compare Two Strings Lexicographically
This JavaScript program compares two strings lexicographically, meaning it checks if one string comes before or after the other in alphabetical order. Lexicographical comparison is based on the Unicode value of each character in the strings. The program should return a positive value if the first st
2 min read
JavaScript Program to Find Uncommon Characters of the two Strings
In JavaScript, finding uncommon characters in two strings is the process of identifying the characters that exist in one string but not in the other string. We can find these uncommon characters using various approaches that are mentioned below: Table of Content Using SetsUsing Array.filter() method
2 min read
JavaScript Program Count number of Equal Pairs in a String
In this article, we are going to learn how can we count a number of equal pairs in a string. Counting equal pairs in a string involves finding and counting pairs of consecutive characters that are the same. This task can be useful in various applications, including pattern recognition and data analy
3 min read
JavaScript - Compare Two Strings
These are the followings ways to compare two strings: 1. Using strict equality (===) operatorWe have defined a function that compare two strings using the strict equality operator (===), which checks if both the value and the type of the operands are equal.JavaScriptlet str1 = "hello"; let str2 = "w
2 min read
PHP Program to Check if Two Strings are Same or Not
Given two strings, the task is to check whether two strings are same or not in PHP. In this article, we will be looking at different approaches to check two strings are same or not. Examples: Input: str1 = "Geeks", str2 = "Geeks" Output: Both Strings are the same Input: str1 = "Hello", str2 = "Geeks
2 min read
Javascript Program To Check Whether Two Strings Are Anagram Of Each Other
Write a function to check whether two given strings are anagram of each other or not. An anagram of a string is another string that contains the same characters, only the order of characters can be different. For example, "abcd" and "dabc" are an anagram of each other.Method 1 (Use Sorting):Sort bot
6 min read
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: Tr
4 min read
Javascript Program To Check If A String Is Substring Of Another
Given two strings s1 and s2, find if s1 is a substring of s2. If yes, return the index of the first occurrence, else return -1. Examples :Â Input: s1 = "for", s2 = "geeksforgeeks" Output: 5 Explanation: String "for" is present as a substring of s2. Input: s1 = "practice", s2 = "geeksforgeeks" Output
2 min read
Check if two strings are permutation of each other
Write a function to check whether two given strings are Permutation of each other or not. A Permutation of a string is another string that contains same characters, only the order of characters can be different. For example, "abcd" and "dabc" are Permutation of each other. We strongly recommend that
13 min read