List Collected From: https://neetcode.io/practice

Golang Implimentation By Sk Shahriar Ahmed Raka

Array & Hashing

1. Contains Duplicate (easy) - Problem - Solution

2. Valid Anagram (easy) -Problem - Solution

3. Two Sum (easy) -Problem- Solution

4. Group Anagrams (medium) -Problem- Solution

5. Top K Frequent Elements (medium) -Problem - Solution

6. Product of Array Except Self (medium) -Problem - Solution

7. Valid Sudoku (medium) -Problem - Solution

8. Encode and Decode Strings (medium) -Problem - Solution

9. Longest Consecutive Sequence (medium) -Problem - Solution

Two Pointers

1. Valid Palindrome (easy) -Problem - Solution

2. Two Sum II - Input Array Is Sorted (medium) -Problem - Solution

3. 3Sum (medium) -Problem - Solution

4. Container With Most Water (medium) -Problem - Solution

5. Trapping Rain Water (hard) -Problem- Solution

Sliding Window

1. Best Time to Buy and Sell Stock (easy) -Problem- Solution

2. Longest Substring Without Repeating Characters (medium) -Problem - Solution

3. Longest Repeating Character Replacement (medium) -Problem - Solution

4. Permutation in String (medium) -Problem- Solution

5. Minimum Window Substring (hard) -Problem- Solution

6. Sliding Window Maximum (hard) -Problem- Solution

Stack

1. Valid Parentheses (easy) -Problem- Solution

2. Min Stack (medium) -Problem - Solution

3. Evaluate Reverse Polish Notation (medium) -Problem - Solution

4. Generate Parentheses (medium) -Problem - Solution

5. Daily Temperatures (medium) -Problem- Solution

6. Car Fleet (medium) - Solution

7. Largest Rectangle in Histogram (hard) -Problem- Solution

Binary Search

1. Binary Search (easy) -Problem- Solution

2. Search a 2D Matrix (medium) --Problem Solution

3. Koko Eating Bananas (medium) -Problem- Solution

4. Search in Rotated Sorted Array (medium) -Problem- Solution

5. Find Minimum in Rotated Sorted Array (medium) -Problem- Solution

6. Time Based Key-Value Store (medium) -Problem- Solution

7. Median of Two Sorted Arrays (hard) -Problem- Solution

Linked List

1. Reverse Linked List (easy) -Problem- Solution

2. Merge Two Sorted Lists (easy) -Problem- Solution

3. Reorder List (medium) -Problem- Solution

4. Remove Nth Node From End of List (medium) -Problem- Solution

5. Copy List with Random Pointer (medium) -Problem- Solution

6. Add Two Numbers (medium) -Problem- Solution

7. Linked List Cycle (easy) -Problem- Solution

8. Find the Duplicate Number (medium) -Problem- Solution

9. LRU Cache (medium) -Problem- Solution

10. Merge k Sorted Lists (hard) -Problem- Solution

11. Reverse Nodes in k-Group (hard) -Problem- Solution

Trees

1. Invert Binary Tree (easy) - Solution

2. Maximum Depth of Binary Tree (easy) - Solution

3. Diameter of Binary Tree (easy) - Solution

4. Balanced Binary Tree (easy) - Solution

5. Same Tree (easy) - Solution

6. Subtree of Another Tree (easy) - Solution

7. Lowest Common Ancestor of a Binary Search Tree (medium) - Solution

8. Binary Tree Level Order Traversal (medium) - Solution

9. Binary Tree Right Side View (medium) - Solution

10. Count Good Nodes in Binary Tree (medium) - Solution

11. Validate Binary Search Tree (medium) - Solution

12. Kth Smallest Element in a BST (medium) - Solution

13. Construct Binary Tree from Preorder and Inorder Traversal (medium) - Solution

14. Binary Tree Maximum Path Sum (hard) - Solution

15. Serialize and Deserialize Binary Tree (hard) - Solution

Tries

1. Implement Trie (Prefix Tree) (medium) - Solution

2. Design Add and Search Words Data Structure (medium) - Solution

3. Word Search II (hard) - Solution

Heap

1. Kth Largest Element in a Stream (easy) - Solution

2. Last Stone Weight (easy) - Solution

3. K Closest Points to Origin (medium) - Solution

