MCPcopy Create free account
hub / github.com/neetcode-gh/leetcode / canSwap

Function canSwap

javascript/0041-first-missing-positive.js:42–43  ·  view source on GitHub ↗
(nums, num, indexNum)

Source from the content-addressed store, hash-verified

40};
41
42const canSwap = (nums, num, indexNum) =>
43 isPositive(num) && isInBound(num, nums) && !isEqual(num, indexNum);
44
45const swap = (nums, index, indexKey) =>
46 ([nums[index], nums[indexKey]] = [nums[indexKey], nums[index]]);

Callers 1

cyclicSortFunction · 0.85

Calls 3

isPositiveFunction · 0.85
isEqualFunction · 0.85
isInBoundFunction · 0.70

Tested by

no test coverage detected