github.com/doocs/leetcode ↗

About doocs/leetcode

This is a comprehensive collection of solutions for competitive programming problems from LeetCode, Sword to Offer (Second Edition and Special Edition), and Cracking the Coding Interview (Sixth Edition). The project provides implementations in multiple programming languages including Java, Python, C++, Go, TypeScript, and Rust, making it accessible to developers with different language preferences.

The repository is organized into several major categories covering fundamental algorithms through advanced techniques. It includes solutions for basic algorithms like binary search and sorting, data structures such as linked lists and monotonic stacks, search algorithms including BFS, DFS, and bidirectional search, dynamic programming across various patterns, and high-level topics like union-find, segment trees, and graph algorithms. Each problem typically includes detailed explanations of the approach and implementation across multiple languages.

The project serves as both a learning resource and a reference guide for those preparing for technical interviews or looking to improve their algorithmic problem-solving skills. With contributions from multiple developers and active maintenance, it maintains a large collection of problems with comprehensive solutions and is designed to help users understand not just the what and how, but also the underlying thinking patterns and approaches to algorithmic challenges.