Blankj/awesome-java-leetcode

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.

Star history