Restore original String from given Encrypted String by the given operations

Given a string str and a positive integer N, the task is to reverse N characters and skip N characters until the end of the string to generate the encrypted message.


Input: str = “ihTs suohld ebeas!y”, K = 3
Output: This should be easy!
Reverse “ihT” -> “Thi”
“s” remains the same
“uoh” -> “hou”, and so on.

Input: str = “!ysae eb dluohs sihT”, K = 30
Output: This should be easy!
Since 30 is larger than the length of the given string(= 20), just print the reverse of the string.

Approach: Follow the steps below to solve the problem:

  • Traverse the given string.
  • Increment the iterator by 2 * N.
  • Reverse N characters step by step.

Below is the implementation of the above approach:






// C++ Program to implement
// the above approach
#include <bits/stdc++.h>
using namespace std;
// Function to decrypt and print the
// original strings
int decryptString(string s, unsigned int N)
    for (unsigned int i = 0; i < s.size();
         i += 2 * N) {
        auto end = s.begin() + i + N;
        // If length is exceeded
        if (i + N > s.size())
            end = s.end();
        // Reverse the string
        reverse(s.begin() + i, end);
    cout << s << endl;
// Driver Code
int main()
    string s = "ihTs suohld  ebeas!y";
    unsigned int N = 3;
    decryptString(s, N);
    return 0;



This should be easy!

Time Complexity:
Auxiliary Space: O(1)

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using or mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.