Unique morse code words question

See more:

C

Question:
International Morse Code defines a standard encoding where each letter is mapped to a series of dots and dashes, as follows: "a" maps to ".-", "b" maps to "-...", "c" maps to "-.-.", and so on.
For convenience, the full table for the 26 letters of the English alphabet is given below:
[".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."]

Now, given a list of words, each word can be written as a concatenation of the Morse code of each letter. For example, "cab" can be written as "-.-..--...", (which is the concatenation "-.-." + ".-" + "-..."). We'll call such a concatenation, the transformation of a word.

Return the number of different transformations among all words we have.
For example:

Example:
Input: words = ["gin", "zen", "gig", "msg"]
Output: 2
Explanation:
The transformation of each word is:
"gin" -> "--...-."
"zen" -> "--...-."
"gig" -> "--...--."
"msg" -> "--...--."
There are 2 different transformations, "--...-." and "--...--.".

Answer I did:
I am getting wrong for the input when I submitted my code of the above example
I am getting output as 4.
But when I debug by taking the above one in onlinegdb.com , I am getting correct output i.e 2

What I have tried:

#include<string.h>

int uniqueMorseRepresentations(char ** words, int wordsSize){
    int i=0,j,count=wordsSize;
    for(;i<wordsSize-1;i++)
    {
        if(words[i]!=NULL)
        {
             for(j=i+1;j<wordsSize;j++)
        {
            if(words[j]!=NULL)
            {
               if(strcpy(words[i],words[j])==0)
               {
                   count--;
               }
            }
        }
            words[i]=NULL;
        }
    }
    return count;
}