InterviewBit Problems
WoodCutting Made Easy! : Solved
About the WoodCutting Made Easy! : Solved category
(1)
Java O(N) time O(N) space sol with coments
(1)
Very easy python NLogN
(1)
Use long int (C++ solution)
(1)
Even Bruteforce did it
(1)
Easy peasy Cpp solution O(NlogN)
(1)
Easy python code : O(N*logN)
(1)
Using long long int while calculating wooden cutting to avoid wrong answer during submission
(1)
Simple C++ Soln - O(nlogn) time & O(1) space
(1)
Same approach as the question "Allocate books"
(3)
6 lines C++ O(nlogn)
(3)
Easy Binary Search Solution
(1)
Easy to solve c++
(1)
Easy C++ solution logn
(2)
Easy C++ solution using binary search with proper explanation
(1)
Simple Binary Search approach
(1)
O(n) solution using extra space
(2)
Code without using binary search
(2)
Sorting + binary search : O(nlongn)
(1)
Simple Solution : C++
(1)
Just a logical solution
(2)
Cpp Code without sorting
(1)
Easy approach...Similar to painters problem or book allocation approach
(1)
WoodCutting is really easy if you sort it!
(1)
The purpose of this question
(1)
Simple binary search c++ solution use long long to avoid overflow
(1)
Solution Cpp very easy and stupid
(1)
SOLUTION :: If wanna solve in conceptual way , it is same as allocation of books
(1)
Simple and easy cpp solution
(1)
Simple O(NlogN) solution using Sorting
(1)
next page →