You have an array of logs. Each log is a space delimited string of words. For each log, the first word in each log is an alphanumeric identifier. Th ...

A string S of lowercase letters is given. We want to partition this string into as many parts as possible so that each letter appears in at most one p ...

Given a string S, find the length of the longest substring T that contains at most k distinct characters. ExampleNo.1Input: S = “eceba” and k = 3 Outp ...

Given a string s and a non-empty string p, find all the start indices of p’s anagrams in s. Strings consists of lowercase English letters only and the ...

Given a binary tree, find the subtree with maximum average. Return the root of the subtree. NoteIt’s guaranteed that there is only one subtree with ma ...

Given a paragraph and a list of banned words, return the most frequent word that is not in the list of banned words. It is guaranteed there is at lea ...

We have a list of points on the plane. Find the K closest points to the origin (0, 0). (Here, the distance between two points on a plane is the Eucli ...

There is a ball in a maze with empty spaces and walls. The ball can go through empty spaces by rolling up, down, left or right, but it won’t stop roll ...

There is a ball in a maze with empty spaces and walls. The ball can go through empty spaces by rolling up, down, left or right, but it won’t stop roll ...

Given a string s, find the longest palindromic subsequence’s length in s. You may assume that the maximum length of s is 1000. ExampleNo.1Input:“bbbab ...