stack clear solution for Adjacent Letters by Phil15 - python coding challenges

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

stack solution in Clear category for Adjacent Letters by Phil15

def adjacent_letters(line: str) -> str:
    stack = []
    for s in line:
        if stack and stack[~0] == s:
            stack.pop()
        else:
            stack.append(s)
    return ''.join(stack)

Sept. 12, 2022

Comments:

lisovsky on Nov. 26, 2022, 2:27 p.m.
Very good!

flowerinapot on June 9, 2023, 10:12 a.m.
What a delightful solution! Delight

BootzenKatzen on Sept. 6, 2023, 6:11 p.m.
Is there a reason you went with [~0] instead of [-1]? I had completely forgotten that was an option, tbh. Nice work!

Phil15 on Sept. 6, 2023, 7:56 p.m.
First two elements `list[:2]`, last two elements`list[-2:]`, `2` and `-2` it's symmetric, right? But first element is at index `0` while last element is at index `~0 == -1`. It's just clearer in some way that `~0` refers to the first element from the end (i.e last one).

amandel on May 1, 2024, 3:36 p.m.
Your solution is identical to mine, both were published on the same day (mine is on speedy). Quite amazing, just the variable names are different (and the way of referring to the last element of a list). After checking some other solutions, I conclude we really nailed it.

Strings Theory

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.