CODEKNACK IBM Question

Hey guys!!! I need help with this particular problem. Please help me out
I don’t have the particular question but will explain it in detail. Here it follows, given a string shorten it by removing the vowels(a,e,i,o,u) but on shortening the words if found duplicates append 1, 2 ,3 and so on to the number of occurrences of same duplicate word. Example:
Input 1 - bold and build
Output 1 - bld nd bld1

Input 2 - she learnt it bit by bit but didnot understand
Output 2 - sh lrnt t bt b bt1 bt2 ddnt ndrstnd