摘要：
Given a linked list and two values v1 and v2. Swap the two nodes in the linked list with values v1 and v2. It's guaranteed there is no duplicate value 阅读全文
摘要：
18.13 Given a list of millions of words, design an algorithm to create the largest possible rectangle of letters such that every row forms a word (rea 阅读全文
摘要：
18.12 Given an NxN matrix of positive and negative integers, write code to find the submatrix with the largest possible sum. 这道求和最大的子矩阵，跟LeetCode上的Max 阅读全文
摘要：
18.11 Imagine you have a square matrix, where each cell (pixel) is either black or white. Design an algorithm to find the maximum subsquare such that 阅读全文
摘要：
18.10 Given two words of equal length that are in a dictionary, write a method to transform one word into another word by changing only one letter at 阅读全文
摘要：
18.9 Numbers are randomly generated and passed to a method. Write a program to find and maintain the median value as new values are generated. LeetCod 阅读全文
摘要：
18.8 Given a string s and an array of smaller strings T, design a method to search s for each small string in T. 这道题给我们一个字符串s，和一个字符串数组T，让我们找T中的每一个小字符串 阅读全文
摘要：
5.7 Given a list of words, write a program to find the longest word made of other words in the list. 这道题给了我们一个字符串数组，让我们找到最长的那个单词是由字符串数组中的其他单词组成的，LeetC 阅读全文
摘要：
18.6 Describe an algorithm to find the smallest one million numbers in one billion numbers. Assume that the computer memory can hold all one billion n 阅读全文
摘要：
Design a Tic-tac-toe game that is played between two players on a n x n grid. You may assume the following rules: A move is guaranteed to be valid and 阅读全文
摘要：
18.5 You have a large text file containing words. Given any two words, find the shortest distance (in terms of number of words) between them in the fi 阅读全文
摘要：
18.4 Write a method to count the number of 2s between 0 and n. 这道题给了我们一个整数n，让我们求[0,n]区间内所有2出现的个数，比如如果n=20，那么满足题意的是2, 12, 20,那么返回3即可。LeetCode上有一道很类似的题F 阅读全文
摘要：
18.3 Write a method to randomly generate a set of m integers from an array of size n. Each element must have equal probability of being chosen. 这道题让我们 阅读全文
摘要：
在VTK中，我们有时候想要保存vtkImageData类的变量到一幅图片，可以使用如下的实例代码： 阅读全文
摘要：
Given a non-empty array of integers, return the k most frequent elements. Example 1: Example 2: Input: nums = [1], k = 1 Output: [1] Example 2: Note: 阅读全文
摘要：
18.2 Write a method to shuffle a deck of cards. It must be a perfect shuffle—in other words, each of the 52! permutations of the deck has to be equall 阅读全文
摘要：
18.1 Write a function that adds two numbers. You should not use + or any arithmetic operators. 这道题让我们实现两数相加，但是不能用加号或者其他什么数学运算符号，那么我们只能回归计算机运算的本质，位操作Bi 阅读全文
摘要：
Given a stream of integers and a window size, calculate the moving average of all integers in the sliding window. Example: MovingAverage m = new Movin 阅读全文
摘要：
17.14 Oh, no! You have just completed a lengthy document when you have an unfortunate Find/Replace mishap. You have accidentally removed all spaces, p 阅读全文
摘要：
A message containing letters from A-Z is being encoded to numbers using the following mapping: 'A' -> 1'B' -> 2...'Z' -> 26Given an encoded message co 阅读全文
摘要：
Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n. ExampleGiven n = 12, retur 阅读全文
摘要：
There is a fence with n posts, each post can be painted with one of the k colors.You have to paint all the posts such that no more than two adjacent f 阅读全文
摘要：
There are a row of n houses, each house can be painted with one of the three colors: red, blue or green. The cost of painting each house with a certai 阅读全文
摘要：
There are a row of n houses, each house can be painted with one of the k colors. The cost of painting each house with a certain color is different. Yo 阅读全文
摘要：
Write a program to check whether a given number is an ugly number`. Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For ex 阅读全文
摘要：
Java和C++中都有关于子字符串的操作，C++中是substr()，Java中是substring()，两者的用法上稍有些区别，首先针对只有一个参数的情况: s.substr(start) 和 s.substring(start) 均表示从start位置开始到结尾的子字符串 而对于有两个参数的情况 阅读全文
摘要：
After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This t 阅读全文
摘要：
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping yo 阅读全文
摘要：
The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the "root." Besides the root, each hou 阅读全文
摘要：
17.13 Consider a simple node-like data structure called BiNode, which has pointers to two other nodes. The data structure BiNode could be used to repr 阅读全文
摘要：
17.12 Design an algorithm to find all pairs of integers within an array which sum to a specified value. 这道题实际上跟LeetCode上的Two Sum很类似，但是不同的是，那道题限定了只有一组解 阅读全文
摘要：
Write a program to find the nth super ugly number. Super ugly numbers are positive numbers whose all prime factors are in the given prime list primes 阅读全文
摘要：
17.11 Implement a method rand7() given rand5(). That is, given a method that generates a random number between 0 and 4 (inclusive), write a method tha 阅读全文
摘要：
17.10 Since XML is very verbose, you are given a way of encoding it where each tag gets mapped to a pre-defined integer value. The language/grammar is 阅读全文
摘要：
You know what, left pad is javascript package and referenced by React: Github link One day his author unpublished it, then a lot of javascript project 阅读全文
摘要：
Given a nested list of integers, implement an iterator to flatten it. Each element is either an integer, or a list -- whose elements may also be integ 阅读全文
摘要：
For an array A, if i < j, and A [i] > A [j], called (A [i], A [j]) is a reverse pair.return total of reverse pairs in A. ExampleGiven A = [2, 4, 1, 3, 阅读全文
摘要：
17.9 Design a method to find the frequency of occurrences of any given word in a book. 这道题让我们找书中单词出现的频率，那么首先需要搞清楚的问题是，只需要统计一个单词，还是多个单词。如果是一个单词的话，那直接就遍 阅读全文
摘要：
17.8 You are given an array of integers (both positive and negative). Find the contiguous sequence with the largest sum. Return the sum. LeetCode上的原题， 阅读全文
摘要：
17.7 Given any integer, print an English phrase that describes the integer (e.g., "One Thousand, Two Hundred Thirty Four"). LeetCode上的原题，请参见我之前的博客Inte 阅读全文
