Plain and simple clear solution for Swap Nodes by rodka81 - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

Plain and simple solution in Clear category for Swap Nodes by rodka81

def swap_nodes(a):
    for i in range(0, len(a)-1, 2):
        a[i], a[i+1] = a[i+1], a[i]
    return a

Jan. 25, 2019

Comments:

Oleg_Domokeev on March 10, 2020, 11:33 a.m.
Excellent!

piter239 on April 27, 2020, 5:39 p.m.
so neat!

veky on Jan. 2, 2022, 4:28 p.m.
Iterable doesn't have to support indexing. :-/

ainem on June 22, 2023, 3:36 a.m.
Hello Veky. I have been thinking about your comment. Would changing the code as follows satisfy the requirement in question? ``` def swap_nodes(a): a = list(a) # add this line for i in range(0, len(a)-1, 2): a[i], a[i+1] = a[i+1], a[i] return a # list is Iterble ```

veky on June 24, 2023, 12:27 p.m.
Not really. Iterable (in & out) might be infinite. ;-) Try swap_nodes on itertools.count().

adamspj on March 17, 2024, 11:16 p.m.
The description of the mission is problematic. Besides infinite iterators, we can't really plan for an unsorted iterable. There's nothing to "swap" in a set or dictionary. rodka, I wouldn't change any code unless there were an update to the mission description.

veky on March 21, 2024, 4:24 p.m.
But you're not swapping them inside a set or dictionary (which would be nonsensical, I agree). You're swapping the order in which you go through them. And it does make perfect sense, even for infinite iterators (as my solution shows).

Shelter

0 %

You ClassRoom Demo is Ready With the new tool CheckiO ClassRoom, you will be able to analyze your students' progress, have your own leaderboard, change missions order on the map, and so on.