//Please read first comment of code to get idea of what is the problem statement /* Got some feedback ? most welcome to make this code more better in terms of performance */ #include #include #include #include using namespace std; struct duplicate { int val; string rowOrCol; string pos1; string pos2; duplicate(int v,string rc,string p1,string p2) : val(v),rowOrCol(rc),pos1(p1),pos2(p2){} }; ostream& operator<<(ostream& os,duplicate& obj) { os << obj.rowOrCol << " has value " << obj.val << " at " << obj.pos1 << " & " << obj.pos2 << endl; return os; } int main() { vector> input { {3, 5, 2, 9, 1, 8, 6, 7, 4}, {8, 9, 7, 2, 4, 6, 5, 1, 3}, {6, 4, 1, 7, 5, 3, 2, 8, 9}, {7, 8, 3, 5, 6, 9, 4, 2, 1}, {9, 2, 6, 1, 3, 4, 7, 5, 8}, {4, 1, 5, 8, 2, 7, 9, 3, 6}, {8, 6, 4, 3, 7, 5, 8, 9, 2}, {2, 7, 8, 4, 9, 1, 3, 6, 5}, {5, 3, 9, 6, 8, 2, 1, 4, 7} }; int rows = input.size(); int cols = input[0].size(); vector results; for(int c = 0;c < cols ; ++c) { unordered_map um; for(int r= 0;rsecond; results.emplace_back(val,"Col " + to_string(c+1),"Row " + to_string(r+1) , "Row " + to_string(idx+1)); } else { um[val] = r; } } } for(int r = 0;r < rows ; ++r) { unordered_map um; for(int c= 0;csecond; results.emplace_back(val,"Row " + to_string(r+1),"Col " + to_string(c+1) , "Col " + to_string(idx+1)); } else { um[val] = c; } } } if(results.size()<1) cout << "Sudoku is valid.!\n"; else cout << "Sudoku is not valid..!\n\n"; for(auto& elem : results) { cout << elem; } return 0; }

challenge [sudoku validate]