Write a function that takes an array of floats (or doubles) as a parameter and returns a longest subsequence of floats where all elements have differences not more than 1 between each other. For example input: [4.2, 5.3, 4.6, 9.8, 1.5, 5.2, 4.7] output: [4.2, 4.6, 5.2, 4.7], -> if you find the difference between any pair of elements here, it would be less or equal then one.
Recursive folder traversal in a file system. Very similar to the first screening phone interview question. You get a folder-like data structure as an input and return a string describing a tree structure. As an alternative, each subfolder might contain files and you need to return a count of files contained in the folder and it's subfolders.
I was asked to create an app that would download ten predetermined photos and display them in a UITableViewController.
Why do you want to work at Tinder?
Gave a fancy view to design. Basically a stack of views.
All questions was easy. The most important question was "Why you choose mind valley". They were asking like they are apple company. The Manager and HR asked me so many times. In tech interview, they gave a URL and create a model and fetch api response and show into table. I was like Of course "A senior developer is much capable of that doing this simple task".
Remove outer paranthesis
General ios interview questions nothing.
Technical Round: 1. Basic Swift: Class vs Struct (when you have to use), Access Specifier, multi-threading, Closures, Protocols, Core Data 2. About Project 3. some Framework & Libraries 4. Create tree's node in Swift
If there were a cheese factory with 100 hungry mice and 4 not so hungry mice, how would you figure out which is which?
Viewing 1191 - 1200 interview questions