4. Kth Largest Element in an Array (medium) - Solution

5. Task Scheduler (medium) - Solution

6. Design Twitter (medium) - Solution

7. Find Median from Data Stream (hard) - Solution

Backtracking

1. Subsets (medium) - Solution

2. Combination Sum (medium) - Solution

3. Permutations (medium) - Solution

4. Subsets II (medium) - Solution

5. Combination Sum II (medium) - Solution

6. Word Search (medium) - Solution

7. Palindrome Partitioning (medium) - Solution

8. Letter Combinations of a Phone Number (medium) - Solution

9. N-Queens (hard) - Solution

Graph

1. Number of Islands (medium) - Solution

2. Clone Graph (medium) - Solution

3. Max Area of Island (medium) - Solution

4. Pacific Atlantic Water Flow (medium) - Solution

5. Surrounded Regions (medium) - Solution

6. Rotting Oranges (medium) - Solution

7. Walls and Gates (medium) - Solution

8. Course Schedule (medium) - Solution

9. Course Schedule II (medium) - Solution

10. Redundant Connection (medium) - Solution

11. Number of Connected Components in an Undirected Graph (medium) - Solution

12. Graph Valid Tree (medium) - Solution

13. Word Ladder (hard) - Solution

Advanced Graph

1. Reconstruct Itinerary (hard) - Solution

2. Min Cost to Connect All Points (medium) - Solution

3. Network Delay Time (medium) - Solution

4. Swim in Rising Water (hard) - Solution

5. Alien Dictionary (hard) - Solution

6. Cheapest Flights Within K Stops (medium) - Solution

1-D Dynamic Programming

1. Cheapest Flights Within K Stops (medium) - Solution

2. Min Cost Climbing Stairs (easy) - Solution

3. House Robber (medium) - Solution

4. House Robber II (medium) - Solution

5. Longest Palindromic Substring (medium) - Solution

6. Palindromic Substrings (medium) - Solution

7. Decode Ways (medium) - Solution

8. Coin Change (medium) - Solution

9. Maximum Product Subarray (medium) - Solution

10. Word Break (medium) - Solution

11. Longest Increasing Subsequence (medium) - Solution

12. Partition Equal Subset Sum (medium) - Solution

2-D Dynamic Programming

1. Unique Paths (medium) - Solution

2. Longest Common Subsequence (medium) - Solution

3. Best Time to Buy and Sell Stock with Cooldown (medium) - Solution

4. Coin Change II (medium) - Solution

5. Target Sum (medium) - Solution

6. Interleaving String (medium) - Solution

7. Longest Increasing Path in a Matrix (hard) - Solution

8. Distinct Subsequences (hard) - Solution

9. Edit Distance (hard) - Solution

10. Burst Balloons (hard) - Solution

11. Regular Expression Matching (hard) - Solution

Greedy

1. Maximum Subarray (medium) - Solution

2. Jump Game (medium) - Solution

3. Jump Game II (medium) - Solution

4. Gas Station (medium) - Solution

5. Hand of Straights (medium) - Solution

6. Merge Triplets to Form Target Triplet (medium) - Solution

7. Partition Labels (medium) - Solution

8. Valid Parenthesis String (medium) - Solution

Interval

1. Insert Interval (medium) - Solution

2. Merge Intervals (medium) - Solution

3. Non-overlapping Intervals (medium) - Solution

4. Meeting Rooms (easy) - Solution

5. Meeting Rooms II (medium) - Solution

6. Minimum Interval to Include Each Query (hard) - Solution

Math & Geometry

1. Rotate Image (medium) - Solution

2. Spiral Matrix (medium) - Solution

3. Set Matrix Zeroes (medium) - Solution

4. Happy Number (easy) - Solution

5. Plus One (easy) - Solution

6. Pow(x, n) (medium) - Solution

7. Multiply Strings (medium) - Solution

8. Detect Squares (medium) - Solution

Bit Manipulation

1. Single Number (easy) - Solution

2. Number of 1 Bits (easy) - Solution

3. Counting Bits (easy) - Solution

4. Reverse Bits (easy) - Solution

5. Missing Number (easy) - Solution

6. Sum of Two Integers (medium) - Solution

7. Reverse Integer (medium) - Solution