Blind 75 Coding Challenges

Introduction

This repository contains my solutions to the "Blind 75" coding problems, which are widely regarded as essential problems for software engineering. The list covers a variety of topics including arrays, strings, linked lists, binary trees, dynamic programming, and more.

Purpose

The purpose of this repository is to track my progress and understanding of these challenging problems. I hope it can also serve as a resource for other aspiring software engineers.

Problems and Solutions

Each directory in this repository corresponds to a specific problem category (e.g., Arrays, Dynamic Programming). Inside each directory, you'll find my solutions along with a brief explanation of the approach and any relevant concepts.

Usage

Feel free to browse through the solutions for study and reference. If you have any suggestions or alternative solutions, I welcome your contributions and feedback.

Problem List

Array

• Two Sum: Statement Solution
• Best Time to Buy and Sell Stock: Statement Solution
• Contains Duplicate: Statement Solution
• Product of Array Except Self: Statement Solution
• Maximum Subarray: Statement Solution
• Maximum Product Subarray: Statement Solution
• Find Minimum in Rotated Sorted Array: Statement Solution
• Search in Rotated Sorted Array: Statement Solution
• 3 Sum: Statement Solution
• Container With Most Water: Statement Solution

Binary

• Sum of Two Integers: Statement Solution
• Number of 1 Bits: Statement Solution
• Counting Bits: Statement Solution
• Missing Number: Statement Solution
• Reverse Bits: Statement Solution

Dynamic Programming

• Climbing Stairs: Statement Solution
• Coin Change: Statement Solution
• Longest Increasing Subsequence: Statement Solution
• Longest Common Subsequence: Statement Solution
• Word Break Problem: Statement Solution
• Combination Sum: Statement Solution
• House Robber: Statement Solution
• House Robber II: Statement Solution
• Decode Ways: Statement Solution
• Unique Paths: Statement Solution
• Jump Game: Statement Solution

Graph

• Clone Graph: Statement Solution
• Course Schedule: Statement Solution
• Pacific Atlantic Water Flow: Statement Solution
• Number of Islands: Statement Solution
• Longest Consecutive Sequence: Statement Solution
• Alien Dictionary: Statement Solution
• Graph Valid Tree: Statement Solution
• Number of Connected Components in an Undirected Graph: Statement Solution

Interval

• Insert Interval: Statement Solution
• Merge Intervals: Statement Solution
• Non-overlapping Intervals: Statement Solution
• Meeting Rooms: Statement Solution
• Meeting Rooms II: Statement Solution

Linked List

• Reverse a Linked List: Statement Solution
• Detect Cycle in a Linked List: Statement Solution
• Merge Two Sorted Lists: Statement Solution
• Merge K Sorted Lists: Statement Solution
• Remove Nth Node From End Of List: Statement Solution
• Reorder List: Statement Solution

Matrix

• Set Matrix Zeroes: Statement Solution
• Spiral Matrix: Statement Solution
• Rotate Image: Statement Solution
• Word Search: Statement Solution

String

• Longest Substring Without Repeating Characters: Statement Solution
• Longest Repeating Character Replacement: Statement Solution
• Minimum Window Substring: Statement Solution
• Valid Anagram: Statement Solution
• Group Anagrams: Statement Solution
• Valid Parentheses: Statement Solution
• Valid Palindrome: Statement Solution
• Longest Palindromic Substring: Statement Solution
• Palindromic Substrings: Statement Solution
• Encode and Decode Strings: Statement Solution

Tree

• Maximum Depth of Binary Tree: Statement Solution
• Same Tree: Statement Solution
• Invert/Flip Binary Tree: Statement Solution
• Binary Tree Maximum Path Sum: Statement Solution
• Binary Tree Level Order Traversal: Statement Solution
• Serialize and Deserialize Binary Tree: Statement Solution
• Subtree of Another Tree: Statement Solution
• Construct Binary Tree from Preorder and Inorder Traversal: Statement Solution
• Validate Binary Search Tree: Statement Solution
• Kth Smallest Element in a BST: Statement Solution
• Lowest Common Ancestor of BST: Statement Solution
• Implement Trie_Prefix Tree: Statement Solution
• Add and Search Word: Statement Solution
• Word Search II: Statement Solution

Heap

• Merge K Sorted Lists: Statement Solution
• Top K Frequent Elements: Statement Solution
• Find Median from Data Stream: Statement Solution

Contributing

Contributions to this repository are welcome! If you have an alternative solution or an improvement to an existing solution, please feel free to open a pull request.

License

MIT License

Acknowledgments

Special thanks to the creators of the Blind 75 list for compiling these essential problems. Please note that this repository contains only my solutions and explanations and not the actual problem descriptions from LeetCode or any other platform.