docs(docs): delete obsolete array problem pages

apps/docs/content/(array)/189-rotate-array.mdx

@@ -1,42 +0,0 @@
----
-title: '189. Rotate Array'
-description: Given an integer array nums, rotate the array to the right by k steps, where k is non-negative
-sidebar:
-  label: 'Rotate Array'
-  badge: 'Medium'
----
-
-<Badge variant="accent">Two Pointers</Badge>
-
-::::warning
-Try to come up with as many solutions as you can. There are at least three different ways to solve this problem. Could you do it in-place with `O(1)` extra space?
-::::
-
-### Example 1:
-- Input: `nums = [1,2,3,4,5,6,7], k = 3`
-- Output: `[5,6,7,1,2,3,4]`
-- Explanation: rotate 1 steps to the right: `[7,1,2,3,4,5,6]` rotate 2 steps to the right: `[6,7,1,2,3,4,5]` rotate 3 steps to the right: `[5,6,7,1,2,3,4]`
-
-### Example 2:
-- Input: `nums = [-1,-100,3,99], k = 2`
-- Output: `[3,99,-1,-100]`
-- Explanation: rotate 1 steps to the right: `[99,-1,-100,3]` rotate 2 steps to the right: `[3,99,-1,-100]`
-
-### Constraints:
-
-- `1 <= nums.length <= 10^5`
-- `-2^31 <= nums[i] <= 2^31 - 1`
-- `0 <= k <= 10^5`
-
-## Solution
-
-```js
-/**
- * @param {number[]} nums
- * @param {number} k
- * @return {void} Do not return anything, modify nums in-place instead.
- */
-var rotate = function(nums, k) {
-    
-};
-```

apps/docs/content/(array)/2090-k-radius-subarray-averages.mdx

@@ -1,50 +0,0 @@
----
-title: '2090. K Radius Subarray Averages'
-description: You are given a 0-indexed array nums of n integers, and an integer k
-sidebar:
-  label: 'K Radius Subarray Averages'
-  badge: 'Medium'
----
-
-<Badge variant="accent">Array</Badge>
-
-### Example 1:
-- Input: `nums = [7,4,3,9,1,8,5,2,6], k = 3`
-- Output: `[-1,-1,-1,5,4,4,-1,-1,-1]`
-- Explanation:
-  - `avg[0]`, `avg[1]`, and `avg[2]` are `-1` because there are less than `k` elements before each index.
-  - The sum of the subarray centered at index `3` with radius `3` is: `7 + 4 + 3 + 9 + 1 + 8 + 5 = 37`. Using integer division, `avg[3] = 37 / 7 = 5`.
-  - For the subarray centered at index `4`, `avg[4] = (4 + 3 + 9 + 1 + 8 + 5 + 2) / 7 = 4`.
-  - For the subarray centered at index `5`, `avg[5] = (3 + 9 + 1 + 8 + 5 + 2 + 6) / 7 = 4`.
-  - `avg[6]`, `avg[7]`, and `avg[8]` are `-1` because there are less than `k` elements after each index.
-
-### Example 2:
-- Input: `nums = [100000], k = 0`
-- Output: `[100000]`
-- Explanation:
-  - The sum of the subarray centered at index `0` with radius `0` is: `100000`. `avg[0] = 100000 / 1 = 100000`.
-
-### Example 3:
-- Input: `nums = [8], k = 100000`
-- Output: `[-1]`
-- Explanation:
-  - `avg[0]` is `-1` because there are less than `k` elements before and after index `0`.
-
-### Constraints:
-
-- `n == nums.length`
-- `1 <= n <= 10^5`
-- `0 <= nums[i], k <= 10^5`
-
-## Solution
-
-```js
-/**
- * @param {number[]} nums
- * @param {number} k
- * @return {number[]}
- */
-var getAverages = function(nums, k) {
-    
-};
-```

apps/docs/content/(array)/42-trapping-rain-water.mdx

@@ -1,36 +0,0 @@
----
-title: '42. Trapping Rain Water'
-description: Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining
-sidebar:
-  label: 'Trapping Rain Water'
-  badge: 'Hard'
----
-
-<Badge variant="accent">Two Pointers</Badge>
-
-### Example 1:
-- Input: `height = [0,1,0,2,1,0,1,3,2,1,2,1]`
-- Output: `6`
-- Explanation: The above elevation map (black section) is represented by array `[0,1,0,2,1,0,1,3,2,1,2,1]`. In this case, `6` units of rain water (blue section) are being trapped.
-
-### Example 2:
-- Input: `height = [4,2,0,3,2,5]`
-- Output: `9`
-
-### Constraints:
-
-- `n == height.length`
-- `1 <= n <= 2 * 10^4`
-- `0 <= height[i] <= 10^5`
-
-## Solution
-
-```js
-/**
- * @param {number[]} height
- * @return {number}
- */
-var trap = function(height) {
-    
-};
-```