Given a set of points (x,y) and an integer "n", return n number of points which are close to the origin
Engineer Software Interview Questions
419,197 engineer software interview questions shared by candidates
Given an array A of n integers, in sorted order, and an integer x. design an O(n)-time complexity algorithm to determine whether there are 2 integers in A whose sum is exactly x.
given non-zero number array A, create array B where B[i] = product of all elements in A except A[i].
First explain what a tree, then binary tree, then a binary search tree is. Now implement a function that verifies whether a binary tree is a valid binary search tree.
Write a code for determining the given integer is palindrome in binaries.
I got questions like "Given a dictionary of words, how do you calculate the anagrams for a new word".
Find the longest subarray which consists of numbers that can be arranged in a continuous sequence. For ex- {4,5,1,5,7,6,8,4,1} output-{5,7,6,8,4}.Find the longest.
How would you code up a custom rectangle detector?
Given 2 numbers. Find if they are consecutive grey code sequences
Coding Challenge 2) You will be given N number of points as an array (CPPoint class). CPPoint class will have x and y coordinate. Find the closest k number of points from the origin.
Viewing 651 - 660 interview questions