CareerCup

Test1:
int list1 = {1, 2, 3, 4, 5};
len1 = 5;
int list2 = {1, 2, 3, 4, 5};
len2 = 5;

Test2:
int list1 = {1, 2, 3, 4, 5};
len1 = 5;
int list2 = {0, 0, 0, 0, 0};
len2 = 5;

etc ...

pseudo code

1. put list 1 in hash table
2. use a pointer, go from beginning to end of list 2 and do hash look-up. if there is a match, point current->next to current->next->next. delete current->next. move on to the next one and repeat til NULL.

3. count how many is left in list 2.

Test Cases:

1. Unsorted lists
2. Sorted Lists
3. Lists of different types
4. Lists containing alpha numeric elements.

Any other test cases ?

1. lists of equal length
2. lists of unequal length
3. empty lists (both l1 and l2)
4. lists with all 0s or -ve numbers (both l1 and l2)
5. lists will non integer values
6. lists with repeating values in sorted and unsorted order