/* If there are two or more words that are the same length, return the first word from the string with that length. Ignore punctuation and assume sen will not be empty. ************************* * Input:"fun&!! time" * * Output:time * * Input:"I love dogs" * * Output:love * ************************* Made by "The Cowboy" */ #include #include using namespace std; string LongestWord(string sen) { int len = sen.length(), w = 1; // finding the number of words for(int i = 0; i < len; i++){ if(sen[i] == ' '){ w++; } } int i = 0, a = 0, sum = 0, len1 = len, noofletters = 0; int word[w]; for(int j = 0; j < w; j++){ noofletters = 0; a = 0; for(i; sen[i] != ' ' && i <= len1 && sen[i] != '\0'; i++,a++){ if(( sen[i] >= 'a' && sen[i] <= 'z' ) || ( sen[i] >= 'A' && sen[i] <= 'Z' ) || ( sen[i] >= '0' && sen[i] <= '9' )){ noofletters = a+1; if(len == i) word[j] = len - sum; sum += a; } else{ a--; } } word[j] = noofletters; len -= i; i += 1; } string s, str[w]; int value, countsym; for(int i = 0; i < w; i++){ s = ""; value = 0; countsym = 0; for(int j = 0;sen[j] != ' ' && sen[j] != '\0'; j++){ if(( sen[j] >= 'a' && sen[j] <= 'z' ) || ( sen[j] >= 'A' && sen[j] <= 'Z' ) || ( sen[j] >= '0' && sen[j] <= '9' )){ s += sen[j]; }else{ countsym++; } } if(i!=w){ value = word[i] + countsym + 1; sen.erase(0,value); } str[i] = s; } string answer = str[0]; for(int i = 0; i < w; i++){ for(int j = 1; j <= w; j++){ if(str[i].size() > answer.size()){ answer = str[i]; } } } return answer; } int main() { string str = "Sololearn!& is $uper cool."; cout << "The longest word after filtration: " << LongestWord(str); return 0; }

Longest wordfinder after filtration