My Coding Interview Journery

1. Create LinkedList in Rust

2. Heap in Rust 2.1. Create a new class and make sure you can change how heap sorts the data

3. BST in Rust 2.2 Use the same class as above and make sure how you can change the sroting

4. Adjacency matrix 4.1 Why bfs time complexity is $O(n.m)$ (adjancy matrix). What is the memory complexity? 4.2 Why dfs time complexity and memory complexity is $O(4^n)$ and O(n.m) respectfully

5. Graph in rust

Ahmad Mansouri