Given a string s and a non-empty string p, find all the start indices of p’s anagrams in s.继续阅读
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.继续阅读
Given a set of intervals, for each of the interval i, check if there exists an interval j whose start point is bigger than or equal to the end point of the interval i, which can be called that j is on the “right” of i.继续阅读
You are given a doubly linked list which in addition to the next and previous pointers, it could have a child pointer, which may or may not point to a separate doubly linked list. These child lists may have one or more children of their own, and so on, to produce a multilevel data structure, as shown in the example below.继续阅读
Given an n-ary tree, return the level order traversal of its nodes’ values.继续阅读
Given a string s that consists of only uppercase English letters, you can perform at most k operations on that string.
In one operation, you can choose any character of the string and change it to any other uppercase English character.
Find the length of the longest sub-string containing all repeating letters you can get after performing the above operations.继续阅读
Given a non-empty string containing an out-of-order English representation of digits 0-9, output the digits in ascending order.继续阅读
Given a non-empty array of numbers, a0, a1, a2, … , an-1, where 0 ≤ ai < 231. Find the maximum result of ai XOR aj, where 0 ≤ i, j < n. Could you do this in O(n) runtime?继续阅读
Given an 2D board, count how many battleships are in it. The battleships are represented with ‘X’s, empty slots are represented with ‘.’s. You may assume the following rules:继续阅读