This repository contains my structured Data Structures & Algorithms practice in Java, following a topic-wise approach.
- Arrays
- Strings (in progress)
- Searching & Sorting (upcoming)
- Recursion & Backtracking
- Linked List
- Stack & Queue
- Trees & Graphs
Each problem includes:
- Problem description
- Optimized approach
- Time & Space complexity
- Clean Java implementation
To build strong DSA fundamentals for:
- STEP Internship
- Product-based companies
- Technical interviews
| 0152-maximum-product-subarray |
| 0169-majority-element |
| 0239-sliding-window-maximum |
| 0448-find-all-numbers-disappeared-in-an-array |
| 0169-majority-element |
| 0169-majority-element |
| 0169-majority-element |
| 1189-maximum-number-of-balloons |
| 0141-linked-list-cycle |
| 0160-intersection-of-two-linked-lists |
| 0206-reverse-linked-list |
| 0234-palindrome-linked-list |
| 0876-middle-of-the-linked-list |
| 0141-linked-list-cycle |
| 0160-intersection-of-two-linked-lists |
| 0234-palindrome-linked-list |
| 0876-middle-of-the-linked-list |
| 0010-regular-expression-matching |
| 0030-substring-with-concatenation-of-all-words |
| 0424-longest-repeating-character-replacement |
| 1189-maximum-number-of-balloons |
| 0030-substring-with-concatenation-of-all-words |
| 0239-sliding-window-maximum |
| 0424-longest-repeating-character-replacement |
| 0010-regular-expression-matching |
| 0152-maximum-product-subarray |
| 0010-regular-expression-matching |
| 0206-reverse-linked-list |
| 0234-palindrome-linked-list |
| 0234-palindrome-linked-list |
| 0239-sliding-window-maximum |
| 0239-sliding-window-maximum |
| 0239-sliding-window-maximum |