1 00:00:00,330 --> 00:00:07,050 Now, after this, if is solved, then it cannot possibly be a potential decryption letter for a different 2 00:00:07,050 --> 00:00:12,130 ciphertext, so we should remove it from those other from the list. 3 00:00:12,450 --> 00:00:24,710 So now, again, we create a formal appeal saying so for the Saiful letter, one in letters is OK, 4 00:00:25,060 --> 00:00:30,150 we take a variable one in your solved. 5 00:00:32,610 --> 00:00:44,820 Let us one and we will run this for loop and check if the length of letter mapping one at the index 6 00:00:44,820 --> 00:00:58,320 of Saiful letter one and if this is not equal to one and your S1 in the letter mapping one at the index 7 00:00:58,320 --> 00:01:01,430 of Saiful letter one. 8 00:01:02,040 --> 00:01:09,540 Then we open up this package and now in this we create see the letter 9 00:01:12,000 --> 00:01:18,660 mapping one and the index of Saifullah to one dot. 10 00:01:19,260 --> 00:01:23,450 Now we use to remove the value of S1. 11 00:01:23,840 --> 00:01:37,220 OK, and then again we check if the length of your letter mapping one at the index of Saifullah to one. 12 00:01:37,610 --> 00:01:42,940 OK, if it is equal to one again here a new letter is now solved. 13 00:01:43,050 --> 00:01:44,010 So the loop again. 14 00:01:44,370 --> 00:01:49,500 So now here we are again giving the loop again through. 15 00:01:50,190 --> 00:01:50,470 OK. 16 00:01:50,760 --> 00:01:51,750 And finally. 17 00:01:52,910 --> 00:02:04,640 At the end, we are to return the value of letter mapping what now we move on to our main definition 18 00:02:04,640 --> 00:02:08,470 that is Haak simple sub. 19 00:02:08,990 --> 00:02:14,350 Now we have given here a simple sub one. 20 00:02:15,200 --> 00:02:19,220 So assessment, OK, and here we are going to pass. 21 00:02:19,220 --> 00:02:21,380 The message is still variable. 22 00:02:21,830 --> 00:02:34,580 And now here we create the intersected map, one that's equal to we see the get blank, let's remove 23 00:02:34,580 --> 00:02:38,750 this get blank cipher letter mapping. 24 00:02:38,760 --> 00:02:41,410 So we're calling that particular method here. 25 00:02:41,990 --> 00:02:50,810 OK, after we have called and we have stored the value there, then we create the civil war list and 26 00:02:50,810 --> 00:02:52,910 that is equal to Synon. 27 00:02:54,670 --> 00:03:00,220 Now, let us cooperate on this non Letrozole space battle. 28 00:03:01,960 --> 00:03:04,220 So we are putting that reference there. 29 00:03:04,540 --> 00:03:15,690 And in this, we are giving blank then nakama same message, SDR dot convert to Apple, not use split 30 00:03:15,790 --> 00:03:16,170 metal. 31 00:03:16,990 --> 00:03:27,730 After this we create a for loop for the Saiful one in our civil war list that we have created. 32 00:03:27,730 --> 00:03:31,600 And that is our if we just look at it. 33 00:03:34,400 --> 00:03:36,200 Now, say, philatelist. 34 00:03:37,280 --> 00:03:41,450 STF for War List A. 35 00:03:42,440 --> 00:03:49,220 And in this we open up the for loop and we get a new Saiful at the map and for each ciphertext vote 36 00:03:49,610 --> 00:03:53,810 for that week of candidate mappers. 37 00:03:54,650 --> 00:03:55,520 That's Equilar. 38 00:03:55,520 --> 00:04:03,340 Do we call here again to get blank Saiful letter mapping one. 39 00:04:03,980 --> 00:04:14,590 OK and the vote pattern we create see war pattern asdf that's equal. 40 00:04:14,630 --> 00:04:18,440 Do we say make the war button so. 41 00:04:21,680 --> 00:04:23,740 Let's use that over here. 42 00:04:25,120 --> 00:04:33,430 OK, so now here we can just check out in this make war button if we just open it and open the matter 43 00:04:33,430 --> 00:04:39,130 that we are creating is get more buttons on a stick and the filenames make war button one. 44 00:04:39,250 --> 00:04:42,340 So now he will have to write down saying make war 45 00:04:45,160 --> 00:04:47,200 button one dot. 46 00:04:48,370 --> 00:04:58,530 We have the matter that is get more button still so that this get more button STF. 47 00:04:58,640 --> 00:05:03,910 And in this we are passing the Saiful voter one. 48 00:05:04,630 --> 00:05:16,570 OK, hence we need the files to be completed, then we check if the war button is or is not in your. 49 00:05:17,050 --> 00:05:18,720 Now we want another five. 50 00:05:18,730 --> 00:05:21,130 So let us close this and go forward. 51 00:05:21,130 --> 00:05:21,950 Button five. 52 00:05:22,390 --> 00:05:24,720 Let's open this in November, ok. 53 00:05:25,060 --> 00:05:29,890 So if it does not there in war patterns one. 54 00:05:30,370 --> 00:05:31,510 So that's right. 55 00:05:31,930 --> 00:05:34,240 Not in war. 56 00:05:37,480 --> 00:05:41,500 Batten's one dot all battles. 57 00:05:41,830 --> 00:05:44,500 So here we have this all battles created. 58 00:05:44,530 --> 00:05:45,670 So we are using that. 59 00:05:46,090 --> 00:05:49,360 And for this, the final limits, war battles one. 60 00:05:49,780 --> 00:05:57,160 OK, so if it is not, then in this visible column and we just give that the continual statement, this 61 00:05:57,160 --> 00:05:59,230 war was not in our dictionary. 62 00:05:59,230 --> 00:06:02,300 So we continue with the next part of it. 63 00:06:02,380 --> 00:06:02,690 OK. 64 00:06:02,920 --> 00:06:12,130 And after this after this continues, we move on to the next and we say for the candidate one in your 65 00:06:12,670 --> 00:06:13,180 war 66 00:06:17,020 --> 00:06:26,170 button, one got all factors in the index of Faqir War 67 00:06:28,900 --> 00:06:32,780 button is OK in this VSC. 68 00:06:32,870 --> 00:06:37,750 Add letters to mapping. 69 00:06:38,110 --> 00:06:42,890 Now your way of creating add letters to mapping one. 70 00:06:43,540 --> 00:06:46,890 So let us put down the same concept here. 71 00:06:47,020 --> 00:06:58,720 OK, in this we are passing the candidate one candidate map one, then the Saiful vote one and we are 72 00:06:58,720 --> 00:07:02,680 having now its candidate map estie out in this case. 73 00:07:02,950 --> 00:07:07,990 Then we have the Saiful vote one and we have the candidate one. 74 00:07:08,480 --> 00:07:12,820 So we pass all this and we security add letters to mapping. 75 00:07:13,390 --> 00:07:21,310 OK, ok, so after this we continue for the next part of it and we see in the new mapping with the existing 76 00:07:21,310 --> 00:07:22,390 intersected mapping. 77 00:07:22,630 --> 00:07:34,140 So here we create intersected map one that's equal to intersect mappings. 78 00:07:35,140 --> 00:07:42,670 In the second one, and here we pass the object of intercepted map. 79 00:07:44,020 --> 00:07:57,820 One gift and the candidate map is OK, and then finally we give you your written statement and receive 80 00:07:57,840 --> 00:08:05,260 it on the novel, calling your remove dissolve letters from mapping. 81 00:08:05,710 --> 00:08:16,450 So we are returning that passing that the interactive map once, OK, now will continue in the next 82 00:08:16,450 --> 00:08:16,880 session. 83 00:08:16,970 --> 00:08:18,770 More, more on this program. 84 00:08:18,880 --> 00:08:24,300 And we have to also write down the method for group with this little mappings and then give our main 85 00:08:24,310 --> 00:08:25,370 method execution. 86 00:08:25,810 --> 00:08:28,510 OK, so we'll continue this in the next session. 87 00:08:28,540 --> 00:08:29,350 Thank you very much.