Hei! Welcome to my coding journey where I'm solving LeetCode problems to level up my programming skills.
| Problem | Solution | Approach |
|---|---|---|
| Two Sum | C++ | Hash maps for O(1) lookups |
| Contains Duplicate | C++ | Hash sets to track seen elements |
| Valid Anagram | C++ | Character frequency counting |
| First Unique Character | C++ | Hash map with character counts |
| Isomorphic Strings | C++ | Two hash maps for bidirectional mapping |
| Number of Good Pairs | C++ | Combination formula n*(n-1)/2 |
| Majority Element | C++ | Frequency counting |
| Word Pattern | C++ | Two hash maps for word-character mapping |
| Duplicate Emails | SQL | GROUP BY and HAVING COUNT() > 1 |
| Combine Two Tables | SQL | LEFT JOIN |
| Smallest Missing Integer Greater Than Sequential Prefix Sum | C++ | Prefix sum + set tracking |
| Longest Common Prefix | C++ | Vertical scanning |
| Find the Duplicate Number | C++ | Floyd’s Tortoise and Hare (Cycle Detection) |
| Contains Duplicate II | C++ | Hash map with index tracking |
| Power of Three | C++ | Iterative division by 3 |
| Power of Four | C++ | Bit manipulation + modulo check |
| Power of Two | C++ | Bit manipulation (n & (n-1) == 0) |
| Ransom Note | C++ | Character frequency hash map |
Total Solved: 18+ problems
Languages: C++, SQL
- Mastering hash maps & sets
- Building consistent coding habits
- Preparing for technical interviews
- Expanding into medium difficulty problems