awesome-repositories.com
Blog
MCP
awesome-repositories.com

Discover the best open-source repositories with AI-powered search.

ExploreCurated searchesOpen-source alternativesSelf-hosted softwareBlogSitemap
ProjectMCP serverAboutHow we rankPress
LegalPrivacyTerms
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
Blankj avatar

Blankj/awesome-java-leetcode

0
View on GitHub↗

Awesome Java Leetcode

This project is a reference library of Java implementations for algorithmic coding challenges and data structure patterns. It serves as a study guide for technical interview preparation, providing a curated collection of LeetCode solutions organized by difficulty and algorithmic technique.

The collection includes a mapping system that associates specific algorithm problems with the companies that frequently use them in technical interviews.

The repository covers a wide range of capability areas, including tree algorithms for hierarchy construction and verification, string processing for sequence validation and pattern matching, and mathematical utilities for combinatorics and digit manipulation. It also provides implementations for search and sorting operations, as well as fundamental algorithmic patterns like dynamic programming and binary search.

AI search

Explore more awesome repositories

Describe what you need in plain English — the AI ranks thousands of curated open-source projects by relevance.

Start searching with AI

Features

  • Algorithm Study Collections - Serves as a curated repository of coding challenge solutions and structured study plans for technical interviews.
  • Technical Interview Preparation - Provides a curated collection of algorithm and data structure implementations specifically for software engineering job interview preparation.
  • Binary Search Implementations - Provides Java implementations of binary search to locate target values or insertion points in sorted arrays.
  • Data Structure Implementations - Provides educational Java code examples demonstrating the implementation of binary trees, linked lists, and stacks.
  • Depth-First Search Implementations - Implements depth-first search for state space exploration and calculating tree properties like maximum depth.
  • Breadth-First Search - Implements breadth-first search strategies for traversing tree and graph data structures level by level.
  • LeetCode Solution References - Offers a curated collection of Java implementations for LeetCode problems as a study reference.
  • Interview Problem Solving - Implements a wide variety of Java solutions to coding challenges focused on interview-style problem solving.
  • Algorithm Reference Libraries - Serves as a reference library of standard algorithms organized by difficulty and technique for study.
  • Dynamic Programming - Implements dynamic programming techniques for solving optimization problems by storing intermediate results of subproblems.
  • Two-Pointer Strategies - Implements two-pointer algorithmic patterns for efficient in-place array manipulation and duplicate filtering.
  • Bracket Validation Algorithms - Implements stack-based algorithms to verify the correct pairing and nesting of brackets in strings.
  • Depth Calculations - Implements depth-first search to calculate the maximum height from the root to the farthest leaf node.
  • Structural Comparisons - Implements depth-first search to verify if two binary trees are structurally identical and contain the same values.
  • Symmetry & Mirroring - Implements algorithms to verify if a binary tree is a mirror image of itself.
  • Technical Interview Guides - Provides a guide of Java code examples and problem patterns tailored for technical job interviews.
  • Arbitrary Precision Arithmetic Simulations - Implements manual carry logic to perform addition on integers represented as arrays of digits.
  • Binary String Arithmetic - Provides carry-based addition algorithms for calculating the sum of two binary strings.
  • Roman Numeral Converters - Provides algorithms for translating Roman numeral symbols into decimal integers.
  • Balanced Tree Constructions - Provides recursive logic to build balanced binary search trees by splitting sorted data.
  • Combinatorial Counting - Implements combinatorial counting techniques using dynamic programming to find distinct ways to reach target states.
  • Company-Specific Problem Mappings - Includes a mapping system that associates specific algorithmic problems with companies that frequently use them in interviews.
  • Tree Path Sum Algorithms - Implements depth-first search to determine if any root-to-leaf path totals a specific target value.
8,698 stars·1,692 forks·Java·26 views

Star history

Star history chart for blankj/awesome-java-leetcodeStar history chart for blankj/awesome-java-leetcode

How this analysis was created: This summary and feature list are AI-generated from collected project material and can contain mistakes. Stars, license and language are imported from GitHub. Inclusion does not mean that we have tested or audited this project. Check the source documentation for any feature you depend on. Learn more on our About page.

Frequently asked questions

What does blankj/awesome-java-leetcode do?

