bujosa / leetcode-rust Goto Github PK

View Code? Open in Web Editor NEW

21.0 2.0 0.0 1.07 MB

My Leetcode solutions in rust

License: MIT License

Rust 78.41% Python 21.59%

leetcode rust algorithms algorithms-and-data-structures test airbnb apple data-structures facebook google

leetcode-rust's Introduction

RustLeet

This project is for leetcode challenges in Rust and includes notes on theory and algorithms.

Description

In this project, I will attempt to solve LeetCode challenges in Rust.

Directory Structure

Problems - Contains solutions to problems. Problems are categorized by difficulty. Each problem has a link to the problem on LeetCode.
Theory - Contains notes on theory and algorithms. Theory is categorized by category. Each category contains a list of problems related to it.

Contribution

We welcome contributions to this project. If you'd like to contribute, please follow the guidelines outlined in our Contribution Guide.

References

leetcode-rust's People

Contributors

Stargazers

Watchers

leetcode-rust's Issues

Construct Binary Tree from Preorder and Inorder Traversal

Amazon question: -> https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/

Median of Two Sorted Arrays

https://leetcode.com/problems/median-of-two-sorted-arrays/

Invert Binary Tree

Description

Given the root of a binary tree, invert the tree, and return its root.

Reference

https://leetcode.com/problems/invert-binary-tree/

Copy List With Random Pointer

Bug related with the compiler,

resolve the bug
add specs for this problem

212. Word Search II

https://leetcode.com/problems/word-search-ii/

Same Tree

https://leetcode.com/problems/same-tree/

Time Based Key-Value Store

https://leetcode.com/problems/time-based-key-value-store/)

Palindrome Partitioning

https://leetcode.com/problems/palindrome-partitioning/

Last Stone Weight

https://leetcode.com/problems/last-stone-weight/

Subtree of Another Tree

https://leetcode.com/problems/subtree-of-another-tree/

Kth Largest Element In An Array

Create Tries Theory File

In this file will be have the problems related with tries, and the theory

703. Kth Largest Element in a Stream

Min Cost Climbing Stairs

https://leetcode.com/problems/min-cost-climbing-stairs/

Kth Smallest Element in a BST

https://leetcode.com/problems/kth-smallest-element-in-a-bst/

355. Design Twitter

https://leetcode.com/problems/design-twitter/

Balanced Binary Tree

Reverse Nodes in K Group

https://leetcode.com/problems/reverse-nodes-in-k-group/

K Closest Points to Origin

198. House Robber

https://leetcode.com/problems/house-robber/

213. House Robber II

https://leetcode.com/problems/house-robber-ii/

Letter Combinations of a Phone Number

https://leetcode.com/problems/letter-combinations-of-a-phone-number/

621. Task Scheduler

Subsets

https://leetcode.com/problems/subsets/

Graphs Theory

Tries Theory

Heap/Priority Queue Theory

Combination sum 2

https://leetcode.com/problems/combination-sum-ii/

Permutations

https://leetcode.com/problems/permutations/

Binary Tree Level Order Traversal

https://leetcode.com/problems/binary-tree-level-order-traversal/

Combination Sum

https://leetcode.com/problems/combination-sum/

N-Queens

https://leetcode.com/problems/n-queens/

Implement Trie Prefix Tree

https://leetcode.com/problems/implement-trie-prefix-tree/

Subsets 2

https://leetcode.com/problems/subsets-ii/

Backtracking Theory

152. Maximum Product Subarray

647. Palindromic Substrings

295. Find Median from Data Stream

https://leetcode.com/problems/find-median-from-data-stream/

Maximum Depth of Binary Tree

Problem Description

Given the root of a binary tree, return its maximum depth.

A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

Reference

https://leetcode.com/problems/maximum-depth-of-binary-tree/

Design Add And Search Words Data Structure

https://leetcode.com/problems/design-add-and-search-words-data-structure/

Climbing Stairs

Binary Tree Right Side View

https://leetcode.com/problems/binary-tree-right-side-view/

Lowest Common Ancestor of a Binary Search Tree

https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/

5. Longest Palindromic Substring

https://leetcode.com/problems/longest-palindromic-substring/

Merge K Sorted Lists

Description

You are given an array of k linked-lists lists, each linked-list is sorted in ascending order.

Merge all the linked-lists into one sorted linked-list and return it.

Examples

Example 1:

Input: lists = [[1,4,5],[1,3,4],[2,6]]
Output: [1,1,2,3,4,4,5,6]
Explanation: The linked-lists are:
[
1->4->5,
1->3->4,
2->6
]
merging them into one sorted list:
1->1->2->3->4->4->5->6
Example 2:

Input: lists = []
Output: []
Example 3:

Input: lists = [[]]
Output: []

Constraints

k == lists.length
0 <= k <= 104
0 <= lists[i].length <= 500
-104 <= lists[i][j] <= 104
lists[i] is sorted in ascending order.
The sum of lists[i].length will not exceed 104.

https://leetcode.com/problems/merge-k-sorted-lists/

1-D DP Theory

Diameter of Binary Tree

https://leetcode.com/problems/diameter-of-binary-tree/

bujosa / leetcode-rust Goto Github PK

leetcode-rust's Introduction

RustLeet

Description

Directory Structure

Contribution

References

leetcode-rust's People

Contributors

Stargazers

Watchers

leetcode-rust's Issues

Description

Reference

Problem Description

Reference

Description

Examples

Constraints

Recommend Projects

Recommend Topics

Recommend Org