Tracking my DSA journey one problem at a time as part of the #DrGViswanathan Challenge.
| Day | Problem | Difficulty |
|---|---|---|
| 1 | Reverse Linked List | Easy |
| 2 | Missing Number | Easy |
| 3 | Middle of the Linked List | Easy |
| 4 | Add Digits | Easy |
| 5 | Merge Two Sorted Lists | Easy |
| 6 | Perfect Number | Easy |
| 7 | Linked List Cycle | Easy |
| 8 | Palindrome Number | Easy |
| 9 | Palindrome Linked List | Easy |
| 10 | Valid Perfect Square | Easy |
| 11 | Remove Linked List Elements | Easy |
| 12 | Happy Number | Easy |
| 13 | Rotate List | Medium |
| 14 | Plus One | Easy |
| 15 | Odd Even Linked List | Medium |
| 16 | Excel Sheet Column Number | Easy |
| 17 | Swapping Nodes in a Linked List | Medium |
| 18 | Nth Digit | Medium |
| 19 | Delete the Middle Node of a Linked List | Medium |
| 20 | Bulb Switcher | Medium |
| 21 | Remove Nth Node From End of List | Medium |
| 22 | Factorial Trailing Zeroes | Medium |
| 23 | Insert Greatest Common Divisors in Linked List | Medium |
| 24 | Count Odd Numbers in an Interval Range | Easy |
- Solve DSA problems consistently.
- Strengthen problem-solving skills.
- Improve understanding of Data Structures and Algorithms.
- Build a public record of learning and progress.
- Prepare for coding interviews and competitive programming.
- Reverse Linked List
- Middle of the Linked List
- Merge Two Sorted Lists
- Linked List Cycle
- Palindrome Linked List
- Remove Linked List Elements
- Rotate List
- Odd Even Linked List
- Swapping Nodes in a Linked List
- Delete the Middle Node of a Linked List
- Remove Nth Node From End of List
- Insert Greatest Common Divisors in Linked List
- Missing Number
- Plus One
- Add Digits
- Perfect Number
- Happy Number
- Palindrome Number
- Valid Perfect Square
- Excel Sheet Column Number
- Nth Digit
- Bulb Switcher
- Factorial Trailing Zeroes
- Count Odd Numbers in an Interval Range
- Two Pointers
- Fast and Slow Pointer Technique
- Floyd's Cycle Detection
- Dummy Node Technique
- In-place Reversal
- Linked List Insertion and Deletion
- Binary Search
- Digit Manipulation
- Carry Propagation
- Base-26 Conversion
- Mathematical Grouping
- Euclid's Algorithm
- Modular Arithmetic
- Factor Counting
- Perfect Square Observation
DSA-Problems-Solved
│
├── Day-01-Reverse-Linked-List
├── Day-02-Missing-Number
├── Day-03-Middle-of-the-Linked-List
├── ...
├── Day-23-Insert-Greatest-Common-Divisors-in-Linked-List
├── Day-24-Count-Odd-Numbers-in-an-Interval-Range
│
└── README.md
- Problems Solved: 24
- Streak: 24 Days
- Language: Java
- Easy: 15
- Medium: 9
- ✅ First Linked List Problem Solved
- ✅ First Fast and Slow Pointer Problem Solved
- ✅ First Cycle Detection Problem Solved
- ✅ First Binary Search Problem Solved
- ✅ First Medium Problem Solved
- ✅ First Mathematical Optimization Problem Solved
- ✅ 3-Week DSA Streak Completed
- ✅ 20+ Problems Solved
- ✅ 24-Day DSA Streak Completed
🎯 Reach 30 consecutive days of DSA practice. 🎯 Solve more Medium-level problems. 🎯 Start Trees, Stacks, Queues, and Recursion. 🎯 Improve problem-solving speed and pattern recognition.
Consistency compounds. One problem a day is better than ten problems once a month.