How should I practice Find Longest Chain?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Bloomberg LP online assessment problems in FastPrep.

Is Find Longest Chain associated with Bloomberg LP?

FastPrep tags this as a Bloomberg LP online assessment coding practice problem when the problem catalog has that company and stage context.

Find Longest Chain

Bloomberg LP● MediumFULLTIMEOA

Learn

Problem statement

Given a dictionary of many words:

- bac, ac, a, c, bads

For each word, each time you can delete one letter, and the resulting word must still be in the dictionary. The task is to find the longest chain that can be formed.

Function

longestChain(words: String[]) → int

Examples

Example 1

words = ["bac", "ac", "a", "c", "bads"]return = 3

The longest chain that can be formed starting with "bac" is "bac" -> "ac" -> "a", which has a length of 3.

Constraints

🍓🍓

Problem statement

Function

Examples

Example 1

Constraints

More Bloomberg LP problems