Welcome to my collection of LeetCode problem solutions! This repository is a record of my journey tackling coding challenges to improve my problem-solving skills and strengthen my understanding of data structures and algorithms.
Each problem is organized by topic and difficulty level to help you easily find solutions:
- π Difficulty
π’ Easy
π‘ Medium
π΄ Hard
DSA | Problems | π’ Easy | π‘ Medium | π΄ Hard |
---|---|---|---|---|
ποΈ Array | 9 | 5 | 3 | 1 |
π Binary | 4 | 4 | 0 | 0 |
π Dynamic Programming | 3 | 3 | 0 | 0 |
π Linked List | 3 | 3 | 0 | 0 |
β Math | 3 | 3 | 0 | 0 |
𧡠String | 7 | 5 | 2 | 0 |
π³ Tree | 3 | 3 | 0 | 0 |
π Weekly Contest | 2 | 0 | 2 | 0 |
- Problems Solved [34]
- π’ Easy [26]
- π‘ Medium [7]
- π΄ Hard [1]
Note: The list of problems is organized in this README to make it easier to find.
-
Clone the repository:
git clone https://github.com/GitArika/leetcode.git cd leetcode
-
Navigate to a problem: Browse the folders to find specific problem solutions.
-
Run solutions: Each solution file can be run independently. Make sure to have the necessary environment set up (Node.js or Python).
-
π Problem Descriptions: Each solution file contains a brief description of the problem and approach.
-
π‘ Efficient Approaches: Solutions are optimized where possible, with complexity analysis included.
-
π Regular Updates: I consistently update this repository with new solutions as I tackle more challenges on LeetCode.
If you're new to LeetCode, hereβs how to get started:
-
Create an Account: Sign up at leetcode.com.
-
Start Solving: Try problems by difficulty level or topic.
-
Practice Regularly: Consistency is key!
Feel free to submit pull requests if you have alternative or optimized solutions for any problem, or if you'd like to add documentation improvements.
For questions, connect with me on LinkedIn or open an issue here on GitHub.