You are given an array of numbers and a pattern array. Your task is to count how many subarrays within the number array match the specified pattern.

Given a string, determine how many times the case (upper vs. lower) of consecutive letters changes. Count the number of case changes in the string.

You are given an array of integers and a pattern. Find the number of subarrays in the array that match the given pattern of increasing, decreasing, or equal-valued elements.

You're given an array of numbers. Distribute each number into one of two new arrays based on a simple comparison rule involving the last elements of the target arrays.

Given a list of strings, count the number of pairs where one string is both a prefix and a suffix of the other.

You are given a list of strings. Count how many pairs of strings exist in the list where one string is both a prefix and a suffix of the other string.

Given an array of integers, distribute its elements into two new arrays based on a specific rule: compare the number of elements greater than the current element in each new array, and append to the one with the higher count. Return the final concatenated array.

You're given a sorted array that has been rotated, and a target value. Find the index of the target value in the rotated array, or return -1 if it's not present.

Find the maximum value within each sliding window of a given size as it moves across an array.

Design a data structure that acts as a Least Recently Used (LRU) cache. Implement methods to get and put key-value pairs, evicting the least recently used entry when the cache is full.

Find the median of two sorted arrays. The arrays can be of different sizes, and you should aim for an efficient solution.

Given a list of words, group together all the anagrams. Anagrams are words that contain the same letters rearranged.

Determine if a string containing parentheses is valid. A valid string has matching and properly nested opening and closing parentheses.

Find all unique combinations of numbers from a given array that sum up to a specific target value. You can use the same number multiple times.

Find the contiguous subarray within a given array of numbers which has the largest sum. Return the sum of this subarray.

Given a string of digits, return all possible letter combinations that the number could represent, using the typical phone keypad mapping. The goal is to generate all valid combinations in any order.

Reverse a linked list in groups of k nodes. If the number of nodes is not a multiple of k, leave the remaining nodes at the end as is.

Imagine a game where you repeatedly eliminate numbers from a sorted list. The goal is to determine the last remaining number after this elimination process.

Given a string of digits, find all possible valid IP address combinations you can create by inserting dots. An IP address is valid if each segment is between 0 and 255.

Find the element that appears more than n/2 times in a given array of size n. Essentially, you need to identify the majority element.