Level: Easy
Topics: Array, Hash Table, Two Pointers, Binary Search, Sorting
Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must be unique and you may return the result in any order.
Example...
![[TypeScript] 자료 구조로 담아내기. #6 - 배열(with. 이진 탐색)](https://cdn.hashnode.com/res/hashnode/image/stock/unsplash/B0jijv2X-U8/upload/248ea6fa1aafed32e19fcde9f6942f56.jpeg)
