Guide · Open source
How to use algorithm-pattern: templates and a study order for coding interviews
Updated · written with AI from the project's own documentation and checked against our catalogue data
algorithm-pattern is an open-source collection of reusable templates for common algorithm problems, organized by topic such as binary trees, sliding window, dynamic programming and backtracking. It also suggests an order for working through LeetCode problems. This guide explains how to get the repo, how it is organized, and how to use the templates alongside practice problems. It is written for people preparing for coding interviews, especially beginners and Go programmers.
Algorithm Patternsgreyireland/algorithm-pattern · ★ 15.5k · MIT Install options & downloads Quick start
- 1Clone the repository. Run git clone https://github.com/greyireland/algorithm-pattern to get a local copy, or open the GitBook docs online.
- 2Read the Getting Started pages. Start with the Intro to Go and Algorithm Quickstart pages if you are new to the language or to algorithm problems.
- 3Study one topic at a time. Open a topic such as Sliding Window or Backtracking and read the thought process and common pitfalls.
- 4Solve the practice problems. Each article ends with practice problems. Write the code yourself rather than only reading the answer.
- 5Follow the suggested order. Move from this repo to the LeetCode Explore basic cards, then to the Coding Interviews (剑指 offer) problem set.
- 6Skip and return to hard problems. If a problem is stuck, skip it for now, build a foundation, and come back to it later.
What algorithm-pattern is and who it suits
The project describes an algorithm pattern as a reusable template for solving a class of problems. The author wrote it while preparing for technical job interviews, and the README reads as a personal study record rather than a formal course.
It is a good fit if you want to study by topic, if you are unsure where to start with LeetCode, or if you want Go examples of common patterns. It is not a textbook or university algorithms course, and it is not a runnable application.
- Best for: interview prep organised by topic
- Best for: beginners who do not know where to start
- Best for: Go programmers who want Go examples
- Not for: formal textbook or university-level study
- Not for: anyone expecting an installable program
Get the repository and open the docs
The install method listed for this project is a web app, and the README lists no prerequisites. To get a local copy of the repository, clone it with Git. The README also links to an online version of the docs on GitBook, so you can read without cloning.
- Online docs: https://greyireland.gitbook.io/algorithm-pattern
- Repository: https://github.com/greyireland/algorithm-pattern
git clone https://github.com/greyireland/algorithm-patternUnderstand the topic map
The core contents are grouped into four parts. Getting Started covers Go and a quickstart. Data Structures covers binary trees, linked lists, stacks and queues, and bit manipulation. Basic Algorithms covers binary search, sorting and dynamic programming. Algorithmic Thinking covers recursion, sliding window, binary search trees and backtracking.
Each topic has its own page, so you can read the template for one pattern and then work problems of that type.
- Getting Started: Intro to Go, Algorithm Quickstart
- Data Structures: Binary Tree, Linked List, Stack and Queue, Binary / Bit Manipulation
- Basic Algorithms: Binary Search, Sorting Algorithms, Dynamic Programming
- Algorithmic Thinking: Recursion, Sliding Window, Binary Search Tree, Backtracking
Practise each pattern with problems
The README says each article explains the thought process behind a problem and common pitfalls, and then ends with practice problems. Reading is not enough, so write the code yourself. Work the problems for one topic in a row, since the author found that same-type problems are easier to build momentum on.
If you get stuck, the README advises skipping the problem for now and returning later once you have a foundation.
- Read the topic page and note the template
- Solve the practice problems for that topic without looking at the answer first
- Write your own version of the template in your preferred language
Follow the suggested study order
The README recommends three stages. First, work through this repo's table of contents once. Then go through the LeetCode Explore basic cards. Finally, before interviews, work through the Coding Interviews (剑指 offer) problem set.
The author suggests finishing the first two parts in about six weeks and the last part in roughly another half month. These timings are the author's own plan, so adjust them to your situation.
- Stage 1: algorithm-pattern table of contents and practice problems
- Stage 2: LeetCode Explore basic cards
- Stage 3: Coding Interviews (剑指 offer) on LeetCode CN
Check other language versions and contributions
The README has a Check-ins table listing community repos that implement the same patterns in other languages, including Python, Java, C++, JavaScript and TypeScript, Dart, C#, Swift and Go. If you want Go examples, the table links a separate algorithm-pattern-golang repository. Compare them with the main repo to see different coding styles.
The README invites contributors to submit a pull request adding their own implementation to the table.
What people use it for
- Preparing for coding interviews by working through one pattern at a time
- Learning the sliding window or backtracking template before practising similar LeetCode problems
- Beginners building a study plan for LeetCode without a set curriculum
- Go programmers who want Go-language examples of common patterns
Frequently asked questions
How do I install algorithm-pattern?
The repository has no installation step in the source. You can clone it with git clone https://github.com/greyireland/algorithm-pattern, or read the same material on the GitBook docs site at greyireland.gitbook.io/algorithm-pattern.
Is algorithm-pattern free to use?
The project is licensed under MIT, which the source lists. Check the LICENSE file in the repository for the full terms before reusing the material.
What prerequisites do I need?
The README lists no prerequisites. It does include an Intro to Go page under Getting Started, which is useful if you are new to Go.
Is algorithm-pattern better than NeetCode or LeetCode Explore?
It serves a different purpose. algorithm-pattern groups problems by reusable templates and suggests an order, while NeetCode, LeetCode Explore, Grokking the Coding Interview and Sedgewick's Algorithms are other options people compare it with. Many learners use more than one.
How many LeetCode problems do I need for interviews?
The author says roughly 200 to 300 problems should cover most interview needs for top-tier domestic companies in China. This is one author's estimate, not a guarantee, and it depends on the company you target.
Will this guarantee a job offer?
No. The README's claims about offers reflect one author's experience, and the project does not promise outcomes. Treat it as a study aid alongside other practice.
New agent skills, repos and AI tools — every week
The best new skills and open-source projects, the fastest-growing repos, and one free prompt. Five minutes to read. Unsubscribe anytime.
Our verdict
Use algorithm-pattern if you are preparing for coding interviews and want topic-based templates with a suggested problem order, especially if you use Go. Pick a more formal course such as Sedgewick's Algorithms or a structured platform if you need textbook-level depth or an installable tool.
Install options & downloads