1 00:00:01,020 --> 00:00:02,020 Hello, everyone. 2 00:00:02,220 --> 00:00:07,670 So in this video, we are going to solve another question, and the name of the question is basically 3 00:00:07,680 --> 00:00:08,460 unique, but. 4 00:00:11,360 --> 00:00:13,790 So the name of the question is unique, but. 5 00:00:14,770 --> 00:00:16,400 Let me explain you the question. 6 00:00:16,930 --> 00:00:19,850 So in the question, we are provided with morals and greed. 7 00:00:19,930 --> 00:00:20,760 OK, fine. 8 00:00:21,160 --> 00:00:22,300 So we have agreed. 9 00:00:24,400 --> 00:00:31,870 And the dimensions of great are McCrossin simple, so there is one robot and this robot is basically 10 00:00:31,870 --> 00:00:33,970 present at the top left corner. 11 00:00:34,960 --> 00:00:37,450 So this robot is present here. 12 00:00:37,550 --> 00:00:40,680 OK, so this robot and the index are zero zero. 13 00:00:41,530 --> 00:00:46,900 And this robot basically is trying to reach the bottom right corner of the grid. 14 00:00:47,530 --> 00:00:50,860 And the index for this one will be at minus one and minus one. 15 00:00:52,300 --> 00:00:57,510 Now, what we need to do, we need to find out how many unique possible parts will be there. 16 00:00:57,940 --> 00:01:05,019 And it is given that a robot can move only in two direction, robot can move in this direction and robot 17 00:01:05,019 --> 00:01:06,860 can move in this direction. 18 00:01:07,090 --> 00:01:09,970 So there are two directions in which the robot can move. 19 00:01:10,090 --> 00:01:14,080 Either you can move down or you can move right from any given point. 20 00:01:14,710 --> 00:01:17,950 And we need to find out how many unique possible parts will be there. 21 00:01:18,310 --> 00:01:20,530 So this is standard depiction. 22 00:01:22,350 --> 00:01:27,810 This is standard precaution, I'm explaining the logic and you will be writing the code for this problem 23 00:01:27,810 --> 00:01:29,190 yourself, so. 24 00:01:30,270 --> 00:01:33,690 Let's see, so far reaching this particular index. 25 00:01:35,060 --> 00:01:36,410 If I want to reach here. 26 00:01:37,740 --> 00:01:44,220 How many unique possible parts will be there, so to reach this index, you can basically come from 27 00:01:44,220 --> 00:01:48,600 the index above it and from the index left of it. 28 00:01:49,070 --> 00:01:50,100 OK, so. 29 00:01:51,900 --> 00:01:59,040 I want to reach this index so you can come from here from above or you can come from left because these 30 00:01:59,040 --> 00:02:00,990 are the only two directions allowed. 31 00:02:01,330 --> 00:02:03,880 So it will come from left or so. 32 00:02:03,930 --> 00:02:10,320 A number of ways to reach this index will be the number of ways to reach this index, plus the number 33 00:02:10,320 --> 00:02:11,910 of ways to reach this index. 34 00:02:12,330 --> 00:02:13,170 Simple, right? 35 00:02:13,440 --> 00:02:22,590 So what will do we will create are two really are two, three and four to DPRK for filling what Depfa 36 00:02:22,590 --> 00:02:25,110 is able to present, what it will represent. 37 00:02:25,110 --> 00:02:29,370 It will represent the number of unique parts to reach accommodation. 38 00:02:29,440 --> 00:02:33,960 OK, so Depfa is going to represent NAMAROFF of unique but. 39 00:02:38,060 --> 00:02:38,780 To reach. 40 00:02:40,320 --> 00:02:41,100 Index. 41 00:02:43,160 --> 00:02:46,340 Ikoma and. 42 00:02:47,420 --> 00:02:52,580 This is a comedy, so I can come from the top or I can come from left. 43 00:02:53,090 --> 00:02:56,840 So basically I will be Bartolomé recursive relation. 44 00:02:57,260 --> 00:03:02,420 I will be either I will come from top or I will come from left. 45 00:03:02,680 --> 00:03:08,850 Sleepify minus Maji plus deep off I and G minus one. 46 00:03:10,280 --> 00:03:12,370 So this is our definition. 47 00:03:12,410 --> 00:03:14,090 This is symbolic assimilation. 48 00:03:14,090 --> 00:03:15,380 And what will be our answer? 49 00:03:15,620 --> 00:03:21,080 Our answer will be basically DPF and minus one and and minus one. 50 00:03:21,080 --> 00:03:21,520 Right. 51 00:03:22,010 --> 00:03:28,700 But we need to do we need to find out the number of unique possible paths to reach this index, the 52 00:03:28,700 --> 00:03:29,750 last index. 53 00:03:30,620 --> 00:03:31,010 Right. 54 00:03:31,010 --> 00:03:32,240 And what is the definition? 55 00:03:32,540 --> 00:03:36,280 Definition is number of unique part to reach Index A.. 56 00:03:37,070 --> 00:03:40,040 So I want to reach this index, which is at minus UNadministered. 57 00:03:40,040 --> 00:03:46,910 So our answer will be DPF and minus and minus number of unique, but to reach index and minus one, 58 00:03:46,910 --> 00:03:47,960 comma and minus one. 59 00:03:49,260 --> 00:03:51,560 OK, so this is a very simple problem. 60 00:03:51,980 --> 00:03:57,320 You can write the code for yourself and if you face any problem, then you can watch my code in the 61 00:03:57,320 --> 00:03:57,990 next video. 62 00:03:58,550 --> 00:04:00,200 So this is it about this video. 63 00:04:00,230 --> 00:04:01,660 I will see you in the next one. 64 00:04:02,120 --> 00:04:02,660 Thank you.