Skip to content

AlexBiobelemo/Alex-Leetcode-Library

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

21 Commits
01 Matrix.md
01 Matrix.md
 
 
3Sum Closest.md
3Sum Closest.md
 
 
3Sum.md
3Sum.md
 
 
4Sum.md
4Sum.md
 
 
Add Binary.md
Add Binary.md
 
 
Add Two Numbers.md
Add Two Numbers.md
 
 
Angle Between Hands of a Clock.md
Angle Between Hands of a Clock.md
 
 
Ant on the Boundary.md
Ant on the Boundary.md
 
 
Apply Discount Every n Orders.md
Apply Discount Every n Orders.md
 
 
Apply Discount to Prices.md
Apply Discount to Prices.md
 
 
Apply Operations to Make Strings Empty.md
Apply Operations to Make Strings Empty.md
 
 
Apply Operations to an Array.md
Apply Operations to an Array.md
 
 
Array Nesting.md
Array Nesting.md
 
 
Beautiful Array.md
Beautiful Array.md
 
 
Beautiful Towers II.md
Beautiful Towers II.md
 
 
Best Position for a Service Centre.md
Best Position for a Service Centre.md
 
 
Best Time to Buy and Sell Stock II.md
Best Time to Buy and Sell Stock II.md
 
 
Best Time to Buy and Sell Stock III.md
Best Time to Buy and Sell Stock III.md
 
 
Best Time to Buy and Sell Stock V.md
Best Time to Buy and Sell Stock V.md
 
 
Best Time to Buy and Sell Stock.md
Best Time to Buy and Sell Stock.md
 
 
Binary Search Tree to Greater Sum Tree.md
Binary Search Tree to Greater Sum Tree.md
 
 
Binary Search.md
Binary Search.md
 
 
Boats to Save People.md
Boats to Save People.md
 
 
Booking Concert Tickets in Groups.md
Booking Concert Tickets in Groups.md
 
 
Bus Routes.md
Bus Routes.md
 
 
Calculate Score After Performing Instructions.md
Calculate Score After Performing Instructions.md
 
 
Calculator With Method Chaining.md
Calculator With Method Chaining.md
 
 
Capacity To Ship Packages Within D Days.md
Capacity To Ship Packages Within D Days.md
 
 
Capitalize the Title.md
Capitalize the Title.md
 
 
Car Fleet.md
Car Fleet.md
 
 
Categorize Box According to Criteria.md
Categorize Box According to Criteria.md
 
 
Check Distances Between Same Letters.md
Check Distances Between Same Letters.md
 
 
Check If Digits Are Equal After Operations I.md
Check If Digits Are Equal After Operations I.md
 
 
Check If String Is a Prefix of Array.md
Check If String Is a Prefix of Array.md
 
 
Check if All the Integers in a Range Are Covered.md
Check if All the Integers in a Range Are Covered.md
 
 
Check if Strings Can be Made Equal With Operations I.md
Check if Strings Can be Made Equal With Operations I.md
 
 
Checking Existence of Edge Length Limited Paths.md
Checking Existence of Edge Length Limited Paths.md
 
 
Choose K Elements With Maximum Sum.md
Choose K Elements With Maximum Sum.md
 
 
Circular Array Loop.md
Circular Array Loop.md
 
 
Climbing Stairs.md
Climbing Stairs.md
 
 
Coin Change.md
Coin Change.md
 
 
Combination Sum II.md
Combination Sum II.md
 
 
Combination Sum.md
Combination Sum.md
 
 
Combinations.md
Combinations.md
 
 
Compact Object.md
Compact Object.md
 
 
Concatenated Words.md
Concatenated Words.md
 
 
Concatenation of Array.md
Concatenation of Array.md
 
 
Conservative Numbers Sum.md
Conservative Numbers Sum.md
 
 
Construct Binary Tree from Inorder and Postorder Traversal.md
Construct Binary Tree from Inorder and Postorder Traversal.md
 
 
Construct Product Matrix.md
Construct Product Matrix.md
 
 
Construct the Minimum Bitwise Array II.md
Construct the Minimum Bitwise Array II.md
 
 
Container With Most Water.md
Container With Most Water.md
 
 
Contains Duplicate II.md
Contains Duplicate II.md
 
 
Contains Duplicate III.md
Contains Duplicate III.md
 
 
Contains Duplicate.md
Contains Duplicate.md
 
 
Count Good Triplets in An Array.md
Count Good Triplets in An Array.md
 
 
Count Hills and Valleys in an Array.md
Count Hills and Valleys in an Array.md
 
 
Count Number of Pairs With Absolute Difference K.md
Count Number of Pairs With Absolute Difference K.md
 
 
Count Pairs of Similar Strings.md
Count Pairs of Similar Strings.md
 
 
Count Parturitions with Even Sum Difference.md
Count Parturitions with Even Sum Difference.md
 
 
Count Prefixed of a Given String.md
Count Prefixed of a Given String.md
 
 
Count Prime-Gap Balanced Subarray.md
Count Prime-Gap Balanced Subarray.md
 
 
Count Subarrays With Majority Element I.md
Count Subarrays With Majority Element I.md
 
 
Count Subarrays With Median K.md
Count Subarrays With Median K.md
 
 
Count Tested Devices After Test Operations.md
Count Tested Devices After Test Operations.md
 
 
Count Valid Paths in a Tree.md
Count Valid Paths in a Tree.md
 
 
Count Visited Nodes in a Directed Graph.md
Count Visited Nodes in a Directed Graph.md
 
 
Count Ways to Build Good Strings.md
Count Ways to Build Good Strings.md
 
 
Count Words Obtained After Adding A Letter.md
Count Words Obtained After Adding A Letter.md
 
 
Count and Say.md
Count and Say.md
 
 
Count of Smaller Numbers After Self.md
Count of Smaller Numbers After Self.md
 
 
Count the Number of Fair Pairs.md
Count the Number of Fair Pairs.md
 
 
Count the Number of Inversions.md
Count the Number of Inversions.md
 
 
Create Maximum Number.md
Create Maximum Number.md
 
 
Cut Off Trees for Golf Event.md
Cut Off Trees for Golf Event.md
 
 
Decode XORed Permutation.md
Decode XORed Permutation.md
 
 
Decompress Run Length Encoded List.md
Decompress Run Length Encoded List.md
 
 
Defuse the Bomb.md
Defuse the Bomb.md
 
 
Delete Columns to Make Sorted III.md
Delete Columns to Make Sorted III.md
 
 
Delete Duplicate Emails.md
Delete Duplicate Emails.md
 
 
Delete Nodes and Return Forest.md
Delete Nodes and Return Forest.md
 
 
Department Highest Salary.md
Department Highest Salary.md
 
 
Design Movie Rental System.md
Design Movie Rental System.md
 
 
Design Spreadsheet.md
Design Spreadsheet.md
 
 
Design a Food Rating System.md
Design a Food Rating System.md
 
 
Detect Pattern of Length M Repeated K or More TImes.md
Detect Pattern of Length M Repeated K or More TImes.md
 
 
Display Table of Food Orders in a Resturant.md
Display Table of Food Orders in a Resturant.md
 
 
Distribute Repeating Integers.md
Distribute Repeating Integers.md
 
 
Divide Two Integers.md
Divide Two Integers.md
 
 
Divisible and Non-Divisible Sums Difference.md
Divisible and Non-Divisible Sums Difference.md
 
 
Edit Distance.md
Edit Distance.md
 
 
Equal Sum Grid Partition I.md
Equal Sum Grid Partition I.md
 
 
Execute Asynchronous Functions in Parallel.md
Execute Asynchronous Functions in Parallel.md
 
 
Execution of All Suffix Instructions Staying in a Grid.md
Execution of All Suffix Instructions Staying in a Grid.md
 
 
Fancy Sequence.md
Fancy Sequence.md
 
 
Fill a Special Grid.md
Fill a Special Grid.md
 
 
Find All Duplcates in an Array.md
Find All Duplcates in an Array.md
 
 
Find All K-Distant Indices in an Array.md
Find All K-Distant Indices in an Array.md
 
 
Find Closest Node To Given Two Nodes.md
Find Closest Node To Given Two Nodes.md
 
 
Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree.md
Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree.md
 
 

