1. find-all-anagrams-in-a-string 2. find common ancestor for a n-ary tree These two questions have to use JAVA to solve.
Developer Interview Questions
270,915 developer interview questions shared by candidates
find subarray at a given length with the maximum average
Union of n arrays with x elements. Output common members contained in at least 2 arrays. Explain the complexity of the algorithm used. We have a digested server log with username, visited page and timestamp. Create a processing algorithm that will output the most visited page/areas in such a way that will match partial path as well. i.e. { { user: "user1", page="/home" }, { user: "user1", page="/home/account" }, { user: "user1", page="/home/account/profile" }, { user: "user1", page="/home/account/login" }, { user: "user2", page="/about" }, { user: "user2", page="/about/contact" }, { user: "user2", page="/home" } } the output user1 - home/account - home user2 - /about PS I'm rephrasing because I cannot recall exactly the question
Problem given are general and tough
Delegates, Protocol, blocks, multithreading, GCD, project specific, some behavioural questions etc
Given two arrays of integers find numbers how can you find the numbers in both? What is the complexity?
Very simply question of inserting latest 5000 records in container along with timestamp and retrieve them as needed and discard which are older then 5000.
A rustic village contains one million married couples and no children. Each couple has exactly one child per year. Each couple wants a girl, but also wants to minimize the number of children they have, so they will continue to have children until they have their first girl. Assume that children are equally likely to be born male or female. Let p(t) be the percentage of children that are female at the end of year t. What is p(t)? "Can't tell" is a potential answer if you don't have sufficient information.
Why is a manhole cover round?
Logical Reasoning, Very few Aptitude questions, and 4 program questions
Viewing 291 - 300 interview questions