def count$\_$price$\_$errors$($products$,$

productPrices, productsSold,

sellingPrices$)$:

# Step $1$: Create a dictionary for

product prices

correct$\_$prices $=\{$products$[$i$]$:

productPrices$[$i$]$ for i in

range$($len$($products$))\}$

# Step $2$: Initialize error counter

errors $=0$

# Step $3$: Compare each sold price

with the correct price

for i in range$($len$($productsSold$))$:

product $=$ productsSold$[$i$]$

selling$\_$price $=$ sellingPrices$[$i$]$

correct$\_$price $=$

correct$\_$prices$[$product$]$

if selling$\_$price $!=$ correct$\_$price:

errors $+=1$

$12$ answers left

Get unlimited more.

Given an array of integers, what is the length of the longest subarray containing no more than two distinct values such that the distinct values differ by no more than $1?$

Example

arr$=[0,1,2,1,2,3]$

The largest such subarray has length $4$: $1,2,1,2$

arr$=[1,1,1,3,3,2,2]$

The largest such subarray has length $4$: $3,3,2,2.$ The values $1$ and $3$ differ by more than $1$ so $1,1,1,3,3$ is not valid.

Function Description

Complete the function longestSubarray in the editor below.

longestSubarray has the following parameter$($s$)$:

int arr$[$n$]$: an array of integers