{"id":20755456,"url":"https://github.com/hrz8/be-qlue","last_synced_at":"2026-04-18T20:31:47.808Z","repository":{"id":136511603,"uuid":"312151482","full_name":"hrz8/be-qlue","owner":"hrz8","description":null,"archived":false,"fork":false,"pushed_at":"2021-05-10T03:40:38.000Z","size":258,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-25T11:51:54.721Z","etag":null,"topics":["alghorithm","shell","tools"],"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/hrz8.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":"2020-11-12T02:57:22.000Z","updated_at":"2021-08-21T17:47:16.000Z","dependencies_parsed_at":null,"dependency_job_id":"25c3c6bb-75ad-4d84-a359-e2101242c067","html_url":"https://github.com/hrz8/be-qlue","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/hrz8/be-qlue","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hrz8%2Fbe-qlue","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hrz8%2Fbe-qlue/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hrz8%2Fbe-qlue/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hrz8%2Fbe-qlue/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/hrz8","download_url":"https://codeload.github.com/hrz8/be-qlue/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hrz8%2Fbe-qlue/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31984125,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-18T20:23:30.271Z","status":"ssl_error","status_checked_at":"2026-04-18T20:23:29.375Z","response_time":103,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["alghorithm","shell","tools"],"created_at":"2024-11-17T09:25:41.641Z","updated_at":"2026-04-18T20:31:47.758Z","avatar_url":"https://github.com/hrz8.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# be Qlue\n\n## What's going on here?\n- [Shell](#01_shell)\n- [SQL](#02_sql)\n- [NodeJS](#03_nodejs-prime)\n- [Javascript](#04_javascript)\n- [Algorithmic](#05_algorithmic)\n- [Bonus: Parallel and Concurrency](#06_parallel-concurrency)\n- [Bonus: Rounded Matrix Path](#07_rounding-path)\n\n## 01_shell\n\n### Play the Game\n\n```bash\n[be-qlue]$ cd 01_shell/\n```\n\n\u003e Create a single line script that returns the number of httpd processes that are running on the current machine\n\n```bash\n[01_shell]$ bash httpd_proccess_count.sh\n# OR\n[01_shell]$ ./httpd_proccess_count\n```\n\nNote: \n- the first bash script using `grep -c` to directly count how many `httpd` word from `ps -A` process status list command\n- the second binary file using `grep [query]` command to fetch list of line which contains `httpd` from `ps -A` process status list command and then count the result line using `wc -l` word count command\n\n\u003eFrom the current folder (/tmp), provide some bash commands that will rename all the *.txt files in mig33/inner_folder/ to *.dat\n\n```bash\n[01_shell]$ cd tmp/\n[tmp]$ bash transform_txt_dat.sh\n```\n\n## 02_sql\n\n### Play the Game\n\n```bash\n[be-qlue]$ cd 02_sql/\n```\n\n```bash\n# 1)\n[02_sql]$ cat 01_solution.sql\n```\n\n```bash\n# 2)\n[02_sql]$ cat 02_solution.sql\n```\n\n## 03_nodejs-prime\n\n### Play the Game\n\n```bash\n[be-qlue]$ cd 03_nodejs-prime/\n```\n\u003e Write a function which, taking in a positive integer n as input, returns an array of all primes lower than n.\n\n```bash\n[03_nodejs-prime]$ node index.js [number]\n```\n\nNote:\n- `[number]` is a positive integer number n as an input number\n- the requested function that returns array of primes number lower than `number` is exist in `./03_nodejs-prime/index.js` file called `collectPrime()`\n- `collectPrime()` function using `isPrime()` function in the body that exist in `./03_nodejs-prime/utils.js` file\n\nOptional:\n- if you want to **build** the binary file, you need to make sure that your machine **connect to the internet** for download some dev dependencies packages. if so you can run this command:\n    ```bash\n  [03_nodejs-prime]$ bin/setup\n  ```\n- the binary file that can be run using:\n  ```bash\n  [03_nodejs-prime]$ bin/collect_prime [number]\n  ```\n\n## 04_javascript\n\n### Play the Game\n\n```bash\n[be-qlue]$ cd 04_javascript/\n```\n\u003e Write the NodeJS function which, taking in a raw data set as first mentioned, will return the improved json-encoded string and expose it into standard RESTFul API\n\n```bash\n[04_javascript]$ npm start\n```\n\nNote:\n- to lookup the RestFul API Response go to http://localhost:8080/ from your machine\n- the requested function to sanitize and improve the json response can found and exist in `./04_javascript/utils.js` as `sanitizeResponse()`\n\n## 05_algorithmic\n\n### Play the Game\n\n```bash\n[be-qlue]$ cd 05_algorithmic/\n```\n\u003e Write a function which, taking a positive integer n as input, finds all sets of numbers that sum up to n.\n\n```bash\n[05_algorithmic]$ node index.js [number]\n```\n\nNote:\n- `[number]` is a positive integer number n as an input number\n- the requested function that returns all sets of numbers that sum up to `number` is exist in `./05_algorithmic/index.js` file as method of `SumSet` object in `SumSet.prototype.combinations()`\n- `combinations()` method of `SumSet` is a recursive method that returns an array of set numbers\n\nOptional:\n- if you want to **build** the binary file, you need to make sure that your machine **connect to the internet** for download some dev dependencies packages. if so you can run this command:\n    ```bash\n  [05_algorithmic]$ bin/setup\n  ```\n- the binary file that can be run using:\n  ```bash\n  [05_algorithmic]$ bin/get_combinations [number]\n  ```\n\n## 06_parallel-concurrency\n\n### Reading for you\n\n[Click Here](../master/06_parallel-concurrency)\n\n## 07_rounding-path\n\n### Play the Game\n\n```bash\n[be-qlue]$ cd 07_rounding-path/\n```\n\u003e Write the function which, taking [N] for argument as the width and height for square matrix (NxN = ROWxCOL), will return something like this:\n\n```bash\n# N = 2\n[\n  [1,2],\n  [4,3]\n]\n\n# N = 3\n[\n  [1,2,3],\n  [8,9,4],\n  [7,6,5]\n]\n\n# N = 4\n[\n  [1,  2, 3,4],\n  [12,13,14,5],\n  [11,16,15,6],\n  [10, 9, 8,7]\n]\n```\n\n```bash\n[07_rounding-path]$ node index.js [number]\n```\n\nNote:\n- the output will show 2d array (matrix) with rounding path number (left --\u003e right, top --\u003e bottom, right --\u003e left, bottom --\u003e top, so on)\n\n## App Info\n\n### Authors\n\nHirzi Nurfakhrian\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhrz8%2Fbe-qlue","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhrz8%2Fbe-qlue","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhrz8%2Fbe-qlue/lists"}