Easy Solution
Intuition\nSimple Dart programing\n\n# Approach\nsimple approach using predefined functions\n\n# Complexity\n- Time complexity:\n\n\n- Space complexity:\n\n\n# 
# Intuition\nSimple Dart programing\n\n# Approach\nsimple approach using predefined functions\n\n# Complexity\n- Time complexity:\n\n\n- Space complexity:\n\n\n# Code\n```\nclass Solution {\n  List<int> findIntersectionValues(List<int> nums1, List<int> nums2) {\n    nums1.sort();\n    nums2.sort();\n\n    Set<int> set1 = nums1.toSet();\n    Set<int> set2 = nums2.toSet();\n\n    int count1 = nums1.where((element) => set2.contains(element)).length;\n    int count2 = nums2.where((element) => set1.contains(element)).length;\n\n    return [count1, count2];\n  }\n}\n\n```
['Dart']