{"id":17018432,"url":"https://github.com/liquidatorcoder/dsa-practice","last_synced_at":"2026-01-05T04:51:27.948Z","repository":{"id":124470971,"uuid":"419687026","full_name":"LiquidatorCoder/dsa-practice","owner":"LiquidatorCoder","description":null,"archived":false,"fork":false,"pushed_at":"2021-12-30T12:45:31.000Z","size":76,"stargazers_count":0,"open_issues_count":1,"forks_count":1,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-01-27T16:47:49.250Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":null,"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/LiquidatorCoder.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}},"created_at":"2021-10-21T11:01:01.000Z","updated_at":"2021-12-30T12:45:33.000Z","dependencies_parsed_at":null,"dependency_job_id":"69c07090-ac29-4945-bc26-14f7fd154f7f","html_url":"https://github.com/LiquidatorCoder/dsa-practice","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/LiquidatorCoder%2Fdsa-practice","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LiquidatorCoder%2Fdsa-practice/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LiquidatorCoder%2Fdsa-practice/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LiquidatorCoder%2Fdsa-practice/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/LiquidatorCoder","download_url":"https://codeload.github.com/LiquidatorCoder/dsa-practice/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244982060,"owners_count":20542300,"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":[],"created_at":"2024-10-14T06:45:51.545Z","updated_at":"2026-01-05T04:51:27.912Z","avatar_url":"https://github.com/LiquidatorCoder.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# DSA\n\n## Data Structures\n### 1. Arrays\n| Problem                |Difiiculty| Link           | Solved |\n| ---------------------- |:-------------:|:-------------:|:-------------:|\n| Non-decreasing arrays  |🟢| [🔗](https://www.hackerearth.com/practice/data-structures/arrays/1-d/practice-problems/algorithm/make-it-non-decreasing-7d3391fd/) |✔️|\n| Build Array from Permutation  |🟢| [🔗](https://leetcode.com/problems/build-array-from-permutation/) |✔️|\n| Two Sum  |🟢| [🔗](https://leetcode.com/problems/two-sum/) |✔️|\n| Remove Duplicates from Sorted Array  |🟢| [🔗](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) |✔️|\n| Maximize the sum  |🟢| [🔗](https://www.hackerearth.com/practice/data-structures/arrays/1-d/practice-problems/algorithm/maximize-sum-0423b95e/) |✔️|\n| Remove Element  |🟢| [🔗](https://leetcode.com/problems/remove-element/) |✔️|\n| Maximum Subarray  |🟢| [🔗](https://leetcode.com/problems/maximum-subarray/) |✔️|\n| Transpose Matrix  |🟢| [🔗](https://www.hackerearth.com/practice/data-structures/arrays/multi-dimensional/tutorial/) |✔️|\n| Degree of an Array |🟢| [🔗](https://leetcode.com/problems/degree-of-an-array/) |✔️|\n| Monk and Inversions |🟢| [🔗](https://www.hackerearth.com/practice/codemonk/) |⛔|\n| Contains Duplicate |🟢| [🔗](https://leetcode.com/problems/contains-duplicate) |✔️|\n| Merge Sorted Array |🟢| [🔗](https://leetcode.com/problems/merge-sorted-array/) |✔️|\n| Intersection of Two Arrays |🟢| [🔗](https://leetcode.com/problems/intersection-of-two-arrays/) |✔️|\n| Intersection of Two Arrays II |🟢| [🔗](https://leetcode.com/problems/intersection-of-two-arrays-ii/) |✔️|\n| Best Time to Buy and Sell Stock |🟢| [🔗](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) |✔️|\n| Convert 1D Array Into 2D Array |🟢| [🔗](https://leetcode.com/problems/convert-1d-array-into-2d-array/) |✔️|\n| Reshape the Matrix |🟢| [🔗](https://leetcode.com/problems/reshape-the-matrix/) |✔️|\n| Subsets |🟠| [🔗](https://leetcode.com/problems/subsets/) |✔️|\n\n\n### 2. Strings\n| Problem                |Difiiculty| Link           | Solved |\n| ---------------------- |:-------------:|:-------------:|:-------------:|\n| Sort the Substring  |🟢| [🔗](https://www.hackerearth.com/practice/algorithms/string-algorithm/basics-of-string-manipulation/tutorial/) |✔️|\n| Bracket sequences  |🟢| [🔗](https://www.hackerearth.com/practice/data-structures/arrays/1-d/practice-problems/algorithm/bracket-sequence-1-40eab940/) |⛔|\n| Final Value of Variable After Performing Operations  |🟢| [🔗](https://leetcode.com/problems/final-value-of-variable-after-performing-operations/) |✔️|\n| Valid Parentheses  |🟢| [🔗](https://leetcode.com/problems/valid-parentheses/) |✔️|\n| Reverse Words in a String III  |🟢| [🔗](https://leetcode.com/problems/reverse-words-in-a-string-iii/) |✔️|\n\n### 3. Linked List\n| Problem                |Difiiculty| Link           | Solved |\n| ---------------------- |:-------------:|:-------------:|:-------------:|\n| Convert Binary Number in a Linked List to Integer  |🟢| [🔗](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/) |✔️|\n| Middle of the Linked List  |🟢| [🔗](https://leetcode.com/problems/middle-of-the-linked-list/) |✔️|\n| Delete the Middle Node of a Linked List  |🟠| [🔗](https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/) |✔️|\n| Swap Nodes in Pairs  |🟠| [🔗](https://leetcode.com/problems/swap-nodes-in-pairs/) |✔️|\n| Remove Nth Node From End of List  |🟠| [🔗](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) |✔️|\n| Remove Duplicates from Sorted List  |🟢| [🔗](https://leetcode.com/problems/remove-duplicates-from-sorted-list/) |✔️|\n\n### 4. Tree\n| Problem                |Difiiculty| Link           | Solved |\n| ---------------------- |:-------------:|:-------------:|:-------------:|\n| Binary Tree Inorder Traversal  |🟢| [🔗](https://leetcode.com/problems/binary-tree-inorder-traversal/) |✔️|\n| Binary Tree Preorder Traversal  |🟢| [🔗](https://leetcode.com/problems/binary-tree-preorder-traversal/) |✔️|\n| Binary Tree Postorder Traversal  |🟢| [🔗](https://leetcode.com/problems/binary-tree-postorder-traversal/) |✔️|\n| Two Sum IV - Input is a BST  |🟢| [🔗](https://leetcode.com/problems/two-sum-iv-input-is-a-bst/) |✔️|\n\n## Algos\n### 1. Binary Search\n| Problem                |Difiiculty| Link           | Solved |\n| ---------------------- |:-------------:|:-------------:|:-------------:|\n| Binary Search |🟢| [🔗](https://leetcode.com/problems/binary-search/) |✔️|\n| First Bad Version |🟢| [🔗](https://leetcode.com/problems/first-bad-version/) |✔️|\n| Search Insert Position  |🟢| [🔗](https://leetcode.com/problems/search-insert-position/) |✔️|\n\n### 2. Two Pointers\n| Problem                |Difiiculty| Link           | Solved |\n| ---------------------- |:-------------:|:-------------:|:-------------:|\n| Squares of a Sorted Array |🟢| [🔗](https://leetcode.com/problems/squares-of-a-sorted-array/) |✔️|\n| Rotate Array |🟠| [🔗](https://leetcode.com/problems/rotate-array/) |✔️|\n| Move Zeroes |🟢| [🔗](https://leetcode.com/problems/move-zeroes/) |✔️|\n| Two Sum II |🟢| [🔗](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) |✔️|\n| Reverse String |🟢| [🔗](https://leetcode.com/problems/reverse-string/) |✔️|\n| Remove Nth Node From End of List  |🟠| [🔗](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) |✔️|\n\n### 3. Recursion/Backtracking\n| Problem                |Difiiculty| Link           | Solved |\n| ---------------------- |:-------------:|:-------------:|:-------------:|\n| Subsets |🟠| [🔗](https://leetcode.com/problems/subsets/) |✔️|\n| Letter Case Permutation |🟠| [🔗](https://leetcode.com/problems/letter-case-permutation/) |✔️|\n\n### 4. Dynamic Programming\n| Problem                |Difiiculty| Link           | Solved |\n| ---------------------- |:-------------:|:-------------:|:-------------:|\n| Fibonacci Number |🟢| [🔗](https://leetcode.com/problems/fibonacci-number/) |✔️|\n| Climbing Stairs |🟢| [🔗](https://leetcode.com/problems/climbing-stairs/) |✔️|\n| N-th Tribonacci Number |🟢| [🔗](https://leetcode.com/problems/n-th-tribonacci-number/) |✔️|\n\n### 5. Bit manipulation\n| Problem                |Difiiculty| Link           | Solved |\n| ---------------------- |:-------------:|:-------------:|:-------------:|\n| Subsets |🟠| [🔗](https://leetcode.com/problems/subsets/) |✔️|\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fliquidatorcoder%2Fdsa-practice","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fliquidatorcoder%2Fdsa-practice","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fliquidatorcoder%2Fdsa-practice/lists"}