James Pan

原题网址:https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/Given an array nums and a target value k, find the maximum length of a subarray that sums to k. If there isn't one, return 0

原题网址：https://leetcode.com/problems/sudoku-solver/Write a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by the character '.'.You may assume that th

原题网址：https://leetcode.com/problems/lru-cache/Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.get(key) - Get

原题网址：http://www.lintcode.com/en/problem/consistent-hashing-ii/在 Consistent Hashing I 中我们介绍了一个比较简单的一致性哈希算法，这个简单的版本有两个缺陷：增加一台机器之后，数据全部从其中一台机器过来，这一台机器的读负载过大，对正常的服务会造成影响。当增加到3台机器的时候，每台服务器的负载量不

原题网址：https://leetcode.com/problems/sort-colors/Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order re

原题网址：https://leetcode.com/problems/anagrams/Given an array of strings, group anagrams together.For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"], Return:[ ["ate", "eat","t

原题网址：https://leetcode.com/problems/design-twitter/Design a simplified version of Twitter where users can post tweets, follow/unfollow another user and is able to see the 10 most recent tweets in

原题网址：https://leetcode.com/problems/line-reflection/Given n points on a 2D plane, find if there is such a line parallel to y-axis that reflect the given set of points.Example 1:Given po

原题网址：https://leetcode.com/problems/logger-rate-limiter/Design a logger system that receive stream of messages along with its timestamps, each message should be printed if and only if it is not p

原题网址：https://leetcode.com/problems/maximum-gap/Given an unsorted array, find the maximum difference between the successive elements in its sorted form.Try to solve it in linear time/space.

原题网址：https://leetcode.com/problems/copy-list-with-random-pointer/A linked list is given such that each node contains an additional random pointer which could point to any node in the list or nul

原题网址：https://leetcode.com/problems/n-queens/The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.Given an integer n, retu

原题网址:http://www.lintcode.com/en/problem/memcache/Implement a memcache which support the following features:get(curtTime, key). Get the key's value, return 2147483647 if key does not exis

原题网址：https://leetcode.com/problems/4sum-ii/Given four lists A, B, C, D of integer values, compute how many tuples (i, j, k, l) there are such that A[i] + B[j] + C[k] + D[l] is zero.To make

原题网址：https://leetcode.com/problems/number-of-boomerangs/Given n points in the plane that are all pairwise distinct, a "boomerang" is a tuple of points (i, j, k) such that the distance between 

原题网址：https://leetcode.com/problems/valid-sudoku/Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are fil

原题网址：https://leetcode.com/problems/4sum/Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which

原题网址：https://leetcode.com/problems/3sum/Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of ze

原题网址：https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume t

原题网址：https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume

原题网址：https://leetcode.com/problems/word-pattern/Given a pattern and a string str, find if str follows the same pattern.Here follow means a full match, such that there is a bijection betwee

原题网址：https://leetcode.com/problems/word-pattern/Given a pattern and a string str, find if str follows the same pattern.Here follow means a full match, such that there is a bijection betwee

原题网址：https://leetcode.com/problems/top-k-frequent-elements/Given a non-empty array of integers, return the k most frequent elements.For example,Given [1,1,1,2,2,3] and k = 2, return [1,2].

原题网址：https://leetcode.com/problems/intersection-of-two-arrays-ii/Given two arrays, write a function to compute their intersection.Example:Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], retu

原题网址：https://leetcode.com/problems/two-sum-iii-data-structure-design/Design and implement a TwoSum class. It should support the following operations: add and find.add - Add the number to an

原题网址：https://leetcode.com/problems/unique-word-abbreviation/An abbreviation of a word follows the form . Below are some examples of word abbreviations:a) it --> it (no

原题网址：https://leetcode.com/problems/two-sum/Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have 

原题网址：https://leetcode.com/problems/longest-substring-without-repeating-characters/Given a string, find the length of the longest substring without repeating characters.Examples:Given "ab

原题网址：https://leetcode.com/problems/single-number-ii/Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a lin

原题网址：https://leetcode.com/problems/clone-graph/Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.OJ's undirected graph serialization:Nodes ar

原题网址：https://leetcode.com/problems/maximum-product-of-word-lengths/Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share comm

原题网址：https://leetcode.com/problems/contains-duplicate-ii/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] = num

原题网址：https://leetcode.com/problems/lfu-cache/Design and implement a data structure for Least Frequently Used (LFU) cache. It should support the following operations: getand put.get(key) -