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.
Programmer Intern Interview Questions
716,417 programmer intern interview questions shared by candidates
Debugging section consists of basic algorithm and data structures while analytical sections consists of analogy based questions.
How to reverse a space-delimited-string word by word
how to test a toaster?
how many zeros are there in 100!
what if company in losses , dividend declaration
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.
I have three water jugs, one with 10 liters another with 5 and another with 6, how do i get 8 liters on the first one?
(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).
Viewing 861 - 870 interview questions