Diademata

You are given a two-digit integer n. Return the sum of its digits. Example For n = 29, the output should beaddTwoDigits(n) = 11. The Core 시작 code >> int addTwoDigits(int n) {return n / 10 + n % 10;}

Sudoku is a number-placement puzzle. The objective is to fill a 9 × 9 grid with digits so that each column, each row, and each of the nine 3 × 3 sub-grids that compose the grid contains all of the digits from 1 to 9. This algorithm should check if the given grid of numbers represents a correct solution to Sudoku. Example For the first example below, the output should be true. For the other grid,..

Construct a square matrix with a size N × N containing integers from 1 to N * N in a spiral order, starting from top-left and in clockwise direction. Example For n = 3, the output should be spiralNumbers(n) = [[1, 2, 3], [8, 9, 4], [7, 6, 5]] code>> std::vector spiralNumbers(int n) {std::vector _list;for (int i = 0; i < n; i++)_list.push_back(std::vector(n));int x = -1, y = 0, idx = 1;int jump =..

You are taking part in an Escape Room challenge designed specifically for programmers. In your efforts to find a clue, you've found a binary code written on the wall behind a vase, and realized that it must be an encrypted message. After some thought, your first guess is that each consecutive 8 bits of the code stand for the character with the corresponding extended ASCII code. Assuming that you..

You are given an array of desired filenames in the order of their creation. Since two files cannot have equal names, the one which comes later will have an addition to its name in a form of (k), where k is the smallest positive integer such that the obtained name is not used yet. Return an array of names that will be given to the files. Example For names = ["doc", "doc", "image", "doc(1)", "doc"..

Given an integer product, find the smallest positive (i.e. greater than 0) integer the product of whose digits is equal to product. If there is no such integer, return -1 instead. Example For product = 12, the output should bedigitsProduct(product) = 26;For product = 19, the output should bedigitsProduct(product) = -1. code>> int digitsProduct(int product){if (product == 0) return 10;else if (pr..

Given a rectangular matrix containing only digits, calculate the number of different 2 × 2 squares in it. ExampleFormatrix = [[1, 2, 1], [2, 2, 2], [2, 2, 2], [1, 2, 3], [2, 2, 1]] the output should be differentSquares(matrix) = 6. Here are all 6 different 2 × 2 squares:1 22 2 2 12 2 2 22 2 2 21 2 2 22 3 2 32 1 code>> int differentSquares(std::vector matrix) { std::set s; for (int i = 1; i

CodeMaster has just returned from shopping. He scanned the check of the items he bought and gave the resulting string to Ratiorg to figure out the total number of purchased items. Since Ratiorg is a bot he is definitely going to automate it, so he needs a program that sums up all the numbers which appear in the given input. Help Ratiorg by writing a function that returns the sum of numbers that ..

Check if the given string is a correct time representation of the 24-hour clock. Example For time = "13:58", the output should bevalidTime(time) = true;For time = "25:51", the output should bevalidTime(time) = false;For time = "02:76", the output should bevalidTime(time) = false. code >> bool validTime(std::string time) {int index = time.find(":");int hour = std::stoi(time.substr(0, index));int ..

Define a word as a sequence of consecutive English letters. Find the longest word from the given string. Example For text = "Ready, steady, go!", the output should belongestWord(text) = "steady". code>> std::string longestWord(std::string text) {std::regex reg("\\w+([a-zA-Z])");std::smatch m;std::string str="";std::string temp = text;while (std::regex_search(temp, m, reg)){for (auto t : m){if (s..