[[["이해하기 쉬움","easyToUnderstand","thumb-up"],["문제가 해결됨","solvedMyProblem","thumb-up"],["기타","otherUp","thumb-up"]],[["필요한 정보가 없음","missingTheInformationINeed","thumb-down"],["너무 복잡함/단계 수가 너무 많음","tooComplicatedTooManySteps","thumb-down"],["오래됨","outOfDate","thumb-down"],["번역 문제","translationIssue","thumb-down"],["샘플/코드 문제","samplesCodeIssue","thumb-down"],["기타","otherDown","thumb-down"]],["최종 업데이트: 2025-07-26(UTC)"],[],["The content details how to perform a signed right shift operation on a number. It takes two numerical arguments: `left` (the number to be shifted) and `right` (the number of bits to shift). The operation `Number.rightShift(right)` returns a new number. The provided examples demonstrate shifting the binary representation of 20 two positions to the right, resulting in the value 5. Both JavaScript and Python code examples illustrate this behavior.\n"]]