Preguntas de entrevistas para Software Engineer

Traverse, use absolute value on each element as index, make the value at index as negative to mark it. If already marked negative, then is a repeating element. For missing ones, traverse again and check for positive values instead. #include #include void printTwoElements(int arr[], int size) { int i; printf("\n element repeating: "); for(i = 0; i 0) { arr[abs(arr[i])-1] = -arr[abs(arr[i])-1]; } else { printf(" %d ", abs(arr[i])); } } printf("\n missing one: "); for(i=0; i0) { printf("%d",i+1); } } } /* test method */ int main() { int arr[] = {7, 3, 4, 5, 5, 6, 2}; int n = sizeof(arr)/sizeof(arr[0]); printTwoElements(arr, n); return 0; }

^ description says there is no duplicate. So the answer here is wrong. If the numbers are ordered, then you can just make a binary search and check the (index + 1) matches value for that index until you find the missing one (i.e the first one that does not matches within the array). That's likely the fastest way O(logN).

Los hice pero yo no soy buena dibujando

I've prepared myself before the interview following other experiences, this is the most important piece, to have your mind prepare for any exercise and have all the main programming concept fresh and ready to be used

Soy técnico, no tenía experiencia y mi ingles es intermedio

Rapidamente di una solución que no estaba totalmente acertada pero si sirve como punto de partida para la solución correcta.

En base a mi experiencia, al trabajar con personas un proceso de adaptación, se requiere una gran empatía y reconocimiento para luego trabajar el proceso de cambio

Describe how event bus work