1
00:00:00,930 --> 00:00:03,630
Welcome to our first coding challenge.

2
00:00:04,380 --> 00:00:05,520
Let's have a look.

3
00:00:05,700 --> 00:00:14,010
Challenge number one is that create a function to find the maximum of two numbers.

4
00:00:14,370 --> 00:00:18,450
The maximum of two numbers is a ledger of the two numbers.

5
00:00:19,560 --> 00:00:25,680
And then it should retain the maximum of the two numbers should be retained as a number.

6
00:00:26,160 --> 00:00:30,090
The two numbers should be supplied as parameters to the function.

7
00:00:30,090 --> 00:00:34,500
So this question has give more details about what you are supposed to do.

8
00:00:34,890 --> 00:00:43,170
So in a nutshell, the function should take two numbers and the function should determine which number

9
00:00:43,170 --> 00:00:44,940
is larger than the other.

10
00:00:45,210 --> 00:00:46,410
That is a question.

11
00:00:46,890 --> 00:00:52,170
The coding challenge, number one, coding challenge number two, the same thing.

12
00:00:52,170 --> 00:00:57,060
But instead for this one, I'm going to find the minimum number of the two.

13
00:00:57,390 --> 00:01:01,920
So it stays that create a function to find the minimum of two numbers.

14
00:01:01,950 --> 00:01:06,510
The minimum of two numbers is the smaller of the two numbers, and the minimum of two numbers should

15
00:01:06,510 --> 00:01:08,010
be retained as a number.

16
00:01:08,280 --> 00:01:11,820
The two numbers should be supplied as parameters to the function.

17
00:01:11,820 --> 00:01:13,530
So it's opposite this one.

18
00:01:13,530 --> 00:01:16,200
Find the maximum and this one find the minimum.

19
00:01:16,470 --> 00:01:16,950
All right.

20
00:01:16,950 --> 00:01:22,110
You can make reference to the previous section or any external resources.

21
00:01:23,060 --> 00:01:27,330
That can help you to get this challenge done.

22
00:01:27,350 --> 00:01:31,670
The next video I'm going to show you how I'm going to solve this particular challenge.