Imagine you have a string and you want to return False if there are repeat characters in this string, what are the fastest and most space efficient ways to do this. (I clarified and he only wanted to return False if there was a repeat letter or number)
Given a text file containing the text for Hamlet (/usr/share/file.txt), return the top 5 most frequent words with count.
Save a tree to an array
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
Find the nth element in a linked list in constant time and space.
Define Yourself
What is a class?
There are 4 people who want to cross a bridge. They each take 1, 2, 5 and 8 minutes. Only 2 people can cross at a time and they take as long as the slowest person. What is the fastest time you can get everyone across? Then I was asked to write the mathematical equation to determine the trade-off point between each of the 2 approaches to solving this.
Given a triangle, determine if its a scalene, equilateral, isosceles or neither... required knowledge of triangle properties, I learnt these properties about two decades ago so ofcourse I was fuzzy on the details, completely unexpected
Given a string of format '2+3*2-1', calculate and return the result. No parenthesis in the input, just integers and + - * / operators. Operator precedence has to be considered. Linear time complexity and minimal data structure use is preferred.
Viewing 1581 - 1590 interview questions