Welcome to my LeetCode Problem Solving Repository! This repository contains my topic-wise solutions to various LeetCode problems. The goal is to improve algorithmic thinking, track progress, and prepare for coding interviews efficiently.
Each folder in this repository represents a problem category (like Arrays, Strings, Tree, etc.) and contains:
- Solutions to LeetCode problems
- Clean and readable code
- Optimized approaches (when available)
- Java
DSA/
│
├── Arrays/
├── backTracking/
├── BinarySearch/
├── BitManipulation/
├── Demo/
├── DynamicProgramming/
├── Graph/
├── HashTable/
├── Heap-PriorityQueue/
├── linkedList/
├── Maths/
├── PrefixSum/
├── Queue/
├── Recursion/
├── SlidingWindow/
├── Stack/
├── String/
├── tree/
├── Trie.src/
├── README.md
└── DSA.iml
-
Clone this repository:
git clone https://github.com/smitkachhadiya/DSA.git
-
Navigate to the folder:
cd DSA -
Run the code (example for Java):
javac Arrays/TwoSum.java java Arrays.TwoSum
⭐ If you find this helpful, don't forget to star the repo! It motivates me to keep solving and sharing more problems.