arr = [c,c,b,d,d,a,a,c,b,b,b,c,d,a] Given an array of characters, find the min length sub array within this array which has all the unique elements present in the array. unique = [c,b,d,a] worst = [c,a,a,a,a,d,d,d,b] //in this case the complete array becomes the min lenght sub array.. Write a function which accepts the char array and prints i,j of the sub array
behavioral questions, on how, why, when
Palindrome, and versions of it.
Given two linked lists, check if they merge. If so write a function to get the intersection point of two Linked Lists
Exclusively whiteboard algorithm questions.
Which Swift libraries I am acquainted with.
Can you describe yourself? What is your previous experience related iOS development? What is your motivation to plan at Flix?
Live App Coding If everything goes well still I don't understand why they don't reply
Have you wrote backend and have you encrypt api
Q: Tell me about yourself
Viewing 5471 - 5480 interview questions