Finding longest string in array

Question

Is there a short way to find the longest string in a string array   Something like arr Max x   gt  x Length

User · Answer

Using Array prototype -  sort is similar to what was posted by  katsPaugh and  deceze while I was doing a fiddle   DEMO HERE  var arr          2 --        3 ---        4 ----        1 -        5 -----      Array prototype longest function         return this sort        function a b              if  a length  gt  b length  return -1          if  a length  lt  b length  return 1            return 0               0     alert arr longest

User · Answer

Came here for the solution  but could not understand much  posting my version  const getLongestStr    longestStr  str    gt      return longestStr length  gt  str length   longestStr   str    var input     ali    Shahenshah    naqvi    hm    var longest   input reduce getLongestStr   quot  quot

User · Answer

I see the shortest solution   function findLong s     return Math max apply null  s split      map w   gt  w length

User · Answer

In ES6 this could be accomplished with a reduce   call in O n  complexity as opposed to solutions using sort   which is O nlogn     x000D   x000D  const getLongestText    arr    gt  arr reduce  x000D     savedText  text    gt   text length  gt  savedText length   text   savedText   x000D        x000D     x000D   x000D  console log getLongestText   word    even-longer-word    long-word     x000D   x000D   x000D

User · Answer

var arr      fdgdfgdfg    gdfgf    gdfgdfhawsdgd    gdf    gdfhdfhjurvweadsd     arr sort function  a  b    return b length - a length    0

User · Answer

I will do something like this   function findLongestWord str    var array   str split       var maxLength array 0  length  for var i 0  i  lt  array length  i       if array i  length  gt  maxLength  maxLength   array i  length  return maxLength    findLongestWord  What if we try a super-long word such as otorhinolaryngology

User · Answer

This is my simple solution var arr     quot you quot    quot are quot    quot the quot    quot love quot    quot of quot    quot my quot    quot life quot    var sorted   arr sort function  a  b        return b length - a length       console log sorted 0

User · Answer

var array     hello   falsey   undefined    var findLongestWord   function array       var longest   array reduce function a b       return  a length  gt  b length    a   b            return longest    findLongestWord array

User · Answer

Maybe not the fastest  but certainly pretty readable   function findLongestWord array      var longestWord          array forEach function word        if word length  gt  longestWord length          longestWord   word                 return longestWord     var word   findLongestWord   The   quick   brown    fox    jumped    over    the    lazy    dog     console log word      result is  jumped    The array function forEach has been supported since IE9

User · Answer

In case you expect more than one maximum this will work     maxBy Object entries   groupBy x  y   gt  y length    y   gt  parseInt y 0    1    It uses lodash and returns an array

User · Answer

With ES6 supported also duplicate string   var allLongestStrings   arrayOfStrings   gt      let maxLng   Math max    arrayOfStrings map  elem   gt  elem length     return arrayOfStrings filter elem   gt  elem length     maxLng     let arrayOfStrings     aba    aa    ad    vcd   aba    console log allLongestStrings arrayOfStrings

User · Answer

I provide a functional recursive approach  See comments to understand how it works    x000D   x000D  const input1     a    aa    aaa   x000D  const input2     asdf    qwer    zxcv   x000D  const input3     asdfasdf fdasdf a sd f     asdfsdf    asdfasdfds    asdfsdf    asdfsdaf   x000D  const input4     ddd    dddddddd    dddd    ddddd    ddd    dd    d    d    dddddddddddd   x000D   x000D     Outputs which words has the greater length x000D     greatestWord    String - gt  String - gt  String x000D  const greatestWord   x   gt  y   gt   x000D        x length  gt  y length   x   y x000D         x000D     Recursively outputs the first longest word in a series x000D     longestRec    String - gt   String  - gt  String x000D  const longestRec   longestWord   gt     nextWord     words      gt  x000D                                                       x000D           Destructuring lets us get the next word  and remaining ones  x000D        nextWord     lt -- If next word is undefined  then it won t recurse  x000D            longestRec  greatestWord  nextWord   longestWord    words   x000D            longestWord x000D   x000D   x000D     Outputs the first longest word in a series x000D     longest     String  - gt  String x000D  const longest   longestRec      x000D   x000D  const output1   longest  input1  x000D  const output2   longest  input2   x000D  const output3   longest  input3  x000D  const output4   longest  input4  x000D   x000D  console log   output1     output1  x000D  console log   output2     output2  x000D  console log   output3     output3  x000D  console log   output4     output4  x000D   x000D   x000D

User · Answer

I was inspired of Jason s function and made a little improvements to it and got as a result rather fast finder   function timo longest a      var c   0  d   0  l   0  i   a length    if  i  while  i--        d   a i  length      if  d  gt  c          l   i  c   d              return a l     arr   First    Second    Third    var longest   timo longest arr     Speed results  http   jsperf com longest-string-in-array 7

User · Answer

var longest    arr    gt      let sum   0   arr map  e    gt        sum   e length  gt  sum   e length   sum        return sum     it can be work

User · Answer

A new answer to an old question  in ES6 you can do shorter   Math max     x map el   gt  el length

User · Answer

Modern browsers support a for   of loop  The fastest and shortest way to solve this problem in Chrome  Safari  Edge  and Firefox is also the clearest   let largest       for  let item of arr      if  item length  gt  largest length  largest   item     In IE  you can use Array forEach  that s still faster and clearer than sorting or reducing the array   var largest       arr forEach function item      if  item length  gt  largest length  largest   item

User · Answer

If your string is already split into an array  you ll not need the split part   function findLongestWord str      str   str split         var longest   0     for var i   0  i  lt  str length  i           if str i  length  gt   longest           longest   str i  length                      return longest    findLongestWord  The quick brown fox jumped over the lazy dog

User · Answer

I would do something like this  x000D   x000D  var arr        first item      second item is longer than the third one      third longish item      var lgth   0  var longest   for  var i   0  i  lt  arr length  i        if  arr i  length  gt  lgth        var lgth   arr i  length      longest   arr i          console log longest   x000D   x000D   x000D

User · Answer

function allLongestStrings array        const newArr         let temp      Math max     array map el   gt  el length              array forEach item   gt            if temp    item length             newArr push item                         return newArr

User · Answer

Available since Javascript 1 8 ECMAScript 5 and available in most older browsers  var longest   arr reduce      function  a  b            return a length  gt  b length   a   b            Otherwise  a safe alternative  var longest   arr sort      function  a  b            return b length - a length          0

User · Answer

function findLongestWord str      str   str split         var sorted   str sort function prev current       return prev length - current length             var index   sorted length    str   sorted index-1     return str    findLongestWord  The quick brown fox jumped over the lazy dog

[javascript] Finding longest string in array

DEMO HERE

Examples related to javascript