Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
LinkBack URL
About LinkBacks
Java Algorithms - Find the skyline of a group of buildings
Given a group of buildings, we have to find the resulting skyline.
The brute force solution can be done in O(n2).
The most efficient solution to the problem involves using the divide and conquer technique
The solution to the problem along with the Java code is given at Find the skyline of a group of buildings – The Coding Interview Blog
This solution can be done in O(nlogn)
Reply With Quote