Welcome to my 100 Days of LeetCode Challenge repository!
Here, I document my daily progress while solving Data Structures and Algorithms problems using Java.
✅ Days Completed: 13 / 100
🔥 Current Streak: 13 Days
🎯 Next Goal: Reach Day 100
- 🧠 Solving LeetCode problems daily
- 💻 Language used: Java
- 📅 Challenge: 100 Days of LeetCode
- 🎯 Goal: Strengthen problem-solving skills and prepare for technical interviews
Each folder represents one day of the challenge:
- Day01 → Two Sum
- Day02 → Valid Anagram
- Day03 → Palindrome Number
- Day04 → Remove Duplicates from Sorted Array
- Day05 → Remove Element
- Day06 → Contains Duplicate
- Day07 → Add Digits
- Day08 → Spiral Matrix
- Day09 → Search in Rotated Sorted Array
- Day10 → Find Greatest Common Divisor of Array
- Day11 → Majority Element
- Day12 → Happy Number
- Day13 → Matrix Diagonal Sum
More days will be added as I progress 🚀
- Arrays
- HashMap
- HashSet
- Strings
- Math
- Two Pointers
- In-place Algorithms
- Number Manipulation
- Matrix Traversal
- Binary Search
- Euclidean Algorithm (GCD)
- Moore's Voting Algorithm
- Cycle Detection
- Matrix Diagonal Traversal
| Day | Problem | Difficulty |
|---|---|---|
| Day 01 | Two Sum | Easy |
| Day 02 | Valid Anagram | Easy |
| Day 03 | Palindrome Number | Easy |
| Day 04 | Remove Duplicates from Sorted Array | Easy |
| Day 05 | Remove Element | Easy |
| Day 06 | Contains Duplicate | Easy |
| Day 07 | Add Digits | Easy |
| Day 08 | Spiral Matrix | Medium |
| Day 09 | Search in Rotated Sorted Array | Medium |
| Day 10 | Find Greatest Common Divisor of Array | Easy |
| Day 11 | Majority Element | Easy |
| Day 12 | Happy Number | Easy |
| Day 13 | Matrix Diagonal Sum | Easy |
I am consistently practicing Data Structures and Algorithms to improve my coding skills and prepare for software development roles.
- 💼 LinkedIn: https://www.linkedin.com/in/aijazsana/
- 💻 GitHub: https://github.com/Sana9058
⭐ Stay tuned — more solutions coming daily!