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.
Collections.sort(unsorted, (a, b) -> {
// Compare by length first
int lenA = a.length();
int lenB = b.length();
if (lenA != lenB) {
return lenA - lenB;
}
// If lengths are equal, compare lexicographically
return a.compareTo(b);
});
return unsorted;
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Big Sorting
You are viewing a single comment's thread. Return to all comments →
Java8
Collections.sort(unsorted, (a, b) -> { // Compare by length first int lenA = a.length(); int lenB = b.length(); if (lenA != lenB) { return lenA - lenB; } // If lengths are equal, compare lexicographically return a.compareTo(b); }); return unsorted;