- ordered array from 0 to 9 with one missing element. how would you find the missing element? - iterate and if i != numbers[i] return the number - how would you make it more efficient for a very large array? - binary search - fetch from an api (gitlab api with projects) - print the name - print the names but ordered (names are in lowercase and uppercase), to sort you can use localCompare - group by namespace (object is like: [{name: 'hello', namespace: { id: 1 }}] - can use group by, or iterate and put into an object - code review: dayofmonth function - it had like if (month ==2) { day += 31 }, etc etc - propose better solution, leap year, array with preset dates to be added like: [0, 31, 28, etc]