- Leetcode Solutions in Rust
- AdventOfCode Solutions in Rust
- Google Solutions in Rust
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. To speed up your learning with generative AI, visit abao.ai and create a FREE account to manage your telegram @username. Add @abao_ai_bot to your telegram group with your friends to learn rust coding together. You can ask GPT, Gemini, Claude coding questions with your friends and tutors in the group together. Other Image and Video generation models are also available for paid subscribers. Join https://t.me/abao_ai_flux for support.
Data Structures
- Stack & Queue ( Vec, VecDeque )
- Linked List ( Option<Box> )
- Hash Tables ( HashMap, HashSet )
- Tree Tables ( BTreeMap, BTreeSet )
- Binary Search Tree ( Option<Rc<RefCell>> )
- Binary Heaps & Priority Queue ( BinaryHeap )
- Graphs ( Vec<Vec> )
- Union Find ( UnionFind )
- Trie ( Trie )
Algorithms
- 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