{"id":22494538,"url":"https://github.com/ivstudio/dsa","last_synced_at":"2026-04-17T07:31:26.438Z","repository":{"id":254838440,"uuid":"815986914","full_name":"ivstudio/dsa","owner":"ivstudio","description":"This repository serves as a study and exercise guide for JavaScript data structures and algorithms (DSA).","archived":false,"fork":false,"pushed_at":"2025-03-17T15:31:17.000Z","size":2123,"stargazers_count":1,"open_issues_count":10,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-27T20:50:00.664Z","etag":null,"topics":["algorithms","data-structures","dsa","javascript","technical-interview-questions"],"latest_commit_sha":null,"homepage":"","language":"TypeScript","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/ivstudio.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":"2024-06-16T18:28:45.000Z","updated_at":"2024-12-21T16:06:08.000Z","dependencies_parsed_at":null,"dependency_job_id":"4a8e84c4-0e03-4580-90f6-611ffb1d8030","html_url":"https://github.com/ivstudio/dsa","commit_stats":null,"previous_names":["ivstudio/dsa"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ivstudio/dsa","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ivstudio%2Fdsa","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ivstudio%2Fdsa/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ivstudio%2Fdsa/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ivstudio%2Fdsa/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ivstudio","download_url":"https://codeload.github.com/ivstudio/dsa/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ivstudio%2Fdsa/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31919868,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-16T18:22:33.417Z","status":"online","status_checked_at":"2026-04-17T02:00:06.879Z","response_time":62,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["algorithms","data-structures","dsa","javascript","technical-interview-questions"],"created_at":"2024-12-06T19:14:52.463Z","updated_at":"2026-04-17T07:31:26.316Z","avatar_url":"https://github.com/ivstudio.png","language":"TypeScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# JavaScript Data Structures and Algorithms (DSA)\n\n## Description\n\nThis repository is a hands-on guide for learning data structures and algorithms (DSA). It includes TypeScript code examples, test cases, and helpful utilities to make writing and testing solutions easier and more effective.\n\n### Testing\n\nThis project uses Jest for testing each solution to ensure everything works as expected.\nTo run all tests, simply use: `npm run test`.\n\n### Table of Contents\n\n- Algorithms\n  - [Anagram](/src/algorithms/anagram)\n  - [Array Operations](/src/algorithms/arraysOperations/)\n    - [Maximum Average Subarray I](/src/algorithms/maximumAverageSubarray)\n    - [Max Consecutive Ones III](/src/algorithms/maxConsecutiveOnes/)\n    - [Merge Sorted Array](/src/algorithms/arraysOperations/mergeSortedArray/)\n    - [Minimum Value to Get Positive Step by Step Sum](/src/algorithms/minimumValueToGetPositiveStepByStepSum/)\n    - [Minimum SizeSubarray Sum](/src/algorithms/minimumSizeSubarraySum/)\n    - [Minimum Window Substring](/src/algorithms/minimumWindowSubstring/)\n    - [Remove Duplicate Objects](/src/algorithms/arraysOperations/removeDuplicateObjects/)\n    - [Remove Duplicates from Sorted Array](/src/algorithms/removeDuplicatesfromSortedArray/)\n    - [Running Sum of 1d Array](/src/algorithms/runningSumOf1dArray/)\n    - [Squares of Sorted Array](/src/algorithms/squaresOfSortedArray/)\n    - [K Radius Subarray Averages](/src/algorithms/kRadiusSubarrayAverages/)\n  - [Capitalize](/src/algorithms/capitalize/)\n  - [Fibonacci](/src/algorithms/fibonacci)\n  - [FizzBuzz](/src/algorithms/fizzBuzz/)\n  - [Longest Substring](/src/algorithms/longestSubstring)\n  - [Palindrome](/src/algorithms/palindrome)\n  - [Pangram](/src/algorithms/pangram)\n  - [Reverse String](/src/algorithms/reverseString)\n  - [Sorting](/src/algorithms/sorting/)\n  - [String Operations](/src/algorithms/stringOperations/)\n  - [Missing Number](/src/algorithms/missingNumber)\n  - [Two Sum](/src/algorithms/twoSum)\n\n- Data Structures\n  - [Binary Search Tree](/src/dataStructures/binarySearchTree/)\n  - [Linked List](/src/dataStructures/linkedList)\n    - [Add Two Numbers LL](/src/dataStructures/linkedList/addTwoNumbers/)\n    - [Merge Two Sorted LL](/src/dataStructures/linkedList//mergeTwoSortedLinkedLists/)\n  - [Queue](/src/dataStructures/queue/)\n\n- Exercises\n  - Closures\n    - [Counter](/src/exercises/closures/counter/)\n    - [Interval](/src/exercises/closures/interval/)\n  - [Promise Time Limit](/src/exercises/promiseTimeLimit)  \n\n\n### Folder Structure\n\nThis project will continue to grow and evolve. It is organized by algorithms, data structures, and exercises. Each implementation includes unit tests.\n\n\n```bash\nroot/\n│\n├── src/\n│   ├── algorithms/\n│   │   ├── sorting/\n│   │   │   ├── bubbleSort.ts\n│   │   │   ├── bubbleSort.test.js\n│   │   │   └── ...\n│   │   └── .../\n│   ├── dataStructures/\n│   │    ├── queue/\n│   │    │   ├── queue.ts\n│   │    │   ├── queue.test.js\n│   │    └── ...\n│   ├── exercises/\n│   │    ├── debouce\n│   │    │   ├── debounce.ts\n│   │    │   ├── debounce.test.js\n│   │    └── ...\n├── package.json\n└── jest.config.js\n```\n\n### Resources\n\n- [VisuAlgo](https://visualgo.net/en)\n- [Sorting Algorithms Animations](https://www.toptal.com/developers/sorting-algorithms)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fivstudio%2Fdsa","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fivstudio%2Fdsa","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fivstudio%2Fdsa/lists"}