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

    HackerRank

  • |
  • Prepare
  • Certify
  • Compete
  • Hiring developers?
  1. Prepare
  2. Algorithms
  3. Sorting
  4. Big Sorting
  5. Discussions

Big Sorting

Problem
Submissions
Leaderboard
Discussions
Editorial

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

  • farukcan
    4 months ago+ 0 comments

    C# best solution 9/9

        public static List<string> bigSorting(List<string> unsorted)
        {
            unsorted.Sort((a,b)=>{
                if(a.Length!=b.Length) return a.Length-b.Length;
                int strLen = a.Length;
                for(int v = 0; v < strLen; v++){
                    if( a[v] == b[v] ) continue;
                    if( a[v] > b[v] ) return 1;
                    return -1;
                }
                return 0;
            });
            return unsorted;
        }
    		
    
    0|
    Permalink
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy