Incomplete solution for Valid Anagrams problem

[gurunathsane]

In Valid Anagrams problem. the solution is not complete.
it is checking that frequencyCount1 is matching with frequencyCount2 but we also need to test frequencyCount2 is matching with frequencyCount1. for example: if I run the test with const result = validAnagrams('app', 'ppax'); it returns true but it should be false.

[diegodesouza]

the test expect(validAnagrams('aaa', 'aaab')).toBe(false); is also failing even after proposed solution.

[diegodesouza]

The issue in this case, with the provided solution is that the length of the freqCount1 is less than freqCount2 or str1 less than str2 where the iteration in this test case ( expect(validAnagrams('aaa', 'aaab')).toBe(false); ) would stop at aaa making it true, the same is happening with your issue. app is the same as ppa since it never gets to x. Does that make sense?

  return Object.keys(str1.length > str2.length ? freqCount1 : freqCount2).every(
        (char) => freqCount1[char] === freqCount2[char]
    );