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.
An option to use UIKit or SwiftUI for the live coding portion.
What would I do to this code in order to make it better?
2 DSA medium questions asked
mostly related to best coding practice to follow
How to manually make access to properties atomic instead of using the atomic keyword
Revisão de código: Mostram um código relativamente simples, mas cheio de pequenos problemas, modelando uma locadora de filmes
Sobre minhas atitudes ou ações diante de situações de conflito.
ViewController lifecycle
Viewing 1191 - 1200 interview questions