Answer (1 of 5): Quite honestly, Google interview is not as hard as most people thought as the interview process is very standard and general, which is very similar to other large companies. Also you can easily search tons of questions from past Google interviews and they are mainly focused on ...

Jump to level 6. Level 6. Heaps And Maps. Tree Data Structure. Jump to level 7. Level 7. Dynamic Programming. Greedy Algorithm. Jump to level 8.

Yet Another Source Code for LintCode. Current Status : 232AC / 289ALL in Language C++, Up to date (2016-02-10) For more problems and solutions, you can see my LintCode repository. I'll keep updating for full summary and better solutions.

LeetCode R.I.P. to my old Leetcode repository, where there were 5.7k+ stars and 2.2k+ forks (ever the top 3 in the field). Since free questions may be even mistakenly taken down by some companies, only solutions will be post on now. There are new LeetCode questions every week. I'll keep updating for full summary and better solutions.

For finding maximum element I precalculated maximum elements in every 2^a row,2^b column combinations. Like for every sub matrix of size 1,2 1,4 1,8 1,16… 2,1 2,2 2,4 2,8 2,16… 4,1 4,2 4,4 4,8… and so on. This helps to find maximum element in any submatrix in O(1) with O(k.n^2) preprocessing time. It passed in 1.33 seconds .

Joining NumPy Arrays. Joining means putting contents of two or more arrays in a single array. In SQL we join tables based on a key, whereas in NumPy we join arrays by axes. We pass a sequence of arrays that we want to join to the concatenate () function, along with the axis. If axis is not explicitly passed, it is taken as 0.

Here's what Google has to say on recursion - Did you mean: recursion Strange, isn't? Or not!! Recursion is a problem-solving technique that involves breaking a problem into smaller instances of the same problem (also called subproblems) until we get a small enough subproblem having a trivial solution. We can say that recursion is "defining a problem in terms of itself" as it involves ...

Joining NumPy Arrays. Joining means putting contents of two or more arrays in a single array. In SQL we join tables based on a key, whereas in NumPy we join arrays by axes. We pass a sequence of arrays that we want to join to the concatenate () function, along with the axis. If axis is not explicitly passed, it is taken as 0.

A full binary tree is a binary tree where each node has exactly 0 or 2 children. Return a list of all possible full binary trees with N nodes. Each element of the answer is the root node of one possible tree. Each node of each tree in the answer must have node.val = 0. You may return the final list of trees in any order.