This repository contains my solutions to LeetCode problems, implemented primarily in Python.
The goal of this repository is to practice Data Structures & Algorithms, improve problem-solving skills, and maintain a well-organized reference for interview preparation.
- Solutions to LeetCode problems across multiple difficulty levels:
- Easy
- Medium
- Hard
- Clean, readable, and optimized code
- Multiple approaches where applicable
- Well-structured solutions focused on correctness and efficiency
- Continuous updates as more problems are solved
Each solution in this repository generally follows these principles:
- Clear understanding of the problem constraints
- Efficient algorithmic approach (Greedy, DP, Two Pointers, Sliding Window, etc.)
- Clean and readable implementation
- Optimal time and space complexity where possible
- Interview-friendly coding style
- Primary Language: Python, java, C++, javascript, swift
- Platform: LeetCode
- Concepts Covered:
- Arrays & Strings
- Hashing
- Recursion
- Dynamic Programming
- Greedy Algorithms
- Trees & Graphs
- Sorting & Searching
- Bit Manipulation
LeetCode-problems/
├── README.md # Repository overview and usage guide
├── easy/ # Easy-level LeetCode problems
├── medium/ # Medium-level LeetCode problems
└── hard/ # Hard-level LeetCode problems
📌 Folder structure may evolve as the repository grows.
- Browse problems by difficulty or topic
- Open the solution file to review the logic
- Run the code locally to test different inputs
- Compare approaches and optimize further
- Strengthen DSA fundamentals
- Prepare for technical interviews
- Track problem-solving progress over time
- Build a strong coding portfolio
- Maintain a personal reference for revision
This repository is actively maintained and will be updated regularly with new problems and improved solutions.
- GitHub: https://github.com/76jankihere
- LeetCode: (https://leetcode.com/u/76jankiparmar/)
- LinkedIn: (https://www.linkedin.com/in/janki-parmar-b1466b176/)
⭐ If you find this repository helpful, feel free to star it!