Grind 75 (Completed)

This repository is a software engineer interview prepration, which provides solutions for 75 leetcode questions in Python. The original post can be found on here. Questions can be categorized into 15 cagtegories, including Array, Stack, Linked List, String, Binary Tree, Binary Search, Graph, Dynamic Programming, Binary Search Tree, Hash Table, Binary, Heap, Trie, Recursion, and Matrix.

Problem Solved: 75 / 75

• Array (11)
• Stack (7)
• Linked-List (5)
• String (8)
• Binary Tree (9)
• Binary Search (5)
• Graph (10)
• Dynamic Programming (5)
• Binary Search Tree (3)
• Hash Table (1)
• Binary (1)
• Heap (4)
• Trie (2)
• Recursion (3)
• Matrix (1)

Array

• Two Sum: Solution
• Best Time to Buy and Sell Stock: Solution
• Contains Duplicate: Solution
• Majority Element: Solution
• Insert Interval: Solution
• 3Sum: Solution
• Product of Array Except Self: Solution
• Combination Sum: Solution
• Merge Intervals: Solution
• Sort Colors: Solution: Solution
• Container With Most Water: Solution

Stack

• Valid Parentheses: Solution
• Implement Queue using Stacks: Solution
• Min Stack: Solution: Solution
• Evaluate Reverse Polish Notation: Solution
• Trapping Rain Water: Solution
• Basic Calculator: Solution
• Largest Rectangle in Histogram: Solution

Linked List

• Merge Two Sorted Lists: Solution
• Linked List Cycle: Solution
• Reverse a Linked List: Solution
• Middle of the Linked List: Solution
• LRU Cache: Solution

String

• Valid Palindrome: Solution
• Valid Anagram: Solution
• Longest Palindrome: Solution
• Longest Substring Without Repeating Characters: Solution
• String to Integer (atoi): Solution
• Longest Palindromic Substring: Solution
• Find All Anagrams in a String: Solution
• Minimum Window Substring: Solution

Binary Tree

• Invert Binary Tree: Solution
• Balanced Binary Tree: Solution
• Diameter of Binary Tree: Solution
• Maximum Depth of Binary Tree: Solution
• Binary Tree Level Order Traversal: Solution
• Lowest Common Ancestor of a Binary Tree: Solution
• Binary Tree Right Side View: Solution
• Construct Binary Tree from Preorder and Inorder Traversal: Solution
• Serialize and Deserialize Binary Tree: Solution

Binary Search

• Binary Search: Solution
• First Bad Version: Solution
• Search in Rotated Sorted Array: Solution
• Time Based Key-Value Store: Solution
• Maximum Profit in Job SchedulingSolution

Graph

• Flood Fill: Solution
• 01 Matrix: Solution
• Clone Graph: Solution
• Course Schedule: Solution
• Number of Islands: Solution
• Rotting Oranges: Solution
• Accounts Merge: Solution
• Word Search: Solution
• Minimum Height Trees: Solution
• Word Ladder: Solution

Dynamic Programming

• Maximum Subarray: Solution
• Climbing Stairs: Solution
• Coin Change: Solution
• Partition Equal Subset Sum: Solution
• Unique Paths: Solution

Binart Search Tree

• Lowest Common Ancestor of a Binary Search Tree: Solution
• Validate Binary Search Tree: Solution
• Kth Smallest Element in a BST: Solution

Hash Table

• Ransom Note: Solution

Binary

• Add Binary: Solution

Heap

• K Closest Points to Origin: Solution
• Task Scheduler: Solution
• Find Median from Data Stream: Solution
• Merge K Sorted Lists: Solution

Trie

• Implement Trie (Prefix Tree): Solution
• Word Break: Solution

Recursion

• Permutations: Solution
• Subsets: Solution
• Letter Combinations of a Phone Number: Solution

Matrix

• Spiral Matrix: Solution