질문있습니다!

Inflearn Community Q&A

Introduction to Javascript Algorithm Problem Solving (Coding Test Preparation)

7. Anagram (Hash Map)

Written on

150

  function solution(str1, str2) {
        let answer = "yes";
        let obj1 = new Map();

        for (let x of str1) {
          if (obj1.has(x)) {
            obj1.set(x, obj1.get(x) + 1);
          } else {
            obj1.set(x, 1);
          }
        }

        for (let x of str2) {
          if (!obj1.has(x) || obj1.get(x) === 0) return "no";
          obj1.set(x, obj1.get(x) - 1);
        }

        return answer;
      }

      let a = "AbaAeCe";
      let b = "aeeACA";
      console.log(solution(a, b));

a = AbaAeCe

b = aeeACA
로 서로 문자의 개수가 일치하지 않아도 yes가 나오게되는데, 한쪽에 있는 문자들로 다른 문자를 만들 수 있기만 하면 아나그램인가요?

아니면 아나그램에서는 각 문자의 길이는 같다라는 전제조건하에 검토하는 것인가요??

javascript코테 준비 같이 해요!

Quiz

45% of people got it wrong. Give it a try!

What is the main reason why two-pointer or sliding window techniques are more efficient than nested loops?

Because it uses less memory?

Is it because the code is shorter?

Is it because it achieves O(N) time complexity in most cases?

Is it because it's not affected by the input data size?

Answer 1