{"id":15032003,"url":"https://github.com/tolumide-ng/coding-challenge","last_synced_at":"2025-04-09T21:22:29.938Z","repository":{"id":55076358,"uuid":"329010398","full_name":"tolumide-ng/coding-challenge","owner":"tolumide-ng","description":"Algorithms and Data-structures, problems and solutions in Rust language using cargo-workspaces","archived":false,"fork":false,"pushed_at":"2021-06-06T10:25:54.000Z","size":270,"stargazers_count":17,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-23T23:15:13.281Z","etag":null,"topics":["algorithms","cargo","data-structures","rust","rust-language","rustlang"],"latest_commit_sha":null,"homepage":"","language":"Rust","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/tolumide-ng.png","metadata":{"files":{"readme":"readme.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2021-01-12T14:21:46.000Z","updated_at":"2022-04-24T14:05:16.000Z","dependencies_parsed_at":"2022-08-14T11:20:21.039Z","dependency_job_id":null,"html_url":"https://github.com/tolumide-ng/coding-challenge","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tolumide-ng%2Fcoding-challenge","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tolumide-ng%2Fcoding-challenge/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tolumide-ng%2Fcoding-challenge/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tolumide-ng%2Fcoding-challenge/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/tolumide-ng","download_url":"https://codeload.github.com/tolumide-ng/coding-challenge/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248112797,"owners_count":21049722,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","cargo","data-structures","rust","rust-language","rustlang"],"created_at":"2024-09-24T20:17:07.266Z","updated_at":"2025-04-09T21:22:29.917Z","avatar_url":"https://github.com/tolumide-ng.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"## Coding Challenge\n\n### LeetCode/Hackerrank e.t.c\n\nUsing this as an opportunity to improve my knowledge of rust lang\n\n\u003e \u003e If you found this repo useful to you, add a star :thumbs-up\n\n### Please Note\n\n\u003e \u003e \u003e \\*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\n\n| #   | Title                                                                                                                                                                 | JS                                                                                                                                      | Rust                                                                                                                                                    |\n| --- | --------------------------------------------------------------------------------------------------------------------------------------------------------------------- | --------------------------------------------------------------------------------------------------------------------------------------- | ------------------------------------------------------------------------------------------------------------------------------------------------------- |\n| 1   | [Reverse Bits](https://github.com/tolumide-ng/coding-challenge)                                                                                                       |\n| 2   | [Binary tree from inorder, postorder](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/bt_from_list.rs)                                 |\n| 3   | [Binary tree from preorder, inorder](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/bt_from_preorder_inorder.rs)                      |\n| 4   | [Lowest Common Ancestor](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/lowest_common_ancestor.rs)                                    |\n| 5   | [Next Pointer (javascript)](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/next_right_pointers.js)                                    |\n| 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)                      |\n| 7   | [Town Sunset](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/sunset.rs)                                                               |\n| 8   | [Two Sums](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/two_sums.rs)                                                                |\n| 9   | [Walls and Gates](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/walls_and_gates.rs)                                     |\n| 10  | [Circular Queue](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/circular_queue.rs)                                       |\n| 11  | [Moving Data Stream](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/moving_data_stream.rs)                               |\n| 12  | [Inorder traversal](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/binary_tree/in_order_traversal.rs)                                  |\n| 13  | [Level Order traversal](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/binary_tree/level_order_traversal.rs)                           |\n| 14  | [Lowest Common Ancestor](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/binary_tree/lowest_common_ancestor.rs)                         |\n| 15  | [Maximum Depth](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/binary_tree/max_depth.rs)                                               |\n| 16  | [Path Sum](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/binary_tree/path_sum.rs)                                                     |\n| 17  | [Post order traversal](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/binary_tree/post_order_traversal.rs)                             |\n| 18  | [Pre order traversal](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/binary_tree/pre_order_traversal.rs)                               |\n| 19  | [Priority queue](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/binary_tree/priority_queue.rs)                                         |\n| 20  | [Serialize Deserialize Binary Tree](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/binary_tree/serialize_deserialize.rs)               |\n| 21  | [Symmetric tree](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/binary_tree/symmetic_tree.rs)                                          |\n| 22  | [Doubly linked list](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/linked_lists/doubly_linked_list.rs)                                |\n| 23  | [Linked Cycle](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/linked_lists/leet_singly_ll.rs)                                          |\n| 24  | [Linked Cycle Position](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/linked_lists/linked_cycle_pos.rs)                               |\n| 25  | [Linked List Palindrome](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/linked_lists/linked_palindrome.rs)                             |\n| 26  | [Linked List- nth from last](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/linked_lists/nth_from_last.rs)                             |\n| 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)            |\n| 28  | [Linked List - Remove Linked elem](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/linked_lists/remove_linked_elements.rs)              |\n| 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) |\n| 30  | [Reverse Linked List](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/linked_lists/reversed_linked_lists.rs)                            |\n| 31  | [Number of Islands](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/number_of_islands_dfs.rs)                             |\n| 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)             |\n| 33  | [Chief Hopper](https://www.hackerrank.com/challenges/chief-hopper/problem?utm_campaign=challenge-recommendation\u0026utm_medium=email\u0026utm_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)                                          |\n| 34  | [Open the Lock - bfs](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/open_the_lock.rs)                                   |\n| 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)                       |\n| 36  | [Min Stack](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/min_stack.rs)                                                 |\n| 37  | [Valid Parenthes](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/valid_parentheses.rs)                                   |\n| 38  | [Daily Temperatures](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/daily_temperatures.rs)                               |\n| 39  | [Reverse Polish Notation](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/reverse_polish_notation.rs)                     |\n| 40  | [Max Min](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/max_min.rs)                                                                  |\n| 41  | [Number of Islands](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/number_of_islands_bfs.rs)                             |\n| 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)                              |\n| 43  | [Clone Graph](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/clone_graph.rs)                                             |\n| 44  | [Game Of Thrones 1](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/game_of_thrones_1.rs)                                              |\n| 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)                      |                                                                                                                                                         |\n| 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)                     |\n| 47  | [Stack with Queues](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/stack_with_queues.rs)                                 |\n| 48  | [Decode String](https://github.com/tolumide-ng/coding-challenge/blob/main/data_structures/src/queues_stacks/decode_string.rs)                                         |\n| 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)                                 |\n| 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)                                   |\n| 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)                         |\n| 52  | [Permuting Two Arrays](https://www.hackerrank.com/challenges/two-arrays/problem?utm_campaign=challenge-recommendation\u0026utm_medium=email\u0026utm_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)                          |\n| 53  | [Mark and Toys](https://www.hackerrank.com/challenges/mark-and-toys/problem?utm_campaign=challenge-recommendation\u0026utm_medium=email\u0026utm_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)                                        |\n| 54  | [Two Strings](https://www.hackerrank.com/challenges/two-strings/problem?utm_campaign=challenge-recommendation\u0026utm_medium=email\u0026utm_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)                                            |\n| 55  | [Making Anagrams](https://www.hackerrank.com/challenges/making-anagrams/problem?utm_campaign=challenge-recommendation\u0026utm_medium=email\u0026utm_source=24-hour-campaign)   | [Making Anagrams](https://github.com/tolumide-ng/coding-challenge/blob/main/others/src/the_algos/making_anagrams.js)                    |                                                                                                                                                         |\n| 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)                             |\n| 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)                       |\n| 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)       |\n| 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)                                      |\n| 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)                         |\n| 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)                        |\n| 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)                                       |\n| 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)                           |\n| 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)                 |\n| 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)                                         |\n| 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)             |\n| 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)               |\n| 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) 😂 🤓           |\n| 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)                                     |\n| 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)                               |\n| 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)                                     |\n| 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)                                 |\n| 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)                      |\n| 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)                   |\n| 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)         |\n| 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)                                      |\n| 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)                               |\n| 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)                                 |\n| 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)                                       |\n| 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)                 |\n| 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)   |\n| 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)                                 |\n| 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) |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftolumide-ng%2Fcoding-challenge","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftolumide-ng%2Fcoding-challenge","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftolumide-ng%2Fcoding-challenge/lists"}