Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.

You are given two integer arrays nums1 and nums2 sorted in ascending order and an integer k.

Given two arrays, write a function to compute their intersection.

Say you have an array for which the ith element is the price of a given stock on day i.

Given a n x n matrix where each of the rows and columns are sorted in ascending order, find the kth smallest element in the matrix.

Say you have an array for which the ith element is the price of a given stock on day i.

Say you have an array for which the ith element is the price of a given stock on day i.

Say you have an array for which the ith element is the price of a given stock on day i.

Given a sorted linked list, delete all duplicates such that each element appear only once.

Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.