CodeSignal - Arcade - areEquallystrong

@p-iknow 🎹 · April 20, 2019

Problem
What I learned
My solution
Solution
Python Solution

Problem

image

What I learned

  • 연산자 우선순위
  • sorting 먼저하는 로직
  • python 집합으로 비교하는 로직

My solution

function areEquallyStrong(yourLeft, yourRight, friendsLeft, friendsRight) {
    return (yourLeft + yourRight  === friendsLeft + friendsRight) &&( (yourLeft === friendsLeft) || (yourLeft === friendsRight) )
}

Solution

function areEquallyStrong(yourLeft, yourRight, friendsLeft, friendsRight) {
    var me = [yourLeft, yourRight].sort().join("");
    var friend = [friendsLeft, friendsRight].sort().join("");
    return me === friend;
}

Python Solution

def areEquallyStrong(yourLeft, yourRight, friendsLeft, friendsRight):
    return {yourLeft, yourRight} == {friendsLeft, friendsRight}

def areEquallyStrong(yourLeft, yourRight, friendsLeft, friendsRight):
    return sorted([yourLeft,yourRight])==sorted([friendsLeft,friendsRight])
@p-iknow 🎹
많은 것을 이해하고 싶습니다. 더 이해하기 위해 노력합니다.