all_star_code_challenge_15.cpp

//This Kata is intended as a small challenge for my students

//Your family runs a shop and have just brought a Scrolling Text Machine (http://3.imimg.com/data3/RP/IP/MY-2369478/l-e-d-multicolour-text-board-250x250.jpg) to help get some more business.

//The scroller works by replacing the current text string with a similar text string, but with the first letter shifted to the end; this simulates movement.

//You're father is far too busy with the business to worry about such details, so, naturally, he's making you come up with the text strings.

//Create a function named rotate() that accepts a string argument and returns an array of strings with each letter from the input string being rotated to the end.

//rotate("Hello") // => {"elloH", "lloHe", "loHel", "oHell", "Hello"}

//Note: The original string should be included in the output array The order matters. Each element of the output array should be the rotated version of the previous element. The output array SHOULD be the same length as the input string The function should return an emptry array with a 0 length string, '', as input

#include <string>
#include <vector>

std::vector<std::string> rotate(const std::string& s) {
  std::vector<std::string> result;
  
  for (int i = 0; i < s.size(); ++i) {
    std::string tmpString = s.substr(i + 1, s.size()) + s.substr(0, i + 1);
    result.push_back(tmpString);
  }
  
  return result;
}