We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  • Hackerrank Home
  • Prepare
    NEW
  • Certify
  • Compete
  • Career Fair
  • Hiring developers?
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Migratory Birds
  5. Discussions

Migratory Birds

Problem
Submissions
Leaderboard
Discussions
Editorial

    You are viewing a single comment's thread. Return to all comments →

  • wael_hassine0
    2 months ago+ 0 comments

    Solution using JS let newArr = arr.slice().sort(), most = [undefined, 0], counter = 0;
    newArr.reduce(function(old, chr){ old == chr ? ++counter > most[1] && (most = [chr, counter]) : (counter = 1) return chr }); return most[0];

    0|
    Permalink
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy