### Find K Pairs with Smallest Sums

The goal is to find the k pairs formed by choosing one element from each array. These pairs have the smallest sums among all possible combinations of elements from both arrays. ### K Radius Subarray Averages

The task is to compute running average of an array. We must do it efficiently. ### Make Array Strictly Increasing

The task involves finding the minimum number of operations, where each operation consists of replacing an element in an array with an element from another, to make source array strictly increasing. ### H-Index (2)

The task involves finding the researcher's h-index from a sorted array of citations. The h-index represents the maximum value 'h' where the researcher has published at least 'h' papers, each cited at least 'h' times. ### Count Negative Numbers in a Sorted Matrix

Simple traversing problem that can be solve in many ways