## Accolite software Interview Questions

- 0of 0 votes
Assume there is no software like google maps. you are given a map of world. Suppose you are somewhere in the hyderabad.

You will have to figure out all the paths from your location to Hyderabad airport.

I have given DFS approach. But the problem is that by doing DFS, a path can cross boundaries of Hyderabad and go so long away from Hyderabad

airport. DFS will take some much time. How to solve this problem?

You are give very big file (15TB) of employees sign in and sign out data. The file contains information like below

EmployeeId,Date,SignIn Time,SignOut TIme

An Employee can sign in and sign out multiple times in a single day.

Question: Given EmployeeId, day and time, your algorithm has to tell whether employee is present in the office or not at that particular time

- 0of 0 votes
Assume there is no software like google maps. you are given a map of world. Suppose you are somewhere in the hyderabad.

You will have to figure out all the paths from your location to Hyderabad airport.

I have given DFS approach. But the problem is that by doing DFS, a path can cross boundaries of Hyderabad and go so long away from Hyderabad

airport. DFS will take some much time. How to solve this problem?

- -1of 1 vote
Sachin wants to buy a laptop for programming. he plans on buying a laptop whose price is made of digits 4 and 7 only. The number of 4s and 7s in the price should be equal. You are given laptop brand names and their prices. Find and print the name of the laptop brand that satisfies the above criteria. If there are multiple brands that meet the criteria, print the name of the one with the minimum price. If none of the laptops meet the criteria print -1.

For example, if Sharon has a choice between laptops 'BestBook' priced at 444777 and 'LapBook' priced at 7744, the solution should indicate ideal choice to be 'LapBook'. Although both 'BestBook' and 'LapBook' have equal number of 4s and 7s in the price, 'LapBook' is priced lower which makes it the right choice for Sharon.

- 0of 0 votes
Sort an unsorted array containing o's and 1's. For eg: [0,1,1,1,1,0,0,1]. Do it in-place as well as in O(n) time. While sorting you are not allowed to change the original ordering of same element.

- 0of 0 votes
There is an integer INPUT array {1,2,3,4,5}. Create an OUTPUT array such that each element in output array consists Product of all elements in INPUT array divided by element at that point. But you have to do it without using divide operator (/).

e.g

intput={1,2,3,4,5}

output[0]=(1*2*3*4*5)/1

output[1]=(1*2*3*4*5)/2 and so on.

Don't use divide operator