Q.String Analgm Sol : #include<iostream> #include<vector> #include<string> using namespace std; #define NO_OF_CHARS 256 bool areAnagram(string str1,string str2){ // Create 2 count arrays and initialize all values as 0 int count1[NO_OF_CHARS] = { 0 }; int count2[NO_OF_CHARS] = { 0 }; int i; // For each character in input strings, increment count in // the corresponding count array for (i = 0; str1[i] && str2[i]; i++) { count1[str1[i]]++; count2[str2[i]]++; } // If both strings are of different length. Removing this // condition will make the program fail for strings like // "aaca" and "aca" if (str1[i] || str2[i]) ...