Running time complexity: 3n + k) Space time complexity: O(n + k) Stable algorithm

Sort from least significant position to most significant position

Runtime of findLargestStrings is O((n+m)log(m)) Space complexity is O(m)