CareerCup

@Madhur do u think set can have duplicate into it?

Given a list with duplicate values find the first unique elements in it.
and From Ex : BH BH F AL HJ AL HJ PK
according to ur logic the O/P should be F PK

how u will decide which one is First Unique element?

Yeah make the recursive call to get the solution

I need the first unique element
my solution is :

1. Insert the elements of the list into hashmap as Key and a count as value.
2. Before insert check the key into hashmap
if the key is present make the value as negative
else insert into the hashmap and increase the count value

3. After iterating the whole list,search for the key whose value is least +ve value
and that is the answer.

It's a regular technical interview

public static boolean isAnagram(String word, String anagram) { 
		if(word.length() != anagram.length())
			return false; 
		char[] chars = word.toCharArray(); 
		for(char c : chars)
		{ 
			int index = anagram.indexOf(c); 
			if(index != -1){ 
				anagram = anagram.substring(0,index) + 
						anagram.substring(index +1, anagram.length()); 
				}
			else { 
				return false; 
				} 
		} 
		return anagram.isEmpty(); 
	}

Time Complexity: O(n)

1) Sort the elements.
2) Now in a loop, remove duplicates by comparing the current character with previous character.
3) Remove extra characters at the end of the resultant string.
Time Complexity: O(nlogn) and Space Complexity: O(1)

public void setNext(ListNode node) {
	this.node = node;
	}
public void getNext() {
	return this.next;
	}

ListNode ReverseList(ListNode head) {
	ListNode temp = null,nextNode = null;
	while(head != null) {
		nextNode = head.getNext();
		head.setNext(temp);
		temp = head;
		head = nextNode;
	}
	return temp;
}

Time complexity:O(n) Space Complexity:O(1)

Hi,
I just want to know why you have added this condition

if(carrier)	{
	sum += 1;
}

and also we shouldn't validate max sum as 18 as it can be one digit as 9 and 9 so shouldn't we consider the sum >= 18 instead of 10.