README.md

Awesome Leetcode Algorithms Solututions With Rust

---

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

Awesome Leetcode Algorithms Solututions With Rust

_{Author: Ömer Aydın
May, 2023}

Introduction

Welcome to the solutions of leetcode algorithms with Rust.

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)