Question

You are given an input C++ string and a dictionary of English words. You are asked to see if the input is consisted of words only in the dictionary. For example:

Example #1

Input string = "joe";

Input dictionary = { "joe1", "joe" };

Output: true

Explanation: "joe" is in the dictionary.

Example #2

Input string = "joey";

Input dictionary = { "joe1", "joe" };

Output: false

Explanation: even though "joe" is in the dictionary, "y" is not.

Example #3

Input string = "applepie";

Input dictionary = { "pie", "apple" };

Output: true

Explanation: "apple" and "pie" are both in the dictionary.

Example #4

Input string = "hellonow";

Input dictionary = { "hello", "on", "hell", "now" };

Output: true

Explanation: "hello" and "now" are both in the dictionary.

Example #5

Input string = "hellonowl";

Input dictionary = { "hell", "on", "owl" };

Output: true

Explanation: "hell", "on", and "owl" are all in the dictionary.

Implement the following class method that takes the input string and a dictionary of English words, and checks to see if the given input is composed of only the words from the input dictionary:

class CIS14 {
   public:
      bool isInputInDictionary(string* s, unordered_set<string> &dict);
};

Constraints / Assumptions:

• The input string cannot be NULL.
• The input dictionary cannot be NULL; it has at least one English words.
• The method takes a pointer to the input string.
• The method takes a reference of the input dictionary.
• HINT: this solution calls for recursion.
• Your main() won't be graded but your class and its functionality will be graded.
• It is your responsibility to compile your code in C++11/C++14 (no pre-C++11!). Failure to do that means your code isn't compilable and you will receive 0 points.
• Wrong member function signature or wrong class declaration receive -1 styling point each
• Grading for this problem is as follows:

Logic: 8 points (-1 point for each test failure)

Styling/Documentation: 2 points (-1 for wrong function signature, -1 for wrong class declaration, and/or -1 for lack of documentation)

PreviousNext

Answer 1

If you have any doubts, please give me comment...

#include<iostream>

#include<string>

#include<unordered_set>

using namespace std;

class CIS14 {

public:

bool isInputInDictionary(string* s, unordered_set<string> &dict);

};

bool CIS14::isInputInDictionary(string* s, unordered_set<string> &dict){

unordered_set<string>::iterator itr;

for (itr = dict.begin(); itr != dict.end(); itr++){

if(*itr == *s)

return true;

}

return false;

}

int main(){

string str = "joey";

unordered_set<string> dict = {"joe1", "joe"};

CIS14 test;

cout<<test.isInputInDictionary(&str, dict)<<endl;

}