{"id":18712384,"url":"https://github.com/codenameakshay/dsa-revision","last_synced_at":"2026-01-24T07:31:25.223Z","repository":{"id":139043617,"uuid":"420111186","full_name":"codenameakshay/dsa-revision","owner":"codenameakshay","description":null,"archived":false,"fork":false,"pushed_at":"2021-10-27T15:03:54.000Z","size":35,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2024-12-28T08:27:41.949Z","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/codenameakshay.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-22T13:34:20.000Z","updated_at":"2021-10-27T15:03:57.000Z","dependencies_parsed_at":null,"dependency_job_id":"b034149e-2ac2-47f9-aeba-379bab1bd86d","html_url":"https://github.com/codenameakshay/dsa-revision","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/codenameakshay%2Fdsa-revision","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codenameakshay%2Fdsa-revision/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codenameakshay%2Fdsa-revision/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codenameakshay%2Fdsa-revision/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/codenameakshay","download_url":"https://codeload.github.com/codenameakshay/dsa-revision/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239576798,"owners_count":19662113,"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-11-07T12:42:38.220Z","updated_at":"2025-11-09T19:30:18.663Z","avatar_url":"https://github.com/codenameakshay.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# DSA Progress\r\n\r\n## Data Structures\r\n### 1. Arrays\r\n| Problem                |Difiiculty| Link           | Solved | Solution Accepted |\r\n| ---------------------- |:-------------:|:-------------:|:-------------:|:-------------:|\r\n| Non-decreasing arrays  |🟢| [🔗](https://www.hackerearth.com/practice/data-structures/arrays/1-d/practice-problems/algorithm/make-it-non-decreasing-7d3391fd/) |✔️|🟠|\r\n| Build Array from Permutation  |🟢| [🔗](https://leetcode.com/problems/build-array-from-permutation/) |✔️|🟢|\r\n| Two Sum  |🟢| [🔗](https://leetcode.com/problems/two-sum/) |✔️|🟢|\r\n| Remove Duplicates from Sorted Array  |🟢| [🔗](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) |✔️|🟢|\r\n| Maximize the sum  |🟢| [🔗](https://www.hackerearth.com/practice/data-structures/arrays/1-d/practice-problems/algorithm/maximize-sum-0423b95e/) |✔️|🟢|\r\n| Remove Element  |🟢| [🔗](https://leetcode.com/problems/remove-element/) |✔️|🟢|\r\n| Maximum Subarray (Kadane Algo) |🟢| [🔗](https://leetcode.com/problems/maximum-subarray/) |✔️|🟢|\r\n| Transpose Matrix  |🟢| [🔗](https://www.hackerearth.com/practice/data-structures/arrays/multi-dimensional/tutorial/) |✔️|🟢|\r\n| Degree of an Array |🟢| [🔗](https://leetcode.com/problems/degree-of-an-array/) |✔️|🟢|\r\n| Contains Duplicate |🟢| [🔗](https://leetcode.com/problems/contains-duplicate/) |✔️|🟢|\r\n| Monk and Inversions |🟢| [🔗](https://www.hackerearth.com/practice/codemonk/) |✔️|🟢|\r\n| Merge Sorted Array |🟢| [🔗](https://leetcode.com/problems/merge-sorted-array/) |✔️|🟢|\r\n| Intersection of Two Arrays |🟢| [🔗](https://leetcode.com/problems/intersection-of-two-arrays/) |✔️|🟢|\r\n| Intersection of Two Arrays II |🟢| [🔗](https://leetcode.com/problems/intersection-of-two-arrays-ii/) |✔️|🟢|\r\n| Best Time to Buy and Sell Stock |🟢| [🔗](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) |✔️|🟢|\r\n\r\n### 2. Strings\r\n| Problem                |Difiiculty| Link           | Solved | Solution Accepted |\r\n| ---------------------- |:-------------:|:-------------:|:-------------:|:-------------:|\r\n| Sort the Substring  |🟢| [🔗](https://www.hackerearth.com/practice/algorithms/string-algorithm/basics-of-string-manipulation/tutorial/) |✔️|🟢|\r\n| Bracket sequences  |🟢| [🔗](https://www.hackerearth.com/practice/data-structures/arrays/1-d/practice-problems/algorithm/bracket-sequence-1-40eab940/) |✔️|🟠|\r\n| Final Value of Variable After Performing Operations  |🟢| [🔗](https://leetcode.com/problems/final-value-of-variable-after-performing-operations/) |✔️|🟢|\r\n\r\n## Algorithms\r\n### 1. Binary Search\r\n| Problem                |Difiiculty| Link           | Solved | Solution Accepted |\r\n| ---------------------- |:-------------:|:-------------:|:-------------:|:-------------:|\r\n| Binary Search  |🟢| [🔗](https://leetcode.com/problems/binary-search/) |✔️|🟢|\r\n| First Bad Version  |🟢| [🔗](https://leetcode.com/problems/first-bad-version/) |✔️|🟢|\r\n| Search Insert Position  |🟢| [🔗](https://leetcode.com/problems/search-insert-position/) |✔️|🟢|\r\n\r\n## Dynamic Programming\r\n| Problem                |Difiiculty| Link           | Solved | Solution Accepted |\r\n| ---------------------- |:-------------:|:-------------:|:-------------:|:-------------:|\r\n| Fibonacci Number  |🟢| [🔗](https://leetcode.com/problems/fibonacci-number/) |✔️|🟢|\r\n| Climbing Stairs  |🟢| [🔗](https://leetcode.com/problems/climbing-stairs/) |✔️|🟢|\r\n| N-th Tribonacci Number  |🟢| [🔗](https://leetcode.com/problems/n-th-tribonacci-number/) |✔️|🟢|\r\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcodenameakshay%2Fdsa-revision","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcodenameakshay%2Fdsa-revision","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcodenameakshay%2Fdsa-revision/lists"}