Now, after this, we are supposed to define another function, that is to add letters to mapping is
one, mapping one.
And in this we are passing selective mapping one five for war one and candidate one.
All these parameters we are passing here.
And in this mapping, one parameter takes a dictionary value that basically stool's decide Falletta
one mapping and which is copied by the function to decipher what one parameter is a street value of
the ciphertext and the candidate.
One parameter is a possible English word that cipher mode one would decrypt.
So this particular function asks the letters in the candidate one as potential decryption letters,
four of four letters, one in this letter mapping.
So over here we are seeing four even in the range and we're giving you the range of the length of Civil
War one.
OK, and in this we are checking if the candidate one and the index of each one, if it is not in the
letter mapping one in the bracket or the object of C Saiful one over the one at the next one.
OK, so that is not in the mapping of this.
Then let's close this and colon now in this we are giving that letter mapping one in the index of Saiful
World one.
Even now in this we are using a pen and we are upending the value of candidate one index either.
OK.
Fine now after definition for this particular function, let us go back here and redefine another matter
that is to intersect mapping or mapping.
So.
And here we are passing the map over and map V1 as two parameters.
Now, here to intersect the two maps, we are creating a blank map and then add only a potential decryption
letters if they exist on both the maps.
So in this we are creating the intersected.
Mapping one, that's to we have another object that we will be creating, said that Blank Saiful.
Let us know that we have already created a mapping one, so we are calling that you're getting all the
blanks for little mappings from this particular function, storing it in the Intersect or intersected,
mapping one object, and then we run a loop, seeing four letters, one in letters is the constant that
we have created on the first line.
So an empty list means any little as possible.
So in this case, just copy another map and diary.
So in this case, we are seeing if our map is one in the index of little one is equal to blank, then
open the object and we see the intersected mapping one index of what we are using the copy matter,
copy, dot the copy and we are giving him an object.
Might be one index of little one.
Now here we also will have the elusive path wherein we are checking if map B one at the index of little
one, if that is equal to blank.
If it is, then we say here see intersected mapping one index of Lepka one and now we are using copy
dot the copy matter and copying the object of each one at the index of later on in this.
OK, now if both of this falls then we are going to spot any four letter and map A1 at the index of
letters is existing and B one of the index of little one.
Then add that letter to the intercepted mappings of Legalman.
So here we are checking for C mapped like the one in map even index legalman.
Then in this you check if over mapped letter is in.
Also Map B one at the index of Lietuva.
If both the conditions are true, then you'll see in the intersected mapping one at the index of letter
one, we are seeing DOT in the value of mapped letter one.
OK, and after you have done this, do not forget to use a written statement and say return the intersected
mapping one.
And once you have written the particular value, then the method ends and we come to another method
definition that is removing these old letters from mapping.
So now let us define how the function letters.
So remove.
Solved letters from mapping one, and it will be the object as little mapping one once you have passed
the object.
Now in this deciphered letters in the mapping, that map to only one letter are solved and can be removed
from other letters.
So, for example, save a map still potentially does a man and and B maps to n then we know that we
must be map to enemy.
Right.
So we can then remove and from the list of what a good map.
So then a map to Emily.
So know that now that maps only one letter, we can remove them from the list of letters for every other
letter.
So this is why there is a loop which we keep on reducing the map in this particular method that we would
be creating.
OK, now we would be creating a variable loop again, one which is initially equal to through.
Then we say via the loop again, one, which means while it is true, we are assuming that we will not
loop again.
So we are giving here a loop again is equal to Foote's.
Then the fourth letters we will be list or will be basically the list of your uppercase letters that
have one and only one possible map to the letter mappings.
So here we are creating C solved letters that's equal to blank.
Initially we say while the cipher letters is equal to or in the letters Astraea,
then we are seeing if the length of your letter mapping one at the index of your cipher letter one and
zero.
OK, so we are giving the two indexes that is zero and the column.
OK, and in this one thing you made a mistake here or we are forced checking there for SICI Fullarton
in letters.
Then we check if the letter mapping one saw the index of your cipher letter.
If that is equal to one then we are saying see these solved
letters one dot, we are using your append and giving little mapping one.
Now we are giving two indexes.
One is Saifullah to one, another is zero.
OK.