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.
This can be solved by sorting the lengths initially, that way the worst case time complexity is just O(n log n). Have a look if you find this solution better !
Maximum Perimeter Triangle
You are viewing a single comment's thread. Return to all comments →
This can be solved by sorting the lengths initially, that way the worst case time complexity is just O(n log n). Have a look if you find this solution better !