LeetCode Blind 75 Solutions (Work In Progress)

Welcome to my repository of solutions for the LeetCode Blind 75, a curated list of 75 high-quality coding problems frequently asked in technical interviews.

About

The Blind 75 is a collection of coding problems across various categories designed to strengthen problem-solving skills and prepare for technical interviews. This repository contains my personal solutions to each problem, along with explanations and insights to aid understanding.

Includes

• Solutions implemented in Python
• Problem statement and solution descriptions.
• Time and space complexity analysis.

Problem List

Arrays

1. Two Sum
2. Best Time to Buy and Sell Stock
3. Contains Duplicate
4. Product of Array Except Self
5. Maximum Subarray
6. Maximum Product Subarray
7. Find Minimum in Rotated Sorted Array
8. Search in Rotated Sorted Array

Binary

1. Missing Numbers

Strings

1. Valid Paranthesis
2. Longest Substring Without Repeating Characters
3. Valid Palindrome

Linked Lists

1. Linked List Cycle
2. Merge Two Sorted Lists

Contributions

This repository is primarily for personal learning and growth, but suggestions for improvement are welcome. Feel free to open an issue or submit a pull request.