Hello Everyone! 👋
I am starting my 150-day journey of Data Structures & Algorithms (DSA).
Every single day, I’ll solve problems and share my progress here. The goal is to build consistency, problem-solving skills, and strong fundamentals 💪.
✅ Problems I solved today (Day 1)
. Product of Array Except Self (LeetCode #238)
1.Two Sum (LeetCode #1)
Learned about brute force vs. optimized approaches.
Used hashmap approach for O(n) solution, but also practiced two pointers with sorting.
2.Best Time to Buy and Sell Stock (LeetCode #121)
Applied single-pass greedy approach.
Key idea: Track the minimum price so far and compute profit at each step.
3.Maximum Subarray (LeetCode #53)
Implemented Kadane’s Algorithm.
Learned how to track current sum vs. maximum sum efficiently.
4.Contains Duplicate (LeetCode #217)
Solved using a set to check duplicates in O(n) time.
5.Practiced the prefix-suffix product trick.
Learned to do it in O(n) without extra division.
✨ Reflections
Writing approaches in my copy helped me understand logic more clearly.
Even simple problems get tricky if not thought through carefully.
Excited to keep this momentum going for 150 days! 🔥
📌 Next Steps
Solve 4–5 problems daily (mix of easy & medium).
Keep documenting solutions + approaches.
Share progress consistently.
👉 Follow me here to keep track of my #150DaysOfDSA journey.
Let’s stay consistent and grow together 🚀
Top comments (0)