1
00:00:00,180 --> 00:00:07,160
So now let's try to execute and now we would try to print letter mapping one here.

2
00:00:08,480 --> 00:00:12,080
So once we have done this particular part.

3
00:00:16,180 --> 00:00:31,890
Let us try doing this by saying, see, little mapping is equal to the simple sub Haikal Dot and let

4
00:00:32,030 --> 00:00:32,640
those.

5
00:00:34,200 --> 00:00:34,650
To.

6
00:00:36,830 --> 00:00:40,220
Mapping one and Hillary would pass.

7
00:00:41,720 --> 00:00:53,690
Little muffing won this case, then the text and candidate STF Index zero.

8
00:00:54,380 --> 00:01:06,230
So let's also it on this text here and now if we see a little mapping one, so we get those letters

9
00:01:06,230 --> 00:01:08,180
mapped over here like this.

10
00:01:08,830 --> 00:01:21,350
OK, now, similarly, if you try and see see, little mapping is equal to against this simple sub hecho

11
00:01:21,710 --> 00:01:26,840
dot and letters to the mapping one.

12
00:01:27,350 --> 00:01:38,550
Here again we take Lettow mapping one and again the same text here, but this time we take candidate

13
00:01:38,610 --> 00:01:46,450
still at the index one and again we try to see a little mapping one being printed.

14
00:01:46,910 --> 00:01:54,290
So now here you see we get multiple letters wherever exist, not only of what we were doing, we were

15
00:01:54,290 --> 00:02:00,700
taking this variable and this parameter C because of which we were not getting any values displayed.

16
00:02:00,920 --> 00:02:03,950
Hence we have changed this variable with a value iStore.

17
00:02:04,220 --> 00:02:10,080
And this is the variable where we have already stored the blank ciphertext mappings initially.

18
00:02:10,820 --> 00:02:17,870
So notice that if you have seen that nothing much has changed in this letter mapping except that this

19
00:02:17,960 --> 00:02:26,540
four letter mappings now for Z maps to also write in addition to now, that is because your add letter

20
00:02:26,810 --> 00:02:31,190
and so adds a letter to the list only if the letter is already not there.

21
00:02:31,370 --> 00:02:37,250
So now that we have this letter mapping for the full standard total cipher votes, we need to get a

22
00:02:37,250 --> 00:02:42,440
new mapping for, say, for that the second cipher and then repeat the same process.

23
00:02:42,770 --> 00:02:53,990
So now what we will do is let us do a little mapping tool that's equal to the agentic, simple sub hackle.

24
00:02:54,140 --> 00:03:01,550
Don't get the blank cipher letter mapping.

25
00:03:01,570 --> 00:03:02,150
So.

26
00:03:03,300 --> 00:03:05,940
Let's just cooperate on this function.

27
00:03:07,620 --> 00:03:11,610
Now, this is we are taking in for this is that a map in one?

28
00:03:11,610 --> 00:03:13,860
And this is that the mapping tool that we are doing?

29
00:03:14,310 --> 00:03:20,610
Then we take, let's say, for example, the vote part one, which is what do you make you're saying

30
00:03:21,180 --> 00:03:26,760
make the world back on one.

31
00:03:27,740 --> 00:03:41,030
Don't get battle out, and this time we passed the middle vote or the second road in this case, just

32
00:03:41,030 --> 00:03:47,060
copy paste it over here and then now that is me, Vode.

33
00:03:49,150 --> 00:03:50,640
Faten, Estie, or.

34
00:03:54,420 --> 00:04:06,550
Of me, in this case, the is small, made a mistake by putting it Capitol, so we got this narrative

35
00:04:06,600 --> 00:04:12,330
against the candidate of steel that's equal to a work world, Patton's.

36
00:04:16,350 --> 00:04:27,480
Wore buttons, one got dignity, all buttons, and now here we are putting the more fat one that we

37
00:04:27,480 --> 00:04:31,360
already have it, so we don't need to put it back individually.

38
00:04:31,410 --> 00:04:32,650
Copy paste and values.

39
00:04:32,670 --> 00:04:34,220
OK, ok.

40
00:04:34,770 --> 00:04:38,280
For in sorry.

41
00:04:38,550 --> 00:04:39,560
Our mistake.

42
00:04:45,700 --> 00:04:47,020
Gameboard patterns.

43
00:04:49,390 --> 00:04:58,420
One fine now after this, if you try to take this candidate a steer, you get now for values which have

44
00:04:58,420 --> 00:04:59,030
this magic.

45
00:04:59,260 --> 00:05:11,980
So now if we run a losing candidate or let's say for that case, for see in candidate last year and

46
00:05:11,980 --> 00:05:14,560
here we take another see.

47
00:05:16,060 --> 00:05:19,510
Now, in this case, we had taken normal letter mapping.

48
00:05:19,780 --> 00:05:22,510
So let's take your letter mapping itself.

49
00:05:22,780 --> 00:05:29,950
And that is equal to take samples of Hackle Dortch and letters.

50
00:05:32,450 --> 00:05:46,790
To mapping one now here to use also to map in one, and he give us the little mapping tool now and again,

51
00:05:47,030 --> 00:05:50,660
the same text available here in this.

52
00:05:51,050 --> 00:05:54,750
And then we lost the value of C in this case.

53
00:05:55,190 --> 00:06:02,360
And once that is done, if we try to take a mapping to in this case, we get this particular values.

54
00:06:02,720 --> 00:06:09,470
Now, instead of entering a four number of times called your letters to mapping one for each of the

55
00:06:09,470 --> 00:06:10,300
four candidates.

56
00:06:10,330 --> 00:06:16,220
Also, we have written a loop in this case which goes through the list of the candidates and the particular

57
00:06:16,220 --> 00:06:17,940
function on each of them.

58
00:06:18,110 --> 00:06:21,980
This finishes this little map in four seconds followed also.

59
00:06:22,520 --> 00:06:28,720
So now let us move on with the intersection part of this to say four letters in the next session.

60
00:06:29,000 --> 00:06:30,270
That's it from the session.

61
00:06:30,290 --> 00:06:31,040
Thank you very much.