Leetcode Solutions in Rust, Advent of Code Solutions in Ru.zip

# [RUST GYM](http://rustgym.com) Rust Solutions [](https://docs.rs/rustgym) [](https://github.com/warycat/rustgym/actions) ## [Leetcode Solutions in Rust](#leetcode) ## [AdventOfCode Solutions in Rust](#adventofcode) ## [Google Solutions in Rust](#google) This project demonstrates how to create **Data Structures** and to implement **Algorithms** using programming language **Rust** All the solutions here are crafted with love and their performance beats 99% of other solutions on the leetcode website. Tutorial videos will be added later. ### Please subscribe to our [RUST GYM Youtube Channel](https://www.youtube.com/channel/UCV9HzRLPKjI8SttaIYOygsw) for future videos. <details><summary>Data Structures</summary> - Stack & Queue ( Vec, VecDeque ) - Linked List ( Option<Box<ListNode>> ) - Hash Tables ( HashMap, HashSet ) - Tree Tables ( BTreeMap, BTreeSet ) - Binary Search Tree ( Option<Rc<RefCell<TreeNode>>> ) - Binary Heaps & Priority Queue ( BinaryHeap ) - Graphs ( Vec<Vec<usize>> ) - Union Find ( UnionFind ) - Trie ( Trie ) </details> <details><summary>Algorithms</summary> - Bit Manipulation & Numbers - Stability in Sorting - Heapsort - Binary Search - Kth Smallest Elements - Permutations - Subsets - BFS Graph - DFS Graph - Dijkstra’s Algorithm - Tree Traversals - BFS - DFS - in-order - pre-order - post-order - Topological Sort - Detect cycle in an undirected graph - Detect a cycle in a directed graph - Count connected components in a graph - Find strongly connected components in a graph </details> <table id="leetcode" class="table-auto"> <thead> <tr> <th>id</th> <th>Leetcode</th> <th>Level</th> </tr> </thead> <tbody> <tr> <td> 1 </td> <td> <a href="http://rustgym.com/leetcode/1"> Two Sum</a> </td> <td>Easy</td> </tr> <tr> <td> 9 </td> <td> <a href="http://rustgym.com/leetcode/9"> Palindrome Number</a> </td> <td>Easy</td> </tr> <tr> <td> 13 </td> <td> <a href="http://rustgym.com/leetcode/13"> Roman to Integer</a> </td> <td>Easy</td> </tr> <tr> <td> 14 </td> <td> <a href="http://rustgym.com/leetcode/14"> Longest Common Prefix</a> </td> <td>Easy</td> </tr> <tr> <td> 20 </td> <td> <a href="http://rustgym.com/leetcode/20"> Valid Parentheses</a> </td> <td>Easy</td> </tr> <tr> <td> 21 </td> <td> <a href="http://rustgym.com/leetcode/21"> Merge Two Sorted Lists</a> </td> <td>Easy</td> </tr> <tr> <td> 26 </td> <td> <a href="http://rustgym.com/leetcode/26"> Remove Duplicates from Sorted Array</a> </td> <td>Easy</td> </tr> <tr> <td> 27 </td> <td> <a href="http://rustgym.com/leetcode/27"> Remove Element</a> </td> <td>Easy</td> </tr> <tr> <td> 28 </td> <td> <a href="http://rustgym.com/leetcode/28"> Implement strStr()</a> </td> <td>Easy</td> </tr> <tr> <td> 35 </td> <td> <a href="http://rustgym.com/leetcode/35"> Search Insert Position</a> </td> <td>Easy</td> </tr> <tr> <td> 53 </td> <td> <a href="http://rustgym.com/leetcode/53"> Maximum Subarray</a> </td> <td>Easy</td> </tr> <tr> <td> 58 </td> <td> <a href="http://rustgym.com/leetcode/58"> Length of Last Word</a> </td> <td>Easy</td> </tr> <tr> <td> 66 </td> <td> <a href="http://rustgym.com/leetcode/66"> Plus One</a> </td> <td>Easy</td> </tr> <tr> <td> 67 </td> <td> <a href="http://rustgym.com/leetcode/67"> Add Binary</a> </td> <td>Easy</td> </tr> <tr> <td> 69 </td> <td> <a href="http://rustgym.com/leetcode/69"> Sqrt(x)</a> </td> <td>Easy</td> </tr> <tr> <td> 70 </td> <td> <a href="http://rustgym.com/leetcode/70"> Climbing Stairs</a> </td> <td>Easy</td> </tr> <tr> <td> 83 </td> <td> <a href="http://rustgym.com/leetcode/83"> Remove Duplicates from Sorted List</a> </td> <td>Easy</td> </tr> <tr> <td> 88 </td> <td> <a href="http://rustgym.com/leetcode/88"> Merge Sorted Array</a> </td> <td>Easy</td> </tr> <tr> <td> 94 </td> <td> <a href="http://rustgym.com/leetcode/94"> Binary Tree Inorder Traversal</a> </td> <td>Easy</td> </tr> <tr> <td> 100 </td> <td> <a href="http://rustgym.com/leetcode/100"> Same Tree</a> </td> <td>Easy</td> </tr> <tr> <td> 101 </td> <td> <a href="http://rustgym.com/leetcode/101"> Symmetric Tree</a> </td> <td>Easy</td> </tr> <tr> <td> 104 </td> <td> <a href="http://rustgym.com/leetcode/104"> Maximum Depth of Binary Tree</a> </td> <td>Easy</td> </tr> <tr> <td> 108 </td> <td> <a href="http://rustgym.com/leetcode/108"> Convert Sorted Array to Binary Search Tree</a> </td> <td>Easy</td> </tr> <tr> <td> 110 </td> <td> <a href="http://rustgym.com/leetcode/110"> Balanced Binary Tree</a> </td> <td>Easy</td> </tr> <tr> <td> 111 </td> <td> <a href="http://rustgym.com/leetcode/111"> Minimum Depth of Binary Tree</a> </td> <td>Easy</td> </tr> <tr> <td> 112 </td> <td> <a href="http://rustgym.com/leetcode/112"> Path Sum</a> </td> <td>Easy</td> </tr> <tr> <td> 118 </td> <td> <a href="http://rustgym.com/leetcode/118"> Pascal&#x27;s Triangle</a> </td> <td>Easy</td> </tr> <tr> <td> 119 </td> <td> <a href="http://rustgym.com/leetcode/119"> Pascal&#x27;s Triangle II</a> </td> <td>Easy</td> </tr> <tr> <td> 121 </td> <td> <a href="http://rustgym.com/leetcode/121"> Best Time to Buy and Sell Stock</a> </td> <td>Easy</td> </tr> <tr> <td> 125 </td> <td> <a href="http://rustgym.com/leetcode/125"> Valid Palindrome</a> </td> <td>Easy</td> </tr> <tr> <td> 136 </td> <td> <a href="http://rustgym.com/leetcode/136"> Single Number</a> </td> <td>Easy</td> </tr> <tr> <td> 141 </td> <td> <a href="http://rustgym.com/leetcode/141"> Linked List Cycle</a> </td> <td>Easy</td> </tr> <tr> <td> 144 </td> <td> <a href="http://rustgym.com/leetcode/144"> Binary Tree Preo