Question

*****Complete void example 4, 7, 8, 9, 10

#include <iostream>
#include <fstream>
#include <vector>
#include <string>

using namespace std;

void rtrim(std::string& str, const std::string& chars = "\t\n\v\f\r ")
{
str.erase(str.find_last_not_of(chars) + 1);
}

vector<string> *get_words() {
vector<string> *words = new vector<string>();
fstream infile;
string word;
infile.open("words.txt");

getline(infile, word);
while(infile) {
rtrim(word);
    words->push_back(word);
    getline(infile, word);
}
return words;
}

void example_1(vector<string> *words) {
// find words that contain the substring 'pet' and 'cat'
// HINT: use find(str, p) method. Then find more words
// using your own two words but this time use the p
// parameter to enforce the order in which the words appear.
cout << endl << "Words that contains 'pet' and 'cat' in the same word"<< endl;

for (string word : *words) {
   if (word.find("pet", 0) != string::npos)
       if (word.find("cat", 0) != string::npos)             
   cout << word << endl;
   }
}

void example_2(vector<string> *words) {
// find words that have exactly 5 characters with the second letter
// is 'p' and the last letter is 'e'
cout << endl << "Words with second letter 'p', and last letter 'e'"<< endl;

for (string word : *words) {
if(word.length()==5){
if (word[1]=='p'&&word[4]=='e')
cout<<word<<endl;
}
}
  
}

void example_3(vector<string> *words) {
// find words that have more then 6 characters and end with
// 'sant'
// HINT: use the length of the word to find the location of 'sant'
// int lenght;

cout << endl << "Words ending in 'sant'" << endl;
  
for (string word : *words){
if (word.length() > 6) {
if (word.find("sant", 0) != string::npos)

cout << word << endl;
}
}
}
void example_4(vector<string> *words) {
// find words longer then 3 chars that start and end with the same
// three characters.
// HINT: use substr() and find()
cout << endl << "Starts and ends with same 3 chars." << endl;

}

void example_5(vector<string> *words) {
// find words that have double p's and double l's
cout << endl << "Words with 'pp' and 'll'" << endl;
  
for (string word : *words) {
   if (word.find("pp", 0) != string::npos) {
   cout << word << endl;
   }
   if (word.find("ll", 0) != string::npos)   {         
   cout << word << endl;
       }
}
}

void example_6(vector<string> *words) {
// find words that have more then 8 letters where the
// first, fourth, seventh, and tenth letters are the same.
int length;
cout << endl << "Words with matching first, fourth, seventh, and tenth letters" << endl;
for (string word : *words) {
       if (word.length() >= 10) {
           if ((word[0] == word[3]) && (word[3] == word[6]) &&
               (word[6] == word[9])) {
               cout << word << endl;
           }
       }
   }
}

void example_7(vector<string> *words) {
// find words of any length that contains an 'x' and 'e' and a 'v'
cout << endl << "Words containing x,e and v" << endl;
  
for (string word : *words) {
  
  
       }
}

void example_8(vector<string> *words) {
// find words that have an odd number of characters that
// start with 'st' and end with 'rt'
int length;
cout << endl << "Odd length words starting with 'st' and ending with 'rt'" << endl;
}

void example_9(vector<string> *words) {
// make up your own word search..
}

void bonus(vector<string> *words) {
// 10 points. points can be applied to any missing lab.
// find palindromes - words that are spelled the same
// backwards and forwards. HINT: Use two pointers, one
// that starts at the beginning of the word and one that
// starts at the end.
char *s, *e;
int length, palindrome;
cout << endl << "Bonus palindromes" << endl;
}

int main() {
vector<string> *words;

words = get_words();

cout << "Words read: " << words->size() << endl;
  
example_1(words);
example_2(words);
example_3(words);
example_4(words);
example_5(words);
example_6(words);
example_7(words);
example_8(words);
example_9(words);
bonus(words);
  
}

Answer 1

100% Working C++ code:-

//*****Complete void example 4, 7, 8, 9, 10

#include <iostream>
#include <fstream>
#include <vector>
#include <string>

using namespace std;

void rtrim(std::string& str, const std::string& chars = "\t\n\v\f\r ")
{
str.erase(str.find_last_not_of(chars) + 1);
}

vector<string> *get_words() {
vector<string> *words = new vector<string>();
fstream infile;
string word;
infile.open("words.txt");

getline(infile, word);
while(infile) {
rtrim(word);
words->push_back(word);
getline(infile, word);
}
return words;
}

