💻 Problems Solved: ✅ Contains Duplicate (Easy) ✅ Valid Anagram (Easy) ✅ Two Sum (Easy) ✅ Group Anagrams (Medium)
🔍 Key Takeaways:
<ul>
<li>Hashing is powerful! Used HashMaps (or Sets) for quick lookups in most problems.
</li>
<li>Sorting can simplify things. In "Valid Anagram", sorting made comparison easy.
</li>
<li>Edge cases matter. Initially, I missed handling empty strings and single-character cases.
</li>
<li>Group Anagrams was tricky! Using a frequency-count tuple for grouping was a cool trick.
</li>
</ul>
⚡ Reflection: Day 1 done! 🎯 Started with some array and hash-based problems, and the patterns are already getting clearer. "Group Anagrams" was a step up, but it was a good push. On to Day 2! 🚀

💻 **Problems Solved:**  
✅ Contains Duplicate (Easy)  
✅ Valid Anagram (Easy)  
✅ Two Sum (Easy)  
✅ Group Anagrams (Medium)

🔍 **Key Takeaways:**

* **Hashing is powerful**! Used HashMaps (or Sets) for quick lookups in most problems.
    
* **Sorting can simplify things.** In "Valid Anagram", sorting made comparison easy.
    
* **Edge cases matter.** Initially, I missed handling empty strings and single-character cases.
    
* **Group Anagrams was tricky!** Using a frequency-count tuple for grouping was a cool trick.
    

⚡ **Reflection:**  
Day 1 done! 🎯 Started with some **array and hash-based problems**, and the patterns are already getting clearer. "Group Anagrams" was a step up, but it was a good push. On to Day 2! 🚀

First day of problem-solving with arrays and hashes. Learned the power of hashing and handling edge cases. Ready for Day 2! 🚀

Kicking Off: The First Day of the Grind

Tracking my journey to mastering DSA—one problem at a time! 🚀