This repository contains my Data Structures and Algorithms (DSA) practice questions and their solutions.
The goal of this repo is to:
- Strengthen DSA fundamentals
- Practice follow-up questions commonly asked in interviews
- Maintain clean, understandable solutions written from scratch
- Track my learning journey consistently
- Kadane’s Algorithm
- Maximum subarray sum
- Follow-up: Print the subarray with maximum sum
(More topics will be added gradually)
- Java
- First understand the brute force approach
- Then optimize to the best possible solution
- Focus on dry runs, edge cases, and follow-ups
- Write and test code locally using VS Code
- Push clean and working solutions to this repo
To become confident in solving DSA problems and explaining solutions clearly in interviews.
This repository is actively updated as I continue my DSA journey.