Forwarded from Java Hyd Team
Which topic you want to learn from scratch
Anonymous Poll
56%
Array
49%
Collection
44%
Multi threading
42%
Exception handling
40%
Strings
28%
Interfaces n abstract methods
40%
Java 8
Forwarded from Codeerror
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)
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)
Need to learn spring and spring boot ??
Anonymous Poll
93%
Yes , I need super assistance from employees
7%
No , i don't need assistance i am expert
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
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
Top LeetCode posts that you cannot miss"
1) For Online Assessment + Phone Screen + Onsite Rounds:
- https://lnkd.in/dXB7xbsc
- https://lnkd.in/dhgnCHDh
- https://lnkd.in/dV65F9s2
- https://lnkd.in/dmMsTEXb
- https://lnkd.in/dyCbzm7P
- https://lnkd.in/dvPHRbi3
- https://lnkd.in/d5C5AfDB
2) For Behavioural Rounds:
- https://lnkd.in/daWKBYxu
- https://lnkd.in/d2VThaPC
- https://lnkd.in/dUAGGSRg
- https://lnkd.in/dV9kQ2e9
- https://lnkd.in/dRsXPyfW
3) For System Design Rounds (LLD + HLD):
- https://lnkd.in/dYqeeU8v
- https://lnkd.in/gZ_AEPTP
- https://lnkd.in/dFXbu9sk
- https://lnkd.in/dCcyUVuJ
- https://lnkd.in/dcu9mZeF
- https://lnkd.in/dFBM9aPg!
- https://lnkd.in/ddv7-88p
4) Top Interview Experiences to go through:
- https://lnkd.in/dzJnpSMN
- https://lnkd.in/dD4dUvtf
- https://lnkd.in/d5pRRErH)
- https://lnkd.in/d2fpNAfa
- https://lnkd.in/dp98-KV7
- https://lnkd.in/d57qTJKU.
- https://lnkd.in/dmEBEKBU
5) Some Strategies To Follow:
- https://lnkd.in/dZP38bKc
- https://lnkd.in/dmp3zkMr
- https://lnkd.in/dMsw4YB6)
- https://lnkd.in/djxydmHe
#save & #share this post π―
It consists of most of the posts related to FAANGπ₯π―.
1) For Online Assessment + Phone Screen + Onsite Rounds:
- https://lnkd.in/dXB7xbsc
- https://lnkd.in/dhgnCHDh
- https://lnkd.in/dV65F9s2
- https://lnkd.in/dmMsTEXb
- https://lnkd.in/dyCbzm7P
- https://lnkd.in/dvPHRbi3
- https://lnkd.in/d5C5AfDB
2) For Behavioural Rounds:
- https://lnkd.in/daWKBYxu
- https://lnkd.in/d2VThaPC
- https://lnkd.in/dUAGGSRg
- https://lnkd.in/dV9kQ2e9
- https://lnkd.in/dRsXPyfW
3) For System Design Rounds (LLD + HLD):
- https://lnkd.in/dYqeeU8v
- https://lnkd.in/gZ_AEPTP
- https://lnkd.in/dFXbu9sk
- https://lnkd.in/dCcyUVuJ
- https://lnkd.in/dcu9mZeF
- https://lnkd.in/dFBM9aPg!
- https://lnkd.in/ddv7-88p
4) Top Interview Experiences to go through:
- https://lnkd.in/dzJnpSMN
- https://lnkd.in/dD4dUvtf
- https://lnkd.in/d5pRRErH)
- https://lnkd.in/d2fpNAfa
- https://lnkd.in/dp98-KV7
- https://lnkd.in/d57qTJKU.
- https://lnkd.in/dmEBEKBU
5) Some Strategies To Follow:
- https://lnkd.in/dZP38bKc
- https://lnkd.in/dmp3zkMr
- https://lnkd.in/dMsw4YB6)
- https://lnkd.in/djxydmHe
#save & #share this post π―
It consists of most of the posts related to FAANGπ₯π―.
lnkd.in
LinkedIn
This link will take you to a page thatβs not on LinkedIn