{"id":20968184,"url":"https://github.com/mvxt/sudoku-validator","last_synced_at":"2026-04-21T23:03:27.370Z","repository":{"id":87875609,"uuid":"150548914","full_name":"mvxt/sudoku-validator","owner":"mvxt","description":"Solution for Interview Problem - Validate Sudoku Puzzle","archived":false,"fork":false,"pushed_at":"2018-10-17T18:29:45.000Z","size":14,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-12-31T16:06:01.134Z","etag":null,"topics":["arrays","dataductus","hashset","interview","interview-questions","sudoku-checker"],"latest_commit_sha":null,"homepage":"","language":"Java","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/mvxt.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-09-27T07:45:09.000Z","updated_at":"2018-10-17T18:37:31.000Z","dependencies_parsed_at":"2024-01-23T01:34:00.264Z","dependency_job_id":null,"html_url":"https://github.com/mvxt/sudoku-validator","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/mvxt/sudoku-validator","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mvxt%2Fsudoku-validator","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mvxt%2Fsudoku-validator/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mvxt%2Fsudoku-validator/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mvxt%2Fsudoku-validator/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mvxt","download_url":"https://codeload.github.com/mvxt/sudoku-validator/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mvxt%2Fsudoku-validator/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32113748,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-21T11:25:29.218Z","status":"ssl_error","status_checked_at":"2026-04-21T11:25:28.499Z","response_time":128,"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":["arrays","dataductus","hashset","interview","interview-questions","sudoku-checker"],"created_at":"2024-11-19T03:06:30.066Z","updated_at":"2026-04-21T23:03:27.330Z","avatar_url":"https://github.com/mvxt.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Sudoku Validator\n\nThis is the repository for Data Ductus round 2 interview question solution, implemented in Java. The goal is to write a function which, given a 2D array of integers representing a Sudoku puzzle, validates the given solution.\n\n## Background\nSudoku is a 9x9 grid puzzle. You are usually given an incomplete puzzle with only a few numbers, and based on logic, you are supposed to fill in the rest of the puzzle. See the [Wikipedia](https://en.wikipedia.org/wiki/Sudoku) article for more information.\n\nThe rules are as follows:\n- All rows must contain numbers 1-9 uniquely\n- All columns must contain numbers 1-9 uniquely\n- All 3x3 squares at 0,0 / 0,3 / 0,6 / 3,0 / 3,3 / 3,6 / 6,0 / 6,3 / 6,6 must contain numbers 1-9 uniquely\n\n## Setup\nYou must have minimum Java 7 installed.\n\n1. Clone the repository and `cd` into it.\n```\n$ git clone https://github.com/mvxt/sudoku-validator \u0026\u0026 cd sudoku-validator\n```\n\n2. Build the project.\n```\n$ make\n```\n\n3. Run the project.\n```\n$ java SudokuValidator\n```\n\n## Overview of Solution(s)\nOne implementation could be to iterate through all rows, then all columns, then each of the squares to check for 1-9 uniqueness. If we assume for N to be the number of rows and columns, then this runtime would be O(n^2) complexity. This naive implementation can be seen on commit [e393241](https://github.com/mvxt/sudoku-validator/commit/e3932417992cc80cd390f880b4f3f0fae1bc7b5e).\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmvxt%2Fsudoku-validator","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmvxt%2Fsudoku-validator","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmvxt%2Fsudoku-validator/lists"}