A collection of my LeetCode solutions implemented in Java. This repository documents my journey of improving problem-solving skills, mastering Data Structures & Algorithms, and preparing for software engineering interviews.
This repository contains accepted LeetCode solutions with a focus on:
- Clean and readable Java code
- Optimal time and space complexity
- Different algorithmic approaches
- Continuous learning and improvement
The goal is to build strong problem-solving skills while maintaining a well-organized reference for future interview preparation.
- Java
- Arrays
- Strings
- HashMap
- HashSet
- Two Pointers
- Sliding Window
- Prefix Sum
- Binary Search
- Sorting
- Stack
- Queue
- Linked List
- Trees
- Binary Search Tree
- Heap (Priority Queue)
- Recursion
- Backtracking
- Greedy
- Dynamic Programming
- Graphs
- Bit Manipulation
- Math
Leetcode-Problems/
│
├── Arrays/
├── Strings/
├── HashMap/
├── Sliding Window/
├── Binary Search/
├── Stack/
├── Queue/
├── Linked List/
├── Trees/
├── Graph/
├── Dynamic Programming/
└── ...
- Solve LeetCode problems consistently
- Learn common interview patterns
- Improve coding speed and accuracy
- Write clean and optimized Java solutions
- Prepare for product-based company interviews
For every problem, I try to:
- Understand the problem completely.
- Think of the brute-force solution.
- Optimize the solution.
- Analyze time and space complexity.
- Write clean and readable code.
I regularly update this repository with new solutions as I solve more problems.
This repository is primarily for my personal learning. However, if you find a better or more optimized approach, feel free to open an Issue or Pull Request.
If you found this repository helpful, consider giving it a ⭐. It motivates me to keep solving and sharing more problems!
Aathithyan
- GitHub: https://github.com/aathi1412
Happy Coding! 🚀