LC-2363 Easy LeetCode

2363. Merge Similar Items

Read the full problem statement on LeetCode.

Difficulty: easy Acceptance: 77% Topics: Array, Hash Table, Sorting, Ordered Set

Reading material

Arrays & Hashing 12 min Sorting 13 min Ordered Sets 11 min

Reference solution (spoiler · python)

# Time:  O((m + n) * log(m + n))
# Space: O(m + n)

# freq table, sort
class Solution(object):
    def mergeSimilarItems(self, items1, items2):
        """
        :type items1: List[List[int]]
        :type items2: List[List[int]]
        :rtype: List[List[int]]
        """
        return sorted((Counter(dict(items1))+Counter(dict(items2))).iteritems())

Solution from kamyu104/LeetCode-Solutions · MIT