René's URL Explorer Experiment

Title: #3151 - Special Array I - LeetCode JavaScript Solutions

Open Graph Title: #3151 - Special Array I - LeetCode JavaScript Solutions

X Title: #3151 - Special Array I - LeetCode JavaScript Solutions

Description: An array is considered special if every pair of its adjacent elements contains two numbers with different parity. You are given an array of ...

Open Graph Description: An array is considered special if every pair of its adjacent elements contains two numbers with different parity. You are given an array of ...

X Description: An array is considered special if every pair of its adjacent elements contains two numbers with different parity. You are given an array of ...

Keywords:

• leetcode
• javascript
• solutions
• algorithms
• data structures
• coding
• programming
• coding challenges
• coding problems
• coding solutions

Opengraph URL: https://leetcodejavascript.com/solutions/special-array-i

direct link

Domain: leetcodejavascript.com

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/special-array-i","name":"#3151 - Special Array I - LeetCode JavaScript Solutions","description":"An array is considered special if every pair of its adjacent elements contains two numbers with different parity. You are given an array of ...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @return {boolean}\n */\nvar isArraySpecial = function(nums) {\n  for (let i = 0; i < nums.length - 1; i++) {\n    if ((nums[i] + nums[i + 1]) % 2 === 0) {\n      return false;\n    }\n  }\n  return true;\n};","keywords":"LeetCode 3151, #3151 - Special Array I, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}

Links:

Viewport: width=device-width, initial-scale=1.0

Robots: index, follow