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
Basic iOS design questions with many follow-ups.
Qual a diferença entre ObservedObjects e EnvironmentObjects para as views no SwiftUI
1- Difference between LayoutIfNeeded, LayoutSubviews, SetneedsDisplay
How delegate works
How can you improve you solution?
Here’s a ninja (i.e. supposedly not a heavy) question: Given an array of numbers, reset the array to put all the non-zero numbers in front of all the zeros in the array, then return the count of non-zero numbers. e.g., for an input array of [3,0,2,0,0,1,0,4], you’ll end up with a return value of 4 and an array of [3,2,1,4,0,0,0,0] I do not remember if they asked me to do this in-line and/or return the adjusted array as well.
This is a question from my first interview (back in 2015), and I have a feeling it's still used: A telephone keypad has letters associated with each number (e.g. 2 = abc, 3 = def). Given a passphrase of "fb1" (e.g. one that you might use to log into a bank account), come up with an algorithm that would assemble an array that contains all the different possible letter combinations that, when typed into a telephone dial pad, would be equivalent to the original passphrase. That is, "fb1" equals "321" numerically; matching equivalent combinations include: "da1", "db1", "dc1", "ea1", "eb1", "ec1", "fa1" and "fc1".
General iOS Questions.
Given two binary numbers in string format, get the sum of them.
Viewing 871 - 880 interview questions