How should I practice Minimum Numeric Code Transformation?

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

Is Minimum Numeric Code Transformation associated with Adobe?

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

Minimum Numeric Code Transformation

Adobe● HardFULLTIMEOA

Learn

Problem statement

You receive one reconfiguration request. Start with the positive integer x and transform it into y. Each allowed operation costs exactly one step:

Scale: choose an integer a with 2 <= a <= k and replace the current value v with v * a, only when the result is at most 10^6.
Split: choose an integer a with 2 <= a <= k. If v is divisible by a, replace it with v / a.
Mirror: reverse the decimal digits. Leading zeros produced by reversal are discarded, so 120 becomes 21.
Rotate last to front: move the final decimal digit to the front. This operation is forbidden when it would create a leading zero.
Swap adjacent digits: swap any one adjacent pair. This operation is forbidden when it would create a leading zero.

Every intermediate value must remain between 1 and 10^6, inclusive. Return the minimum number of operations needed to reach y, or -1 when no valid sequence exists.

Function

minimumCodeTransformOperations(x: int, y: int, k: int) → int

Examples

Example 1

x = 4y = 6k = 3return = 2

Scale by 3 to get 12, then split by 2 to get 6. No one-step operation transforms 4 directly into 6.

Example 2

x = 120y = 21k = 10return = 1

One mirror operation reverses 120 to 021; the leading zero is discarded, leaving 21.

Constraints

1 <= x, y <= 10^6
2 <= k <= 10^3

Source note: Public assessment screenshots showing the complete operation rules, bounds, and sample.