Desarrollador Sr Java Interview Questions

Software Development Engineer (Computer Vision)

Interviewed at Amazon

3.5★

Nov 22, 2012

How would you code up a custom rectangle detector?

Amazon Software Developer Intern

Interviewed at Amazon

3.5★

Apr 1, 2011

how would you design how a cellphone implements its contact list when you press a certain letter. For example, If you press M it will tell you all the names starting with M. then if you press MI it will tell you all names starting from MI and so forth....

Software Development Engineer

Interviewed at Amazon

3.5★

Nov 8, 2014

Given 2 numbers. Find if they are consecutive grey code sequences

Software Development Engineer

Interviewed at Amazon

3.5★

Oct 31, 2016

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 Development Engineer I

Interviewed at Amazon

3.5★

Dec 21, 2016

Debugging section consists of basic algorithm and data structures while analytical sections consists of analogy based questions.

Software Engineer, Backend

Interviewed at Shopee

3.7★

Mar 12, 2019

How to reverse a space-delimited-string word by word

Software QA Engineer

Interviewed at Apple

4.2★

Mar 22, 2011

how to test a toaster?

Software Development Engineer

Interviewed at Microsoft

4★

Jan 26, 2012

how many zeros are there in 100!

Process Developer

Interviewed at Wipro

3.6★

Aug 13, 2012

what if company in losses , dividend declaration

Software Development Engineer In Test (SDET)

Interviewed at Microsoft

4★

May 14, 2013

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.