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.
deep Swift, Swiftui and UIKit, objective c
standard questions, random questions, stupid questions
1. They asked from initial to end process of ios application development 2. Technical questions - (classes, structure, closure, delgates, protocol,extension, GCD, NSOperation Queue, Design Patterns, Push Notifications, Library Integrations, URLSession, access specifiers, generics etc )
A home task with a map view
Swift fundamentals, threading, core data, memory dispatch, operation queue.
Some very basic coding questions
Memory management
Viewing 5561 - 5570 interview questions