void example_1(vector<string> *words) {
// find words that contain the substring 'pet' and 'cat'
// HINT: use find(str, p) method. Then find more words
// using your own two words but this time use the p
// parameter to enforce the order in which the words appear.
cout << endl << "Words that contains 'pet' and 'cat' in the same word"<< endl;

for (string word : *words) {
if (word.find("pet", 0) != string::npos)
if (word.find("cat", 0) != string::npos)   
cout << word << endl;
}
}

void example_2(vector<string> *words) {
// find words that have exactly 5 characters with the second letter
// is 'p' and the last letter is 'e'
cout << endl << "Words with second letter 'p', and last letter 'e'"<< endl;

for (string word : *words) {
if(word.length()==5){
if (word[1]=='p'&&word[4]=='e')
cout<<word<<endl;
}
}
  
}

void example_3(vector<string> *words) {
// find words that have more then 6 characters and end with
// 'sant'
// HINT: use the length of the word to find the location of 'sant'
// int lenght;

cout << endl << "Words ending in 'sant'" << endl;
  
for (string word : *words){
if (word.length() > 6) {
if (word.find("sant", 0) != string::npos)

cout << word << endl;
}
}
}
void example_4(vector<string> *words) {
// find words longer then 3 chars that start and end with the same
// three characters.
// HINT: use substr() and find()

cout << endl << "Starts and ends with same 3 chars." << endl;

for (string word : *words) {
  
   int i=0;
   if(word.length()>3)
   {
       string first=word.substr(0,3);
       string last=word.substr(word.length()-3,word.length());
      
       for(i=0;i<first.length();i++)
       {
           char ch=first.at(i);
           if(last.find(ch)==-1)
           {
               break;
           }
       }
       if(i==first.length())
       {
           cout<<word<<endl;
       }
   }
}

}

void example_5(vector<string> *words) {
// find words that have double p's and double l's
cout << endl << "Words with 'pp' and 'll'" << endl;
  
for (string word : *words) {
if (word.find("pp", 0) != string::npos) {
cout << word << endl;
}
if (word.find("ll", 0) != string::npos) {   
cout << word << endl;
}
}
}

void example_6(vector<string> *words) {
// find words that have more then 8 letters where the
// first, fourth, seventh, and tenth letters are the same.
int length;
cout << endl << "Words with matching first, fourth, seventh, and tenth letters" << endl;
for (string word : *words) {
if (word.length() >= 10) {
if ((word[0] == word[3]) && (word[3] == word[6]) &&
(word[6] == word[9])) {
cout << word << endl;
}
}
}
}

void example_7(vector<string> *words) {
// find words of any length that contains an 'x' and 'e' and a 'v'
cout << endl << "Words containing x,e and v" << endl;
  

for (string word : *words) {
   int x=0,e=0,v=0;
       for(int i=0;i<word.length();i++)
       {
           char ch=word.at(i);
           if(ch=='x')
           {
               x++;
           }
           else if(ch=='e')
           {
               e++;
           }
           else if(ch=='v')
           {
               v++;
           }
       }
       if(x>0 && e>0 && v>0)
       {
           cout<<word<<endl;
       }
}
}

void example_8(vector<string> *words) {
// find words that have an odd number of characters that
// start with 'st' and end with 'rt'
int length;
cout << endl << "Odd length words starting with 'st' and ending with 'rt'" << endl;

for (string word : *words) {
  
   if(word.length()%2==1)
   {
       string st=word.substr(0,2);
       string en=word.substr(word.length()-2,word.length());
      
       if(st=="st" && en=="rt")
       {
           cout<<word<<endl;
       }
   }
}
}

void example_9(vector<string> *words) {
// make up your own word search..

//My own search- starts and ends with same character

cout << endl << "words starting and ending with same character"<<endl;

for (string word : *words) {
  
   char st=word.at(0);
   char en=word.at(word.length()-1);
  
   if(st==en)
   {
       cout<<word<<endl;
   }
}

}

void bonus(vector<string> *words) {
// 10 points. points can be applied to any missing lab.
// find palindromes - words that are spelled the same
// backwards and forwards. HINT: Use two pointers, one
// that starts at the beginning of the word and one that
// starts at the end.
char *s, *e;
int length, palindrome;
cout << endl << "Bonus palindromes" << endl;

for (string word : *words)
{

int start=0;
int end=word.length()-1;

while(start<=end)
{
   if(word.at(start)==word.at(end))
   {
      
       start++;
       end--;
   }
   else
   {
       break;
   }
}
if (start > end)
   {
       cout<<word<<endl;
   }

  
}

}

int main() {
vector<string> *words;

words = get_words();

cout << "Words read: " << words->size() << endl;
  
example_1(words);
example_2(words);
example_3(words);
example_4(words);
example_5(words);
example_6(words);
example_7(words);
example_8(words);
example_9(words);
bonus(words);
  
}