Repository files navigation

Alex's LeetCode Library

Profile Views Repository Views

A comprehensive, curated collection of 370+ LeetCode problem solutions featuring in-depth explanations, complexity analysis, and step-by-step implementation guides.

Overview

This repository serves as a structured learning resource for developers preparing for technical interviews or looking to strengthen their problem-solving skills. Each solution goes beyond basic code implementation to provide conceptual understanding and optimization techniques.

Key Features

  • 370+ Problems Solved - Extensive coverage across all difficulty levels and problem categories
  • Deep Dive Analysis - Detailed explanations of approach, intuition, and thought process
  • Complexity Breakdown - Time and space complexity analysis for each solution
  • Step-by-Step Documentation - Clear, guided walkthroughs to understand implementation
  • Multiple Approaches - Where applicable, multiple solution strategies are discussed
  • Organized Structure - Easy navigation with descriptive file names

Problem Categories

This library covers a wide range of algorithmic concepts including:

  • Arrays & Strings - Two pointers, sliding window, prefix sums
  • Dynamic Programming - Classic DP patterns and optimization
  • Binary Search - Search space reduction and binary search variants
  • Trees & Graphs - Traversals, DFS, BFS, shortest paths
  • Backtracking - Combinatorial problems and constraint satisfaction
  • System Design - Data structure design and implementation
  • Database - SQL queries and optimization
  • Mathematics - Number theory, geometry, and combinatorics

Repository Structure

Each problem is contained in its own Markdown file with a descriptive name. Files follow the format:

Problem Title.md

Example files include:

  • Two Sum.md
  • Binary Search.md
  • Longest Substring Without Repeating Characters.md

How to Use This Repository

  1. Browse by Problem Name - Use the file list to find specific problems
  2. Search by Topic - Use GitHub's search functionality to filter by algorithm type or pattern
  3. Sequential Learning - Start with easier problems and progress to more complex ones
  4. Interview Preparation - Review problems by company or difficulty level

Solution Format

Each solution document typically includes:

  1. Problem Statement - Clear description of the problem
  2. Approach & Intuition - Thought process and strategy
  3. Algorithm Steps - Detailed breakdown of the solution
  4. Implementation - Clean, well-commented code
  5. Complexity Analysis - Time and space complexity
  6. Edge Cases - Important test cases and considerations
  7. Variations - Alternative approaches or related problems

Contributing

This is a personal learning repository. However, if you spot any errors or have suggestions for improvements, feel free to open an issue.

Resources

For additional practice and learning:

Author

Created and maintained by Alex Alagoa Biobelemo

Note: Solutions are meant for learning purposes. Understanding the approach is more valuable than memorizing code. Happy coding! 🚀

About

A curated resource of 340+ LeetCode problems. All solutions include deep dives, complexity analysis, and step-by-step guided documentation.

Resources

Readme
Activity

Stars

1 star

Watchers

0 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

 
 
 

Contributors