The first Jedi question was this: given an unsorted array of numbers, like [1, 3, 5, 4, 2], write a function that takes an integer and returns true if there's any pair of numbers in that array that can be summed up to the input integer.
Developer Interview Questions
269,002 developer interview questions shared by candidates
Implement a method to determine whether a string is a palindrome.
Given an array of integers, find the sub array with the largest sum. (must be done in linear time)
Do you need sponsorship for this position?
How will you check to see if two integer arrays have any common elements?
How would you find a duplicate number in a very large unsorted array of ints.
What data structure to use for Smartphone lock screen
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.
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
Viewing 281 - 290 interview questions