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. Implementation
  4. Cut the sticks
  5. Discussions

Cut the sticks

Problem
Submissions
Leaderboard
Discussions
Editorial
Topics

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

  • mennadiego
    2 months ago+ 0 comments

    C#

     public static List<int> cutTheSticks(List<int> arr)
        {
            List<int> stickCut = new List<int>();
    
            stickCut.Add(arr.Count);
    
            arr.Sort();
    
            while (arr.Count > 0)
            {
                int min = arr[0];
                for (int i = 0; i < arr.Count; i++)
                {
                    arr[i] = arr[i] - min;
                }
                arr.RemoveAll(x => x == 0);
                stickCut.Add(arr.Count);
            }
            stickCut.RemoveAt(stickCut.Count - 1);
            return stickCut;
    
        }
    
    0|
    Permalink
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy