{"id":23064343,"url":"https://github.com/hiejulia/project-euler","last_synced_at":"2026-05-08T14:08:42.223Z","repository":{"id":104757281,"uuid":"85464135","full_name":"hiejulia/Project-Euler","owner":"hiejulia","description":"Data structure \u0026 Algorithms ","archived":false,"fork":false,"pushed_at":"2019-10-11T09:00:07.000Z","size":78,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-07-28T23:45:53.221Z","etag":null,"topics":["algorithms","bigo","datastructures","euler-solutions","java","javascript","python"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","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/hiejulia.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":"2017-03-19T09:22:05.000Z","updated_at":"2020-06-03T15:58:02.000Z","dependencies_parsed_at":"2023-05-29T15:00:11.263Z","dependency_job_id":null,"html_url":"https://github.com/hiejulia/Project-Euler","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/hiejulia/Project-Euler","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hiejulia%2FProject-Euler","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hiejulia%2FProject-Euler/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hiejulia%2FProject-Euler/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hiejulia%2FProject-Euler/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/hiejulia","download_url":"https://codeload.github.com/hiejulia/Project-Euler/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hiejulia%2FProject-Euler/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":272878209,"owners_count":25008340,"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","status":"online","status_checked_at":"2025-08-30T02:00:09.474Z","response_time":77,"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","bigo","datastructures","euler-solutions","java","javascript","python"],"created_at":"2024-12-16T04:17:51.382Z","updated_at":"2026-05-08T14:08:37.181Z","avatar_url":"https://github.com/hiejulia.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Project-Euler\n(repo for preparing algorithms test for codility interview tests - as big guy always has algorithms : ) )\n\n+ This is Project Euler solved by Javascript \n\n+ Data structure and algorithm with Java - Python - Javascript \n\n\n## Data structure \n+ Vector\n+ Linked list \n+ Stack - queue \n    + Priority queue \n    + Heap \n+ Suffix array \n+ Hash map \n+ Map - Set - Multimap \n+ Tree \n    + Binary tree\n    + Binary search tree\n+ Graph\n    + DFS, BFS,Dijkstra, Prim\n    + Topological sort \n    + Johnson's algorithm\n+ Dictionary\n\n## Algorithms\n+ Bloom filter \n+ Breadth-first iterative search\n+ k way merge \n+ Greedy algorithm\n    + Prim \n    + Kruskal\n    + \n+ Divide and conquer \n+ Recursion(no BigO)\n+ Sort\n+ Graph \n    + Depth first search \n    + Breadth first search \n    + Spanning tree \n    + Prim \n    + Sortest path \n\n+ Dynamic programming \n    + Knapsack \n    + Longest increasing subsequence \n    + Edit distance \n    + Minimum partition \n    + Matrix chain multiplication \n    + Fibonacci \n    + Tower of hanoi \n    + Bai toan ba lo \n+ String algorithm \n    + Levenshtein Distance\n    + \n+ Search \n    + Quick sort, Heap sort, Binary search \n    + Interpolation search \n    + Aho Corasick String Matching\n    + Rotation \n    + Insertion \n    + Substring search algorithm \n\n+ Tree \n    + Binary search tree\n    + AVL tree \n    + Red black tree \n    + K dimensional tree \n    + \n\n\n+ Divide and conquer \n    + Merge sort \n    + Quick sort \n    + Binary search \n    + Strassen","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhiejulia%2Fproject-euler","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhiejulia%2Fproject-euler","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhiejulia%2Fproject-euler/lists"}