Given a non-negative integer represented as non-empty a singly linked list of digits, plus one to the integer.

Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n).

Design an algorithm to encode a list of strings to a string. The encoded string is then sent over the network and is decoded back to the original list of strings.

A character in UTF8 can be from 1 to 4 bytes long, subjected to the following rules:

Given a string S and a character C, return an array of integers representing the shortest distance from the character C in the string.

Given a string, find the length of the longest substring without repeating characters.

Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.

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] and the absolute difference between i and j is at most k.

Given an array of integers, find out whether there are two distinct indices i and j in the array such that the absolute difference between nums[i] and nums[j] is at most t and the absolute difference between i and j is at most k.

Given a list of 24-hour clock time points in "Hour:Minutes" format, find the minimum minutes difference between any two time points in the list.

Assume you have an array of length n initialized with all 0's and are given k update operations.

The set S originally contains numbers from 1 to n. But unfortunately, due to the data error, one of the numbers in the set got duplicated to another number in the set, which results in repetition of one number and loss of another number.

Given an array, rotate the array to the right by k steps, where k is non-negative.

Give a string s, count the number of non-empty (contiguous) substrings that have the same number of 0's and 1's, and all the 0's and all the 1's in these substrings are grouped consecutively.

Given two sentences words1, words2 (each represented as an array of strings), and a list of similar word pairs pairs, determine if two sentences are similar.

There is a list composed by sets. If two sets have the same elements, merge them. In the end, there are several sets left.

Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.

1.If n is even, replace n with n/2.2.If n is odd, you can replace n with either n + 1 or n - 1.

A Uni-value subtree means all nodes of the subtree have the same value.

Given a string s, return all the palindromic permutations (without duplicates) of it. Return an empty list if no palindromic permutation could be form.

Given a list of daily temperatures, produce a list that, for each day in the input, tells you how many days you would have to wait until a warmer temperature. If there is no future day for which this is possible, put 0 instead.

Problem Given a non-negative integer n, print the number in words. Example Given n = 125 Return one hundred twenty five Solution {代码...}

A group of two or more people wants to meet and minimize the total travel distance. You are given a 2D grid of values 0 or 1, where each 1 marks the home of someone in the group. The distance is calculated using Manhattan Distance, where distance(p1, p2) = |p2.x - p1.x| + |p2.y - p1.y|.

Given two numbers n and k. We need to find out if n can be written as sum of k prime numbers.

Binary Tree PruningWe are given the head node root of a binary tree, where additionally every node's value is either a 0 or a 1.

In LOL world, there is a hero called Teemo and his attacking can make his enemy Ashe be in poisoned condition. Now, given the Teemo's attacking ascending time series towards Ashe and the poisoning time duration per Teemo's attacking, you need to output the total time that Ashe is in poisoned cond...

Given a list of strings, each string can be one of the 4 following types:

Minimum Absolute Difference in BSTGiven a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes.

You have 4 cards each containing a number from 1 to 9. You need to compute whether they could operated through *, /, +, -, (, ) to get the value of 24.

There is now an order with demand for n items, and the demand for the i-th item is order[i]. The factory has m production modes. Each production mode is shaped like [p[1],p[2],...p[n]], that is, produce p[1] first items, p[2] second items... You can use multiple production modes. Please tell me h...