You are required to extract a specific word <code>target_word</code> from an encrypted document. Fortunately, you have the basic information needed to decrypt that document.

The equation used to encrypt the document is as follows:

\[E_n(x) = (I(\mathsf{s}) + n) \mod 26 \]

Where:

<ul>
<li>\(\mathsf{s}\) is a letter</li>
<li>\(I(x) \) is the number representing the position of the letter in the alphabet (1 for <code>A</code>, 2 for <code>B</code>, etc.)</li>
<li>\(n \) is an arbitrary integer.</li>
<li>\(E_n(x) \) is the encrypted letter.</li>
</ul>

Return the number of occurrences of <code>target_word</code> in the document after decryption.

Note: The document only has upper case letters and spaces.

Example:

Input:

<pre tabindex="0" class="chroma"><code>encrypted_document = &#39;WKH TXLFN EURZQ IRA MXPSV RYHU WKH ODCB GRJ&#39;
n = 3
target_word = &#39;BROWN&#39;
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>extract_word(encrypted_document,n,target_word) -&gt; 1
</code></pre>

Explanation:

After decrypting the document, you will have :

<pre tabindex="0" class="chroma"><code>THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG
</code></pre>

In which the <code>target_word</code> (BROWN) appears only once.

Words in Encrypted String

Comments