Desenvolvedor Interview Questions

102,674 desenvolvedor interview questions shared by candidates

Q: Check if a number is a power of 2. Q: Write code for pair-sum(a version of subset sum where the sum of two number is equal to the expected sum, rather than optimization problem, it is decision problem) problem. How to solve it in O(n lg n) and O(n) time. Q: What is the difference of pointer and reference in C++. When to use those ?
avatar

Software Developer C/C++

Interviewed at AKUNA CAPITAL

4
May 4, 2016

Q: Check if a number is a power of 2. Q: Write code for pair-sum(a version of subset sum where the sum of two number is equal to the expected sum, rather than optimization problem, it is decision problem) problem. How to solve it in O(n lg n) and O(n) time. Q: What is the difference of pointer and reference in C++. When to use those ?

There are two linked lists, each around million nodes long. One linked list merges into the second one. Find the node where the two linked lists merge i.e find the first node that is part of both linked lists.
avatar

Financial Software Developer Intern

Interviewed at Bloomberg

4
Sep 25, 2012

There are two linked lists, each around million nodes long. One linked list merges into the second one. Find the node where the two linked lists merge i.e find the first node that is part of both linked lists.

Halloween has just happened, and all of the kids in the neighborhood have candy. 5 of them are standing in a circle comparing stashes, when one of them (kid 0) gets the idea to steal his neighbor's (kid 1's) candy. Kid 1 gets upset and runs away crying. Kid 2 sees kid 0 stealing from kid 1, thinks that he could do that too, and steals kid 3's candy. Kid 4 sees kid 2, and steals from kid 0, and so on and so forth until there's only one kid left. Given n children, find the index of the last kid remaining.
avatar

Financial Software Developer Intern

Interviewed at Bloomberg

4
Oct 7, 2013

Halloween has just happened, and all of the kids in the neighborhood have candy. 5 of them are standing in a circle comparing stashes, when one of them (kid 0) gets the idea to steal his neighbor's (kid 1's) candy. Kid 1 gets upset and runs away crying. Kid 2 sees kid 0 stealing from kid 1, thinks that he could do that too, and steals kid 3's candy. Kid 4 sees kid 2, and steals from kid 0, and so on and so forth until there's only one kid left. Given n children, find the index of the last kid remaining.

Viewing 981 - 990 interview questions

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