{"id":15848975,"url":"https://github.com/amazingandyyy/good-job","last_synced_at":"2026-06-22T16:32:21.292Z","repository":{"id":82578768,"uuid":"161607100","full_name":"amazingandyyy/good-job","owner":"amazingandyyy","description":"🎉 The most useful DS and Algor. implemented in javascript","archived":false,"fork":false,"pushed_at":"2020-04-25T23:18:59.000Z","size":90,"stargazers_count":1,"open_issues_count":0,"forks_count":1,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-10-19T23:30:56.790Z","etag":null,"topics":["algorithm","computer-science","data-structures","interview","interview-questions","software-engineer"],"latest_commit_sha":null,"homepage":"https://amazingandyyy.com/good-job","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/amazingandyyy.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":"2018-12-13T08:24:22.000Z","updated_at":"2020-04-25T23:19:01.000Z","dependencies_parsed_at":null,"dependency_job_id":"49634b93-8e1e-4c2a-93a9-fdef673e7995","html_url":"https://github.com/amazingandyyy/good-job","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/amazingandyyy/good-job","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/amazingandyyy%2Fgood-job","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/amazingandyyy%2Fgood-job/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/amazingandyyy%2Fgood-job/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/amazingandyyy%2Fgood-job/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/amazingandyyy","download_url":"https://codeload.github.com/amazingandyyy/good-job/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/amazingandyyy%2Fgood-job/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34657893,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-22T02:00:06.391Z","response_time":106,"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":["algorithm","computer-science","data-structures","interview","interview-questions","software-engineer"],"created_at":"2024-10-05T18:21:12.012Z","updated_at":"2026-06-22T16:32:21.267Z","avatar_url":"https://github.com/amazingandyyy.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# 🎉 You can do a good-job!\n\n## Big O\n\nrules\n\n1. Always worst case\n2. Remove constants\n3. Different inputs should have different variables. O(a+b). A and B arrays nested would be O(a*b)\n4. Drop non-dominant terms O(n+ n^2) -\u003e O(n^2)\n\nexternal resource: http://bigocheatsheet.com/\n\n\n## [Data Structures](https://github.com/amazingandyyy/good-job/blob/master/ds.md)\n\n- array\n- hashtable\n- linked list\n- stack\n- queue\n- tree\n- graph\n\n## [Algorithms](https://github.com/amazingandyyy/good-job/blob/master/algor.md)\n\n- resursion\n- sorting\n  - selection\n  - bubble\n  - insertion\n  - merge\n\n## Handle technical interview questions\n\nsteps\n\n1. Repeat questions, points, input, output\n2. Start with the naive/brute force approach\n3. Tell them why this approach is not the best, Walk through your approach, Give out a better one\n4. Before you start coding, walk through your code and write down the steps you are going to follow.\n5. Try to break it\n6. Modulizing\n\n### references\n\n- [Master The Coding Interview Data Structures Algorithms](https://www.udemy.com/master-the-coding-interview-data-structures-algorithms)\n- [Algorithms In Js](https://github.com/amazingandyyy/algorithms-in-js)\n- [Cracking the Coding Interview - Fullstack Academy Speaker Series](https://www.youtube.com/watch?v=Eg5-tdAwclo)\n\n#### License\n\n[MIT](https://github.com/amazingandyyy/good-job/blob/master/LICENSE)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Famazingandyyy%2Fgood-job","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Famazingandyyy%2Fgood-job","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Famazingandyyy%2Fgood-job/lists"}