using System; using System.Text.RegularExpressions; public static class CryptoSquare { public static string NormalizedPlaintext(string plaintext) { string result = ""; for(int i=0;

using System; using System.Collections.Generic; public class Matrix{ public string input; public Matrix(string input){ this.input = input; } public int[] Row(int row){ List<int> parts = new

using System; using System.Collections.Generic; using System.Linq; public class TreeBuildingRecord{ public int ParentId { get; set; } public int RecordId { get; set; } } public class Tree{ public int Id

Edin il sovrano... :D

class ProgramWindow{ public $x; public $y; public $width; public $height; function __construct(){ $this->x = 0; $this->y = 0; $this->width = 800; $this->height = 600; } function resize($size){

export function nucleotideCounts(lett:string) { const res: Record<string, number> = { A: 0, C: 0, G: 0, T: 0,}; // ricordarsi la virgola alla fine! for(let i=0; i<lett.length; i++){ let char =

export function find(haystack: number[], needle: number, counter: number = 0): number | never { const maxNumber = Math.max(...haystack); let middle = Math.floor(haystack.length/2); if(needle === 0 ||

​ let arr : string[] =["wink" ,"double blink","close your eyes", "jump"]; ​ export function commands(num: number): string[] { let res: string[] = []; const binArr

export function encode(text:string) { let res = ""; let num = 1; for(let i=0; i<text.length; i++){ if(i<text.length - 1 && text[i] === text[i+1]){ num +=1; } else{ if(num === 1){

export function convert( digits: number[], inputBase: number, outputBase: number ): number[] { let res: number[] = []; let resNum = 0; let exp = digits.length-1; let toAdd = 0; if (inputBase <=1) throw

export class Series { series: string; constructor(series: string) { this.series = series; if(this.series.length === 0) throw new Error('series cannot be empty'); } slices(sliceLength: number): number[][]

export const encode = (phrase, key) => { let lower = phrase.toLowerCase().replaceAll(' ', ''); let alphabet = ['a','b','c','d','e','f','g','h','i','j','k','l','m',

<?php . \* \* To disable strict typing, comment out the directive below. \*/ declare(strict\_types=1); function encode(string $text, int $num1, int $num2): string{ $res = ""; $alphabet = range('a', 'z');

declare(strict_types=1); ​ function sumOfMultiples(int $number, array $multiples): int{ $res = 1; $setres = []; foreach($multiples as $mult){ if($mult < 1 || $mult > $number) continue; $i = 1; while

export function transform(old: {[key: string]: string[]}) { let expected: {[key: string]: number} = {}; for(const [keys, values] of Object.entries(old)){ for(const elm of values){ expected[elm.toLowerCase()]

def rows(letter): list\_start = ['A','B','C','D','E','F','G','H','I','J', 'K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'] row\_conf=[] n = list\_start.index(letter) for i in range(n+1):

export class Squares { count: number; constructor(count: number) { this.count = count; } ​ get sumOfSquares(): number { let tot = 0; for(let i=0; i<=this.count; i++){ tot += i\*i; } return tot; } ​

// // This is only a SKELETON file for the 'Kindergarten Garden' exercise. // It's been provided as a convenience to get you started writing code faster. // const DEFAULT_STUDENTS: Student[] = [ 'Alice',

// // This is only a SKELETON file for the 'Kindergarten Garden' exercise. // It's been provided as a convenience to get you started writing code faster. // ​ const DEFAULT_STUDENTS = [ 'Alice', 'Bob',

export class Anagram { input : string; constructor(input: string) { this.input = input.toLowerCase(); } public matches(...potentials: string[]): string[] { let res: string[] = []; let sortedStringFirst: