Find the number f set bits in an integer
Developer Support Engineer Interview Questions
1,137,072 developer support engineer interview questions shared by candidates
Given a sorted array of integers, write a function to remove any duplicates. Give algorithm, then code and finally list how you would test your program.
Find the max and second largest max in an array of integers. What is run time? How to test function?
Why are manhole covers round?
Write a Java program that takes a 2D bitmap (represented as a 1D array of integers), and reverses it about its vertical axis.
find and output the given number's shortest square sum. like input: 12=2^2+2^2+2^2 (not 3^2+1^2+1^2+1^2) output: {2 2 2}
You're given a binary tree and pointers to two nodes in the tree. Describe the fastest algorithm you can come up with to determine the closest common ancestor.
a. Given a function double f(double x), 0<=x<=1, f(x) is increasing. f(0)<0, f(1)>0. Find x s.t. f(x)\approx 0.
finding the biggest sum of subset in an int array.
write code to find the second shortest path between two given nodes in an undirected graph.
Viewing 1781 - 1790 interview questions