My LeetCode Journey

Welcome to my LeetCode Journey! 🚀

This repository documents my progress, challenges, and achievements as I work through various coding problems on LeetCode. My goal is to enhance my problem-solving skills, deepen my understanding of algorithms and data structures, and grow as a software engineer.

Goals 🎯

Solve a wide range of LeetCode problems.
Improve coding efficiency and accuracy.
Prepare for technical interviews.
Share my solutions and insights with the community.

Repository Structure 📂

Each folder or file corresponds to a specific problem or topic.
Solutions are written in clean, well-documented code.
Explanations and thought processes are included where applicable.

Connect with Me 🌐

LeetCode Profile: Eldeeb23
GitHub Profile: ElDEEB21
LinkedIn: Abd El Rahman ElDeeb

Feel free to explore, learn, and contribute. Let's grow together! 💡

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

My LeetCode Journey

Goals 🎯

Repository Structure 📂

Connect with Me 🌐

About

Uh oh!

Releases

Packages

Uh oh!

Contributors

Uh oh!

Languages

Name		Name	Last commit message	Last commit date
Latest commit History 187 Commits
3Sum-Closest.cpp		3Sum-Closest.cpp
3Sum.cpp		3Sum.cpp
4Sum.cpp		4Sum.cpp
Add-Binary.cpp		Add-Binary.cpp
Add-Two-Numbers.cpp		Add-Two-Numbers.cpp
Bitwise-ORs-of-Subarrays.cpp		Bitwise-ORs-of-Subarrays.cpp
Build-Array-from-Permutation.cpp		Build-Array-from-Permutation.cpp
Candy.cpp		Candy.cpp
Climbing-Stairs.cpp		Climbing-Stairs.cpp
Container-With-Most-Water.cpp		Container-With-Most-Water.cpp
Convert-Binary-Number-in-a-Linked-List-to-Integer.cpp		Convert-Binary-Number-in-a-Linked-List-to-Integer.cpp
Count-Complete-Subarrays-in-an-Array.cpp		Count-Complete-Subarrays-in-an-Array.cpp
Count-Equal-and-Divisible-Pairs-in-an-Array.cpp		Count-Equal-and-Divisible-Pairs-in-an-Array.cpp
Count-Good-Triplets-in-an-Array.cpp		Count-Good-Triplets-in-an-Array.cpp
Count-Hills-and-Valleys-in-an-Array.cpp		Count-Hills-and-Valleys-in-an-Array.cpp
Count-Largest-Group.cpp		Count-Largest-Group.cpp
Count-Number-of-Balanced-Permutations.cpp		Count-Number-of-Balanced-Permutations.cpp
Count-Number-of-Maximum-Bitwise-OR-Subsets.cpp		Count-Number-of-Maximum-Bitwise-OR-Subsets.cpp
Count-Subarrays-Where-Max-Element-Appears-at-Least-K-Times.cpp		Count-Subarrays-Where-Max-Element-Appears-at-Least-K-Times.cpp
Count-Subarrays-With-Fixed-Bounds.cpp		Count-Subarrays-With-Fixed-Bounds.cpp
Count-Subarrays-With-Score-Less-Than-K.cpp		Count-Subarrays-With-Score-Less-Than-K.cpp
Count-Subarrays-of-Length-Three-With-a-Condition.cpp		Count-Subarrays-of-Length-Three-With-a-Condition.cpp
Count-and-Say.cpp		Count-and-Say.cpp
Count-of-Interesting-Subarrays.cpp		Count-of-Interesting-Subarrays.cpp
Count-the-Hidden-Sequences.cpp		Count-the-Hidden-Sequences.cpp
Count-the-Number-of-Arrays-with-K-Matching-Adjacent-Elements.cpp		Count-the-Number-of-Arrays-with-K-Matching-Adjacent-Elements.cpp
Count-the-Number-of-Fair-Pairs.cpp		Count-the-Number-of-Fair-Pairs.cpp
Count-the-Number-of-Good-Subarrays.cpp		Count-the-Number-of-Good-Subarrays.cpp
Count-the-Number-of-Ideal-Arrays.cpp		Count-the-Number-of-Ideal-Arrays.cpp
Delete-Duplicate-Folders-in-System.cpp		Delete-Duplicate-Folders-in-System.cpp
Distribute-Candies-Among-Children-II.cpp		Distribute-Candies-Among-Children-II.cpp
Divide-Array-Into-Arrays-With-Max-Difference.cpp		Divide-Array-Into-Arrays-With-Max-Difference.cpp
Divide-Two-Integers.cpp		Divide-Two-Integers.cpp
Divide-a-String-Into-Groups-of-Size-k.cpp		Divide-a-String-Into-Groups-of-Size-k.cpp
Divisible-and-Non-divisible-Sums-Difference.cpp		Divisible-and-Non-divisible-Sums-Difference.cpp
Domino-and-Tromino-Tiling.cpp		Domino-and-Tromino-Tiling.cpp
Find-All-K-Distant-Indices-in-an-Array.cpp		Find-All-K-Distant-Indices-in-an-Array.cpp
Find-Closest-Node-to-Given-Two-Nodes.cpp		Find-Closest-Node-to-Given-Two-Nodes.cpp
Find-Lucky-Integer-in-an-Array.cpp		Find-Lucky-Integer-in-an-Array.cpp
Find-Minimum-Time-to-Reach-Last-Room-I.cpp		Find-Minimum-Time-to-Reach-Last-Room-I.cpp
Find-Minimum-Time-to-Reach-Last-Room-II.cpp		Find-Minimum-Time-to-Reach-Last-Room-II.cpp
Find-Numbers-with-Even-Number-of-Digits.cpp		Find-Numbers-with-Even-Number-of-Digits.cpp
Find-Subsequence-of-Length-K-With-the-Largest-Sum.cpp		Find-Subsequence-of-Length-K-With-the-Largest-Sum.cpp
Find-Words-Containing-Character.cpp		Find-Words-Containing-Character.cpp
Find-the-K-th-Character-in-String-Game-I.cpp		Find-the-K-th-Character-in-String-Game-I.cpp
Find-the-K-th-Character-in-String-Game-II.cpp		Find-the-K-th-Character-in-String-Game-II.cpp
Find-the-Lexicographically-Largest-String-From-the-Box-I.cpp		Find-the-Lexicographically-Largest-String-From-the-Box-I.cpp
Find-the-Maximum-Achievable-Number.cpp		Find-the-Maximum-Achievable-Number.cpp
Find-the-Maximum-Length-of-Valid-Subsequence-I.cpp		Find-the-Maximum-Length-of-Valid-Subsequence-I.cpp
Find-the-Maximum-Length-of-Valid-Subsequence-II.cpp		Find-the-Maximum-Length-of-Valid-Subsequence-II.cpp
Find-the-Maximum-Number-of-Fruits-Collected.cpp		Find-the-Maximum-Number-of-Fruits-Collected.cpp
Find-the-Maximum-Sum-of-Node-Values.cpp		Find-the-Maximum-Sum-of-Node-Values.cpp
Find-the-Original-Typed-String-I.cpp		Find-the-Original-Typed-String-I.cpp
Find-the-Original-Typed-String-II.cpp		Find-the-Original-Typed-String-II.cpp
Finding-3-Digit-Even-Numbers.cpp		Finding-3-Digit-Even-Numbers.cpp
Finding-Pairs-With-a-Certain-Sum.cpp		Finding-Pairs-With-a-Certain-Sum.cpp
First-Missing-Positive.cpp		First-Missing-Positive.cpp
Fruit-Into-Baskets.cpp		Fruit-Into-Baskets.cpp
Fruits-Into-Baskets-II.cpp		Fruits-Into-Baskets-II.cpp
Fruits-Into-Baskets-III.cpp		Fruits-Into-Baskets-III.cpp
Integer-to-Roman.cpp		Integer-to-Roman.cpp
K-th-Smallest-in-Lexicographical-Order.cpp		K-th-Smallest-in-Lexicographical-Order.cpp
Kth-Smallest-Product-of-Two-Sorted-Arrays.cpp		Kth-Smallest-Product-of-Two-Sorted-Arrays.cpp
Largest-3-Same-Digit-Number-in-String.cpp		Largest-3-Same-Digit-Number-in-String.cpp
Largest-Color-Value-in-a-Directed-Graph.cpp		Largest-Color-Value-in-a-Directed-Graph.cpp
Length-of-Last-Word.cpp		Length-of-Last-Word.cpp
Lexicographical-Numbers.cpp		Lexicographical-Numbers.cpp
Lexicographically-Minimum-String-After-Removing-Stars.cpp		Lexicographically-Minimum-String-After-Removing-Stars.cpp
Lexicographically-Smallest-Equivalent-String.cpp		Lexicographically-Smallest-Equivalent-String.cpp
Longest-Binary-Subsequence-Less-Than-or-Equal-to-K.cpp		Longest-Binary-Subsequence-Less-Than-or-Equal-to-K.cpp
Longest-Common-Prefix.cpp		Longest-Common-Prefix.cpp
Longest-Harmonious-Subsequence.cpp		Longest-Harmonious-Subsequence.cpp
Longest-Palindrome-by-Concatenating-Two-Letter-Words.cpp		Longest-Palindrome-by-Concatenating-Two-Letter-Words.cpp
Longest-Palindromic-Substring.cpp		Longest-Palindromic-Substring.cpp
Longest-Subarray-With-Maximum-Bitwise-AND.cpp		Longest-Subarray-With-Maximum-Bitwise-AND.cpp
Longest-Substring-Without-Repeating-Characters.cpp		Longest-Substring-Without-Repeating-Characters.cpp
Longest-Unequal-Adjacent-Groups-Subsequence-I.cpp		Longest-Unequal-Adjacent-Groups-Subsequence-I.cpp
Longest-Unequal-Adjacent-Groups-Subsequence-II.cpp		Longest-Unequal-Adjacent-Groups-Subsequence-II.cpp
Max-Difference-You-Can-Get-From-Changing-an-Integer.cpp		Max-Difference-You-Can-Get-From-Changing-an-Integer.cpp
Maximize-Subarrays-After-Removing-One-Conflicting-Pair.cpp		Maximize-Subarrays-After-Removing-One-Conflicting-Pair.cpp
Maximize-the-Number-of-Target-Nodes-After-Connecting-Trees-I.cpp		Maximize-the-Number-of-Target-Nodes-After-Connecting-Trees-I.cpp
Maximize-the-Number-of-Target-Nodes-After-Connecting-Trees-II.cpp		Maximize-the-Number-of-Target-Nodes-After-Connecting-Trees-II.cpp
Maximum-69-Number.cpp		Maximum-69-Number.cpp
Maximum-Candies-You-Can-Get-from-Boxes.cpp		Maximum-Candies-You-Can-Get-from-Boxes.cpp
Maximum-Difference-Between-Adjacent-Elements-in-a-Circular-Array.cpp		Maximum-Difference-Between-Adjacent-Elements-in-a-Circular-Array.cpp
Maximum-Difference-Between-Even-and-Odd-Frequency-I.cpp		Maximum-Difference-Between-Even-and-Odd-Frequency-I.cpp
Maximum-Difference-Between-Even-and-Odd-Frequency-II.cpp		Maximum-Difference-Between-Even-and-Odd-Frequency-II.cpp
Maximum-Difference-Between-Increasing-Elements.cpp		Maximum-Difference-Between-Increasing-Elements.cpp
Maximum-Difference-by-Remapping-a-Digit.cpp		Maximum-Difference-by-Remapping-a-Digit.cpp
Maximum-Erasure-Value.cpp		Maximum-Erasure-Value.cpp
Maximum-Fruits-Harvested-After-at-Most-K-Steps.cpp		Maximum-Fruits-Harvested-After-at-Most-K-Steps.cpp
Maximum-Manhattan-Distance-After-K-Changes.cpp		Maximum-Manhattan-Distance-After-K-Changes.cpp
Maximum-Matching-of-Players-With-Trainers.cpp		Maximum-Matching-of-Players-With-Trainers.cpp
Maximum-Number-of-Events-That-Can-Be-Attended-II.cpp		Maximum-Number-of-Events-That-Can-Be-Attended-II.cpp
Maximum-Number-of-Events-That-Can-Be-Attended.cpp		Maximum-Number-of-Events-That-Can-Be-Attended.cpp
Maximum-Number-of-Tasks-You-Can-Assign.cpp		Maximum-Number-of-Tasks-You-Can-Assign.cpp
Maximum-Score-From-Removing-Substrings.cpp		Maximum-Score-From-Removing-Substrings.cpp
Maximum-Unique-Subarray-Sum-After-Deletion.cpp		Maximum-Unique-Subarray-Sum-After-Deletion.cpp
Median-of-Two-Sorted-Arrays.cpp		Median-of-Two-Sorted-Arrays.cpp
Meeting-Rooms-III.cpp		Meeting-Rooms-III.cpp

Folders and files

Latest commit

History

Repository files navigation

My LeetCode Journey

Goals 🎯

Repository Structure 📂

Connect with Me 🌐

About

Topics

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Contributors

Uh oh!

Languages

Packages