Array interview problem and Java code || Contains Duplicate :- Blind 75: Leetcode 217 || Hashset

#array #blind75 #hashSet

Learning Array problem for interview with java code, and optimal solution, with Big O time and space complexity. This will also be a walkthrough the problem, understanding core concept of array traversal, hashing, hashtable, sorting, sliding window and array traversal, using And and Or operator at binary level.

Perfect problem for beginners to understand how to use multiple data-structures to reach to optimal solution:

Not stopping till we get employed in FAANG.

List of Most Important Questions and Solutions:

GitHub Repository for Questions solved so far:

Problem asked recently in following companies in coding interview:
Amazon interview,
Adobe interview,
Google interview,
Bloomberg interview,
Microsoft interview,
Facebook interview,
Apple interview,
Uber interview,
tcs interview

My dream IT companies:

FAANG,
Facebook,
Google,
Amazon,
Netflix,
Microsoft,
apple,
doordash,
roblox,
stripe,
instacart,
uber,
lyft,
twitter,
linked In,
pinetrest,
bloomberg,
robinhood,
box,
two sigma,
byte dance,
tik tok,
air bnb,
nuro,
ui path,
oracle,
twitch,
data bricks,
waymo,
dropbox,
coinbase,
snowflake,
snap,
nvdia,
broadcom,
slack,
intel,
cisco,
indeed,
salesforce,
reddit,
wayfair,
okta,
splunk,
service now,
coursera,
square,
upgrade,
mozilla,
yelp,
unity,
ebay,
affirm,
stach adapt,
amplitude,
github,
wish,
brex,
etsy,
chime,
shopify,
amd,
GoDaddy,
IBM,

[DestinationFAANG]

Java Solution

class Solution {
public boolean containsDuplicate(int[] nums) {

HashSet<Integer> set = new HashSet<>();

for(int i=0; i< nums.length; i++){
if(set.contains(nums[i])){
return true;
}
else{
set.add(nums[i]);
}
}
return false;
}
}

[ngneerin]

# Set
def containsDuplicate(nums):
s = set()
for n in nums:
if n in s: return True
s.add(n)
return False