Question: https://leetcode.com/problems/integer-to-english-words/ Post: https://leetcode.com/problems/integer-to-english-words/discuss/415384/strai

Question: https://leetcode.com/problems/minimum-window-substring/ Post: https://leetcode.com/problems/minimum-window-substring/discuss/415634/slidi

Encountered a situation where I have to re-order an array given the new index of its elements. Can't come up with a O(n) solution until I saw this:

[https://en.wikipedia.org/wiki/Fisher–Yates_shuffle](https://en.wikipedia.org/wiki/Fisher–Yates_shuffle) ``` -- To shuffle an array a of n elements

在我心中，头号玩家是一部完美的电影。即使在票房与口碑上，头号玩家都算不上成功的电影。 高达1亿7千万美金的预算，却只有不到6亿美元的全球票房；IMDB评分7.5，Metascore 64，烂番茄77%新鲜度。从数据上来看，这绝对算不上一个失败的电影。由于电影重点渲染了美国80年代的文化背景，而这段

```java class Solution { public int[][] generateMatrix(int n) { if (n == 0) { return null; } if (n

So while LeetCoding, I encountered problems like [296. Best Meeting Point](https://leetcode.com/problems/best-meeting-point/) where you use the fact

# Introduction Heap is a tree based data structure, it is commonly used to implement things like priority queue where sort order is important. In

In short, you can't with stock Premiere without plugin. I am using this plugin: [https://revisionfx.com/products/rsmb/](https://revisionfx.com/prod

> 推荐 git 互动式教程：[learn git branching](https://learngitbranching.js.org) 公司使用常用的git来管理代码，自然是有不少在工作中应用git的机会。在此总结一下常见的操作流程。 ## 取得源代码，创建feature的branch