Important Notice:

Practice-It will be discontinued as of November 1st, 2024. After this date, the website will remain online for a transitional period, but login will be restricted to University of Washington NetID authentication. This marks the next phase towards the platform's full retirement. Thank you for your use and support of the application over the years.

If you are looking for an alternative, a similar tool, CodeStepByStep, was developed independently by the original author of Practice-It, and is available at codestepbystep.com**

logo Practice-It logo

Main Page → Problems → Solve a Problem

switchPairs

Language/Type: Java Lists
Author: Stuart Reges (on 2020/10/08)

Write a method called switchPairs that switches the order of values in a List of Strings in a pairwise fashion. Your method should switch the order of the first two values, then switch the order of the next two, switch the order of the next two, and so on. For example, if a list stores: 

[four, score, and, seven, years, ago]

your method should switch the first pair (four, score), the second pair (and, seven) and the third pair (years, ago), to yield this list: 

[score, four, seven, and, ago, years]

If there are an odd number of values in the list, the final element is not moved. For example, if the original list had been: 

[to, be, or, not, to, be, hamlet]

It would again switch pairs of values, but the final value (hamlet) would not be moved, yielding this list: 

[be, to, not, or, be, to, hamlet]
Type your solution here:


This is a method problem. Write a Java method as described. Do not write a complete program or class; just the method(s) above.

You must log in before you can solve this problem.


Log In

If you do not understand how to solve a problem or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect problems/tests, etc.), please

Is there a problem? Contact a site administrator.