Blind 75 Leetcode Coding Interview Problem Solutions

This repository provides a curated list of the top 75 LeetCode algorithm questions, along with their solutions in Golang. It has been carefully prepared by the Facebook Tech Lead in his interview preparation. Blind 75 is helped many developers to prepare interviews for top tech companies aka FAANG.

Purpose

The purpose of this repository is to save time and streamline your interview preparation by providing a curated set of algorithm questions. By focusing on these selected 75 LeetCode questions, you can cover a wide range of fundamental algorithms and data structures commonly asked in technical interviews.

Features

Questions are categorized based on problem types such as arrays, linked lists, binary trees, dynamic programming, and more. Each question includes a detailed solution implemented in Go. Solutions are thoroughly tested and optimized to ensure correctness and efficiency.

Contribution

We welcome contributions from the community to enhance this curated list. If you have improvements to existing solutions, please submit a pull request or open an issue.

Resources

Teamblind Post: Curated List of Top 75 LeetCode Questions

Feel free to explore this repository of LeetCode algorithm questions and their solutions in Go. It will help you prepare effectively for technical interviews. Good luck!

Blind 75

#	Problem	Solution	Difficulty	Tags
1	Two Sum	Go	Easy	Array, Hash Table
3	Longest Substring Without Repeating Characters	Go	Medium	Sliding Window
5	Longest Palindromic Substring	Go	Medium	Dynamic Programming
11	Container With Most Water	Go	Medium	Two Pointers
15	Three Sum	Go	Medium	Two Pointers
19	Remove Nth Node From End of List	Go	Medium	Linked List
20	Valid Parentheses	Go	Easy	Stack
21	Merge Two Sorted Lists	Go	Easy	Linked List
23	Merge k Sorted Lists	Go	Hard	Linked List
33	Search in Rotated Sorted Array	Go	Medium	Binary Search
39	Combination Sum	Go	Medium	Backtracking
48	Rotate Image	Go	Medium	Math
49	Group Anagrams	Go	Medium	Array, Hash Table
53	Maximum Subarray	Go	Medium	Greedy
54	Spiral Matrix	Go	Medium	Math
55	Jump Game	Go	Medium	Greedy
56	Merge Intervals	Go	Medium	Intervals
57	Insert Interval	Go	Medium	Intervals
62	Unique Paths	Go	Medium	Dynamic Programming
70	Climbing Stairs	Go	Easy	Dynamic Programming
73	Set Matrix Zeroes	Go	Medium	Math
76	Minimum Window Substring	Go	Hard	Sliding Window
79	Word Search	Go	Medium	Backtracking
91	Decode Ways	Go	Medium	Dynamic Programming
98	Validate Binary Search Tree	Go	Medium	Tree
100	Same Tree	Go	Easy	Tree
102	Binary Tree Level Order Traversal	Go	Medium	Tree
104	Maximum Depth of Binary Tree	Go	Easy	Tree
105	Construct Binary Tree from Preorder and Inorder Traversal	Go	Medium	Tree
121	Best Time to Buy And Sell Stock	Go	Easy	Sliding Window
124	Binary Tree Maximum Path Sum	Go	Hard	Tree
125	Valid Palindrome	Go	Easy	Two Pointers
128	Longest Consecutive Sequence	Go	Medium	Array, Hash Table
133	Clone Graph	Go	Medium	Graph
139	Word Break	Go	Medium	Dynamic Programming
141	Linked List Cycle	Go	Easy	Linked List
143	Reorder List	Go	Medium	Linked List
152	Maximum Product Subarray	Go	Medium	Dynamic Programming
153	Find Minimum in Rotated Sorted Array	Go	Medium	Binary Search
190	Reverse Bits	Go	Easy	Bit Manipulation
191	Number of 1 Bits	Go	Easy	Bit Manipulation
198	House Robber	Go	Medium	Dynamic Programming
200	Number of Islands	Go	Medium	Graph
206	Reverse Linked List	Go	Easy	Linked List
207	Course Schedule	Go	Medium	Graph
208	Implement Trie (Prefix Tree)	Go	Medium	Trie
211	Design Add and Search Words Data Structure	Go	Medium	Trie
212	Word Search II	Go	Hard	Trie
213	House Robber II	Go	Medium	Dynamic Programming
217	Contains Duplicate	Go	Easy	Array, Hash Table
226	Invert Binary Tree	Go	Easy	Tree
230	Kth Smallest Element in a BST	Go	Medium	Tree
235	Lowest Common Ancestor of a Binary Search Tree	Go	Medium	Tree
238	Product Of Array Except Self	Go	Medium	Array
242	Valid Anagram	Go	Easy	Array, Hash Table
252	Meeting Rooms	Go	Easy	Intervals
253	Meeting Rooms II	Go	Medium	Intervals
261	Graph Valid Tree	Go	Medium	Graphs
268	Missing Number	Go	Easy	Bit Manipulation
269	Alien Dictionary	Go	Hard	Graphs
271	Encode And Decode Strings	Go	Medium	Array
295	Find Median From Data Stream	Go	Hard	Heap
297	Serialize And Deserialize Binary Tree	Go	Hard	Tree
300	Longest Increasing Subsequence	Go	Medium	Dynamic Programming
322	Coin Change	Go	Medium	Dynamic Programming
323	Number Of Connected Components In An Undirected Graph	Go	Medium	Graph
338	Counting Bits	Go	Easy	Bit Manipulation
347	Top K Frequent Elements	Go	Medium	Array, Hash Table
371	Sum Of Two Integers	Go	Medium	Bit Manipulation
417	Pacific Atlantic Water Flow	Go	Medium	Graph
424	Longest Repeating Character Replacement	Go	Medium	Sliding Window
435	Non-overlapping Intervals	Go	Medium	Intervals
572	Subtree of Another Tree	Go	Easy	Tree
647	Palindromic Substrings	Go	Medium	Dynamic Programming
1143	Longest Common Subsequence	Go	Medium	Dynamic Programming