This project is a reference library of Java implementations for algorithmic coding challenges and data structure patterns. It serves as a study guide for technical interview preparation, providing a curated collection of LeetCode solutions organized by difficulty and algorithmic technique.

What are the main features of blankj/awesome-java-leetcode?

The main features of blankj/awesome-java-leetcode are: Algorithm Study Collections, Technical Interview Preparation, Binary Search Implementations, Data Structure Implementations, Depth-First Search Implementations, Breadth-First Search, LeetCode Solution References, Interview Problem Solving.

Which projects share features with blankj/awesome-java-leetcode?

Projects with overlapping indexed features include: azl397985856/leetcode — This project is a curated educational resource and solution repository for algorithmic challenges, specifically… greyireland/algorithm-pattern — This project is an algorithm template library and coding interview study guide providing reusable code patterns for… chanda-abdul/several-coding-patterns-for-solving-data-structures-and-algorithms-problems-during-interviews — This repository is a curated guide and implementation library of coding patterns used to solve data structures and… sharingsource/logicstack-leetcode — LogicStack-LeetCode is a curated repository of solved algorithm problems and data structure implementations, primarily… hoanhan101/algo — This project is a Go algorithm implementation library and a reference for data structures. It serves as a collection… soapyigu/leetcode-swift — LeetCode-Swift is a collection of algorithm solutions written in Swift, designed for coding interview preparation.…

Projects sharing features with Awesome Java Leetcode

These projects share indexed features with Awesome Java Leetcode. Shared tags can include platform or build tooling; verify the primary use case before treating a result as a replacement.
  • azl397985856/leetcodeazl397985856 avatar

    azl397985856/leetcode

    55,758View on GitHub↗

    This project is a curated educational resource and solution repository for algorithmic challenges, specifically focused on LeetCode problems. It serves as a technical reference for common data structures and algorithmic patterns, providing verified code implementations across multiple programming languages alongside detailed logic and complexity analysis. The repository functions as a comprehensive study guide for competitive programming and technical interview preparation. It includes specialized learning tools such as an Anki flashcard dataset for spaced repetition and a browser extension t

    JavaScriptalgoalgorithmalgorithms
    View on GitHub↗55,758
  • greyireland/algorithm-patterngreyireland avatar

    greyireland/algorithm-pattern

    15,465View on GitHub↗

    This project is an algorithm template library and coding interview study guide providing reusable code patterns for common data structures and algorithms. It serves as a reference for optimized strategies and a structured learning path to build proficiency in algorithmic problem solving and competitive programming. The library focuses on standardized implementations of key algorithmic patterns, including sliding windows, backtracking, dynamic programming, and binary search. It provides specific templates for managing binary search trees, searching rotated sorted arrays, and executing divide-a

    Goalgoalgorithmleetcode
    View on GitHub↗15,465
  • chanda-abdul/several-coding-patterns-for-solving-data-structures-and-algorithms-problems-during-interviewsChanda-Abdul avatar

    Chanda-Abdul/Several-Coding-Patterns-for-Solving-Data-Structures-and-Algorithms-Problems-during-Interviews

    4,129View on GitHub↗

    This repository is a curated guide and implementation library of coding patterns used to solve data structures and algorithms problems. It serves as a technical interview study resource, providing a comprehensive set of strategies and computational logic examples for optimizing time and space complexity. The project focuses on standardized algorithmic patterns, including sliding windows, two pointers, and dynamic programming. It features specific implementations for a wide range of challenges, such as LeetCode problem solutions and specialized techniques like cyclic sort and bitwise XOR opera

    algorithmscoding-interviewsdata-structures
    View on GitHub↗4,129
  • sharingsource/logicstack-leetcodeSharingSource avatar

    SharingSource/LogicStack-LeetCode

    7,495View on GitHub↗

    LogicStack-LeetCode is a curated repository of solved algorithm problems and data structure implementations, primarily drawn from the LeetCode platform. Its core identity is a structured collection of solutions designed to support technical interview preparation and competitive programming practice, with each solution accompanied by complexity analyses to help engineers understand performance trade-offs. The repository distinguishes itself through its breadth of coverage across fundamental algorithmic patterns and data structures. It includes implementations for array manipulation, string pro

    algorithminterview-practiceinterview-questions
    View on GitHub↗7,495
Compare all 30 related projects→