2) This is the most important task in the group assesment where I think I would have failed. You will be given a code base with 30 Java files. There will be three milestones. Milestone 1) You need to find a way to map the products to shipping centers. The question was vague and I cant remember it exactly. This mapping can be done by identifying the cost of shipping for each area. Cost can in turn be calculated based on four different factors like air shipping, ground shipping and few others. Based on the customer requirement you need to make the products to shipping areas and return a list of product ids and their shipping cost list.
Software Development Interview Questions
36,976 software development interview questions shared by candidates
Heap Sorting. What data structure do you use to implement it? Time to access and sort. Code it.
Is it possible to sort using linear time a file with lots of numbers that contain duplicates, when there are no limits of resources or space?
Given a balance and marbles where one marble weighs more than the other, how many times do you have to use the balance to find the heaviest marble for 7 marbles. Then, extend that answer to how many marbles can you weigh with 4 tries.
How to come out of a maze given that you can move one step at a time and you cannot turn left.
you have 100 doors in a row that are all initially closed. you make 100 passes by the doors starting with the first door every time. the first time through you visit every door and toggle the door (if the door is closed, you open it, if its open, you close it). the second time you only visit every 2nd door (door #2, #4, #6). the third time, every 3rd door (door #3, #6, #9), etc, until you only visit the 100th door.
You have a building with 100 stories. You also have two glass balls. You can drop the glass balls as many times as you want before they break. How can you find the floor at which they start breaking with the fewest number of drops?
Create a Priority Queue with all methods.
Find two smallest elements in an unsorted array using only one pass i.e. O(n)
given an unsigned char array, find if there is a subarray whose elements sum up to a given value
Viewing 471 - 480 interview questions