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
Create list view and fetch data from server, used clean architecture
a twist on Leet code problem
behavioral questions, on how, why, when
Palindrome, and versions of it.
Build a TokenManager that handles token refresh
deep Swift, Swiftui and UIKit, objective c
A home task with a map view
Have you ever had an upset customer and how did you resolve the situation
Questions on IOS Basics concepts
Viewing 7831 - 7840 interview questions