问题：找第 K 大的数在一个数组里在数据流中找最大的 K 个数在一个数组里在数据流中找出现频率最高的 K 个数在一个数组中在数据流中在文件中这种题适合各种follow up核实问题：是否需要精确的结果？数据是离线的(文件形式计算一次得到一个结果)还是在线的(数据流可无限次查询实时结果)？-问题1 - 找第 K 大的数：在一个...

工作之后代码都是业务逻辑，与算法题很不一样。在研究公司代码库时发现很多设计模式的应用，于是打算系统地学习Design Pattern。想要达到的目的是，给一个需求，能够迅速知道哪种设计模式可以应用，然后分析在这个情境中是否应该用这个设计模式，还是组合多个设计模式，抑或压根不用设计模式避免过度设计。达到这个目标...

日活用户:100M每人每天使用：(写)长到短0.1，(读)短到长1日request:写10M，读100Mqps：写100,读1Kpeak qps: 写200,读2K(千级别的qps可以单台SSD MySQL搞定)

www.google.com会自动补全为[链接]这是个url,他表示网络某个资源(resource)的位置, 一般格式为: protocol :// hostname[:port] / path / ;parameters#fragment

用爬山来比喻回溯，好比从山脚下找一条爬上山顶的路,起初有好几条道可走,当选择一条道走到某处时,又有几条岔道可供选择,只能选择其中一条道往前走,若能这样子顺利爬上山顶则罢了,否则走到一条绝路上时或者这条路上有一坨屎,我们只好返回到最近的一个路口,重新选择另一条没走过的道往前走。如果该路口的所有路都走不通,只...

最近正在面试uber，uber以频繁考察系统设计而著名，系统设计是一个没有标准答案的open-end问题，所以关键在于对于特定问题的设计选择,俗称trade-off，这个思维平时无处锻炼，故开启此文，记录学习和理解的过程。 本文全部题目和分析来自《Elements Of Programming Interviews》的 Design Problems 章节，我只是在他的基...

Given a list of non negative integers, arrange them such that they form the largest number. For example, given [3, 30, 34, 5, 9], the largest formed number is9534330. Note: The result may be very large, so you need to return a stringinstead of an integer.

The set [1,2,3,…,n] contains a total of n! unique permutations. By listing and labeling all of the permutations in order, We get thefollowing sequence (ie, for n = 3): "123" "132" "213" "231" "312" "321" Given n and k, return the kthpermutation sequence. Note: Given n will be between 1 and 9 incl...

Given an unsorted integer array, find the first missing positive integer. For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2. Your algorithm should run in O(n) time and uses constant space.

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 is placed on an empty block.Once a winning condition is reached, no more moves is allowed.A player who succeeds in placing n of their marks in a h...

Given a binary tree, collect a tree's nodes as if you were doing this: Collect and remove all leaves, repeat until the tree is empty. Example:Given binary tree {代码...} Returns [4, 5, 3], [2], [1]. Explanation: Removing the leaves [4, 5, 3] would result in this tree: {代码...} 2 Now removing the...

Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of elements in this subset satisfies: Si % Sj = 0 or Sj % Si = 0. If there are multiple solutions, return any subset is fine. Example 1: nums: [1,2,3]Result: [1,2] (of course, [1,3] will also be ok) E...

Numbers can be regarded as product of its factors. For example, {代码...} Write a function that takes an integer n and return all possible combinations of its factors. Note: You may assume that n is always positive.Factors should be greater than 1 and less than n.

Given a binary search tree and a node in it, find the in-order successor of that node in the BST. Note: If the given node has no in-order successor in the tree, return null.

Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are +, - and *. Example 1Input: "2-1-1". {代码...} Output: [0, 2] Example 2Input: "23-45" {代码...} Output: [-34, -14, -10, -10, 10]

Given a binary tree where all the right nodes are either leaf nodes with a sibling (a left node that shares the same parent node) or empty, flip it upside down and turn it into a tree where the original right nodes turned into left leaf nodes. Return the new root. For example:Given a binary tree ...

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 instead. Example 1:Given nums = [1, -1, 5, -2, 3], k = 3,return 4. (because the subarray [1, -1, 5, -2] sums to 3 and is the longest) Example 2:Given nums = [-2, -1, 2, 1],...

Given a sorted array of integers nums and integer values a, b and c. Apply a function of the form f(x) = ax2 + bx + c to each element x in the array. The returned array must be in sorted order. Expected time complexity: O(n) Example:nums = [-4, -2, 2, 4], a = 1, b = 3, c = 5,Result: [3, 9, 15, 33...

Given an unsorted array, find the maximum difference between the successive elements in its sorted form. Try to solve it in linear time/space. Return 0 if the array contains less than 2 elements. You may assume all elements in the array are non-negative integers and fit in the 32-bit signed integ...

先写一个utility: pushAllLeft(root)：把root(包含)一路向左通到底，路过的节点将其访问(加入到result)，并压入栈，留作备用；此时栈顶的元素满足:他的左孩子以及他自己必已经被访问；栈顶元素都是下一个应该访问的子树的根，将其弹出，(不必访问，因为他进栈时已被访问)，然后尝试访问它的右孩子;如果有右孩子，把右孩...

Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get. For example, given n = 2, return 1 (2 = 1 + 1); given n = 10, return 36 (10 = 3 + 3 + 4). Note: you may assume that n is not less...

Write a function to generate the generalized abbreviations of a word. Example:Given word = "word", return the following list (order does not matter): {代码...}

The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility) {代码...} And then read line by line: "PAHNAPLSIIGYIR"Write the code that will take a string and make this conversion given ...

You are playing the following Bulls and Cows game with your friend: You write down a number and ask your friend to guess what the number is. Each time your friend makes a guess, you provide a hint that indicates how many digits in said guess match your secret number exactly in both digit and posi...

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 fence posts have the same color. Return the total number of ways you can paint the fence. Note:n and k are non-negative integers.

Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3,Return [1,3,3,1].

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 you from robbing each of them is that adjacent houses have security system connected and it will automatically contact the police if two adjacent hou...

Intersection of Two Arrays II {代码...} 排序+双指针 复杂度 O(Min(N,M)) 时间 O(Min(N,M)) 空间 思路 先排序，用两个指针从头扫：小的那个肯定不行，指针往后相等的全都放到result里 注意 没有 代码 {代码...} Follow Up What if elements of nums2 are stored on disk, and the memory is limited such that you can...

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note:You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. The number of elements initialized in nums1 and nums2 are m and n respectiv...

Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically neighboring. The same >letter cell may not be used more than once. For example, Given board = {...