1
00:00:01,680 --> 00:00:02,870
So well come back again.

2
00:00:02,900 --> 00:00:06,410
I hope you've successfully finished the previous assignment.

3
00:00:06,620 --> 00:00:13,010
This is another assignment in which you receive an array that contains the names on the list of the

4
00:00:13,010 --> 00:00:19,190
photos for so many users and you have to find the user that has the most photos.

5
00:00:19,190 --> 00:00:24,120
So let's jump into ex-school that I been with the beginning of the out in oxcart.

6
00:00:24,140 --> 00:00:27,190
I'm going to start a new command line tool.

7
00:00:27,290 --> 00:00:28,220
I'm going to call it.

8
00:00:28,220 --> 00:00:31,390
Most photos use there.

9
00:00:31,770 --> 00:00:41,870
And for the most photos use years such as usual and I clean that up and make it like Cunneen proper

10
00:00:41,950 --> 00:00:43,190
formatting.

11
00:00:43,550 --> 00:00:46,810
And then you have received a file with this video page.

12
00:00:46,820 --> 00:00:48,110
Is this one.

13
00:00:48,330 --> 00:00:52,780
And inside it there is one giant R and it's mutable array.

14
00:00:52,790 --> 00:00:55,840
I'm going to copy the whole thing into my ex code.

15
00:00:56,450 --> 00:01:02,550
And now you have an array of card users array that has many many users in it.

16
00:01:02,570 --> 00:01:05,570
Each user has certain number of photos.

17
00:01:05,660 --> 00:01:15,800
And your goal is finding whether David Asaro sour and Adam or Steve which one of them has the most photos.

18
00:01:15,860 --> 00:01:22,610
So good luck and once you're done are please submit your work in the forums so the others can benefit

19
00:01:22,610 --> 00:01:23,310
from it.