checking for anagrams itself will work for this question...
by using an array[[256];
On Wed, Jul 27, 2011 at 2:52 AM, SkRiPt KiDdIe wrote:
> I dint get wat are you speaking of.each alphabet is mapped onto
> ascii_val-'a' ie ascii of a=97. now check for odd and even occurence is
> performed. Work
I dint get wat are you speaking of.each alphabet is mapped onto
ascii_val-'a' ie ascii of a=97. now check for odd and even occurence is
performed. Work it on paper u'll get it.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this g
hey the above case wont work for a few casesfor instance wen the seventh
letter of the alphabet is involved...
On 26 July 2011 15:32, sachet wrote:
> please explainthe code
> #include
> using namespace std;
> int main()
> {
> int x=0;
> string str;
> cin>>str;//only lowercase
> for(int i
please explainthe code
#include
using namespace std;
int main()
{
int x=0;
string str;
cin>>str;//only lowercase
for(int i=0;i wrote:
> int palin(char *p)
> {
> int x=0;
> while(*p)
> {
> x^=1<<(*p-'a');
> p++;
> }
> int i=0,count=0;
> while(i<26)
> {
