Given 2 numbers. Find if they are consecutive grey code sequences
Development Engineer Interview Questions
37,103 development engineer interview questions shared by candidates
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.
Debugging section consists of basic algorithm and data structures while analytical sections consists of analogy based questions.
Given a binary tree, how would you set the keys/values of all the nodes and their child pointers to null. No language restriction. Do it iteratively in O(N) time with O(1) space complexity where N is the number of nodes in the tree. Other Details: - Tree is just a regular Binary Tree and doesn't have the BST property. - It is not guaranteed to be balanced. - You may do whatever you want to the tree however, you must ensure that all the nodes in the tree and their left/right pointers are set to null.
how many zeros are there in 100!
1) 6 hours problem - Walls and Guards, use triple loop as a solutions and matrix. 2) Live coding question - 3 boxes with apples, oranges and apple and oranges, famous problem.
Using only putchar how would you print out the ascii values for each digit in an integer. For example if the integer was 123, then you would want to print the ascii values for 1, 2, and 3.
Given an infinite stream of numbers, find the top 50 integers. What's the data structure to use, and what's the time complexity.
Write a program to find the square root of a double.
Write a function to search for a string within another string. Analyze it's complexity, and propose optimizations.
Viewing 121 - 130 interview questions