Given two arrays: arr1[0..m-1] and arr2[0..n-1]. Find whether arr2[] is a subset of arr1[] or not. Both the arrays are not in sorted order. It may be assumed that elements in both array are distinct.
Perguntas de entrevista de Senior Full Stack Software Engineer Python
193 Perguntas de entrevista compartilhadas pelos candidatos | senior full stack software engineer python
Engineering Manager round, coding task (you handwrite code on an electronic whiteboard). Write a function that accepts 3 parameters (numbers a, b, c). If a is bigger than b, write something to console. If a is bigger than b and c, write something else in console. If it is smaller than c but bigger than b, write another message to console.
Merge K sorted array list.
My knowledge of AWS experience.
First round: two coding questions.
Implement a backend API that builds a menu, item, and side. 1 item per menu, many sides to many items.
Implement movie search consuming data from Movie DB
Guys most of the questions are above, here I'm gonna share the question I failed, as I promised the interviewer that I'm gonna solve it, I just needed more time. The most difficult question is the following: we have this array: $input = [ 'item/id' => 'my_id', 'item/title' => 'my_title', 'item/group1/val1' => 'my_val1', 'item/group1/val2' => 'my_val2', 'summary' => 'xyz', 'item/group1/val3' => 'my_val3', ]; We need to convert it to : Array ( [item] => Array ( [id] => my_id [title] => my_title [group1] => Array ( [val1] => my_val1 [val2] => my_val2 [val3] => my_val3 ) ) [summary] => xyz ) This is using PHP.
Merge k sorted Array lists
What's your background.
Exibindo 1 a 10 perguntas de entrevista