These are chat archives for **camperbot/bonfire-return-largest-numbers-in-arrays**

hint

`hint [1/8]`

Make sure you've tried to hard to solve it yourself before proceeding. :construction:

type

`hint`

for next hint :pencil: [Contribute at the FCC Wiki]

hint

`hint [2/8]`

You will get an array that contains sub arrays of numbers and you need to return an array with the largest number from each of the sub arrays.

type

`hint`

for next hint :pencil: [Contribute at the FCC Wiki]

hint

`hint [3/8]`

You will need to keep track of the array with the answer and the largest number of each sub-array.

type

`hint`

for next hint :pencil: [Contribute at the FCC Wiki]

hint

`hint [4/8]`

You can work with multidimensional arrays by `Array[Index][SubIndex]`

type

`hint`

for next hint :pencil: [Contribute at the FCC Wiki]

hint

`hint [5/8]`

Pay close attention to the timing of the storing of variables when working with loops

type

`hint`

for next hint :pencil: [Contribute at the FCC Wiki]

I finished the first bonfire series and went back to redo them, to really retain the stuff.

I came up with this fresh solution for Bonfire: Return Largest Numbers in Arrays. Still don't grasp how return(ing) a-b; sorts the array from smallest to largest. But, Hey! it works and I get to avoid two for() statements.

<

```
function largestOfFour(arr) {
// You can do this!
function compareNumbers(a,b)
{
return a-b;
}
var newArray = [];
for(i =0;i<arr.length;i++)
{
arr[i] = arr[i].sort(compareNumbers);
newArray.push(arr[i][3]);
}
return newArray;
}
largestOfFour([[4, 5, 1, 3], [13, 27, 18, 26], [32, 35, 37, 39], [1000, 1001, 857, 1]]);
```

>