Skip to contentSkip to footer

Ios Lead Interview Questions

Salaries
Interviews

6,263 ios lead interview questions shared by candidates

Emphasis on algorithms and complexity analysis and some higher-level design. Process is perhaps more focussed on discussion of alternatives/trade-offs/complexity over necessarily nailing a "perfect" answer in the provided time.
avatar

Ios Software Engineer

Interviewed at Meta

3.5★
Mar 21, 2014

Emphasis on algorithms and complexity analysis and some higher-level design. Process is perhaps more focussed on discussion of alternatives/trade-offs/complexity over necessarily nailing a "perfect" answer in the provided time.

Given this single API and an unlimited (space) input buffer, show how you would replace space characters with URL-encoded “%20”. void replaceSpaces(char *buffer); That is: “Hello World Twitch” would become “Hello%20World%20Twitch”
avatar

IOS Engineer

Interviewed at Twitch

3.7★
Apr 19, 2017

Given this single API and an unlimited (space) input buffer, show how you would replace space characters with URL-encoded “%20”. void replaceSpaces(char *buffer); That is: “Hello World Twitch” would become “Hello%20World%20Twitch”

For my phone (and Collabedit) question, I was asked to implement functionality matching the description of this API: /* This class will be given a list of words (such as might be tokenized * from a paragraph of text), and will provide a method that takes two * words and returns the shortest distance (in words) between those two * words in the provided text. * Example: * WordDistanceFinder finder = new WordDistanceFinder(Arrays.asList("the", "quick", "brown", "fox", "quick")); * assert(finder.distance("fox", "the") == 3); * assert(finder.distance("quick", "fox") == 1); * * "quick" appears twice in the input. There are two possible distance values for "quick" and "fox": * (3 - 1) = 2 and (4 - 3) = 1. * Since we have to return the shortest distance between the two words we return 1. */
avatar

IOS Developer

Interviewed at LinkedIn

3.8★
Apr 26, 2017

For my phone (and Collabedit) question, I was asked to implement functionality matching the description of this API: /* This class will be given a list of words (such as might be tokenized * from a paragraph of text), and will provide a method that takes two * words and returns the shortest distance (in words) between those two * words in the provided text. * Example: * WordDistanceFinder finder = new WordDistanceFinder(Arrays.asList("the", "quick", "brown", "fox", "quick")); * assert(finder.distance("fox", "the") == 3); * assert(finder.distance("quick", "fox") == 1); * * "quick" appears twice in the input. There are two possible distance values for "quick" and "fox": * (3 - 1) = 2 and (4 - 3) = 1. * Since we have to return the shortest distance between the two words we return 1. */

Viewing 101 - 110 interview questions

Glassdoor has 6,263 interview questions and reports from Ios lead interviews. Prepare for your interview. Get hired. Love your job.