Given an array, without using extra space, move all zeros to the end and no-zeros to the beginning. The function should return the number of non-zeros.
Lead Ios Engineer Interview Questions
1,714 lead ios engineer interview questions shared by candidates
1. Given a 3 array like below NSArray *a = [1,3,4,5]; NSArray *b = [-1,3,0,9]; NSArray *c = [0,31,32,22,6]; Find the elements from the three array which existing in atleast 2 arrays. Eg: [3, 0] Because 3 is presented in array a, b and 0 is presented in array b, c respectively. -(NSArray)find2ElementsAtleastPresentIn2Arrays:(NSArray*)aList b::(NSArray*)bList c::(NSArray*)cList{ // -- your code here. }
The same list, back to inorder binary tree
The same usual customer service questions. Same sort of questions that are on the application
given numbers 1 4 2 0 2 0, move all zeros to beginning using minimum sorting technique
Implement the MyStack. (A lot of questions about multi-threading) @protocol Stack -(void)pushObject:(nonnull id)obj; -(nonnull id)popObjext; @property(nonatomic,assign)NSInteger count; @end @interface MyStack : NSObject <Stack> @end @implementation MyStack @end
Giving a circular sorted array Ex: [7,9,3,5,6], write an algorithm that finds the smaller element index.
How would you implement UIView hitTest mehtod?
first questions : 1,3,5,7,11,13,17,19,23,29,..... next element
Typical technical interview questions
Viewing 1 - 10 interview questions