My LeetCode Journey

Hello! I’m Aryan Kanojia, and here’s a brief look at my problem-solving journey on LeetCode.

Solved Problems

• Data Structures:

  • Arrays & Strings
  • Linked Lists
  • Stacks & Queues
  • Trees & Graphs

• Algorithms:

  • Sorting & Searching
  • Dynamic Programming
  • Greedy
  • Backtracking

Tip: If you’re just starting out, focus on understanding fundamental data structures and common algorithmic patterns like two pointers, sliding window, and binary search.

Current Streak / Stats

Notable Achievements

• 100+ total problems solved
• Ranked in the top 5% of global users in data structure challenges
• Special focus on dynamic programming: overcame complex problems like Longest Increasing Subsequence, Coin Change, and more.

Learning Strategy

1. Understand Before Coding
   Read the problem thoroughly, identify the pattern, and think about time/space complexity.

2. Practice Consistently
   Doing a few problems each day helps build muscle memory.

3. Review and Optimize
   After solving, compare your approach with editorial solutions and other users’ answers.

Next Goals

• Complete 1000+ problems by the end of the year
• Focus on advanced topics like segment trees, Fenwick trees, and advanced graph algorithms
• Participate in weekly LeetCode contests to stay sharp

Profile Link

You can view my full LeetCode profile [Here].

Thanks for checking out my LeetCode profile!
If you have any questions or want to collaborate on problem-solving, feel free to reach out.