This repository has not been actively maintained for a while. I plan to revisit every single question to ensure accuracy and completeness once I am available. If you come across any outdated information or have suggestions, feel free to open an issue or submit a pull request. Your contributions are greatly appreciated!
This repository is a software engineer interview preparation, which provides solutions for 75 leetcode questions in Python. The original post can be found on here. Questions can be categorized into 15 categories: Array, Stack, Linked List, String, Binary Tree, Binary Search, Graph, Dynamic Programming, Binary Search Tree, Hash Table, Binary, Heap, Trie, Recursion, and Matrix.
- 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)
- 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
- Container With Most Water: Solution
- 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
- Merge Two Sorted Lists: Solution
- Linked List Cycle: Solution
- Reverse a Linked List: Solution
- Middle of the Linked List: Solution
- LRU Cache: Solution
- 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
- 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: Solution
- First Bad Version: Solution
- Search in Rotated Sorted Array: Solution
- Time Based Key-Value Store: Solution
- Maximum Profit in Job SchedulingSolution
- 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
- Maximum Subarray: Solution
- Climbing Stairs: Solution
- Coin Change: Solution
- Partition Equal Subset Sum: Solution
- Unique Paths: Solution
- Lowest Common Ancestor of a Binary Search Tree: Solution
- Validate Binary Search Tree: Solution
- Kth Smallest Element in a BST: Solution
- K Closest Points to Origin: Solution
- Task Scheduler: Solution
- Find Median from Data Stream: Solution
- Merge K Sorted Lists: Solution