/* NAMIT'S CHALLENGE 10 ORDERED LETTERS FINDER Input: microscope Output: IO IP OP PS Rules: 1.) Convert the word to uppercase. 2.) An ordered letters' pair is: . I J K L M N O M I C R O S C O P E If you see carefully, you will realise that in the word "microscope", if we start from 'i' and go ahead according to the alphabetical order and at the sametime we go to the next letter in the word "microscope". We will see that in the alphabetical order and in the word, we get the same letter 'O'(as shown in tha above illustration). 3.) TASK: Find all these ordered letters' pairs in the word provided by the user. From starting to end and from the end to starting like this: M I C R O S C O P E . S R Q P 4.) You have to go through all the letters and find their ordered partners backward and forward if you find any, then print the pair and continue. No line limit If you are facing any difficulty then refer to my code: https://code.sololearn.com/cG1VhvMKGLum/?ref=app https://www.sololearn.com/post/439213/?ref=app */ #include #include #include using namespace std; int main() { string s{"MICROSCOPE"}; cin >> s; vector> OPL; transform(begin(s),end(s),begin(s),::toupper); for(size_t i{0}; i < s.size()-1; ++i) for(size_t j{i+1}; j < s.size(); ++j) if(j - i == abs(s[i] - s[j])) s[j] > s[i] ? OPL.emplace_back(s[i], s[j]) : OPL.emplace_back(s[j], s[i]); cout << "Ordered Pair for " << s << " :\n"; if(OPL.size() > 0) { sort(OPL.begin(), OPL.end()); for(auto&&[c1,c2] : OPL) cout << c1 << c2 << ' '; } else cout << "None\n"; }

[Challenge] Ordered_Letter_Pair.cpp