Write a method to decide if the given binary tree is a binary search tree or not.
Engineer I Interview Questions
842,718 engineer i interview questions shared by candidates
Given two lists, A and B, of sizes n and k, respectively, describe an algorithm to determine the intersection, C, of the two lists. What is the complexity of your algorithm? (The obvious solution is O(n*k)). Can you describe a solution that is faster? (An optimized solution can do it in O(n+k)).
Given a random array with integers, find every pair that sum up to a certain number.
Given a customer order of N items, design and implement a class that will most efficiently by space place the order in various size boxes
Telephone interview: Find largest integer from an array of integers. The integers in the array are arranged in strictly increasing (no 2 integers are same) or strictly increasing then decreasing; so like a curve and you have to find the peak. Discuss time complexity. Write code.
tell me how you have spent time learning new things to help you in your current or past positions
1. You built an application like google drive. State the test cases 2. You are trying to upload a picture on facebook and it is not loading. List out the possible errors 3. Reverse alternate words in a sentence
How many data bits needed to represent A*B+C, all are 8 bit unsigned
It was positive experience. People were nice. Like craft demo which help to have discussion with team instead of traditional interview structure.
puzzle : there is a island and the resident are either blue or black eyed. The residents are trapped in the island and want to leave. One day a foreigner comes and says there are few blue eyed people. He will be sending a steamer to the island every day and blue eyed people can leave. But if a black eyed person approaches the steamer, he will be killed. Constraint: No body knows their eye colour and can't even ask or say the colour to any other person. even cant see their reflection. So how many days is required for all the blue eyed person to leave the island.
Viewing 1521 - 1530 interview questions