{"id":15877775,"url":"https://github.com/ulises-jeremias/v-daily-coding-problems","last_synced_at":"2026-02-03T09:34:42.571Z","repository":{"id":108551447,"uuid":"387604951","full_name":"ulises-jeremias/v-daily-coding-problems","owner":"ulises-jeremias","description":"V solutions to problems sent by dailycodingproblem.com","archived":false,"fork":false,"pushed_at":"2021-07-19T22:14:02.000Z","size":10,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-07-14T21:34:27.397Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"V","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/ulises-jeremias.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":"2021-07-19T22:05:05.000Z","updated_at":"2024-11-22T18:06:53.000Z","dependencies_parsed_at":"2023-03-07T20:45:10.928Z","dependency_job_id":null,"html_url":"https://github.com/ulises-jeremias/v-daily-coding-problems","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ulises-jeremias/v-daily-coding-problems","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ulises-jeremias%2Fv-daily-coding-problems","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ulises-jeremias%2Fv-daily-coding-problems/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ulises-jeremias%2Fv-daily-coding-problems/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ulises-jeremias%2Fv-daily-coding-problems/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ulises-jeremias","download_url":"https://codeload.github.com/ulises-jeremias/v-daily-coding-problems/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ulises-jeremias%2Fv-daily-coding-problems/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29039701,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-03T09:33:44.148Z","status":"ssl_error","status_checked_at":"2026-02-03T09:33:43.343Z","response_time":96,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: 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":[],"created_at":"2024-10-06T02:03:43.386Z","updated_at":"2026-02-03T09:34:42.554Z","avatar_url":"https://github.com/ulises-jeremias.png","language":"V","funding_links":[],"categories":[],"sub_categories":[],"readme":"# V Daily Coding Problems\n\nV solutions to problems sent by dailycodingproblem.com\n\n## Problem 1\n\nThis problem was asked by Apple.\n\nImplement the function fib(n), which returns the nth number in the Fibonacci\nsequence, using only O(1) space.\n\n[Solution](./solutions/problem_001.v)\n\n## Problem 2\n\nThis problem was asked by Facebook.\n\nGiven an array of numbers of length N, find both the minimum and maximum using\nless than 2 * (N - 2) comparisons.\n\n[Solution](./solutions/problem_002.v)\n\n## Problem 3\n\nThis problem was asked by Nvidia.\n\nYou are given a list of N points (x1, y1), (x2, y2), ..., (xN, yN) representing\na polygon. You can assume these points are given in order; that is, you can\nconstruct the polygon by connecting point 1 to point 2, point 2 to point 3, and\nso on, finally looping around to connect point N to point 1.\n\nDetermine if a new point p lies inside this polygon. (If p is on the boundary of\nthe polygon, you should return False).\n\n[Solution](./solutions/problem_003.v)\n\n## Problem 4\n\nThis problem was asked by Amazon.\n\nA tree is symmetric if its data and shape remain unchanged when it is reflected about the root node. The following tree is an example:\nGiven a k-ary tree, determine whether it is symmetric.\n\n[Solution](./solutions/problem_004.v)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fulises-jeremias%2Fv-daily-coding-problems","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fulises-jeremias%2Fv-daily-coding-problems","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fulises-jeremias%2Fv-daily-coding-problems/lists"}