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

Cut the sticks

Sort 1572 Discussions, By:

  • RodneyShag
     + 18 comments

    Java solution - passes 100% of test cases

    From my HackerRank solutions.

    Hint: Sort the array

    import java.util.Scanner;
import java.util.Arrays;

public class Solution {
    public static void main(String[] args) {
        /* Save Input */
        Scanner scan = new Scanner(System.in);
        int numSticks = scan.nextInt();
        int [] array = new int[numSticks];
        for (int i = 0; i < numSticks; i++) {
            array[i] = scan.nextInt();
        }
        scan.close();
        
        Arrays.sort(array);
        
        System.out.println(array.length);
        for (int i = 1; i < array.length; i++) {
            if (array[i] != array[i-1]) {
                System.out.println(array.length - i);
            }
        }
    }
}

    For input

    6
5 4 4 2 2 8

    we sort the array and get

    2 2 4 4 5 8

    Our output is

    6 // we always print the full size of array before the for loop
4 // since array[2] != array[1]
2 // since array[4] != array[3]
1 // since array[5] != array[4]

    As we traverse the array from left to right, every time we reach a new number, we can consider that as "cutting the sticks" for the numbers we already traverse.

  • OguzhanKacamak
     + 19 comments

    The approach at Cpp solution on editorial seems like a bit complex for such a question.Here more simple one https://www.hackerrank.com/challenges/cut-the-sticks/submissions/code/12425510

  • Coder_AMiT
     + 6 comments

    all you need to do is delete the smallest element from list n then print the lenth of list

    print(len(arr))
while True:                 
    arr = [x for x in arr if x != min(arr)] 
    if len(arr)==0:
        break
    print(len(arr))

  • tobyond
     + 4 comments

    Ruby using while loop:

    while arr.length > 0
  p arr.length
  arr.delete(arr.min)
end

  • omalsa04
     + 4 comments

    I don't understand why all of the Editorial code is so complicated. You can simply sort the list and then loop through in one pass.

    https://www.hackerrank.com/challenges/cut-the-sticks/submissions/code/12092076

Load more conversations