README.md

Awesome Leetcode Algorithms Solutions With Python

_{Author: Muhammed Mustafa (muffafa) Savar
May, 2023}

---

🙋🏻 Introduction

Welcome to the solutions of leetcode algorithms with Python.

🚀 How to Use It?

I suggest cloning the repository locally to work with it, but you can easily look at any solution you want without cloning it. Simply press Ctrl + F and type the name of the question or its ID. Each folder includes an .md file that you can click on to go to the Leetcode website. There are two parts of questions:

1. Problem:
   This part includes the definition of the problem, example cases, input and output examples, constraints, and follow-up information.
2. Solution:
   This part includes a table to navigate to the solutions.

😎 Solutions

Each .md file for a solution includes:

• Header (that navigates to the online explanation of the solution)
• Approach (describing the approach to solving the problem)
• Complexity (determining the time and space complexity of the solution)
• Code (the actual solution to the problem)

---

ID	Leetcode ID	👀 Question Name	📦 Category	🔥 Difficulty
1	0001	Two Sum	Arrays & Hashing	Easy
2	0217	Contains Duplicate	Arrays & Hashing	Easy
3	0242	Valid Anagram	Arrays & Hashing	Easy
4	0049	Group Anagram	Arrays & Hashing	Medium
5	0347	Top K Frequent Elements	Arrays & Hashing	Medium
6	0238	Product Of Array Except Self	Arrays & Hashing	Medium
7	0020	Valid Parentheses	Stack	Easy
8	0125	Valid Palindrome	Two Pointers	Easy
9	0155	Min Stack	Stack	Medium
10	0167	Two Sum II Input Array Is Sorted	Two Pointers	Medium
11	0121	Best Time to Buy and Sell Stock	Sliding Window	Easy
12	0206	Reverse Linked List	Linked List	Easy
13	0021	Merge Two Sorted Lists	Linked List	Easy
14	0704	Binary Search	Binary Search	Easy