1. Two Sum -with c- (leetcode.com)

Solution.c

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* twoSum(int* nums, int numsSize, int target, int* returnSize){
    int* returnArray  = malloc(2*sizeof(int));
    if (numsSize ==2){
        returnArray[0]=0;
        returnArray[1]=1;
        return returnArray;
    }
    for (int i=0; i<numsSize-1;i++){
        for (int j=i+1; j<numsSize;j++){
            if (nums[i]+nums[j]==target){
                returnArray[0]=i;
                returnArray[1]=j;
                return returnArray; 
            } 
        }
    }
    return returnArray;
}