Do you need sponsorship for this position?
Developer Interview Questions
268,884 developer interview questions shared by candidates
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
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?
Viewing 311 - 320 interview questions