← All problemsSign in

Prefix Suffix Operations

CodeChefRating 2317Open on judge ↗

You are given two arrays $A$ and $B$, each of size $N$. You can perform the following types of operations on array $A$. - Type $1$: Select any prefix of $A$ and increment all its elements by $1$. - Type $2$: Select any suffix of $A$ and increment all its elements by $1$. Your task is to transform the array $A$ into array $B$ using the **minimum** number of operations. If it is impossible to do s

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start