描述Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.
Follow up: The overall run time co ...
5. Longest Palindromic SubstringGiven a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.
Ex ...
104. Maximum Depth of Binary TreeGiven a binary tree, find its maximum depth.
The maximum depth is the number of nodes along the longest path from the ...
5453. Running Sum of 1d ArrayGiven an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]).
Return the running sum ...
1431. Kids With the Greatest Number of CandiesGiven the array candies and the integer extraCandies, where candies[i] represents the number of candies ...
1470. Shuffle the ArrayGiven the array nums consisting of 2n elements in the form [x1,x2,...,xn,y1,y2,...,yn].
Return the array in the form [x1,y1,x2, ...