Leetcode 100510. Count Subarrays of Length Three With a Condition || Biweekly Contest 146

Welcome to the 146th LeetCode Biweekly Contest

Given an integer array nums, return the number of subarrays of length 3 such that the sum of the first and third numbers equals exactly half of the second number.

A subarray is a contiguous non-empty sequence of elements within an array.

https://leetcode.com/contest/biweekly-contest-146/problems/count-subarrays-of-length-three-with-a-condition/description/

Тэги:

#Leetcode #Count_Subarrays_of_Length_Three_With_a_Condition #100510._Count_Subarrays_of_Length_Three_With_a_Condition #Biweekly_Contest_146

Скачать видео