Giving array of words and user can input any letters. Write a function that returns all possible words that start with the input string. They are looking for optimum solution.

Question

Sigiloso · Accepted Answer

func binarySearchPrefix(array: [String], target: String) -> [String] {
    var left = 0
    var right = array.count - 1
    var result: [String] = []
    
    while (left  target) {
            right = mid - 1
        }
    }
    return result
}

Semyon · Answer

I think it should be a prefix-tree question.

Sigiloso · Answer

func matchWords(array:[String] , input:String) -> Array
{
    var temp : [String] = []
    
    for i in 0..

Clutter

Pergunta de entrevista da empresa Clutter

Respostas da entrevista

Empresas seguidas

Buscas de vagas