Practice Find the Prefix Common Array of Two Arrays

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#2657

LeetCode Problem

Find the Prefix Common Array of Two Arrays

Array Hash Table Bit Manipulation

Problem Statement

You are given two 0-indexed integer permutations A and B of length n. A prefix common array of A and B is an array C such that C[i] is equal to the count of numbers that are present at or before the index i in both A and B. Return the prefix common array of A and B. A sequence of n integers is called a permutation if it contains all integers from 1 to n exactly once.

Source: Find the Prefix Common Array of Two Arrays on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

A = [1,3,2,4], B = [3,1,2,4]

Output

[0,2,3,4]

# Example 2

Input

A = [2,3,1], B = [3,1,2]

Output

[0,1,3]

Constraints

1 <= A.length == B.length == n <= 50

1 <= A[i], B[i] <= n

It is guaranteed that A and B are both a permutation of n integers.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free