GitHub - SmitPawar21/dsa-in-java: This repo contains solved Leetcode problems in JAVA

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 208 Commits
0001-two-sum		0001-two-sum
0011-container-with-most-water		0011-container-with-most-water
0014-longest-common-prefix		0014-longest-common-prefix
0019-remove-nth-node-from-end-of-list		0019-remove-nth-node-from-end-of-list
0020-valid-parentheses		0020-valid-parentheses
0021-merge-two-sorted-lists		0021-merge-two-sorted-lists
0026-remove-duplicates-from-sorted-array		0026-remove-duplicates-from-sorted-array
0027-remove-element		0027-remove-element
0028-find-the-index-of-the-first-occurrence-in-a-string		0028-find-the-index-of-the-first-occurrence-in-a-string
0033-search-in-rotated-sorted-array		0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array		0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position		0035-search-insert-position
0058-length-of-last-word		0058-length-of-last-word
0069-sqrtx		0069-sqrtx
0073-set-matrix-zeroes		0073-set-matrix-zeroes
0075-sort-colors		0075-sort-colors
0080-remove-duplicates-from-sorted-array-ii		0080-remove-duplicates-from-sorted-array-ii
0088-merge-sorted-array		0088-merge-sorted-array
0094-binary-tree-inorder-traversal		0094-binary-tree-inorder-traversal
0104-maximum-depth-of-binary-tree		0104-maximum-depth-of-binary-tree
0121-best-time-to-buy-and-sell-stock		0121-best-time-to-buy-and-sell-stock
0125-valid-palindrome		0125-valid-palindrome
0128-longest-consecutive-sequence		0128-longest-consecutive-sequence
0144-binary-tree-preorder-traversal		0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal		0145-binary-tree-postorder-traversal
0150-evaluate-reverse-polish-notation		0150-evaluate-reverse-polish-notation
0151-reverse-words-in-a-string		0151-reverse-words-in-a-string
0167-two-sum-ii-input-array-is-sorted		0167-two-sum-ii-input-array-is-sorted
0202-happy-number		0202-happy-number
0205-isomorphic-strings		0205-isomorphic-strings
0206-reverse-linked-list		0206-reverse-linked-list
0219-contains-duplicate-ii		0219-contains-duplicate-ii
0228-summary-ranges		0228-summary-ranges
0242-valid-anagram		0242-valid-anagram
0290-word-pattern		0290-word-pattern
0345-reverse-vowels-of-a-string		0345-reverse-vowels-of-a-string
0383-ransom-note		0383-ransom-note
0443-string-compression		0443-string-compression
0496-next-greater-element-i		0496-next-greater-element-i
0643-maximum-average-subarray-i		0643-maximum-average-subarray-i
0700-search-in-a-binary-search-tree		0700-search-in-a-binary-search-tree
0724-find-pivot-index		0724-find-pivot-index
0744-find-smallest-letter-greater-than-target		0744-find-smallest-letter-greater-than-target
0852-peak-index-in-a-mountain-array		0852-peak-index-in-a-mountain-array
0866-59-2259-remove-digit-from-number-to-maximize-result		0866-59-2259-remove-digit-from-number-to-maximize-result
0876-middle-of-the-linked-list		0876-middle-of-the-linked-list
1207-unique-number-of-occurrences		1207-unique-number-of-occurrences
1342-number-of-steps-to-reduce-a-number-to-zero		1342-number-of-steps-to-reduce-a-number-to-zero
1456-maximum-number-of-vowels-in-a-substring-of-given-length		1456-maximum-number-of-vowels-in-a-substring-of-given-length
1492-the-kth-factor-of-n		1492-the-kth-factor-of-n
1768-merge-strings-alternately		1768-merge-strings-alternately
2215-find-the-difference-of-two-arrays		2215-find-the-difference-of-two-arrays
2824-count-pairs-whose-sum-is-less-than-target		2824-count-pairs-whose-sum-is-less-than-target
3074-apple-redistribution-into-boxes		3074-apple-redistribution-into-boxes
3194-minimum-average-of-smallest-and-largest-elements		3194-minimum-average-of-smallest-and-largest-elements
3206-alternating-groups-i		3206-alternating-groups-i
3216-lexicographically-smallest-string-after-a-swap		3216-lexicographically-smallest-string-after-a-swap
3232-find-if-digit-game-can-be-won		3232-find-if-digit-game-can-be-won
README.md created		README.md created

Repository files navigation

# 🌟 **DSA in Java - LeetCode Solutions**  

Welcome to my **Data Structures and Algorithms (DSA)** repository! 🚀 Here, you'll find **clean, efficient, and well-optimized solutions** to a variety of LeetCode problems, all implemented in **Java**. This repository is a step-by-step showcase of my journey to mastering DSA while helping others along the way!  

---

## 📁 **Repository Structure**  
The repository is thoughtfully organized by **data structures** and **algorithm types**. Each category contains a collection of solved LeetCode problems, such as:  

- **Arrays**  
- **Linked Lists**  
- **Recursion**  
- **Sorting and Searching**  
- **Hash Tables**  
- **Bit Manipulation**  
- **Stacks**  

Every folder or file is named following **LeetCode's naming conventions**, ensuring easy navigation and reference.  

---

## 💻 **Technologies Used**  

- **Language:** Java  
- **Platform:** LeetCode  
- **Concepts Covered:** Sorting, searching, recursion, and much more!  

🔍 I am on a mission to cover all major DSA topics systematically.  

---

## 📂 **How to Use**  

1. **Clone the Repository:**  
```bash  
git clone https://github.com/your-username/DSA-Java-LeetCode.git  
```  

2. Navigate to the specific directory to view the code for your desired problem.  

---

## 🎯 **Goals**  

- **Sharpen My Skills:** Continuous practice to improve my DSA expertise.  
- **Share Knowledge:** Provide clean, well-documented code for fellow Java enthusiasts.  
- **Track Progress:** Keep a log of solved problems and my LeetCode journey.  

---

Feel free to explore, learn, and contribute! Together, let's make DSA in Java approachable and fun! 🎉