LeetCode Blind 75 Questions Solutions

Welcome to the LeetCode Blind 75 Questions Solutions Repository! This repository contains Java solutions for the Blind 75 Questions, a curated set of algorithmic problems frequently encountered in technical interviews. You can find the Blind 75 List here.

Each solution is accompanied by Detailed Explanations, Intuitive Approaches, and Time Complexity Analyses to help you master the art of algorithmic problem-solving.

Questions List

1. Two Sum
2. Longest Substring Without Repeating Characters
3. Longest Palindromic Substring
4. Container With Most Water
5. 3Sum
6. Remove Nth Node From End of List
7. Valid Parentheses
8. Merge Two Sorted Lists
9. Merge k Sorted Lists
10. Search in Rotated Sorted Array
11. Combination Sum
12. Rotate Image
13. Group Anagrams
14. Maximum Subarray
15. Spiral Matrix
16. Jump Game
17. Merge Intervals
18. Insert Interval
19. Unique Paths
20. Climbing Stairs
21. Set Matrix Zeroes

Accessing Solutions

To access the solutions for each problem, simply click on the respective problem title. Each problem has its own markdown file which contains the Problem Link, Description, Solution Approach, Java Code, Complexity Analysis, and Code Explanation.

Contribution

Contributions to this repository are welcome! If you have alternative solutions or improvements to existing solutions, feel free to open a pull request.

For any queries, please feel free to reach out to me at shelavaleswaraj1610@gmail.com