Find the Longest Word in a String:
function findLongestWordLength(str) {
return Math.max(...str.split(" ").map(i => i.length));
}
findLongestWordLength("The quick brown fox jumped over the lazy dog");
Asked
Active
Viewed 65 times
-1
Dhaval Marthak
- 17,246
- 6
- 46
- 68
Rohan Pawar
- 49
- 4
-
2what is the question? this is just a code – Ramon de Vries Jun 05 '20 at 10:32
-
1And the code works fine! What's the question? – Dhaval Marthak Jun 05 '20 at 10:33
-
@DhavalMarthak currently the code returns the *length* of the longest string, not the longest string itself. – A.J. Uppal Jun 05 '20 at 10:34
-
just the code for finding the longest word – Rohan Pawar Jun 05 '20 at 10:34
-
If you're asking about simplest, then yes ES6 syntax and using map is probably the way to go but if you're asking for fastest then you should say that – Andre Jun 05 '20 at 10:34
-
1split your string with a pattern, loop over array items and find item have the largest length – Vương Vũ Nguyễn Jun 05 '20 at 10:34
-
[Search results](https://www.google.com/search?q=longest+word+string+javascript+site:stackoverflow.com) for this question. Please read: [How much research effort is expected of Stack Overflow users?](https://meta.stackoverflow.com/a/261593/3082296) – adiga Jun 05 '20 at 10:36
-
@A.J.Uppal From the OP's comment, _just the code for finding the longest word_ it seems like this is a tutorial rather the question! – Dhaval Marthak Jun 05 '20 at 10:36
1 Answers
-2
You could try splitting on space, and then sort the resulting array by length using a lambda:
var input = "The quick brown fox jumped over the lazy dog";
var parts = input.split(" ");
parts.sort((a, b) => a.length < b.length ? 1 : -1);
console.log(parts[0]);The first element printed should correspond to the word in the original sentence which is the longest. Of course, this answer does not cater to ties, but if we wanted to handle ties, we could add more logic to the lambda use to sort.
Tim Biegeleisen
- 502,043
- 27
- 286
- 360
-
1Not my downvote, but this can be achieved with a simple loop with O(N - 1) time complexity, when sorting would have an average of O(N log N) – Cid Jun 05 '20 at 10:38
-
1@Cid They're asking for simplest, not fastest, not lowest time complexity, etc. – Andre Jun 05 '20 at 10:39