256. Intersection of Two Arrays II (Sorted Result)

Write a function solve that returns the intersection of two arrays nums1 and nums2, where each element in the result should appear as many times as it shows in both arrays. Return the result sorted ascending for determinism.

Example:
Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2,2]

Run this challenge interactively in Python or JavaScript when the app loads.