How to find items tied for most appearances in a list?

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
8
down vote

favorite












I want to create a list of the items in list w tied for appearing the most times in w. In other words, if 22 appears in w more than any other number, I want the result to be 22. If 34 and 55 appear the most times in w but the same number of times, I want the result to be 34,55.



The example below just uses a randomly generated list w. My method works but is ugly and inefficient.



w = RandomInteger[100, 200]
fw = w // DeleteDuplicates
wc = Counts[w]
m = Max[fw /. wc]
Reap[Do[If[(fw[[i]] /. wc) == m, Sow[fw[[i]]]], i, 1, Length[fw]]][[2, 1]]


Is there a tidier way?






list-manipulation







share|improve this question



























    up vote
    8
    down vote

    favorite












    I want to create a list of the items in list w tied for appearing the most times in w. In other words, if 22 appears in w more than any other number, I want the result to be 22. If 34 and 55 appear the most times in w but the same number of times, I want the result to be 34,55.



    The example below just uses a randomly generated list w. My method works but is ugly and inefficient.



    w = RandomInteger[100, 200]
    fw = w // DeleteDuplicates
    wc = Counts[w]
    m = Max[fw /. wc]
    Reap[Do[If[(fw[[i]] /. wc) == m, Sow[fw[[i]]]], i, 1, Length[fw]]][[2, 1]]


    Is there a tidier way?






    list-manipulation







    share|improve this question

























      up vote
      8
      down vote

      favorite









      up vote
      8
      down vote

      favorite











      I want to create a list of the items in list w tied for appearing the most times in w. In other words, if 22 appears in w more than any other number, I want the result to be 22. If 34 and 55 appear the most times in w but the same number of times, I want the result to be 34,55.



      The example below just uses a randomly generated list w. My method works but is ugly and inefficient.



      w = RandomInteger[100, 200]
      fw = w // DeleteDuplicates
      wc = Counts[w]
      m = Max[fw /. wc]
      Reap[Do[If[(fw[[i]] /. wc) == m, Sow[fw[[i]]]], i, 1, Length[fw]]][[2, 1]]


      Is there a tidier way?






      list-manipulation







      share|improve this question















      I want to create a list of the items in list w tied for appearing the most times in w. In other words, if 22 appears in w more than any other number, I want the result to be 22. If 34 and 55 appear the most times in w but the same number of times, I want the result to be 34,55.



      The example below just uses a randomly generated list w. My method works but is ugly and inefficient.



      w = RandomInteger[100, 200]
      fw = w // DeleteDuplicates
      wc = Counts[w]
      m = Max[fw /. wc]
      Reap[Do[If[(fw[[i]] /. wc) == m, Sow[fw[[i]]]], i, 1, Length[fw]]][[2, 1]]


      Is there a tidier way?






      list-manipulation




      list-manipulation






      share|improve this question















      share|improve this question













      share|improve this question




      share|improve this question








      edited yesterday

























      asked 2 days ago









      Jerry Guern

      1,954732




      1,954732




















          1 Answer
          1






          active

          oldest

          votes

















          up vote
          9
          down vote



          accepted










          You need Commonest:



          SeedRandom[1]
          w = RandomInteger[100, 200];

          Commonest[w]



          68, 25, 63




          % /. Counts[w]



          5, 5, 5







          share|improve this answer






















          • Thank you! The first part is exactly what I need. But you could explain how the syntax of the second part works? I don't even know how to look that up.
            – Jerry Guern
            2 days ago






          • 1




            @JerryGuern, thank you for the accept. About the last line: it gives the same result as 68, 25, 63 /. Counts[w]. % stands for the last result generated . (See Out (%) in the docs.) So the last line is the same as Count[w, #]&/@ 68,25,63. See also: Map (/@), Function (&) and Slot (#).
            – kglr
            2 days ago











          • Okay, thanks for the followup and links.
            – Jerry Guern
            yesterday










          Your Answer




          StackExchange.ifUsing("editor", function ()
          return StackExchange.using("mathjaxEditing", function ()
          StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
          StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
          );
          );
          , "mathjax-editing");

          StackExchange.ready(function()
          var channelOptions =
          tags: "".split(" "),
          id: "387"
          ;
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function()
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled)
          StackExchange.using("snippets", function()
          createEditor();
          );

          else
          createEditor();

          );

          function createEditor()
          StackExchange.prepareEditor(
          heartbeatType: 'answer',
          convertImagesToLinks: false,
          noModals: false,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: null,
          bindNavPrevention: true,
          postfix: "",
          onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          );



          );













           

          draft saved


          draft discarded


















          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f181652%2fhow-to-find-items-tied-for-most-appearances-in-a-list%23new-answer', 'question_page');

          );

          Post as a guest

















          1 Answer
          1






          active

          oldest

          votes








          1 Answer
          1






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes








          up vote
          9
          down vote



          accepted










          You need Commonest:



          SeedRandom[1]
          w = RandomInteger[100, 200];

          Commonest[w]



          68, 25, 63




          % /. Counts[w]



          5, 5, 5







          share|improve this answer






















          • Thank you! The first part is exactly what I need. But you could explain how the syntax of the second part works? I don't even know how to look that up.
            – Jerry Guern
            2 days ago






          • 1




            @JerryGuern, thank you for the accept. About the last line: it gives the same result as 68, 25, 63 /. Counts[w]. % stands for the last result generated . (See Out (%) in the docs.) So the last line is the same as Count[w, #]&/@ 68,25,63. See also: Map (/@), Function (&) and Slot (#).
            – kglr
            2 days ago











          • Okay, thanks for the followup and links.
            – Jerry Guern
            yesterday














          up vote
          9
          down vote



          accepted










          You need Commonest:



          SeedRandom[1]
          w = RandomInteger[100, 200];

          Commonest[w]



          68, 25, 63




          % /. Counts[w]



          5, 5, 5







          share|improve this answer






















          • Thank you! The first part is exactly what I need. But you could explain how the syntax of the second part works? I don't even know how to look that up.
            – Jerry Guern
            2 days ago






          • 1




            @JerryGuern, thank you for the accept. About the last line: it gives the same result as 68, 25, 63 /. Counts[w]. % stands for the last result generated . (See Out (%) in the docs.) So the last line is the same as Count[w, #]&/@ 68,25,63. See also: Map (/@), Function (&) and Slot (#).
            – kglr
            2 days ago











          • Okay, thanks for the followup and links.
            – Jerry Guern
            yesterday












          up vote
          9
          down vote



          accepted







          up vote
          9
          down vote



          accepted






          You need Commonest:



          SeedRandom[1]
          w = RandomInteger[100, 200];

          Commonest[w]



          68, 25, 63




          % /. Counts[w]



          5, 5, 5







          share|improve this answer














          You need Commonest:



          SeedRandom[1]
          w = RandomInteger[100, 200];

          Commonest[w]



          68, 25, 63




          % /. Counts[w]



          5, 5, 5








          share|improve this answer














          share|improve this answer



          share|improve this answer








          edited yesterday

























          answered 2 days ago









          kglr

          159k8184384




          159k8184384











          • Thank you! The first part is exactly what I need. But you could explain how the syntax of the second part works? I don't even know how to look that up.
            – Jerry Guern
            2 days ago






          • 1




            @JerryGuern, thank you for the accept. About the last line: it gives the same result as 68, 25, 63 /. Counts[w]. % stands for the last result generated . (See Out (%) in the docs.) So the last line is the same as Count[w, #]&/@ 68,25,63. See also: Map (/@), Function (&) and Slot (#).
            – kglr
            2 days ago











          • Okay, thanks for the followup and links.
            – Jerry Guern
            yesterday
















          • Thank you! The first part is exactly what I need. But you could explain how the syntax of the second part works? I don't even know how to look that up.
            – Jerry Guern
            2 days ago






          • 1




            @JerryGuern, thank you for the accept. About the last line: it gives the same result as 68, 25, 63 /. Counts[w]. % stands for the last result generated . (See Out (%) in the docs.) So the last line is the same as Count[w, #]&/@ 68,25,63. See also: Map (/@), Function (&) and Slot (#).
            – kglr
            2 days ago











          • Okay, thanks for the followup and links.
            – Jerry Guern
            yesterday















          Thank you! The first part is exactly what I need. But you could explain how the syntax of the second part works? I don't even know how to look that up.
          – Jerry Guern
          2 days ago




          Thank you! The first part is exactly what I need. But you could explain how the syntax of the second part works? I don't even know how to look that up.
          – Jerry Guern
          2 days ago




          1




          1




          @JerryGuern, thank you for the accept. About the last line: it gives the same result as 68, 25, 63 /. Counts[w]. % stands for the last result generated . (See Out (%) in the docs.) So the last line is the same as Count[w, #]&/@ 68,25,63. See also: Map (/@), Function (&) and Slot (#).
          – kglr
          2 days ago





          @JerryGuern, thank you for the accept. About the last line: it gives the same result as 68, 25, 63 /. Counts[w]. % stands for the last result generated . (See Out (%) in the docs.) So the last line is the same as Count[w, #]&/@ 68,25,63. See also: Map (/@), Function (&) and Slot (#).
          – kglr
          2 days ago













          Okay, thanks for the followup and links.
          – Jerry Guern
          yesterday




          Okay, thanks for the followup and links.
          – Jerry Guern
          yesterday

















           

          draft saved


          draft discarded















































           


          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f181652%2fhow-to-find-items-tied-for-most-appearances-in-a-list%23new-answer', 'question_page');

          );

          Post as a guest
































































          Comments

          Post a Comment

          Popular posts from this blog

          Long meetings (6-7 hours a day): Being “babysat” by supervisor

          Image
          Clash Royale CLAN TAG #URR8PPP .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty margin-bottom:0; up vote 31 down vote favorite 4 I hold a PhD in mechanical engineering with a 7 year background in self-guided, self-paced research including 2 years as a graduate level course instructor and a subject matter expert for various engineering projects in a university setting in the United States. For the last 10-11 months, I am working in a research industry in France where my task is to debug C++ spaghetti code written over a period of several years by my current supervisor. It is a team of 2: just I and my supervisor. Diurnally, I am posed with a "bug of the day" to get out of this C++ code. My supervisor generally gives me about 15-30 minutes to solve it and then accosts me about whether or not the task is completed and then rinses and repeats this until the end of the day. Off-late, my supervisor has been holding 6-7 hour long "meetin
          Read more

          Is the Concept of Multiple Fantasy Races Scientifically Flawed? [closed]

          Image
          Clash Royale CLAN TAG #URR8PPP up vote 2 down vote favorite Many fantasy worlds have multiple humanoid species (elves, orcs, humans, etc) living in the same world, in addition to that, they often have the ability to interbreed. And I can't help but question their believability... fantasy-races reproduction interspecies-relations share | improve this question edited Aug 9 at 14:46 Michael Kjörling ♦ 21.1k 10 85 161 asked Aug 9 at 13:13 Chlodio 118 6 closed as unclear what you're asking by MichaelK, Gryphon, John, Vincent, Frostfyre Aug 9 at 15:25 Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question. 3 Stack Exchange exist to
          Read more

          Confectionery

          Image
          Prepared foods made with a lot of sugar or other cabohydrates "Sweetmeat" redirects here. For the racehorse, see Sweetmeat (horse). Not to be confused with Sweetbread. This Kransekake is a traditional Scandinavian baker's confection. Confectionery is the art of making confections , which are food items that are rich in sugar and carbohydrates. Exact definitions are difficult. [1] In general, though, confectionery is divided into two broad and somewhat overlapping categories, bakers' confections and sugar confections. [2] Bakers' confectionery, also called flour confections , includes principally sweet pastries, cakes, and similar baked goods. Sugar confectionery includes candies ( sweets in British English), candied nuts, chocolates, chewing gum, bubble gum, pastillage, and other confections that are made primarily of sugar. In some cases, chocolate confections (confections made of chocolate) are treated as a separate category, as are sugar-free versions of
          Read more