This is where I track and organize my LeetCode grind — every solved problem, committed and categorized by topic.
- 🎯 Currently ranked in the top 13% globally on LeetCode
- 🧠 Focused on interview-relevant patterns: Arrays, DP, Graphs/Trees, Two Pointers, Sliding Window, Backtracking
- 🔁 Actively updated as I solve — this is a living repo, not a one-time dump
Each solution file includes:
- Problem name & LeetCode link (as a comment header)
- Clean, commented Python solution
- Time & space complexity notes
Example:
# 1. Two Sum
# https://leetcode.com/problems/two-sum/
# Time: O(n) | Space: O(n)
def twoSum(nums, target):
seen = {}
for i, num in enumerate(nums):
complement = target - num
if complement in seen:
return [seen[complement], i]
seen[num] = i
If you find this useful for your own DSA prep, feel free to ⭐ the repo!