You will always get an valid array. And it will be always exactly one letter be missing. The length of the array will always be at least 2. The array will always contain letters in only one case.

Example:

['a','b','c','d','f'] -> 'e'
['O','Q','R','S'] -> 'P'

(Use the English alphabet with 26 letters!) Have fun coding it and please don’t forget to vote and rank this kata! :-). I have also created other katas. Take a look if you enjoyed this kata!

The link problem is here.

Solution:

char findMissingLetter(char array[], int arrayLength)
{
  char miss, start;
  int i;

  start = array[0];
  for (i = 0; i < arrayLength; i++)
  {
    if (start != array[i])
    {
      miss = start;
      break;
    }
    start = start + 1;
  }
  return miss;
}

The post Belajar Bahasa C – Find the missing letter appeared first on Onestring Lab.