Home
Algorithmic problems
Anagrams
EASY
One string is an anagram of another if the second is simply a rearrangement of the first. For example, 'heart' and 'earth' are anagrams. The strings 'python' and 'typhon' are anagrams as well. Your goal is to write a code that will take two strings and print 'yes' if strings are anagrams or 'no' if are not.
INPUT:
string1
string2
OUTPUT:
yes OR no
Solution
<?php
$line1 = trim(fgets(STDIN));
$line2 = trim(fgets(STDIN));
if (strlen($line1) !== strlen($line2)) {
echo 'no';
return;
}
$lineSymbols1 = [];
$lineSymbols2 = [];
$lenght = strlen($line1);
for ($i = 0; $i < $lenght; $i++) {
if (isset($lineSymbols1[$line1[$i]])) {
$lineSymbols1[$line1[$i]]++;
} else {
$lineSymbols1[$line1[$i]] = 1;
}
if (isset($lineSymbols2[$line2[$i]])) {
$lineSymbols2[$line2[$i]]++;
} else {
$lineSymbols2[$line2[$i]] = 1;
}
}
foreach ($lineSymbols1 as $symbol => $count) {
if (!isset($lineSymbols2[$symbol]) || $lineSymbols2[$symbol] !== $count) {
echo 'no';
return;
}
}
echo 'yes';
Select programming language
C (GCC 9.3.0)
Java (OpenJDK 1.8)
Python (3.8)
C++ (GCC 9.3.0)
C# (Mono 6.8)
JavaScript (NODE 14.1)
PHP (7.4)
Go (1.14)
Kotlin (JVM 1.3.72)
Swift (5.2)
Tests
Test #1
Loading...
Test #2
Loading...
Test #3
Loading...
Test #4
Loading...
Test #5
Loading...
Test #6
Loading...
Test #7
Loading...
Test #8
Loading...
Test #9
Loading...