Count ordered fragment pairs forming a password

Q: Count ordered fragment pairs forming a password

This is a Coding & Algorithms interview question from Capital One for Machine Learning Engineer roles. View the full question and solution on PracHub.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Loading...

You are given:

A target string password .
A list of N string fragments fragments[0..N-1] (fragments may repeat).

Count the number of ordered pairs of distinct indices (i, j) such that:

fragments[i] + fragments[j] == password

Notes:

“Ordered” means (i, j) and (j, i) are counted separately when both satisfy the condition.
Indices must be distinct ( i != j ).

Input: password, fragments.

Output: an integer count (potentially large; specify/assume 64-bit).

State any constraints you assume and handle duplicates correctly.

Count ordered fragment pairs forming a password

Comments (0)