Do vote 😊😊

Programmer Presents 2022
http://www.i-programmer.info/news/99-professional/15884-programmer-presents-2022.html

As the holiday season approaches, what can you get the programmer who has everything? How about some festive wear? A garment with a geeky message might seem predictable, but we found several that made us chortle, including Clippy making a comeback on a really ugly sweater.

Read more... (http://www.i-programmer.info/news/99-professional/15884-programmer-presents-2022.html)

Python series 2 part 1

Join my Bot for updates about technology and new ideas 💡

Whatever is posted here is absolutely free to learn just spend your valuable time for these super valuable experiences we are providing

Everyone who does come today at 9am sharp class will start for spring and spring boot

18. 4Sum

Level :- medium

Given an array nums of n integers, return an array of all the unique quadruplets [nums[a], nums[b], nums[c], nums[d]] such that:

0 <= a, b, c, d < n
a, b, c, and d are distinct.
nums[a] + nums[b] + nums[c] + nums[d] == target
You may return the answer in any order.



Example 1:

Input: nums = [1,0,-1,0,-2,2], target = 0
Output: [[-2,-1,1,2],[-2,0,0,2],[-1,0,0,1]]
Example 2:

Input: nums = [2,2,2,2,2], target = 8
Output: [[2,2,2,2]]


Constraints:

1 <= nums.length <= 200
-109 <= nums[i] <= 109
-109 <= target <= 109