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.
Software Engineers Interview Questions
418,965 software engineers interview questions shared by candidates
Debugging section consists of basic algorithm and data structures while analytical sections consists of analogy based questions.
how to test a toaster?
How to reverse a space-delimited-string word by word
how many zeros are there in 100!
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.
(over the phone) How to sort an array with millions of entry on a computer with low memory
WAP to find and print second largest digit in the given number? ( without using arrays, functions and using only one loop).
Given a number n, give me a function that returns the nth fibonacci number. Running time, space complexity, iterative vs. recursive.
Write C code that, given number n from the interval [0,32], produce integer number with n least-significant bit sets to 1, and other bits set to 0 (practically, write a decoder).
Viewing 661 - 670 interview questions