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 Engineers Interview Questions
419,816 software engineers 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.
what is your previous experience
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).
Closest pair of points problem
how to get the most significant bit from a byte?
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?
Find the max subsequent sum for a random array of numbers
Viewing 2511 - 2520 interview questions
See Interview Questions for Similar Jobs
Principal EngineerOperations Engineer.net DeveloperMobile EngineerGame ProgrammerMobile DeveloperFirmware EngineerDevops EngineerPython DeveloperSenior DeveloperLead EngineerC DeveloperJr Security AnalystData EngineerApplication DeveloperAtg DeveloperSoftware DeveloperQa EngineerTechnical Program Manager