野球拳刷刷刷

Question: Given an array in arbitrary order, find if there exists a contiguous subarray sum up to the target. Example: arr = [5, 1, 3,...

Given the root node of a binary search tree, return the sum of values of all nodes with value between L and R (inclusive). The binary sear...

Given a set of points in the xy-plane, determine the minimum area of a rectangle formed from these points, with sides parallel to the x and ...

Given an array A of integers, return true if and only if it is a valid mountain array. Recall that A is a mountain array if and only if: ...

Given a string S that only contains "I" (increase) or "D" (decrease), let N = S.length. Return any permutation A of [0...

You are given a binary tree in which each node contains an integer value. Find the number of paths that sum to a given value. The path d...

Given an array of characters, compress it in-place. The length after compression must always be smaller than or equal to the original arra...

Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j...

In a string S of lowercase letters, these letters form consecutive groups of the same character. For example, a string like S = "abb...

A rectangle is represented as a list [x1, y1, x2, y2] , where (x1, y1) are the coordinates of its bottom-left corner, and (x2, y2) are the...

Given a list of sorted characters letters containing only lowercase letters, and given a target letter target , find the smallest element ...

Given an integer array with no duplicates. A maximum tree building on this array is defined as follow: The root is the maximum number in ...

Initially, there is a Robot at position (0, 0). Given a sequence of its moves, judge if this robot makes a circle, which means it moves bac...

Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only  distinct  numbers from the original list. For exa...

Given a sorted linked list, delete all duplicates such that each element appear only  once . For example, Given  1->1->2 , return ...

Given a Binary Search Tree and a target number, return true if there exist two elements in the BST such that their sum is equal to the give...