D. J.:

- Added the leetcode problem and solution for 2799 and 3392

Author: nobodyPerfecZ

README.md

@@ -245,6 +245,8 @@ This repository contains awesome LeetCode problems and solutions written in Pyth
 - [1964 Find the Longest Valid Obstacle Course at Each Position](https://leetcode.com/problems/find-the-longest-valid-obstacle-course-at-each-position/description/)
 - [2140 Solving Questions With Brainpower](https://leetcode.com/problems/solving-questions-with-brainpower/description/)
 - [2466 Count Ways To Build Good Strings](https://leetcode.com/problems/count-ways-to-build-good-strings/description/)
+- [2799 Count Complete Subarrays in an Array](https://leetcode.com/problems/count-complete-subarrays-in-an-array/description/)
+- [3392 Count Subarrays of Length Three With a Condition](https://leetcode.com/problems/count-subarrays-of-length-three-with-a-condition/description/)
 
 ## Development 🔧
 

awesome_python_leetcode/_2799_count_complete_subarrays_in_an_array.py

@@ -0,0 +1,36 @@
+import collections
+from typing import List
+
+
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def countCompleteSubarrays(self, nums: List[int]) -> int:
+        """
+        You are given an array nums consisting of positive integers.
+
+        We call a subarray of an array complete if the following condition is satisfied:
+        - The number of distinct elements in the subarray is equal to the number of
+        distinct elements in the whole array.
+
+        Return the number of complete subarrays.
+
+        A subarray is a contiguous non-empty part of an array.
+        """
+        count = 0
+        freq = collections.defaultdict(int)
+        i, j = 0, 0
+        while i < len(nums):
+            while j < len(nums) and len(freq) < len(set(nums)):
+                freq[nums[j]] += 1
+                j += 1
+
+            if len(freq) < len(set(nums)):
+                break
+
+            count += len(nums) - j + 1
+            freq[nums[i]] -= 1
+            if freq[nums[i]] == 0:
+                del freq[nums[i]]
+            i += 1
+        return count

awesome_python_leetcode/_3392_count_subarrays_of_length_three_with_a_condition.py

@@ -0,0 +1,19 @@
+from typing import List
+
+
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def countSubarrays(self, nums: List[int]) -> int:
+        """
+        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.
+        """
+        count = 0
+        for i in range(1, len(nums) - 1):
+            if 2 * (nums[i - 1] + nums[i + 1]) == nums[i]:
+                count += 1
+        return count

tests/test_2799_count_complete_subarrays_in_an_array.py

@@ -0,0 +1,18 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._2799_count_complete_subarrays_in_an_array import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["nums", "expected"],
+    argvalues=[
+        ([1, 3, 1, 2, 2], 4),
+        ([5, 5, 5, 5], 10),
+    ],
+)
+def test_func(nums: List[int], expected: int):
+    """Tests the solution of a LeetCode problem."""
+    count = Solution().countCompleteSubarrays(nums)
+    assert count == expected

tests/test_3392_count_subarrays_of_length_three_with_a_condition.py

@@ -0,0 +1,22 @@
+# flake8: noqa
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._3392_count_subarrays_of_length_three_with_a_condition import (
+    Solution,
+)
+
+
+@pytest.mark.parametrize(
+    argnames=["nums", "expected"],
+    argvalues=[
+        ([1, 2, 1, 4, 1], 1),
+        ([1, 1, 1], 0),
+        ([8, -10, -4], 0),
+    ],
+)
+def test_func(nums: List[int], expected: int):
+    """Tests the solution of a LeetCode problem."""
+    num_sub_arrays = Solution().countSubarrays(nums)
+    assert num_sub_arrays == expected