LeetCode 350: Array Intersection II | JavaScript Solution

Published: 18 June 2025
on channel: Crappy Coder

In this video, I solve LeetCode 350: Intersection of Two Arrays II using a Map-based frequency count approach in JavaScript.

Unlike LeetCode 349 (unique intersection), this version requires you to include duplicates as many times as they appear in both arrays.

✅ Step-by-step breakdown:

Count each number in nums1 using a Map

Iterate over nums2 and check if the number exists with positive count

Add to result array and decrement the count

Time Complexity: O(n + m)
Space Complexity: O(n)

This solution is fast, easy to read, and perfect for interviews where you’re asked to manage element frequency.

Chapters:
0:00 - Problem Explanation
1:18 - Strategy Overview
3:50 - JavaScript Code Walkthrough
5:23 - Time & Space Analysis

💬 Want to see the same solution using sorting and two pointers? Comment below!

#leetcode350 #arrayintersection #javascript #frequencycounter #interviewprep #leetcodejavascript #codingchallenge

On this page of the site you can watch the video online LeetCode 350: Array Intersection II | JavaScript Solution with a duration of hours minute second in good quality, which was uploaded by the user Crappy Coder 18 June 2025, share the link with friends and acquaintances, this video has already been watched 7 times on youtube and it was liked by 1 viewers. Enjoy your viewing!