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.
  1. Prepare
  2. Algorithms
  3. Strings
  4. Anagram
  5. Discussions

Anagram

Sort by

recency

|

975 Discussions

|

  • whiland
     + 0 comments

    Minimalist O(n) solution:

        public static int anagram(String s) {
        if (s.length() % 2 != 0) return -1;
        
        int size = s.length() / 2;
        int[] s1 = new int[26];
        int base = 'a';
        int changes = 0;        

        //build first half
        for (int i = 0; i < size; i++) {
            s1[s.charAt(i) - base] ++;
        }

        //check second half
        for (int i = size; i < size*2; i++) {
            if (s1[s.charAt(i) - base] > 0) s1[s.charAt(i) - base]--;
            else changes++;
        }

        return changes;
    
    }

  • greivin_lopez
     + 0 comments
    # Anagram
from collections import Counter
def anagram(s):
    len_s = len(s)
    result = -1
    if len_s % 2 == 0:
        l, r = Counter(s[:len_s // 2]), Counter(s[len_s // 2:])
        result = sum((r - l).values())
    return result

  • eliaskabbani1
     + 0 comments
    fun anagram(s: String): Int {
    // Write your code here
    if(s.length % 2 !=0)
        return -1
    var res = 0
    val middle = s.length/2
    var sub1 = s.subSequence(0, middle)
    var sub2 = s.subSequence(middle,s.length)
    var s1 = StringBuilder(sub1)
    var s2 = StringBuilder(sub2)
    for(c in s1){
        if(s2.contains(c)){
            val index = s2.indexOf(c)
            s2.deleteCharAt(index)
        }else
            res++
    }
    return res
}

  • enix12enix
     + 0 comments

    rust answer

    fn anagram(s: &str) -> i32 {
    let mut counter = vec![0;26];
    let chs: Vec<char> = s.chars().collect();
    let mut res = 0;
    let mut idx:usize = 0;
    
    if chs.len() % 2 == 1 {
        return -1;
    }
    
    for i in 0..chs.len()/2 {
        idx = (chs[i] as u32 - 'a' as u32) as usize;
        counter[idx] = counter[idx] + 1;
    }
    for i in chs.len()/2..chs.len() {
        idx = (chs[i] as u32 - 'a' as u32) as usize;
        if counter[idx] == 0 {
            res += 1;
        } else {
            counter[idx] = counter[idx] - 1;
        }
    }
    
    res

}

  • Sharan__s
     + 0 comments

    c++ answer

    include

    using namespace std;

    string ltrim(const string &); string rtrim(const string &);

    /* * Complete the 'anagram' function below. * * The function is expected to return an INTEGER. * The function accepts STRING s as parameter. */

    int anagram(string s) { int n = s.length();

    // If the length is odd, it's impossible to split into two equal halves.
if (n % 2 != 0) {
    return -1;
}

int half_len = n / 2;
string s1 = s.substr(0, half_len);
string s2 = s.substr(half_len);

// Frequency arrays for characters 'a' through 'z'
vector<int> freq1(26, 0);
vector<int> freq2(26, 0);

// Populate frequency for s1
for (char c : s1) {
    freq1[c - 'a']++;
}

// Populate frequency for s2
for (char c : s2) {
    freq2[c - 'a']++;
}

int changes = 0;
// Compare frequencies to find characters that need to be changed in s1
// We only need to count characters that are in s1 but not (or less) in s2
for (int i = 0; i < 26; ++i) {
    if (freq1[i] > freq2[i]) {
        changes += (freq1[i] - freq2[i]);
    }
}

return changes;

    }

    int main() { ofstream fout(getenv("OUTPUT_PATH"));

    string q_temp;
getline(cin, q_temp);

int q = stoi(ltrim(rtrim(q_temp)));

for (int q_itr = 0; q_itr < q; q_itr++) {
    string s;
    getline(cin, s);

    int result = anagram(s);

    fout << result << "\n";
}

fout.close();

return 0;

    }

    string ltrim(const string &str) { string s(str);

    s.erase(
    s.begin(),
    find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
);

return s;

    }

    string rtrim(const string &str) { string s(str);

    s.erase(
    find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
    s.end()
);

return s;

    }