## Amazon Interview Question for SDE-2s

Country: United States

Comment hidden because of low score. Click to expand.
1
of 1 vote

``````int GetDistinctCnt(TreeNode )
{
HashTable t = new HashTable();
GetMax(n, t);
return t.Count;
}

void GetMax(TreeNode n, HashTable t)
{
if(n!= null)
{
if(!t.ContainsKey(n.Value))
{
}
GetMax(n.Right, t);
GetMax(n.Left, t);
}
}``````

Comment hidden because of low score. Click to expand.
0
of 0 vote

public static int maxDistinct(Tree root){
Set<String> uniq = new HashSet<>();
if(root == null){
return 0;
}
return getMax(root, uniq);
}

private static int getMax(Tree root, Set uniq){
if(root == null){
return uniq.size();
}
int l = 0;
int r = 0;
l = getMax(root.left, uniq);
r = getMax(root.right, uniq);
uniq.remove(uniq.size()-1);
}
return Math.max(l,r);
}

Comment hidden because of low score. Click to expand.
0
of 0 vote

``````public static int getDisCnt(Tree root){
Set<String> uniq = new HashSet<>();
if(root == null){
return 0;
}
return getMaxHelper(root, uniq);
}

private static int getMaxHelper(Tree root, Set<String> uniq){
if(root == null){
return uniq.size();
}
int l = 0;
int r  = 0;
l = getMaxHelper(root.left, uniq);
r = getMaxHelper(root.right, uniq);
uniq.remove(uniq.size()-1);
}
else{
l = getMaxHelper(root.left, uniq);
r = getMaxHelper(root.right, uniq);
}
return Math.max(l, r);``````

}

Comment hidden because of low score. Click to expand.
0
of 0 vote

Use a hashset to keep track of unique nodes. While traversing the tree.

``````public static int getDisCnt(Tree root){
Set<String> uniq = new HashSet<>();
if(root == null){
return 0;
}
return getMaxHelper(root, uniq);
}

private static int getMaxHelper(Tree root, Set<String> uniq){
if(root == null){
return uniq.size();
}
int l = 0;
int r  = 0;
l = getMaxHelper(root.left, uniq);
r = getMaxHelper(root.right, uniq);
uniq.remove(uniq.size()-1);
}
else{
l = getMaxHelper(root.left, uniq);
r = getMaxHelper(root.right, uniq);
}
return Math.max(l, r);``````

}

Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

### Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

### Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.