We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Loading...
  1. Practice
  2. Algorithms
  3. Strings
  4. Anagram
  5. Discussions

Anagram

  • udayshankar911 + 2 comments

    Guys TC 1 an 14 executed but others failed. when i tested in Netbeans IDE i dont find any prob. can anyone look at it and leem know the issue .

    • DanLuo + 1 comment

      if there is 2 "a" in str1, but only 1 "a" in str2, diff will not increase

      • cherry_9 + 1 comment

        can you please explain this further

        • omtonape + 1 comment

          take second string into stringbuilder and if char from first string is present in second string remove char at that position from stringbuilder if char is not present in second string then increment count final answer is count.... thanks DanLuo

          • mayurnagdev123 + 0 comments

            I did something similar.Converted String to StringBuffers sb1 and sb2. Upon iterating characters through sb1: if the character is found in sb2,then change that character value in sb2 to some other value(say '/') so that it couldn't be found in further iterations. This is essential as sb1 may have repeating characters.

    • sivach + 3 comments

      Use stringbuilder for first string, remove the char from builder if exist and at the end, answer = string builder length.

      • udayshankar911 + 1 comment

        Got it. thnq :)

        • dsaxena + 0 comments

          I understood the problem in your code but I a, little bit confused about the mentioned solution. actually I am not much familier with Java, I am currently learning, So can you please explain me the solution??

      • omtonape + 0 comments

        but in that case also mine are passing test cases 1 and 14 but rest are failing

      • andadeacu + 0 comments

        static int anagram(String s) { int result = 0; Map map = new HashMap();

            if (s.length() % 2 != 0) {
        return -1;
    } else {
        int half = s.length() / 2;
        for (int k = 0; k < half; k++) {
            char letter = s.charAt(k);

            if (!map.containsKey(letter)) {
                map.put(letter, 1);
            } else {
                Integer frequency = map.get(letter);
                map.put(letter, ++frequency);
            }
        }

        for (Map.Entry<Character, Integer> entry : map.entrySet()) {
            System.out.println(entry.getKey() + " " + entry.getValue());
        }

        for (int k = half; k < s.length(); k++) {
            char letter = s.charAt(k);
            //System.out.println("a doua jumatate este:");
            //System.out.println(letter);

            if (!map.containsKey(letter)) {
                result++;
            } else {
                Integer freq = map.get(letter);
                freq--;
                map.put(letter, freq);

            }

        }



        for (Map.Entry<Character, Integer> entry : map.entrySet()) {
            System.out.println(entry.getKey() + " " + entry.getValue());
        }

        return result;

    }
}

        for String xaxbbbxx I obtain 0.

        Can someone one say me why?