Embercode: AI-powered software engineer course

1. Which rule decides whether a pattern is a substring of a text, in the suffix trie lesson?

The pattern is a prefix of at least one suffix of the textThe pattern is exactly equal to one of the suffixes of the textThe pattern is a suffix of the whole textThe pattern is stored as one of the whole words in the trie

2. A query such as count("ana") walks the pattern through the trie. What does the cost of one query depend on?

Only the length of the textThe length of the text times the length of the patternOnly the length of the patternThe number of distinct letters in the text

3. What does this program print? ``

cpp
#include <iostream>
#include <string>
using namespace std;

int main() {
    string text = "banana";
    for (size_t i = 0; i < text.size(); ++i) {
        if (text[i] == 'n') cout << text.substr(i) << endl;
    }
}

``

na, then nananana, then nanana, then nannana, then na, then a

4. What does this program print? ``

cpp
#include <iostream>
#include <string>
using namespace std;

int main() {
    string text = "aaaa";
    string pattern = "aaa";
    int hits = 0;
    for (size_t i = 0; i + pattern.size() <= text.size(); ++i) {
        if (text.compare(i, pattern.size(), pattern) == 0) ++hits;
    }
    cout << hits << endl;
}

``

1302

5. How many nodes does the suffix trie for banana have, counting the root? Give the number.

Type a number.

Suffix tries