First clear solution for One Switch Strings by mildm - python coding challenges

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

First solution in Clear category for One Switch Strings by mildm

def switch_strings(line: str, result: str) -> bool:
    return sorted(line)==sorted(result) and list(map(lambda x:x[0]==x[1],zip(line,result))).count(False)<3

Sept. 3, 2023

Comments:

entreoutros on July 20, 2024, 3:06 p.m.
Probably the best solution I've seen! Very clever use of sorted() and map(). What do you think of this simpler version I made inspired by it, but without zip and count? <a href="https://py.checkio.org/mission/one-switch-strings/publications/entreoutros/python-3/sorted-sum-map-lambda-1-line/">https://py.checkio.org/mission/one-switch-strings/publications/entreoutros/python-3/sorted-sum-map-lambda-1-line/</a>

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.