/*Write a program to take two strings s and t as inputs (assume all characters are lowercase). The task is to
determine if s and t are valid anagrams, meaning they contain the same characters with the same frequencies.
Print "Anagram" if they are, otherwise "Not Anagram".*/
#include <stdio.h>
#include <string.h>
int main() {
char s[100], t[100];
int freq[26] = {0};
int i;
return 0;
}
for (i = 0; s[i] != '\0'; i++) {
freq[s[i] - 'a']++; // increase count for character in s
freq[t[i] - 'a']--; // decrease count for character in t
}
for (i = 0; i < 26; i++) {
if (freq[i] != 0) {
return 0;
}
}
return 0;
}
LypXcml0ZSBhIHByb2dyYW0gdG8gdGFrZSB0d28gc3RyaW5ncyBzIGFuZCB0IGFzIGlucHV0cyAoYXNzdW1lIGFsbCBjaGFyYWN0ZXJzIGFyZSBsb3dlcmNhc2UpLiBUaGUgdGFzayBpcyB0bwpkZXRlcm1pbmUgaWYgcyBhbmQgdCBhcmUgdmFsaWQgYW5hZ3JhbXMsIG1lYW5pbmcgdGhleSBjb250YWluIHRoZSBzYW1lIGNoYXJhY3RlcnMgd2l0aCB0aGUgc2FtZSBmcmVxdWVuY2llcy4gClByaW50ICJBbmFncmFtIiBpZiB0aGV5IGFyZSwgb3RoZXJ3aXNlICJOb3QgQW5hZ3JhbSIuKi8KI2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlIDxzdHJpbmcuaD4KCmludCBtYWluKCkgewogICAgY2hhciBzWzEwMF0sIHRbMTAwXTsKICAgIGludCBmcmVxWzI2XSA9IHswfTsKICAgIGludCBpOwoKICAgIHNjYW5mKCIlcyIsIHMpOwogICAgc2NhbmYoIiVzIiwgdCk7CgogICAgaWYgKHN0cmxlbihzKSAhPSBzdHJsZW4odCkpIHsKICAgICAgICBwcmludGYoIk5vdCBBbmFncmFtIik7CiAgICAgICAgcmV0dXJuIDA7CiAgICB9CgogICAgZm9yIChpID0gMDsgc1tpXSAhPSAnXDAnOyBpKyspIHsKICAgICAgICBmcmVxW3NbaV0gLSAnYSddKys7ICAgLy8gaW5jcmVhc2UgY291bnQgZm9yIGNoYXJhY3RlciBpbiBzCiAgICAgICAgZnJlcVt0W2ldIC0gJ2EnXS0tOyAgIC8vIGRlY3JlYXNlIGNvdW50IGZvciBjaGFyYWN0ZXIgaW4gdAogICAgfQoKICAgIGZvciAoaSA9IDA7IGkgPCAyNjsgaSsrKSB7CiAgICAgICAgaWYgKGZyZXFbaV0gIT0gMCkgewogICAgICAgICAgICBwcmludGYoIk5vdCBBbmFncmFtIik7CiAgICAgICAgICAgIHJldHVybiAwOwogICAgICAgIH0KICAgIH0KCiAgICBwcmludGYoIkFuYWdyYW0iKTsKICAgIHJldHVybiAwOwp9Cgo=