{"id":29955142,"url":"https://github.com/diraneyya/leetcode-romantoint-tests","last_synced_at":"2025-09-01T04:36:55.995Z","repository":{"id":287393934,"uuid":"926671094","full_name":"diraneyya/leetcode-romantoint-tests","owner":"diraneyya","description":"Offer feedback to leetcode's romanToInt (from Mastodon)","archived":false,"fork":false,"pushed_at":"2025-02-03T17:05:00.000Z","size":13,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-08-28T08:32:03.593Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"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/diraneyya.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,"zenodo":null}},"created_at":"2025-02-03T17:03:01.000Z","updated_at":"2025-02-03T17:05:03.000Z","dependencies_parsed_at":"2025-04-11T14:29:40.537Z","dependency_job_id":"d1d0b787-4563-47d5-8ae2-5cae15dcc2e8","html_url":"https://github.com/diraneyya/leetcode-romantoint-tests","commit_stats":null,"previous_names":["diraneyya/leetcode-romantoint-tests"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/diraneyya/leetcode-romantoint-tests","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/diraneyya%2Fleetcode-romantoint-tests","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/diraneyya%2Fleetcode-romantoint-tests/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/diraneyya%2Fleetcode-romantoint-tests/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/diraneyya%2Fleetcode-romantoint-tests/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/diraneyya","download_url":"https://codeload.github.com/diraneyya/leetcode-romantoint-tests/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/diraneyya%2Fleetcode-romantoint-tests/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":273074328,"owners_count":25040927,"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-09-01T02:00:09.058Z","response_time":120,"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":[],"created_at":"2025-08-03T17:10:55.249Z","updated_at":"2025-09-01T04:36:55.911Z","avatar_url":"https://github.com/diraneyya.png","language":"TypeScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# leetcode-romantoint\n\nTo install dependencies:\n\n```bash\nbun install\n```\n\nTo run the tests:\n\n```bash\nbun test\n```\n\nThe project uses `clang` after installing (`llvm` and `lld` need to be installed) to compile a C function to WASM and then run a few tests on it using _bun_ (with a [syntax](./main.test.ts) similar to **Jest**)\n\n## Test Cases\n\nPlease inspect the test cases in the [main.test.ts](./main.test.ts) file, located in this repository.\n\n## Discussion\n\n(I used an LLM to try to summarize my thoughts and be more concise)\n\nThe challenge becomes either:\n\n- A trivial summation exercise (ignoring validity), or\n- A parser-design problem with rigid validation rules.\n\nTrue difficulty arises only when combining validity checks, large-input handling, and overflow detection. A scope maybe beyond this LeetCode question. To make it compelling, one must:\n\n- Explicitly define validity rules (e.g., canonical forms only),\n- Enforce strict left-to-right monotonicity,\n- Handle extreme values (e.g., 32-bit/64-bit boundaries),\n- Address additive/subtractive edge cases systematically.\n\nWithout these constraints, the problem remains an introductory string-to-value conversion task.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdiraneyya%2Fleetcode-romantoint-tests","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdiraneyya%2Fleetcode-romantoint-tests","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdiraneyya%2Fleetcode-romantoint-tests/lists"}