{"id":18325140,"url":"https://github.com/edignot/algorithm-data-structure-practice","last_synced_at":"2025-04-09T15:22:03.942Z","repository":{"id":67744605,"uuid":"305022270","full_name":"edignot/algorithm-data-structure-practice","owner":"edignot","description":"🧠 My solutions to popular LeetCode, HackerRank, and other problems. Each solution has a unit test file. The goal of this project is to learn/practice algorithms, data structures, time and space complexity","archived":false,"fork":false,"pushed_at":"2020-12-08T00:56:34.000Z","size":216,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-15T09:16:46.660Z","etag":null,"topics":["algorithms","algorithms-and-data-structures","data-structures","javascript"],"latest_commit_sha":null,"homepage":"https://github.com/edignot/algorithm-data-structure-practice","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/edignot.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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":"2020-10-18T04:32:02.000Z","updated_at":"2020-12-08T00:56:37.000Z","dependencies_parsed_at":"2023-03-18T06:00:32.903Z","dependency_job_id":null,"html_url":"https://github.com/edignot/algorithm-data-structure-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/edignot%2Falgorithm-data-structure-practice","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/edignot%2Falgorithm-data-structure-practice/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/edignot%2Falgorithm-data-structure-practice/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/edignot%2Falgorithm-data-structure-practice/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/edignot","download_url":"https://codeload.github.com/edignot/algorithm-data-structure-practice/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248055624,"owners_count":21040230,"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","algorithms-and-data-structures","data-structures","javascript"],"created_at":"2024-11-05T18:36:54.736Z","updated_at":"2025-04-09T15:22:03.902Z","avatar_url":"https://github.com/edignot.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Algorithms Practice\n\nEach problem directory includes:\n-   Problem description with the link to original problem ( LeetCode, HackerRank, CodeWars... )\n-   One ore more working solution to the problem\n-   Unit test file\n\nThere might still be some personal comments added for my learning purposes. \n\n## Algorithms:\n\n- **Math**\n    * Fibonacci Sequence\n[`Solution`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/fibonacci-sequence/fibonacci-sequence.js) \n[`Test file`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/fibonacci-sequence/fibonacci-sequence.test.js)\n    * Factorial\n[`Solution`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/factorial/factorial.js) \n[`Test file`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/factorial/factorial.test.js)\n    * Min Number\n[`Solution`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/min-number/min-number.js) \n[`Test file`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/min-number/min-number.test.js)\n    * Prime Number\n[`Solution`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/pirmal-numbers/primal-numbers.js) \n[`Test file`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/pirmal-numbers/primal-number.test.js)\n    * Power of 2\n[`Solution`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/power-of-two/power-of-two.js) \n[`Test file`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/power-of-two/power-of-two.test.js)\n\n- **Sorting**\n    * Merge Sort \n[`Solution`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/sorting/sorting.js) \n[`Test file`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/sorting/sorting.test.js)\n    * Quick Sort\n[`Solution`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/sorting/sorting.js) \n[`Test file`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/sorting/sorting.test.js)\n    * Bubble Sort \n[`Solution`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/sorting/sorting.js) \n[`Test file`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/sorting/sorting.test.js)\n\n- **LeetCode**\n    * Valid Parentheses\n[`Solution`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/valid-parentheses/valid-parentheses.js) \n[`Test file`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/valid-parentheses/valid-parentheses.test.js)\n    * Integer to Roman\n[`Solution`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/integer-to-roman/integer-to-roman.js) \n[`Test file`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/integer-to-roman/integer-to-roman.test.js)\n\n- **All**\n    * Robot Return to Origin\n[`Solution`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/robot/robot.js) \n[`Test file`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/robot/robot.test.js)\n    * Snail\n[`Solution`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/snail/snail.js) \n[`Test file`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/snail/snail.test.js)\n    * Knapsack \n[`Solution`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/kanpsack/knapsack.js) \n[`Test file`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/kanpsack/knapsack.test.js)\n    * Tree relation\n[`Solution`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/recursion-tree/recursion-tree.js) \n[`Test file`](https://github.com/edignot/algorithm-data-structure-practice/blob/master/src/recursion-tree/recursion-tree.test.js)\n\n\n## Usage\n-   Clone this repo\n-   Run npm install to get dependencies\n-   Run npm test to run testing files\n\n## Contributors\n[Edita Ignot](https://github.com/edignot) | [MY COMMITS](https://github.com/edignot/algorithms/commits/master?author=edignot\u0026branch=master)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fedignot%2Falgorithm-data-structure-practice","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fedignot%2Falgorithm-data-structure-practice","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fedignot%2Falgorithm-data-structure-practice/lists"}