Skip to contentSkip to footer

Desenvolvedor Interview Questions

Salaries
Interviews

102,664 desenvolvedor interview questions shared by candidates

Suppose a basketball match is going on and apart from conventional manner to record that game i.e. video recording, I want to record that game in a structure, so which structure u will use and with which fields, to record that game so that whenever i go through that structure i'll get the whole description of the match event-wise i.e. what happened at which time.
avatar

Software Developer

Interviewed at Dell Technologies

3.7★
Aug 19, 2012

Suppose a basketball match is going on and apart from conventional manner to record that game i.e. video recording, I want to record that game in a structure, so which structure u will use and with which fields, to record that game so that whenever i go through that structure i'll get the whole description of the match event-wise i.e. what happened at which time.

Identify whether there exists a pair of numbers in an array such that their sum is equal to N Input: The first line contains one integer N, which is the sum we are trying to find; The second line contains one integer M, which is length of the array; This is followeb by M lines each containing one element of the array; Output: Output 1 if there exists a pair of numbers in the array such that their sum equals N. If such a pair does not exist, output 0. Note: The array must be sorted.
avatar

Software Developer

Interviewed at Booking.com

4.1★
Jul 26, 2016

Identify whether there exists a pair of numbers in an array such that their sum is equal to N Input: The first line contains one integer N, which is the sum we are trying to find; The second line contains one integer M, which is length of the array; This is followeb by M lines each containing one element of the array; Output: Output 1 if there exists a pair of numbers in the array such that their sum equals N. If such a pair does not exist, output 0. Note: The array must be sorted.

An integer X and a non-empty zero-indexed array A consisting of N integers are given. We are interested in which elements of A are qual to X and which are different from X. The goal is to split array A into two parts, such that the number of elements equal to X in the first part is the same as the number of elements different from X in the other part. More formally, we are looking for an index K such that: 0 ≤ K < N and the number of elements equal to X in A[0..K−1] is the same as the number of elements different from X in A[K..N−1]. For K = 0, A[0..K−1] does not contain any elements.
avatar

Software Developer

Interviewed at Toptal

3.7★
Jan 14, 2016

An integer X and a non-empty zero-indexed array A consisting of N integers are given. We are interested in which elements of A are qual to X and which are different from X. The goal is to split array A into two parts, such that the number of elements equal to X in the first part is the same as the number of elements different from X in the other part. More formally, we are looking for an index K such that: 0 ≤ K < N and the number of elements equal to X in A[0..K−1] is the same as the number of elements different from X in A[K..N−1]. For K = 0, A[0..K−1] does not contain any elements.

Viewing 561 - 570 interview questions

Glassdoor has 102,664 interview questions and reports from Desenvolvedor interviews. Prepare for your interview. Get hired. Love your job.