1
00:00:01,050 --> 00:00:01,830
Hi, guys.

2
00:00:01,860 --> 00:00:03,140
Welcome back to the goals.

3
00:00:03,930 --> 00:00:08,530
So in this session, they will solve very easy problem on area.

4
00:00:08,700 --> 00:00:12,150
So the problem is given, Eddie, let's say that is

5
00:00:14,950 --> 00:00:18,540
let's say Matt is one, two, three and four.

6
00:00:18,990 --> 00:00:26,790
So we have to print at 18 months old friend in reverse order.

7
00:00:27,240 --> 00:00:30,220
So until now, we have printed that aning using order.

8
00:00:30,240 --> 00:00:31,440
That is from this.

9
00:00:32,410 --> 00:00:33,040
So this.

10
00:00:34,210 --> 00:00:34,440
OK.

11
00:00:34,520 --> 00:00:36,980
Now, what we have to do, we have to bring that in reverse order.

12
00:00:37,240 --> 00:00:40,280
Letters from this to this.

13
00:00:41,420 --> 00:00:44,740
So my vote should be four, three, two and one.

14
00:00:45,180 --> 00:00:50,090
So when I leave my adays, let's see, my ad is five.

15
00:00:50,120 --> 00:00:51,350
One, two.

16
00:00:51,890 --> 00:00:52,340
Seven.

17
00:00:52,400 --> 00:00:55,370
Some output should be seven to one and five.

18
00:00:56,480 --> 00:00:58,100
OK, so this is a very easy problem.

19
00:00:58,760 --> 00:01:00,430
So footprinting the ad in English.

20
00:01:00,620 --> 00:01:04,310
So footprinting that is from this from left to right.

21
00:01:04,850 --> 00:01:14,890
What we used to do for I equals zero I less than n I blessedness C out of.

22
00:01:14,970 --> 00:01:19,520
I know footprinting that from right to left.

23
00:01:19,790 --> 00:01:25,220
What we will do for it will start from the last index which is and minus one.

24
00:01:25,630 --> 00:01:36,020
OK, so the last prediction is and minus one eye is greater than or equals zero ie minus minus.

25
00:01:38,370 --> 00:01:39,800
See out here, fine.

26
00:01:40,420 --> 00:01:42,400
So this is all that we have to do.

27
00:01:42,650 --> 00:01:42,880
OK.

28
00:01:42,970 --> 00:01:43,870
Very easy problem.

29
00:01:44,650 --> 00:01:45,010
That's right.

30
00:01:45,210 --> 00:01:45,650
The code.

31
00:01:49,250 --> 00:01:52,550
So let's name it as Brent reverse, reverse, Brent.

32
00:01:57,240 --> 00:01:58,710
We will spend R.S.V.P..

33
00:02:15,640 --> 00:02:17,790
Now, what we have to do first.

34
00:02:18,130 --> 00:02:19,360
Let us take input.

35
00:02:20,230 --> 00:02:22,030
So a number of elements are in.

36
00:02:22,330 --> 00:02:29,810
Let's make an area of size N and now we will take an element as input.

37
00:02:29,890 --> 00:02:32,840
So I was so I was zero.

38
00:02:33,100 --> 00:02:38,140
I would list an N A plus, plus take input.

39
00:02:40,780 --> 00:02:42,790
Now we will bend.

40
00:02:43,000 --> 00:02:44,710
So first do normal print.

41
00:02:45,760 --> 00:02:52,060
So normal print that is from left to right.

42
00:02:56,580 --> 00:03:03,550
So what we used to do is we will I played first index zero Noster Indexes and minus one.

43
00:03:04,770 --> 00:03:05,670
And we will print.

44
00:03:12,940 --> 00:03:14,440
Now, this was normal print.

45
00:03:15,890 --> 00:03:18,080
Now they will print in reverse order.

46
00:03:18,860 --> 00:03:20,120
Okay, so.

47
00:03:23,240 --> 00:03:25,300
Reverse order.

48
00:03:26,130 --> 00:03:31,120
Now they sprint from right to left.

49
00:03:33,250 --> 00:03:35,870
OK, so the last indexes and minus one.

50
00:03:35,910 --> 00:03:36,460
So for.

51
00:03:39,410 --> 00:03:42,950
And I equals loss from Nexus and minus one.

52
00:03:43,790 --> 00:03:45,250
And the force from Nexus zero.

53
00:03:46,100 --> 00:03:51,920
And I will degrees C out of I.

54
00:03:53,240 --> 00:03:54,890
So this is all that we have to do.

55
00:04:01,410 --> 00:04:02,790
OK, so let's test.

56
00:04:04,660 --> 00:04:10,720
So a number of elements are five and the elements are two, four, one, six and three.

57
00:04:12,150 --> 00:04:14,860
So this is normal order and this is the reverse order.

58
00:04:14,940 --> 00:04:16,380
Okay, so let me give spaces.

59
00:04:21,170 --> 00:04:25,840
And let us also ride out normal.

60
00:04:39,210 --> 00:04:40,010
She out.

61
00:04:41,270 --> 00:04:41,630
Was.

62
00:04:48,870 --> 00:04:50,340
So a number of elements are five.

63
00:04:50,460 --> 00:04:54,570
And the numbers are two, five, one, six and three.

64
00:04:55,500 --> 00:04:59,120
So a normal order is give given order to five or six three.

65
00:04:59,450 --> 00:05:03,150
And the reverse order is three, six, one, five and two.

66
00:05:04,650 --> 00:05:05,480
So one more time.

67
00:05:07,260 --> 00:05:10,780
That's the only three elements are there, and elements are one to win three.

68
00:05:11,780 --> 00:05:15,480
So this is normal print and this is reverse sprint to do one.

69
00:05:16,850 --> 00:05:23,930
OK, so the problem was it didn't start from the last or next till the first index and then print the

70
00:05:23,930 --> 00:05:25,100
value of a.

71
00:05:26,230 --> 00:05:26,410
OK.

72
00:05:26,900 --> 00:05:28,130
So this is it for this video.

73
00:05:28,280 --> 00:05:28,900
Thank you.
