Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/tolumide-ng/coding-challenge
Algorithms and Data-structures, problems and solutions in Rust language using cargo-workspaces
https://github.com/tolumide-ng/coding-challenge
algorithms cargo data-structures rust rust-language rustlang
Last synced: 5 days ago
JSON representation
Algorithms and Data-structures, problems and solutions in Rust language using cargo-workspaces
- Host: GitHub
- URL: https://github.com/tolumide-ng/coding-challenge
- Owner: tolumide-ng
- Created: 2021-01-12T14:21:46.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2021-06-06T10:25:54.000Z (over 3 years ago)
- Last Synced: 2024-09-25T20:17:00.016Z (8 days ago)
- Topics: algorithms, cargo, data-structures, rust, rust-language, rustlang
- Language: Rust
- Homepage:
- Size: 264 KB
- Stars: 17
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: readme.md
Awesome Lists containing this project
README
## Coding Challenge
### LeetCode/Hackerrank e.t.c
Using this as an opportunity to improve my knowledge of rust lang
> > If you found this repo useful to you, add a star :thumbs-up
### Please Note
> > > \*If the rust and js cell of a row is empty, it means the solution is present on the title col of that specific row. This is owing to changes in how this table used to be. Updates would be made later to ensure consistency
| # | Title | JS | Rust |
| --- | --------------------------------------------------------------------------------------------------------------------------------------------------------------------- | --------------------------------------------------------------------------------------------------------------------------------------- | ------------------------------------------------------------------------------------------------------------------------------------------------------- |
| 1 | [Reverse Bits](https://github.com/tolumide-ng/coding-challenge) |
| 2 | [Binary tree from inorder, postorder](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/bt_from_list.rs) |
| 3 | [Binary tree from preorder, inorder](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/bt_from_preorder_inorder.rs) |
| 4 | [Lowest Common Ancestor](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/lowest_common_ancestor.rs) |
| 5 | [Next Pointer (javascript)](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/next_right_pointers.js) |
| 6 | [Sherlock and the Valid string](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/sherlock_and_the_valid_string.rs) |
| 7 | [Town Sunset](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/sunset.rs) |
| 8 | [Two Sums](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/two_sums.rs) |
| 9 | [Walls and Gates](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/walls_and_gates.rs) |
| 10 | [Circular Queue](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/circular_queue.rs) |
| 11 | [Moving Data Stream](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/moving_data_stream.rs) |
| 12 | [Inorder traversal](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/binary_tree/in_order_traversal.rs) |
| 13 | [Level Order traversal](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/binary_tree/level_order_traversal.rs) |
| 14 | [Lowest Common Ancestor](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/binary_tree/lowest_common_ancestor.rs) |
| 15 | [Maximum Depth](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/binary_tree/max_depth.rs) |
| 16 | [Path Sum](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/binary_tree/path_sum.rs) |
| 17 | [Post order traversal](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/binary_tree/post_order_traversal.rs) |
| 18 | [Pre order traversal](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/binary_tree/pre_order_traversal.rs) |
| 19 | [Priority queue](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/binary_tree/priority_queue.rs) |
| 20 | [Serialize Deserialize Binary Tree](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/binary_tree/serialize_deserialize.rs) |
| 21 | [Symmetric tree](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/binary_tree/symmetic_tree.rs) |
| 22 | [Doubly linked list](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/linked_lists/doubly_linked_list.rs) |
| 23 | [Linked Cycle](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/linked_lists/leet_singly_ll.rs) |
| 24 | [Linked Cycle Position](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/linked_lists/linked_cycle_pos.rs) |
| 25 | [Linked List Palindrome](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/linked_lists/linked_palindrome.rs) |
| 26 | [Linked List- nth from last](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/linked_lists/nth_from_last.rs) |
| 27 | [Linked List - Arrange into odd/even](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/linked_lists/odd_even_linked_lists.rs) |
| 28 | [Linked List - Remove Linked elem](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/linked_lists/remove_linked_elements.rs) |
| 29 | [Linked List - Remove nth node from the last](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/linked_lists/remove_nth_node_from_end.rs) |
| 30 | [Reverse Linked List](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/linked_lists/reversed_linked_lists.rs) |
| 31 | [Number of Islands](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/number_of_islands_dfs.rs) |
| 32 | [Walls and Gates - dfs](https://leetcode.com/problems/walls-and-gates/) | | [Walls and Gates - dfs](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/walls_and_gates_dfs.rs) |
| 33 | [Chief Hopper](https://www.hackerrank.com/challenges/chief-hopper/problem?utm_campaign=challenge-recommendation&utm_medium=email&utm_source=24-hour-campaign) | [Chief Hopper](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/chief_hopper.js) | [Chief Hopper](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/chief_hopper.rs) |
| 34 | [Open the Lock - bfs](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/open_the_lock.rs) |
| 35 | [Perfect Squares](https://leetcode.com/problems/perfect-squares/) | | [Perfect Squares](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/perfect_squares.rs) |
| 36 | [Min Stack](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/min_stack.rs) |
| 37 | [Valid Parenthes](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/valid_parentheses.rs) |
| 38 | [Daily Temperatures](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/daily_temperatures.rs) |
| 39 | [Reverse Polish Notation](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/reverse_polish_notation.rs) |
| 40 | [Max Min](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/max_min.rs) |
| 41 | [Number of Islands](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/number_of_islands_bfs.rs) |
| 42 | [Jim and the Others](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/jim_and_the_others.rs) | [Jim and Others](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/jim_and_orders.js) | [Jim and the Others](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/jim_and_the_others.rs) |
| 43 | [Clone Graph](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/clone_graph.rs) |
| 44 | [Game Of Thrones 1](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/game_of_thrones_1.rs) |
| 45 | [Grredy Florist](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/greedy_florist.js) | [Greedy Florist](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/greedy_florist.js) | |
| 46 | [Queue with Stack](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/queue_with_stack.rs) | [Queue with Stack](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/queue_with_stack.js) | [Queue with Stack](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/queue_with_stack.rs) |
| 47 | [Stack with Queues](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/stack_with_queues.rs) |
| 48 | [Decode String](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/decode_string.rs) |
| 49 | [Flood Fill](https://leetcode.com/explore/learn/card/queue-stack/239/conclusion/1393/) | | [Flood Fill](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/flood_fill.rs) |
| 50 | [01 Matrix](https://leetcode.com/explore/learn/card/queue-stack/239/conclusion/1388/) | [Matrix 01](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/matrix_01.js) | [Matrix 01](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/matrix_01.rs) |
| 51 | [Keys and Rooms](https://leetcode.com/explore/learn/card/queue-stack/239/conclusion/1391/) | | [Keys and Rooms](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/keys_and_rooms.rs) |
| 52 | [Permuting Two Arrays](https://www.hackerrank.com/challenges/two-arrays/problem?utm_campaign=challenge-recommendation&utm_medium=email&utm_source=24-hour-campaign) | [Permuting Two Arrays](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/permuting_two_arrays.js) | [Permuting Two Arrays](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/permuting_two_arrays.rs) |
| 53 | [Mark and Toys](https://www.hackerrank.com/challenges/mark-and-toys/problem?utm_campaign=challenge-recommendation&utm_medium=email&utm_source=24-hour-campaign) | [Mark and Toys](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/mark_and_toys.js) | [Mark and Toys](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/mark_and_toys.rs) |
| 54 | [Two Strings](https://www.hackerrank.com/challenges/two-strings/problem?utm_campaign=challenge-recommendation&utm_medium=email&utm_source=24-hour-campaign) | [Two Strings](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/two_strings.js) | [Two Strings](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/two_strings.rs) |
| 55 | [Making Anagrams](https://www.hackerrank.com/challenges/making-anagrams/problem?utm_campaign=challenge-recommendation&utm_medium=email&utm_source=24-hour-campaign) | [Making Anagrams](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/making_anagrams.js) | |
| 56 | [Reverse String (recursion)](https://leetcode.com/explore/learn/card/recursion-i/250/principle-of-recursion/1440/) | [Reverse String](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/reverse_string.js) | [Reverse String](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/reverse_string.rs) |
| 57 | [Swap Node Pairs](https://leetcode.com/explore/learn/card/recursion-i/250/principle-of-recursion/1681/) | | [Swap Node Pairs](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/reverse_linked_list.rs) |
| 58 | [Reverse Linked List (Recursion)](https://leetcode.com/explore/learn/card/recursion-i/251/scenario-i-recurrence-relation/2378/) | | [Reverse Linked List (Recursion)](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/reverse_linked_list.rs) |
| 59 | Create Binary Tree from a vector | | [create BT](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/create_bst.rs) |
| 60 | [Search BST (Recursion)](https://leetcode.com/explore/learn/card/recursion-i/251/scenario-i-recurrence-relation/3233/) | | [search BST (Recursion)](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/search_bst.rs) |
| 61 | [Pascal's Triangle](https://leetcode.com/explore/learn/card/recursion-i/251/scenario-i-recurrence-relation/3234/) | [Pascal's Triangle](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/pascals_triangle.js) | [Pascal's Triangle](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/pascals_triangle.rs) |
| 62 | [Fibonacci](https://leetcode.com/explore/learn/card/recursion-i/255/recursion-memoization/1661/) | | [Fibonacci](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/fibonacci.rs) |
| 63 | [Climbing Stairs](https://leetcode.com/explore/learn/card/recursion-i/255/recursion-memoization/1662/) | [Climbing Stairs](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/climbing_stairs.js) | [Climbing Stairs](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/climbing_stairs.rs) |
| 64 | [Binary Tree (Max depth - bfs)](https://leetcode.com/explore/learn/card/recursion-i/256/complexity-analysis/2375/) | | [Binary Tree (Max depth)](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/binary_tree_depth.rs) |
| 65 | [Pow(x, n)](https://leetcode.com/explore/learn/card/recursion-i/256/complexity-analysis/2380/) | [Pow(x, n)](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/pow_x_n.js) | [Pow(x, n)](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/pow_x_n.rs) |
| 66 | [Merge Two Sorted Lists](https://leetcode.com/explore/learn/card/recursion-i/253/conclusion/2382/) | | [Merge Two Sorted Lists](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/merge_two_sorted_lists.rs) |
| 67 | [Kth Symbol In Grammar](https://leetcode.com/explore/learn/card/recursion-i/253/conclusion/1675/) | | [Kth Symbol In Grammar](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/kth_symbol_in_grammar.rs) |
| 68 | [Unique Binary Trees II](https://leetcode.com/explore/learn/card/recursion-i/253/conclusion/2384/) | [Unique Binary Trees II](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/unique_binary_tree.js) | [Unique Binary Trees II](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/unique_binary_tree.rs) 😂 🤓 |
| 69 | Merge Sort Algorithm | [Merge Sort](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/merge_sort.js) | [Merge Sort](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/merge_sort.rs) |
| 70 | [Sort an Array](https://leetcode.com/explore/learn/card/recursion-ii/470/divide-and-conquer/2944/) | [Sort an Array](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/sort_an_array.js) | [Sort an Array](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/sort_an_array.rs) |
| 71 | Quick Sort | [Quick Sort](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/quick_sort.js) | [Quick Sort](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/quick_sort.rs) |
| 72 | [Validate BST](https://leetcode.com/explore/learn/card/recursion-ii/470/divide-and-conquer/2874/) | [Validate BST](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/validate_bst.js) | [Validate BST](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/validate_bst.rs) |
| 73 | [Search 2D Matrix II](https://leetcode.com/explore/learn/card/recursion-ii/470/divide-and-conquer/2872/) | | [Search 2D Matrix II](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/search_2d_matrix.rs) |
| 74 | [Kth largest element](https://leetcode.com/problems/kth-largest-element-in-an-array/) | [Kth largest element](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/kth_largest_element.js) | [Kth largest element](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/kth_largest_element.rs) |
| 75 | [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/submissions/) | | [Largest Rectangle in Histogram](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/largest_rectangle_histogram.rs) |
| 76 | [N-Queens II](https://leetcode.com/explore/learn/card/recursion-ii/472/backtracking/2804/) | | [n-Queens II](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/n_queens.rs) |
| 77 | [Sudoku Player](https://leetcode.com/explore/learn/card/recursion-ii/472/backtracking/2796/) | | [Sudoku Player](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/sudoku_player.rs) |
| 78 | [Combinations](https://leetcode.com/explore/learn/card/recursion-ii/472/backtracking/2798/) | | [Combinations](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/combinations.rs) |
| 79 | [Same Tree](https://leetcode.com/explore/learn/card/recursion-ii/503/recursion-to-iteration/2894/) | | [Same Tree](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/same_tree.rs) |
| 80 | [Generate Parenthesis](https://leetcode.com/explore/learn/card/recursion-ii/503/recursion-to-iteration/2772/) | | [Generate Parenthesis](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/generate_parenthesis.rs) |
| 81 | [Binary Tree Level Order traversal](https://leetcode.com/explore/learn/card/recursion-ii/503/recursion-to-iteration/2784/) | | [Binary Tree Level Order traversal](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/level_order_traversal.rs) |
| 82 | [Permutations](https://leetcode.com/explore/learn/card/recursion-ii/507/beyond-recursion/2903/) | | [Permutations](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/permutations.rs) |
| 83 | [Letter Combinations of a Phone Number](https://leetcode.com/explore/learn/card/recursion-ii/507/beyond-recursion/2905/) | | [Letter Combinations of a Phone Number](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/recursion/letter_combinations.rs) |