package
0.0.0-20241020204346-852d83918761
Repository: https://github.com/plutov/practice-go.git
Documentation: pkg.go.dev

# README

Build Word

You have a word in lowercase. Your task is to write this word using the fragments you are given. Each element of fragments can be used more than once, but they cannot overlap. It is guaranteed that it's always possible to write the word using the given fragments.

What is the minimum number of elements you have to use? Return 0 if it's not possible to build a word.

Example

// bu + ild + wo + rd
BuildWord("buildword", []string{"buil", "dwor", "bu", "ild", "wo", "rd"}) = 4

Run tests with benchmarks

go test -bench .

# Functions

No description provided by the author

# Structs

No description provided by the author