# How do you find the longest sublist within a nested list

Say, I have a list

stuff={{eat,tea,now},{how,did,you,say},{the,cat,ate,was,can},{win,din,sin}}


I have a nested list and I want to find the list that has the most words in it and then I want to find the length of those words. How would I do that?

I thought it was

Max[StringLength[stuff]]


and

Length[Max[StringLength[stuff]]]


but StringLength doesn't do me any good here since the length of each letter is the same.

-

Since you want to find the sublist with the maximum length (i.e. most number of words), you don't need to concern yourself with StringLength. A simple solution would be to use Pick to select the longest list and then use StringLength to get the lengths.
With[{L = Length /@ stuff}, StringLength@Pick[stuff, L, Max@L]]

Yes, you can use Select. Is there a reason you don't want to use Pick? – R. M. Oct 25 '13 at 21:05