Given an array where the otherwise sorted values are split into two ranges somewhere in the middle (e.g. [5,7,8,9,1,2,3]), come up with an algorithm that returns TRUE or FALSE if any given number X exists in that array.
Ios Developer Engineer Interview Questions
7,844 ios developer engineer interview questions shared by candidates
When ARC takes place?
a telephone keypad has letters associated with each number (e.g. 2 = abc, 3 = def); given a passphrase of "fb1" (e.g. one that you might use to log into a bank account), come up with an algorithm that would assemble an array that contains all the different possible letter combinations that, when typed into a telephone dial pad, would be equivalent to the original passphrase.
NSRange intersections
Given an array of integers and integer K, return another array holding integers appeared K times in the given array
The interview was a while ago, so I'm not sure if I'm remembering the question correctly, but the most difficult question was something about how to know if a number is a square of 2.
Overview of your previous experience and your team work
Write a function that takes in an array of strings and outputs a dictionary with the first character of each string as the key and the remaining characters as the object.
Mention two root class in Cocoa
Giving a circular sorted array Ex: [7,9,3,5,6], write an algorithm that finds the smaller element index.
Viewing 41 - 50 interview questions