fearless Coder
BAN USERint height(int arr[])
{
HashMap h = new HashMap();
for(int i =0 ;i<arr.length;i++)
{
if(h.get(arr[i]) ! = null)
{
h.put(arr[i], '1');
}
}
return h.size();
}
Isn't this correct
- fearless Coder March 22, 2012I think its just a tricky one.Every one knows the answer. :)
say : n= 8
8/2 = 4, 8%2 = 0
4/2 = 2 ,4%2=0
2/2=1, 2%2 =0
O(lg n)
findNthMax(a[],n)
{
if(a.length<n)
{
throw new Exception("No Sufficient Data");
}else
{
Queue q;
for(int i =0; i<a.length;i++)
{
if(a[i] >= q.peek(q.front))
{
if(q.isEmpty() || q.size() ! = n)
{
q.insert(a[i]);
}else{
q.delete();
q.insert(a[i]);
}
}
}
SOP("nth largest element:::" + q.delete());
}
}
Its O(n)
delete(Node n)
{
if(n.next == null)
{
n=null;
return;
}
n.data = n.next.data;
delete(n.next);
}
For Coffee -- Use Decorator.
- fearless Coder July 25, 2014For Coffee Shops -- Use Builder as multiple shops needs to be opened.