3. (similar but not eactly to the "Letter Combinations of a Phone Number" on leetcode) // +-----+-----+-----+ // | 1 | 2 | 3 | // | | ABC | DEF | // +-----------------+ // | 4 | 5 | 6 | // | GHI | JKL | MNO | // +-----------------+ // | 7 | 8 | 9 | // |PQRS | TUV |WXYZ | // +-----------------+ // | 0 | // | + | // +--+--+ // 2 -> "A" // 22 -> "B" // 222 -> "C" // 2233 -> "BE" // Write a function that given a string of numbers as input returns all possible string translations
Most challenging task you ever had
Write a method to compare two binary trees.
How delegate works
Phone interview question: which keyword to use for a delegate property? strong, weak, unsafe unretained, assign
Create an app for payment
Easy programming problem but a bit tricky.
Why Zendesk (given that I was found by a recruiter and told that it's a best place to work)
Basic iOS design questions with many follow-ups.
Swift: Optional, Concurrency, MVVM SwiftUI: All property wrappers, comparisons
Viewing 911 - 920 interview questions