Add Leetcode solution for problem number 454(4Sum II)

[UtkarshBirla28]

Is there an existing issue for this?

• I have searched the existing issues

Feature Description

Given four integer arrays nums1, nums2, nums3, and nums4 all of length n, return the number of tuples (i, j, k, l) such that:

0 <= i, j, k, l < n
nums1[i] + nums2[j] + nums3[k] + nums4[l] == 0

Use Case

Input: nums1 = [1,2], nums2 = [-2,-1], nums3 = [-1,2], nums4 = [0,2]
Output: 2
Explanation:
The two tuples are:

1. (0, 0, 0, 1) -> nums1[0] + nums2[0] + nums3[0] + nums4[1] = 1 + (-2) + (-1) + 2 = 0
2. (1, 1, 0, 0) -> nums1[1] + nums2[1] + nums3[0] + nums4[0] = 2 + (-1) + (-1) + 0 = 0

Benefits

No response

Add ScreenShots

No response

Priority

High

Record

• I have read the Contributing Guidelines
• I'm a GSSOC'24 contributor
• I have starred the repository

[github-actions]

Hi @UtkarshBirla28! 👋 Thank you for opening your first issue on CodeHarborHub. We're excited to hear your thoughts and help you out. You've raised a great topic! Please provide as much detail as you can so we can assist you effectively. Welcome aboard!

[github-actions]

Hi @UtkarshBirla28! Thanks for opening this issue. We appreciate your contribution to this open-source project. Your input is valuable and we aim to respond or assign your issue as soon as possible. Thanks again!

[UtkarshBirla28]

@ajay-dhangar Sir please add respective labels

[UtkarshBirla28]

/assign me