Consider a series similar to the fibonacci series (fn = fn-1 + fn-2) but with f(0) = x, f(1) = y.Given x,y and z (each can be +ve or -ve), how do you find if z exists in the series
Software Development Interview Questions
36,976 software development interview questions shared by candidates
Programming question - check if string has balanced brackets, firstly with "()" only and thereafter adding all other brackets such as "[]{}<>".
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.
based on user input, return an updating list of us cities as the user types. example: user input = s return= san fran, san antonio, seattle.... user input = e return = seattle, seguela, sebba... and so on
Given a 2D array, find the sum of all the elements in the array. O(n^2) solution is too slow, find ways to optimize (ended up adding a second parameter 2D array).
First Round Questions (6 year Exp Software Engineer took the interview) 1)In a Given array which contains sorted numbers only one of number matches with that of Index. Find the number Not in O(N). 2)Derive a DataStructure to support the following operations Insert/Delete/Search/GetRandom Value in O(1) & O(logN)
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?
About the details, and interviewer will communicate with you when you are typing.
Find top k largest numbers in array in O(n) time
Viewing 461 - 470 interview questions
See Interview Questions for Similar Jobs
Systems DeveloperJava DeveloperC DeveloperPython DeveloperHadoop DeveloperDevops EngineerSoftware EngineerTechnical Program ManagerMobile DeveloperAtg DeveloperSoftware Applications EngineerSoftware ProgrammerSoftware Test EngineerMobile EngineerIt DeveloperApplications Support EngineerComputer ScientistSenior DeveloperSoftware Qa Engineer