Printable

2024 AMC 10A Problem 6

Include the solution Back to the problem

2024 AMC 10A Problem 6AMC 10 Step by Step

Name: Date: September 13, 2026

Games & Processes · difficulty 2 of 5 · about 2 min · position P1-10

What is the minimum number of successive swaps of adjacent letters in the string $ABCDEF$ that are needed to change the string to $FEDCBA?$ (For example, $3$ swaps are required to change $ABC$ to $CBA;$ one such sequence of swaps is $ABC\to BAC\to BCA\to CBA.$ )

A)
$6$
B)
$10$
C)
$12$
D)
$15$
E)
$24$

2024 AMC 10A Problem 6

Working