---
title: "Discussion on \"Leetcode POTD - Intersection of Two Arrays II\" | Hashnode"
description: "Discussion on \"Leetcode POTD - Intersection of Two Arrays II\". Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must appear as many times as it shows in both arrays and you may return the result in any order.\nExample 1:\nInput: nums1 = [1,2,2,1], nums2 = ..."
url: "https://hashnode.com/posts/leetcode-potd-intersection-of-two-arrays-ii/668397294cc57cc043868792"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Leetcode POTD - Intersection of Two Arrays II](https://mahekgor.hashnode.dev/leetcode-potd-intersection-of-two-arrays-ii?utm_source=hashnode&utm_medium=feed)

Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must appear as many times as it shows in both arrays and you may return the result in any order. Example 1: Input: nums1 = \[1,2,2,1\], nums2 = ...

Jul 2, 2024 · 2 min read · mahekgor.hashnode.dev  
Read the article

-   [#leetcode-solution](https://hashnode.com/tag/leetcode-solution)

## Written by

[Mahek Gor](https://hashnode.com/@MahekGor)

@MahekGor · Gandhinagar, India

  
[View profile](https://hashnode.com/@MahekGor)

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
