Arrays

We have two special characters: Given a binary array bits that ends with 0, return true if the last character must be a one-bit character.

The array-form of an integer num is an array representing its digits in left to right order.

Given an array nums of n integers and an integer k, determine whether there exist two adjacent subarrays of length k such that both subarrays are strictly increasing.

There is a circle of red and blue tiles.

An ant is on a boundary.

You are given an array apple of size n and an array capacity of size m.

You are given a 0-indexed array nums of size n consisting of non-negative integers.

Given an integer array nums of 2n integers, group these integers into n pairs (a1, b1), (a2, b2), ..., (an, bn) such that the sum of min(ai, bi) for all i is maximized.

Assume you are an awesome parent and want to give your children some cookies.

You are given an 8 x 8 matrix representing a chessboard.

You are given an array of unique integers salary where salary[i] is the salary of the ith employee.

Given an integer array nums of positive integers, return the average value of all even integers that are divisible by 3.

You are given an integer array ranks and a character array suits.

You are given an array prices where prices[i] is the price of a given stock on the ith day.

You are given a binary array nums (0-indexed).

Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums.

Given a zero-based permutation nums (0-indexed), build an array ans of the same length where ans[i] = nums[nums[i]] for each 0 <= i < nums.length and return it.

You are given a 2D array events which represents a sequence of events where a child pushes a series of buttons on a keyboard.

You are given an integer array prices representing the prices of various chocolates in a store.

You are given a 0-indexed 2D integer array brackets where brackets[i] = [upperi, percenti] means that the ith tax bracket has an upper bound of upperi and is taxed at a rate of...

A sequence of numbers is called an arithmetic progression if the difference between any two consecutive elements is the same.

You have a long flowerbed in which some of the plots are planted, and some are not.

There is an m x n matrix that is initialized to all 0's.

You are given an array of distinct integers arr and an array of integer arrays pieces, where the integers in pieces are distinct.

You are given a 0-indexed string s consisting of only lowercase English letters, where each letter in s appears exactly twice.

Given an array of strings words and a string s, determine if s is an acronym of words.

Given an binary array nums and an integer k, return true if all 1's are at least k places away from each other, otherwise return false.

You are given a 2D integer array ranges and two integers left and right.

You are given an integer array nums.

You are given an integer array nums.

Given an array nums, return true if the array was originally sorted in non-decreasing order, then rotated some number of positions (including zero).

You are given an array of positive integers nums.

An n x n matrix is valid if every row and every column contains all the integers from 1 to n (inclusive).

You are given a 2D matrix grid of size m x n.

You are given an array coordinates, coordinates[i] = [x, y], where [x, y] represents the coordinate of a point.

A square matrix is said to be an X-Matrix if both of the following conditions hold: Given a 2D integer array grid of size n x n representing a square matrix, return true if grid...

Given an array arr of integers, check if there exist two indices i and j such that :

Given a string s and an array of strings words, determine whether s is a prefix string of words.

Given two string arrays word1 and word2, return true if the two arrays represent the same string, and false otherwise.

Given an integer array nums of length n, you want to create an array ans of length 2n where ans[i] == nums[i] and ans[i + n] == nums[i] for 0 <= i < n (0-indexed).

You are given an array nums consisting of n prime integers.

Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct.

Given an integer array nums and an integer k, return true if there are two distinct indices i and j in the array such that nums[i] == nums[j] and abs(i - j) <= k.

You are given a 0-indexed 1-dimensional (1D) integer array original, and two integers, m and n.

Given two string arrays words1 and words2, return the number of strings that appear exactly once in each of the two arrays.

You are given a positive integer n, that is initially placed on a board.

You are given an array nums consisting of positive integers.

Given an integer array nums, return the number of elements that have both a strictly smaller and a strictly greater element appear in nums.

Given an array of integers arr, and three integers a, b and c.

You are given a 0-indexed integer array nums.

You are given an array items, where each items[i] = [typei, colori, namei] describes the type, color, and name of the ith item.

Given a m x n matrix grid which is sorted in non-increasing order both row-wise and column-wise, return the number of negative numbers in grid.

Given an integer array nums and an integer k, return the number of pairs (i, j) where i < j such that |nums[i] - nums[j]| == k.

You are given a 0-indexed string array words.

Given an integer array hours representing times in hours, return an integer denoting the number of pairs i, j where i < j and hours[i] + hours[j] forms a complete day.

You are given an integer array nums of length n.

You are given a 0-indexed string array words.

You are given a string array words and a string s, where words[i] and s comprise only of lowercase English letters.

Given a 0-indexed integer array nums, return the number of distinct quadruplets (a, b, c, d) such that:

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.