# Reference

## Reference

```
不积跬步无以至千里，不积小流无以成江海。

练习，思考，总结。

1. 总结归类相似题目
2. 找出适合同一类题目的模板程序
3. 熟练掌握基础题
4. 从题海中找到知识网络，看到本质
```

## 参考资料

### 算法总结

* [编程之法：面试和算法心得 (The-Art-Of-Programming-By-July)](https://github.com/julycoding/The-Art-Of-Programming-By-July/blob/master/ebook/zh/Readme.md)
* [July CSDN Blog](http://blog.csdn.net/v_JULY_v)
* [Problem Solving with Algorithms and Data Structures Using Python](http://interactivepython.org/runestone/static/pythonds/index.html)
* [Top 10 Algorithms for Coding Interview - Program Creek](http://www.programcreek.com/2012/11/top-10-algorithms-for-coding-interview/) [pdf](http://www.programcreek.com/wp-content/uploads/2012/11/coding-interview3.pdf)
* [Top 10 algorithms in Interview Questions - GeeksforGeeks](http://www.geeksforgeeks.org/top-10-algorithms-in-interview-questions/)
* [Code\_Ganker LeetCode总结](http://blog.csdn.net/column/details/leetcode-summary.html) 
* [LeetCode总结 - linhuanmars](http://blog.csdn.net/linhuanmars/article/category/2336231)
* [Logan's LintCode总结](http://blog.csdn.net/luoshengkim/article/category/3050985)
* [Programming Interview Questions - Arden Dertat](http://www.ardendertat.com/2012/01/09/programming-interview-questions/)
* [Tushar Roy's Interview Wiki](https://github.com/mission-peace/interview/wiki)

### 博客文章

* [我的算法学习之路 by Lucida@Google](http://zh.lucida.me/blog/on-learning-algorithms/)
* [程序员必读书单 1.0 by Lucida@Google](http://zh.lucida.me/blog/developer-reading-list/)
* [教你如何迅速秒杀掉：99%的海量数据处理面试题](http://blog.csdn.net/v_july_v/article/details/7382693)
* [十道海量数据处理面试题与十个方法大总结](http://blog.csdn.net/v_JULY_v/article/details/6279498)
* [程序员面试、算法研究、编程艺术、红黑树、数据挖掘5大系列集锦](http://blog.csdn.net/v_july_v/article/details/6543438)

### 可视化

* [VisuAlgo - visualising data structures and algorithms through animation](http://visualgo.net)
* [Data Structure Visualizations](http://www.cs.usfca.edu/~galles/visualization/Algorithms.html)

### 刷题记录

* [Zhang Lei: 水中的鱼](http://fisherlei.blogspot.com/)
* [yuanbin - 数据结构与算法/leetcode/lintcode题解](http://algorithm.yuanbin.me)
* [tanglei](https://www.gitbook.com/book/tl3shi/leetcode-summary/details)
* [Yu's Coding Garden](http://yucoding.blogspot.sg)
* [siddontang - LeetCode题解](https://siddontang.gitbooks.io/leetcode-solution/content/)
* [Cracking the Coding Interview 6th Ed. Solutions](https://github.com/careercup/CtCI-6th-Edition)
* [Code Ganker征服代码](http://blog.csdn.net/linhuanmars)
* [lefttree LintCode 题解](https://lefttree.gitbooks.io/leetcode/content/index.html)
* [ShawnFan LintCode](https://github.com/shawnfan/LintCode)
* [\*小土刀的面试刷题笔记](http://wdxtub.com/interview/index.html)
* \*[Algorithm Notes by mnmunknown](https://mnmunknown.gitbooks.io/algorithm-notes) (**专题分类很好**) 👍
* \*[LintCode Java Algorithm Problems by awangdev@github](https://github.com/awangdev/LintCode) **(分析、优化很详尽) 👍**
* \*[Grandyang's cnblogs](https://www.cnblogs.com/grandyang/) (**思路分析，多种解法**）👍

### Online Judge

* [LeetCode](https://github.com/aaronice/lintcode/tree/bbbb974440d4233e80bad25778c3733867e871db/www.leetcode.com)
* [LintCode](https://github.com/aaronice/lintcode/tree/bbbb974440d4233e80bad25778c3733867e871db/www.lintcode.com)
* [InterviewBit](https://github.com/aaronice/lintcode/tree/bbbb974440d4233e80bad25778c3733867e871db/www.interviewbit.com)
* [HackerRank](https://www.hackerrank.com/)
* [GeeksforGeeks Practice](http://www.practice.geeksforgeeks.org/)

### 在线课程

* [CS 97SI: Introduction to Programming Contests](http://web.stanford.edu/class/cs97si/)

### 其他

* [Runestone Interactive](http://runestoneinteractive.org/)
* [How To Think Like a Computer Scientist](http://interactivepython.org/runestone/static/thinkcspy/index.html)
* [CS Principles: Big Ideas in Programming](http://interactivepython.org/runestone/static/StudentCSP/index.html)
* [Problem Solving with Algorithms and Data Structures](http://interactivepython.org/runestone/static/pythonds/index.html)
* [interactive-coding-challenges](https://github.com/donnemartin/interactive-coding-challenges)


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://aaronice.gitbook.io/lintcode/reference.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.