ssize_t i = 0; ssize_t j = strlen(str) - 1; int ret = 0; for (;i < j; ++i, --j) { if (str[i] == str[j]) continue; char tmp = str[i]; ++ret; for (ssize_t k = j + 1; k < strlen(str); ++k) { tmp ^= str[k]; str[k] ^= tmp; tmp ^= str[k]; } ++j; }

then find the smallest odd number

so: int ret = -1; int buffer[SIZE_OF_ENGLISH_ALPHABET]; for (size_t i = 0; i < strlen(str); ++i) ++buffer[(str[i] | 0x20) - 0x61]; for (int i = 0; i < SIZE_OF_ENGLISH_ALPHABET; ++i) if (buffer[i] % 2) ret += 1; if (ret == -1) ret = 0;

so: int ret = -1; int buffer[SIZE_OF_ENGLISH_ALPHABET]; for (size_t i = 0; i < strlen(str); ++i) ++buffer[(str[i] | 0x20) - 0x61]; for (int i = 0; i < SIZE_OF_ENGLISH_ALPHABET; ++i) if (buffer[i] % 2) ret += 1; if (ret == -1) ret = 0;

Any thoughts on inserting characters?

ssize_t i = 0; ssize_t j = strlen(str) - 1; int ret = 0; for (;i < j; ++i, --j) { if (str[i] == str[j]) continue; char tmp = str[i]; ++ret; for (ssize_t k = j + 1; k < strlen(str); ++k) { tmp ^= str[k]; str[k] ^= tmp; tmp ^= str[k]; } ++j; }

so: int ret = -1; int buffer[SIZE_OF_ENGLISH_ALPHABET]; for (size_t i = 0; i < strlen(str); ++i) ++buffer[(str[i] | 0x20) - 0x61]; for (int i = 0; i < SIZE_OF_ENGLISH_ALPHABET; ++i) if (buffer[i] % 2) ret += 1; if (ret == -1) ret = 0;

Didn't insert any char But i followed an easy way to produce a palindrome O:-)

Didn't insert any char But i followed an easy way to produce a palindrome O:-)

Didn't insert any char But i followed an easy way to produce a palindrome O:-)

for abbca it will do abbcaacbba

TLDR; 1) don't use getters on POD 2) don't use getters that return two objects at once 3) minimize the amount of objects in your code

lol that’s so misleading

lol that’s so misleading

The question is, to print the count of minimum number of characters to be added to a string to make it a palindrome.. For example, 1. aba is a palindrome, so the function returns 0. 2. abca is not a palindrome, but, it can be made into one by adding a 'b' After the 'c'... So, it should return 1.

@prograchallenges is in search for challenges. Can you maybe suggest that challenge to them?

## Welcome We're very glad to welcome you to join the International C/C++ Group. You can invite others by https://t.me/programminginc ## Rules * C/C++ discussion preffered (assembly also allowed), keep other languages to a minimum. * Reverse enginnering, hacking (not facebook, instagram, etc.) * Legitimate requests for help on code and programming questions are ok (no homework requests, or "pls write entire program for me" requests). * Asking for book recommendations is ok, but "pls give pdf book" is not allowed, find books by yourself: google.com, http://gen.lib.rus.ec, https://t.me/programminginc/6504. * Only English language is allowed, if you speak very shitty English you will be banned. * A little bit of programming related memes, jokes, shitposting are allowed. * NSFW content (porn, nudity, etc.) is not allowed. * Spamming will grant you a warning or an immediate ban if you spam right after joining. * Religion, politics and ideological topics are forbidden. ## Resources About asking good questions: * [English](http://www.catb.org/esr/faqs/smart-questions.html) * [Translations](http://www.catb.org/esr/faqs/smart-questions.html#translations) For posting long code snippets: * [GitHub Gist](https://gist.github.com) * [Ubuntu Paste](https://paste.ubuntu.com/) ## Reports If you notice any forbidden content, please use the /report command while responding to the offending post to report it to the admins.

Guys please send the pdf of system software by Leland beck please

Effective modern C++

its kinda focused on the features and good practices more than teaching the fundamentals themselves , right ?

Is turbo c++ still used somewhere?

Exactly. it shows best practices for C++11 and C++14 language features such as smart pointers, rvalue references, forwarding references any many more

@webdevelopers

Yup I recommend u to read effective C++: third edition before this one

I'm have a elective choose from advance algorithm or software arch