Home Problem Set Companies Projects Live Scene Contribute Requests

Loading Question...

String Chains - Akamai Interview Question | Codinzhub

CodinzHub

Home Problem Set Companies Projects Live Scene Contribute Requests

String Chains

You are given an array of words representing a dictionary. A string chain is formed by taking a word and

…

Given an array of values, determine the required result under the following conditions.

Input: [4, 8, 15, 16, 23, 42]

Output: 3

Constraints: 1 ≤ n ≤ 10⁵

Access the full question

Unlock the full statement, examples, constraints, and solution guidance.

Ending preview

…

The longest string chain is 4.

solution.cpp

Run code to see test results

00:00 / 69:42

String Chains

MediumMed•699 views

You are given an array of words representing a dictionary. A string chain is formed by taking a word and

…

Given an array of values, determine the required result under the following conditions.

Input: [4, 8, 15, 16, 23, 42]

Output: 3

Constraints: 1 ≤ n ≤ 10⁵

Access the full question

Unlock the full statement, examples, constraints, and solution guidance.

Ending preview

…

The longest string chain is 4.

MediumMed•699 views

Asked at

Akamai

Author: Amit Dayal

Software Engineer

Expert in Data Structures & Algorithms. Building tools to help developers crack FAANG interviews.

Reviewed by Senior Engineers

GitHub

Up Next

Router Disruption Avoidance - Morgan Stanley Online Assessment IGDTUW

Morgan Stanley • Pending

Smallest Permutation - Morgan Stanley Online Assessment IGDTUW

Morgan Stanley • Pending

Accenture Online Assessment - IIT (BHU) Varanasi

Accenture • Pending

Minimum Bit Flips to Convert One Number to Another - Morgan Stanley Online Assessment - IGDTUW

Morgan Stanley • Pending

Minimum Flips to Convert String - Morgan Stanley Online Assessment - IGDTUW

Morgan Stanley • Pending

Last updated Sep 2026