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 Developer Java Interview Questions
711,092 software developer java 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
what if company in losses , dividend declaration
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?
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.
We have a log file, can grow pretty big. Each line is a trace-log, and the first field is the RequestID. We need to scan the file, and print all the logs for requests which resulted in error .. 001 <timestamp> BEGIN 001 <timestamp> fetched from db 001 <timestamp> some processing .. 002 <timestamp> BEGIN .. 002 <timestamp> fetched from db 001 <timestamp> returned success 003 <timestamp> BEGIN 001 <timestamp> END 003 <timestamp> some work 002 <timestamp> ERROR 003 <timestamp> some other work
(over the phone) How to sort an array with millions of entry on a computer with low memory
Viewing 841 - 850 interview questions