Problem-Solving Practice with LeetCode

This repository contains a curated list of LeetCode problems to practice and enhance your problem-solving skills. The problems are categorized by topic and difficulty, with direct links to the challenges on LeetCode.

---

Easy Problems

Arrays

1. Two Sum
   • Find two numbers in an array that add up to a target.
2. Best Time to Buy and Sell Stock
   • Maximize profit from buying and selling stock.
3. Contains Duplicate
   • Check if an array contains duplicate elements.
4. Maximum Subarray
   • Find the contiguous subarray with the maximum sum.
5. Intersection of Two Arrays II
   • Find common elements between two arrays.

---

Linked Lists

1. Reverse Linked List
   • Reverse a linked list.
2. Merge Two Sorted Lists
   • Merge two sorted linked lists into one.
3. Remove Duplicates from Sorted List
   • Remove duplicates from a sorted linked list.
4. Linked List Cycle
   • Detect if a linked list contains a cycle.

---

Stacks/Queues

1. Valid Parentheses
   • Check if the parentheses in a string are valid and properly nested.
2. Implement Queue using Stacks
   • Implement a queue using two stacks.
3. Implement Stack using Queues
   • Implement a stack using two queues.
4. Min Stack
   • Design a stack that supports retrieving the minimum value in constant time.

---

Intermediate Problems

Sorting

1. Sort Colors
   • Sort an array containing only 0, 1, and 2.
2. Kth Largest Element in an Array
   • Find the kth largest element in an array.
3. Merge Intervals
   • Merge overlapping intervals.

---

Filtering

1. Find All Numbers Disappeared in an Array
   • Find missing numbers in an array of 1 to n.
2. Single Number
   • Find the element that appears only once in an array where others appear twice.
3. Remove Duplicates from Sorted Array
   • Remove duplicates from a sorted array in place.

---

Searching

1. Search in Rotated Sorted Array
   • Search for a target in a rotated sorted array.
2. Find Peak Element
   • Find a peak element in an array where a peak is larger than its neighbors.
3. First Bad Version
   • Identify the first bad version in a sequence using minimal checks.

---

How to Use

• Choose a category and problem based on your skill level.
• Solve the problem directly on LeetCode.
• Track your progress and revisit topics where you face challenges.

Happy coding! 🚀