{"id":49953662,"url":"https://github.com/2giosangmitom/dsa-roadmap","last_synced_at":"2026-05-17T21:19:38.161Z","repository":{"id":272388630,"uuid":"915972147","full_name":"2giosangmitom/dsa-roadmap","owner":"2giosangmitom","description":"🍜 Learn DSA with LeetCode","archived":false,"fork":false,"pushed_at":"2026-04-28T14:21:14.000Z","size":1018,"stargazers_count":6,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2026-04-28T15:33:56.689Z","etag":null,"topics":["dsa","leetcode"],"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/2giosangmitom.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2025-01-13T07:59:35.000Z","updated_at":"2026-04-28T14:37:40.000Z","dependencies_parsed_at":"2025-01-14T05:35:44.569Z","dependency_job_id":"0f7cdb63-0e5f-4bda-8ed4-bd516279aa61","html_url":"https://github.com/2giosangmitom/dsa-roadmap","commit_stats":null,"previous_names":["2giosangmitom/practice","2giosangmitom/leetcode-patterns","2giosangmitom/dsa-roadmap"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/2giosangmitom/dsa-roadmap","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/2giosangmitom%2Fdsa-roadmap","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/2giosangmitom%2Fdsa-roadmap/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/2giosangmitom%2Fdsa-roadmap/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/2giosangmitom%2Fdsa-roadmap/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/2giosangmitom","download_url":"https://codeload.github.com/2giosangmitom/dsa-roadmap/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/2giosangmitom%2Fdsa-roadmap/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33155545,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-17T09:28:26.183Z","status":"ssl_error","status_checked_at":"2026-05-17T09:27:52.702Z","response_time":107,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"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":["dsa","leetcode"],"created_at":"2026-05-17T21:19:37.532Z","updated_at":"2026-05-17T21:19:38.153Z","avatar_url":"https://github.com/2giosangmitom.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# DSA Roadmap\n\nHello, welcome to this DSA Roadmap. This is my personal DSA roadmap with LeetCode.\n\n## πŸ—ΊοΈ The Roadmap\n\n```mermaid\n---\ntitle: DSA Roadmap\n---\nflowchart TD\n %% Basic Foundations\n A[Two Pointers] --\u003e B[Hash Maps and Sets]\n A --\u003e C[Linked Lists]\n B --\u003e E[Binary Search]\n B --\u003e F[Sliding Window]\n B --\u003e G[Prefix Sums]\n\n %% Intermediate Concepts\n C --\u003e D[Fast and Slow Pointers]\n C --\u003e J[Stacks and Queues]\n J --\u003e R[Heaps]\n\n %% Advanced Data Structures\n R --\u003e T[Trees]\n R --\u003e W[Intervals]\n R --\u003e Q[Sort]\n T --\u003e U[Tries]\n T --\u003e X[Graphs]\n X --\u003e Y[Backtracking]\n\n %% Problem-Solving Techniques\n Y --\u003e K[Dynamic Programming]\n K --\u003e O[Bit Manipulation]\n K --\u003e V[Greedy]\n K --\u003e M[Math]\n\n %% Additional Paths\n W --\u003e Q\n Q --\u003e E\n```\n\n## πŸš€ Let's Go\n\n\u003e [!NOTE]\n\u003e All solutions in this repository are written in **Rust**. If you're not familiar with Rust, I highly recommend learning the basic syntax and core concepts before diving into the problems. You can find a great resource for learning Rust [here](https://doc.rust-lang.org/book/).\n\n### Two Pointers\n\n| Link | Solutions | Difficulty |\n| --------------------------------------------------------------------------------------------------------------- | ------------------------------------------------------------------- | ---------- |\n| [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) | [Rust](./src/two_pointers/valid_palindrome.rs) | Easy |\n| [Remove Element](https://leetcode.com/problems/remove-element/) | [Rust](./src/two_pointers/remove_element.rs) | Easy |\n| [Is Subsequence](https://leetcode.com/problems/is-subsequence) | [Rust](./src/two_pointers/is_subsequence.rs) | Easy |\n| [Reverse String](https://leetcode.com/problems/reverse-string/) | [Rust](./src/two_pointers/reverse_string.rs) | Easy |\n| [Merge Two 2D Arrays by Summing Values](https://leetcode.com/problems/merge-two-2d-arrays-by-summing-values/) | [Rust](./src/two_pointers/merge_two_2d_arrays_by_summing_values.rs) | Easy |\n| [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) | [Rust](./src/two_pointers/merge_sorted_arrays.rs) | Easy |\n| [Move Zeroes](https://leetcode.com/problems/move-zeroes) | [Rust](./src/two_pointers/move_zeros.rs) | Easy |\n| [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | TODO | Easy |\n| [Container With Most Water](https://leetcode.com/problems/container-with-most-water/) | [Rust](./src/two_pointers/container_with_most_water.rs) | Medium |\n| [Two Sum II - Input Array Is Sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) | [Rust](./src/two_pointers/two_sum.rs) | Medium |\n| [3Sum](https://leetcode.com/problems/3sum/) | TODO | Medium |\n| [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | TODO | Medium |\n| [Next Permutation](https://leetcode.com/problems/next-permutation/) | TODO | Medium |\n| [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/) | TODO | Medium |\n| [Rotate Array](https://leetcode.com/problems/rotate-array) | TODO | Medium |\n| [4Sum](https://leetcode.com/problems/4sum) | TODO | Medium |\n\n### Linked Lists\n\n| Link | Solutions | Difficulty |\n| ----------------------------------------------------------------------------------------------------------------- | ------------------------------------------------ | ---------- |\n| [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list) | [Rust](./src/linked_list/reverse_linked_list.rs) | Easy |\n| [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements) | TODO | Easy |\n| [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/) | TODO | Easy |\n| [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) | TODO | Easy |\n| [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) | TODO | Easy |\n| [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | [Rust](./src/linked_list/add_two_numbers.rs) | Medium |\n| [Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii) | TODO | Medium |\n| [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii) | TODO | Medium |\n| [Rotate List](https://leetcode.com/problems/rotate-list) | TODO | Medium |\n| [Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/) | TODO | Medium |\n| [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | TODO | Medium |\n| [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs) | TODO | Medium |\n| [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list) | TODO | Medium |\n\n### Hash Maps and Hash Sets\n\n| Link | Solutions | Difficulty |\n| ------------------------------------------------------------------------------------------------------------- | --------------------------------- | ---------- |\n| [Two Sum](https://leetcode.com/problems/two-sum/) | [Rust](./src/hash_map/two_sum.rs) | Easy |\n| [Find Missing and Repeated Values](https://leetcode.com/problems/find-missing-and-repeated-values/) | TODO | Easy |\n| [Merge Two 2D Arrays by Summing Values](https://leetcode.com/problems/merge-two-2d-arrays-by-summing-values/) | TODO | Easy |\n| [Number of Good Pairs](https://leetcode.com/problems/number-of-good-pairs/) | TODO | Easy |\n| [Roman to Integer](https://leetcode.com/problems/roman-to-integer/) | TODO | Easy |\n| [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/) | TODO | Easy |\n| [LRU Cache](https://leetcode.com/problems/lru-cache/) | TODO | Medium |\n| [Valid Sudoku](https://leetcode.com/problems/valid-sudoku/) | TODO | Medium |\n| [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) | TODO | Medium |\n| [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) | TODO | Medium |\n\n### Sliding Window\n\n| Link | Solutions | Difficulty |\n| ------------------------------------------------------------------------------------------------------------------------------------------- | ------------------------------------------------------------------------------ | ---------- |\n| [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | [Rust](./src/sliding_window/longest_substring_without_repeating_characters.rs) | Medium |\n| [Number of Substrings Containing All Three Characters](https://leetcode.com/problems/number-of-substrings-containing-all-three-characters/) | TODO | Medium |\n| [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/) | TODO | Medium |\n\n### Binary Search\n\n| Link | Solutions | Difficulty |\n| ------------------------------------------------------------------------------------------------------------------------------------------------- | --------- | ---------- |\n| [Binary Search](https://leetcode.com/problems/binary-search/) | TODO | Easy |\n| [Maximum Count of Positive Integer and Negative Integer](https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer/) | TODO | Easy |\n| [Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/) | TODO | Medium |\n| [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | TODO | Medium |\n| [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/) | TODO | Medium |\n| [Find Peak Element](https://leetcode.com/problems/find-peak-element/) | TODO | Medium |\n| [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight/) | TODO | Medium |\n| [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | TODO | Hard |\n| [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence) | TODO | Medium |\n\n### Math\n\n| Link | Solutions | Difficulty |\n| ---------------------------------------------------------------------------------------------------------------------------------------------------------------------- | ------------------------- | ---------- |\n| [Stone Removal Game](https://leetcode.com/problems/stone-removal-game/) | TODO | Easy |\n| [Water Bottles](https://leetcode.com/problems/water-bottles/) | TODO | Easy |\n| [Add Digits](https://leetcode.com/problems/add-digits/) | TODO | Easy |\n| [Palindrome Number](https://leetcode.com/problems/palindrome-number/) | TODO | Easy |\n| [Largest Number At Least Twice of Others](https://leetcode.com/problems/largest-number-at-least-twice-of-others/) | TODO | Easy |\n| [Check if Number is a Sum of Powers of Three](https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/) | TODO | Medium |\n| [Reverse Integer](https://leetcode.com/problems/reverse-integer/) | TODO | Medium |\n| [Pow(x, n)](https://leetcode.com/problems/powx-n/) | [Rust](./src/math/pow.rs) | Medium |\n| [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/) | TODO | Medium |\n| [Rotate Image](https://leetcode.com/problems/rotate-image) | TODO | Medium |\n| [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/) | TODO | Medium |\n| [Zigzag Conversion](https://leetcode.com/problems/zigzag-conversion) | TODO | Medium |\n| [Lexicographically Smallest Negated Permutation that Sums to Target](https://leetcode.com/problems/lexicographically-smallest-negated-permutation-that-sums-to-target) | TODO | Medium |\n| [Three Divisors](https://leetcode.com/problems/three-divisors) | TODO | Easy |\n| [Ugly Number](https://leetcode.com/problems/ugly-number) | TODO | Easy |\n| [Count Primes](https://leetcode.com/problems/count-primes/) | TODO | Medium |\n| [Closest Prime Numbers in Range](https://leetcode.com/problems/closest-prime-numbers-in-range/) | TODO | Medium |\n\n### Stacks and Queues\n\n| Link | Solutions | Difficulty |\n| ------------------------------------------------------------------------------------------------------------------- | ------------------------------------------------------------------------- | ---------- |\n| [Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/) | [Rust](./src/stack_and_queue/remove_all_adjacent_duplicates_in_string.rs) | Easy |\n| [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | TODO | Easy |\n| [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/) | TODO | Easy |\n| [Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii/) | TODO | Medium |\n| [Decode String](https://leetcode.com/problems/decode-string) | TODO | Medium |\n| [Basic Calculator](https://leetcode.com/problems/basic-calculator/) | TODO | Hard |\n| [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | TODO | Hard |\n\n### Heaps\n\n| Link | Solutions | Difficulty |\n| ------------------------------------------------------------------------------------------------- | --------- | ---------- |\n| [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) | TODO | Medium |\n| [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/) | TODO | Medium |\n| [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | TODO | Medium |\n| [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | TODO | Hard |\n| [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/) | TODO | Hard |\n\n### Intervals\n\n| Link | Solutions | Difficulty |\n| ----------------------------------------------------------------------------------------- | --------- | ---------- |\n| [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | TODO | Medium |\n| [Interval List Intersections](https://leetcode.com/problems/interval-list-intersections/) | TODO | Medium |\n\n### Prefix Sum\n\n| Link | Solutions | Difficulty |\n| ---------------------------------------------------------------------------------------------- | ----------------------------------------------------- | ---------- |\n| [Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/) | [Rust](./src/prefix_sum/range_sum_query_immutable.rs) | Easy |\n| [Find the Middle Index in Array](https://leetcode.com/problems/find-the-middle-index-in-array) | TODO | Easy |\n| [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | TODO | Medium |\n| [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) | TODO | Medium |\n| [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/) | TODO | Medium |\n\n### Trees\n\n| Link | Solutions | Difficulty |\n| ---------------------------------------------------------------------------------------------------------------------------------------------------- | --------- | ---------- |\n| [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal) | TODO | Easy |\n| [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal) | TODO | Easy |\n| [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal) | TODO | Easy |\n| [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree) | TODO | Easy |\n| [Symmetric Tree](https://leetcode.com/problems/symmetric-tree) | TODO | Easy |\n| [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | TODO | Easy |\n| [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree) | TODO | Easy |\n| [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) | TODO | Easy |\n| [Path Sum](https://leetcode.com/problems/path-sum) | TODO | Easy |\n| [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree) | TODO | Easy |\n| [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/) | TODO | Medium |\n| [Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree/) | TODO | Medium |\n| [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) | TODO | Medium |\n| [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst) | TODO | Medium |\n| [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree) | TODO | Medium |\n| [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | TODO | Medium |\n| [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum) | TODO | Hard |\n| [Vertical Order Traversal of a Binary Tree](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree) | TODO | Hard |\n| [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree) | TODO | Hard |\n\n### Tries\n\n| Link | Solutions | Difficulty |\n| ---------------------------------------------------------------------------------------------------------------------- | --------- | ---------- |\n| [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | TODO | Easy |\n| [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree) | TODO | Medium |\n| [Design Add and Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure) | TODO | Medium |\n| [Word Search](https://leetcode.com/problems/word-search) | TODO | Medium |\n| [Partition String](https://leetcode.com/problems/partition-string) | TODO | Medium |\n| [Word Search II](https://leetcode.com/problems/word-search-ii) | TODO | Hard |\n\n### Backtracking\n\n| Link | Solutions | Difficulty |\n| ------------------------------------------------------------------------------------------------------------ | ------------------------------------------ | ---------- |\n| [Permutations](https://leetcode.com/problems/permutations/) | [Rust](./src/backtracking/permutations.rs) | Medium |\n| [Permutations II](https://leetcode.com/problems/permutations-ii/) | TODO | Medium |\n| [Combinations](https://leetcode.com/problems/combinations/) | TODO | Medium |\n| [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | TODO | Medium |\n| [Subsets](https://leetcode.com/problems/subsets/) | TODO | Medium |\n| [Subsets II](https://leetcode.com/problems/subsets-ii) | TODO | Medium |\n| [Combination Sum](https://leetcode.com/problems/combination-sum) | TODO | Medium |\n| [Combination Sum II](https://leetcode.com/problems/combination-sum-ii) | TODO | Medium |\n| [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence) | TODO | Medium |\n| [N-Queens](https://leetcode.com/problems/n-queens) | TODO | Hard |\n| [N-Queens II](https://leetcode.com/problems/n-queens-ii) | TODO | Hard |\n| [Sudoku Solver](https://leetcode.com/problems/sudoku-solver) | TODO | Hard |\n\n### Sorting\n\n| Link | Solutions | Difficulty |\n| ------------------------------------------------------------------------ | -------------------------------------- | ---------- |\n| [Sort an Array](https://leetcode.com/problems/sort-an-array/) | [Rust](./src/sorting/sort_an_array.rs) | Medium |\n| [Insertion Sort List](https://leetcode.com/problems/insertion-sort-list) | TODO | Medium |\n| [Sort List](https://leetcode.com/problems/sort-list) | TODO | Medium |\n| [Sort Colors](https://leetcode.com/problems/sort-colors) | TODO | Medium |\n\n### Dynamic Programming\n\n| Link | Solutions | Difficulty |\n| ---------------------------------------------------------------------------------- | ------------------------------------------------------ | ---------- |\n| [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle) | [Rust](./src/dynamic_programming/pascal_triangle.rs) | Easy |\n| [Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii) | [Rust](./src/dynamic_programming/pascal_triangle_2.rs) | Easy |\n| [Fibonacci Number](https://leetcode.com/problems/fibonacci-number) | TODO | Easy |\n| [Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | [Rust](./src/dynamic_programming/climbing_stairs.rs) | Easy |\n| [Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs) | TODO | Easy |\n| [Coin Change](https://leetcode.com/problems/coin-change) | TODO | Medium |\n| [Minimum Cost For Tickets](https://leetcode.com/problems/minimum-cost-for-tickets) | TODO | Medium |\n| [Unique Paths](https://leetcode.com/problems/unique-paths) | TODO | Medium |\n| [Unique Paths II](https://leetcode.com/problems/unique-paths-ii) | TODO | Medium |\n| [Maximal Square](https://leetcode.com/problems/maximal-square) | TODO | Medium |\n| [House Robber](https://leetcode.com/problems/house-robber) | TODO | Medium |\n| [Target Sum](https://leetcode.com/problems/target-sum) | TODO | Medium |\n| [Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | TODO | Medium |\n| [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum) | TODO | Medium |\n| [Coin Change II](https://leetcode.com/problems/coin-change-ii) | TODO | Medium |\n\n### Greedy\n\n| Link | Solutions | Difficulty |\n| ---------------------------------------------------------------------------------------------------------------- | --------- | ---------- |\n| [Maximize Sum Of Array After K Negations](https://leetcode.com/problems/maximize-sum-of-array-after-k-negations) | TODO | Easy |\n| [Can Place Flowers](https://leetcode.com/problems/can-place-flowers) | TODO | Easy |\n| [Jump Game](https://leetcode.com/problems/jump-game) | TODO | Medium |\n| [Gas Station](https://leetcode.com/problems/gas-station) | TODO | Medium |\n| [Candy](https://leetcode.com/problems/candy) | TODO | Hard |\n\n### Bit Manipulation\n\n| Link | Solutions | Difficulty |\n| ---------------------------------------------------------------------------------------- | -------------------------------------------------- | ---------- |\n| [Number of Even and Odd Bits](https://leetcode.com/problems/number-of-even-and-odd-bits) | TODO | Easy |\n| [Power of Two](https://leetcode.com/problems/power-of-two/) | [Rust](./src/bit_manipulation/power_of_two.rs) | Easy |\n| [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) | [Rust](./src/bit_manipulation/number_of_1_bits.rs) | Easy |\n| [Reverse Bits](https://leetcode.com/problems/reverse-bits/) | TODO | Easy |\n| [Hamming Distance](https://leetcode.com/problems/hamming-distance/) | TODO | Easy |\n\n### Graph\n\n| Link | Solutions | Difficulty |\n| ------------------------------------------------------------------------------------------ | --------------------------------- | ---------- |\n| [Find if Path Exists in Graph](https://leetcode.com/problems/find-if-path-exists-in-graph) | TODO | Easy |\n| [Find Center of Star Graph](https://leetcode.com/problems/find-center-of-star-graph) | TODO | Easy |\n| [Flood Fill](https://leetcode.com/problems/flood-fill/) | [Rust](./src/graph/flood_fill.rs) | Easy |\n| [Clone Graph](https://leetcode.com/problems/clone-graph) | TODO | Medium |\n| [Number of Islands](https://leetcode.com/problems/number-of-islands) | TODO | Medium |\n| [Rotting Oranges](https://leetcode.com/problems/rotting-oranges) | TODO | Medium |\n| [Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite/) | TODO | Medium |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2F2giosangmitom%2Fdsa-roadmap","html_url":"https://awesome.ecosyste.ms/projects/github.com%2F2giosangmitom%2Fdsa-roadmap","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2F2giosangmitom%2Fdsa-roadmap/lists"}