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.
Cut the sticks
Cut the sticks
Sort by
recency
|
2143 Discussions
|
Please Login in order to post a comment
O(log n) solution Python3 using frequency method
O(log n) because of sorting of keys in dictionary
Simple Java Solution:
Python3 Solution
My code in python
Here is Cut the Sticks problem solution in python, java, c++, c and javascript - https://programmingoneonone.com/hackerrank-cut-the-sticks-problem-solution.html