reversesubstring.cpp

Problem Statement You are given a string input. You are to find the longest substring of input su

#include <iostream>
#include <string>
#include <algorithm>

using namespace std;

string findReversed(string input)
{
	string tempStr;
	string result;
	int subSize = 0;
	for(int i = 0; i < input.size(); ++i) {		
	  for(int j = subSize + 1; j + i < input.size(); ++j) {
		tempStr = input.substr(i, j);
		reverse(tempStr.begin(), tempStr.end());
		for(int k = 0; k < input.size() - tempStr.size(); ++k)
		  if(tempStr == input.substr(k, tempStr.size()) && 
		     tempStr.size() > subSize) {
			subSize = tempStr.size();
			result = tempStr;
		  }
	  }
	}	
	reverse(result.begin(), result.end());
	return result;
}

int main()
{
	string input;
	cin >> input;
	cout << findReversed(input);
	system("PAUSE");	
}