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.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Cut the sticks
  5. Discussions

Cut the sticks

  • kus_maurya0000
     + 0 comments

    O(log n) solution Python3 using frequency method

    O(log n) because of sorting of keys in dictionary

    def cutTheSticks(arr):
    
    freq = {}
    for i in arr:
        freq[i] = freq.get(i, 0) + 1
    ans = []
    sticks_left = len(arr)
    for num in sorted(freq):
               
        ans.append(sticks_left)
        sticks_left -= freq[num]
    
    return ans