Diademata

Below we will define an n-interesting polygon. Your task is to find the area of a polygon for a given n. A 1-interesting polygon is just a square with a side of length 1. An n-interesting polygon is obtained by taking the n - 1-interesting polygon and appending 1-interesting polygons to its rim, side by side. You can see the 1-, 2-, 3- and 4-interesting polygons in the picture below. Example For..

Given an array of integers, find the pair of adjacent elements that has the largest product and return that product. Example For inputArray = [3, 6, -2, -5, 7, 3], the output should beadjacentElementsProduct(inputArray) = 21. 7 and 3 produce the largest product. code>> int adjacentElementsProduct(std::vector inputArray) {int max = -1000 * 1000;for (int i = 0; i < inputArray.size() - 1; i++){int ..

Given the string, check if it is a palindrome. Example For inputString = "aabaa", the output should becheckPalindrome(inputString) = true;For inputString = "abac", the output should becheckPalindrome(inputString) = false;For inputString = "a", the output should becheckPalindrome(inputString) = true. code>> bool checkPalindrome(std::string inputString) { int s=0,e = inputString.size() - 1; while(s

Given a year, return the century it is in. The first century spans from the year 1 up to and including the year 100, the second - from the year 101 up to and including the year 200, etc. Example For year = 1905, the output should becenturyFromYear(year) = 20;For year = 1700, the output should becenturyFromYear(year) = 17. code>> int centuryFromYear(int year) {if (year % 100 == 0)return year / 10..

Write a function that returns the sum of two numbers. Example For param1 = 1 and param2 = 2, the output should beadd(param1, param2) = 3. code >> int add(int param1, int param2) { return param1 + param2;}