The snippets are under the CC-BY-SA license.

Creative Commons Attribution-ShareAlike 3.0

Logo

Programming-Idioms.org

  • The snippets are under the CC-BY-SA license.
  • Please consider keeping a bookmark
  • (instead of printing)
C# Python
1
Print a literal string on standard output
Console.WriteLine("Hello, World!");
print("Hello World")
Alternative implementation:
print('Hello World')
2
Loop to execute some code a constant number of times
for (int i = 0; i < 10; i++)
{
    Console.WriteLine("Hello");
}
Alternative implementation:
Console.WriteLine(string.Join(Environment.NewLine, Enumerable.Repeat("Hello", 10)));
Alternative implementation:
Console.WriteLine( string.Concat(Enumerable.Repeat("Hello\n", 10)) );
for _ in range(10):
    print("Hello")
Alternative implementation:
print("Hello\n"*10)
Alternative implementation:
i = 0
while i < 10:
    print('Hello')
    i += 1
Alternative implementation:
def f(): print('Hello')
for x in range(10): f()
Alternative implementation:
f = lambda: print('Hello')
for x in range(10): f()
Alternative implementation:
for x in repeat('Hello', 10): print(x)
Alternative implementation:
www
3
Like a function which doesn't return any value, thus has only side effects (e.g. Print to standard output)
void Finish(string name)
{
    System.Console.WriteLine($"My job here is done. Goodbye, {name}");
}
Alternative implementation:
void Finish(string name) 
    => System.Console.WriteLine($"My job here is done. Goodbye, {name}");
def finish(name):
    print(f'My job here is done. Goodbye {name}')
Alternative implementation:
f = lambda: print('abc')
f()
4
Create a function which returns the square of an integer
int Square(int x)
{
    return x * x;
}
Alternative implementation:
int Square(int x) => (int)Math.Pow(x, 2);
Alternative implementation:
double Square(int value) => System.Math.Pow(value, 2);
Alternative implementation:
void Square(ref int x)
{
    x = x * x;
}
def square(x):
    return x*x
Alternative implementation:
def square(x):
    return x**2
Alternative implementation:
square = lambda x: x * x
5
Declare a container type for two floating-point numbers x and y
struct Point
{
    public double x;
    public double y;
};
Alternative implementation:
record Point(double x, double y);
Alternative implementation:
(double x, double y)
@dataclass
class Point:
    x: float
    y: float
Alternative implementation:
Point = namedtuple("Point", "x y")
Alternative implementation:
point = {'x': 1.2, 'y': 3.4}
Alternative implementation:
class Point:
    def __init__(self, x, y):
        self.x, self.y = x, y
Alternative implementation:
point = dict(x=1.2, y=3.4)
6
Do something with each item x of the list (or array) items, regardless indexes.
foreach (var x in items)
{
    DoSomething(x);
}
for x in items:
        doSomething( x )
Alternative implementation:
[do_something(x) for x in items]
Alternative implementation:
f = lambda x: ...
for x in items: f(x)
7
Print each index i with its value x from an array-like collection items
for (int i = 0; i < items.Length; i++)
{
    Console.WriteLine($"{i} {items[i]}");
}
Alternative implementation:
foreach (var (i, x) in items.AsIndexed())
{
    System.Console.WriteLine($"{i}: {x}");
}

public static class Extensions
{
    public static IEnumerable<(int, T)> AsIndexed<T>(
        this IEnumerable<T> source)
    {
        var index = 0;
        foreach (var item in source)
        {
            yield return (index++, item);
        }
    }
}
Alternative implementation:
foreach (var (x, i) in items.Select((x, i)=>(x, i)))
{
    System.Console.WriteLine($"{i}: {x}");
}
for i, x in enumerate(items):
    print(i, x)
Alternative implementation:
print(*enumerate(items))
8
Create a new map object x, and provide some (key, value) pairs as initial content.
var x = new Dictionary<string, int> {
   {"year", 2019}, {"month", 12}
};
Alternative implementation:
var x = new Dictionary<string, int> {
   ["year"] = 2019,
   ["month"] = 12
};
x = {"one" : 1, "two" : 2}
Alternative implementation:
x = dict(a=1, b=2, c=3)
9
The structure must be recursive because left child and right child are binary trees too. A node has access to children nodes, but not to its parent.
class BinaryTree<T>:IComparable<T>
{
 T value;
 BinaryTree<T> leftChild;
 BinaryTree<T> rightChild;
}
class Node:
	def __init__(self, data):
		self.data = data
		self.left = None
		self.right = None
Alternative implementation:
class Node:
  def __init__(self, data, left_child, right_child):
    self.data = data
    self._left_child = left_child
    self._right_child = right_child
10
Generate a random permutation of the elements of list x
private static Random rng = new Random();  

public static void Shuffle<T>(this IList<T> x)  
{  
    int n = x.Count;  
    while (n > 1) {  
        n--;  
        int k = rng.Next(n + 1);  
        T value = x[k];  
        x[k] = x[n];  
        x[n] = value;  
    }  
}
Alternative implementation:
public static IEnumerable<T> Shuffle<T>(this IEnumerable<T> input)
    => input.OrderBy(_ => Guid.NewGuid());
shuffle(x)
Alternative implementation:
random.shuffle(x)
11
The list x must be non-empty.
x[new Random().Next(x.Count)]
Alternative implementation:
x[Random.Shared.Next(x.Count)]
random.choice(x)
Alternative implementation:
if x: z = choice(x)
12
Check if the list contains the value x.
list is an iterable finite container.
list.Contains(item);
x in list
13
Access each key k with its value x from an associative array mymap, and print them.
foreach(var entry in map)
{
    Console.WriteLine("Key=" + entry.Key + ", Value=" + entry.Value);
}
for k, v in mymap.items():
    print(k, v)
Alternative implementation:
for x in mymap.items():
    print(x)
14
Pick a random number greater than or equals to a, strictly inferior to b. Precondition : a < b.
Random rng = new();
double pick(double a, double b)
{
    return rng.NextDouble() * (b - a) + a;
}
random.uniform(a,b)
15
Pick a random integer greater than or equals to a, inferior or equals to b. Precondition : a < b.
Random r = new Random();
return r.Next(a, b + 1);
Alternative implementation:
Random.Shared.Next(a, b + 1)
random.randint(a,b)
16
Call a function f on every node of binary tree bt, in depth-first infix order
void Dfs(BinaryTree bt)
{
    if (bt.Left != null) 
        Dfs(bt.Left);

    f(bt);

    if (bt.right != null) 
        Dfs(bt.Right);
}
def dfs(bt):
	if bt is None:
		return
	dfs(bt.left)
	f(bt)
	dfs(bt.right)
17
The structure must be recursive. A node may have zero or more children. A node has access to its children nodes, but not to its parent.
class Node<T>
{
 T value;
 List<Node<T>> childNodes;
}
class Node:
    def __init__(self, value, *children):
        self.value = value
        self.children = list(children)
18
Call a function f on every node of a tree, in depth-first prefix order
public static void Dfs(Action<Tree> f, Tree root) {
    f(root);
    foreach(var child in root.Children)
        Dfs(f, child);
} 
def DFS(f, root):
	f(root)
	for child in root:
		DFS(f, child)
19
Reverse the order of the elements of the list x.
This may reverse "in-place" and destroy the original ordering.
x.Reverse();
x = reversed(x)
Alternative implementation:
y = x[::-1]
Alternative implementation:
x.reverse()
20
Implement a function search which looks for item x in a 2D matrix m.
Return indices i, j of the matching cell.
Think of the most idiomatic way in the language to return the two values at the same time.
(int, int) Search(int[,] m, int x)
{
    for (var i = 0; i <= m.GetUpperBound(0); i++)
        for (var j = 0; j <= m.GetUpperBound(1); j++)
            if (m[i, j] == x)
                return (i, j);

    return (-1, -1);
}
def search(m, x):
    for idx, item in enumerate(m):
        if x in item:
            return idx, item.index(x)
Alternative implementation:
def search(x, m):
    for i, M in enumerate(m):
        for j, N in enumerate(M):
            if N == x: return (i, j)
21
Swap the values of the variables a and b
var tmp = a;
a = b;
b = tmp;
Alternative implementation:
(a, b) = (b, a);
a, b = b, a
Alternative implementation:
a =int(input("enter a number"))
b =int(input("enter b number")) 
a, b = b, a
 
print("Value of a:", a)
print("Value of a", b)
22
Extract the integer value i from its string representation s (in radix 10)
long i = Convert.ToInt64(s);
Alternative implementation:
int i = int.Parse(s);
i = int(s)
23
Given a real number x, create its string representation s with 2 decimal digits following the dot.
string s = $"{x:F2}";
s =  '{:.2f}'.format(x)
Alternative implementation:
s = f'{x:.2f}'
Alternative implementation:
s = '%.2f' % x
Alternative implementation:
s = format(x, '.2f')
24
Declare a new string s and initialize it with the literal value "ネコ" (which means "cat" in japanese)
string s = "ネコ";
s = "ネコ"
25
Share the string value "Alan" with an existing running process which will then display "Hello, Alan"
ConcurrentQueue<int> coll = new ConcurrentQueue<int>();
var ts = new CancellationTokenSource();
CancellationToken ct = ts.Token;

Task t2 = Task.Factory.StartNew(() => {
	while (true) {
		Thread.Sleep(250);
		if (ct.IsCancellationRequested) break;
			bool isDequeued = coll.TryDequeue(out int result);
			if (isDequeued) Console.WriteLine(result);
	}});
while (true) {
	int val = Convert.ToInt32(Console.ReadLine());
	if (val == -1) break;
	coll.Enqueue(val);
}
ts.Cancel();
Alternative implementation:
using(var readyEvent = new ManualResetEvent(false))
{
    var thread = new Thread(() =>
    {
        readyEvent.WaitOne();
        Console.WriteLine(value);
    });

    thread.Start();

    value = "Alan";
    readyEvent.Set();

    thread.Join();
}
q = Queue()

def worker():
    while True:
        print(f"Hello, {q.get()}")
        q.task_done()

Thread(target=worker, daemon=True).start()

q.put("Alan")
q.join()
26
Declare and initialize a matrix x having m rows and n columns, containing real numbers.
var x = new double[m, n];
x = [[0] * n for _ in range(m)]
Alternative implementation:
x = []
for i in range(m):
    x.append([.0] * n)
Alternative implementation:
x = [*repeat([.0] * n, m)]
27
Declare and initialize a 3D array x, having dimensions boundaries m, n, p, and containing real numbers.
var x = new double[m, n, p];
x = [[[0 for k in range(p)] for j in range(n)] for i in range(m)]
Alternative implementation:
x = numpy.zeros((m,n,p))
Alternative implementation:
x = []
for a in range(m):
    t = []
    for b in range(n):
        t.append([.0] * p)
    x.append(t)
Alternative implementation:
f = lambda: [*repeat([.0] * p, m)]
x = [*repeat(f(), n)]
28
Sort the elements of the list (or array-like collection) items in ascending order of x.p, where p is a field of the type Item of the objects in items.
System.Array.Sort(items, Comparer<Item>.Create((a, b) => a.p - b.p));
Alternative implementation:
items.OrderBy(x => x.p)
items = sorted(items, key=lambda x: x.p)
Alternative implementation:
items = sorted(items, key=attrgetter('p'))
29
Remove i-th item from list items.
This will alter the original list or return a new list, depending on which is more idiomatic.
Note that in most languages, the smallest valid value for i is 0.
items.RemoveAt(i);
del items[i]
Alternative implementation:
items.pop(i)
30
Launch the concurrent execution of the procedure f with parameter i from 1 to 1000.
Tasks are independent and f(i) doesn't return any value.
Tasks need not run all at the same time, so you may use a pool.
Parallel.For(1, 1001, f);
pool = Pool()
for i in range(1, 1001):
	pool.apply_async(f, [i])
31
Create the recursive function f which returns the factorial of the non-negative integer i, calculated from f(i-1)
int f(int i)
{
    if (i == 0) return 1;
    return i * f(i - 1);
}
Alternative implementation:
int f(int i) => i == 0 ? 1 : i * f(i - 1)
def f(i):
   if i == 0:
       return 1
   else:
       return i * f(i-1)
32
Create function exp which calculates (fast) the value x power n.
x and n are non-negative integers.
long exp(long x, long n){
    if (n == 0)
        return 1;
    if (n == 1)
        return x;
    if (n % 2 == 0)
        return exp(x * x, n / 2);
    else
        return x * exp(x * x, (n - 1) / 2);
}
Alternative implementation:
long exp(long x, long n) {
    return (long) Math.Pow(x, n);
}
def exp(x, n):
        return x**n
33
Assign to the variable x the new value f(x), making sure that no other thread may modify x between the read and the write.
lock (x) {
  x = f(x);	
}
Alternative implementation:
private readonly object m_Sync = new object();

lock(m_Sync)
{
    x = f(x);
}
lock = threading.Lock()

lock.acquire()
try:
	x = f(x)
finally:
	lock.release()
Alternative implementation:
with threading.Lock():
    x = f(x)
34
Declare and initialize a set x containing unique objects of type T.
HashSet<T> x = new HashSet<T>();
class T(object):
    pass

x = set(T())
Alternative implementation:
class T:
   ...

s = set(T() for _ in range(x))
Alternative implementation:
class T:
    def __init__(self, x):
        self.x = x
    def __hash__(self):
        return hash(self.x)
    def __eq__(self, t):
        return self.x == t.x
x = {T('abc'), T(123), T(lambda: ...)}
35
Implement a function compose (A -> C) with parameters f (A -> B) and g (B -> C), which returns the composition function g ∘ f
Func<A, C> compose(Func<A, B> f, Func<B, C> g) => a => g(f(a));
def compose(f, g):
    return lambda a: g(f(a))
36
Implement a function compose which returns composition function g ∘ f for any functions f and g having exactly 1 parameter.
Func<T1, T3> compose<T1, T2, T3>(Func<T1, T2> f, Func<T2, T3> g) => x => g(f(x));
def compose(f, g):
	return lambda x: g(f(x))
Alternative implementation:
compose = lambda f, g, x: \
    lambda x: g(f(x))
37
Transform a function that takes multiple arguments into a function for which some of the arguments are preset.
Func<A, C> curry<A, B, C>(Func<A, B, C> f, B b) => (A a) => f(a, b);
def add(a, b):
	return a+b

add_to_two = partial(add, 2)
38
Find substring t consisting in characters i (included) to j (excluded) of string s.
Character indices start at 0 unless specified otherwise.
Make sure that multibyte characters are properly handled.
var t = s.Substring(i, j - i);
t = s[i:j]
Alternative implementation:
t = s[slice(i, j)]
39
Set the boolean ok to true if the string word is contained in string s as a substring, or to false otherwise.
var ok = s.Contains(word);
ok = word in s
41
Create the string t containing the same characters as the string s, in reverse order.
The original string s must remain unaltered. Each character must be handled correctly regardless its number of bytes in memory.
char[] charArray = s.ToCharArray();
Array.Reverse(charArray);
string t = new string(charArray);
Alternative implementation:
string t = string.Create(s.Length, s, static (span, s) =>
{
    s.AsSpan().CopyTo(span);
    span.Reverse();
});
t = s[::-1]
Alternative implementation:
t = ''.join(reversed(s))
42
Print each item v of list a which is not contained in list b.
For this, write an outer loop to iterate on a and an inner loop to iterate on b.
int gb = 0;
foreach (int v in a)
{
  foreach (int w in b)
  {
    gb = w;
    if (w == v)
      break;
  }
  if (gb == v)
    continue;
  System.Console.WriteLine(v);
}
for v in a:
    try:
        for u in b:
            if v == u:
                raise Exception()
        print(v)
    except Exception:
        continue
Alternative implementation:
for v in a:
  keep = True
  for w in b:
    if w == v:
      keep = False
      break
  if keep:
    print(v)
Alternative implementation:
z = False
for x in a:
    for y in b:
        if y == x:
            z = True
            break
    if not z: print(x)
    z = False
43
Look for a negative value v in 2D integer matrix m. Print it and stop searching.
bool keepLooping = true;

for(int i = 0; i < m.length && keepLooping; i++)
{
	for(int j = 0; j < m[i].length && keepLooping; j++)
	{
		if(m[i][j] < 0)
		{
			Console.WriteLine(m[i][j]);
			keepLooping = false;
		}
	}
}
Alternative implementation:
foreach (int v in m)
{
    if (v < 0)
    {
        Console.WriteLine(v);
        break;
    }
}
Alternative implementation:
foreach (int[] row in m)
{
    foreach (int v in row)
    {
        if (v < 0)
        {
            Console.WriteLine(v);
            goto DONE;
        }
    }
}
DONE: ;
Alternative implementation:
for (
        int i = 0,
        rows = m.GetLength(0),
        cols = m.GetLength(1); i < rows; i++)
{
    for (int j = 0; j < cols; j++)
    {
        if (m[i, j] < 0)
        {
            Console.WriteLine(m[i, j]);
            i = int.MaxValue - 1; // Break outer loop.
            break;
        }
    }
}
class BreakOuterLoop (Exception): pass

try:
    position = None
    for row in m:
        for column in m[row]:
            if m[row][column] == v:
                position = (row, column)
                raise BreakOuterLoop
except BreakOuterLoop:
    pass
Alternative implementation:
def loop_breaking(m, v): 
    for i, row in enumerate(m): 
        for j, value in enumerate(row): 
            if value == v: 
                return (i, j)
    return None

print(loop_breaking(([1,2,3],[4,5,6],[7,8,9]), 6))
Alternative implementation:
matrix = [[1,2,3],[4,-5,6],[7,8,9]]
try:
    print(next(i for i in chain.from_iterable(matrix) if i < 0))
except StopIteration:
    pass
Alternative implementation:
b = False
for r in m:
    for i in r:
        if i < 0:
            print(i)
            b = True
    if b: break
Alternative implementation:
z = False
for a in m:
    for b in a:
        if z := b < 0:
            print(b)
            break
    if z: break
44
Insert the element x at position i in the list s. Further elements must be shifted to the right.
s.Insert(i, x);
s.insert(i, x)
45
Sleep for 5 seconds in current thread, before proceeding with the next instructions.
Thread.Sleep(5000);
Alternative implementation:
Task.Delay(5000);
time.sleep(5)
46
Create the string t consisting of the 5 first characters of the string s.
Make sure that multibyte characters are properly handled.
string t = s.Substring(0, 5);
t = s[:5]
47
Create string t consisting in the 5 last characters of string s.
Make sure that multibyte characters are properly handled.
var t = s.Substring(s.Length - 5);
t = s[-5:]
48
Assign to variable s a string literal consisting in several lines of text, including newlines.
string s = @"Huey
Dewey
Louie";
s = """Huey
Dewey
Louie"""
Alternative implementation:
s = ('line 1\n'
     'line 2\n'
     'line 3\n'
     'line 4')
49
Build list chunks consisting in substrings of the string s, separated by one or more space characters.
string[] chunks = s.Split(' ');
chunks = s.split()
Alternative implementation:
chunks = split(' +', s)
50
Write a loop that has no end clause.
while (true)
{
    // Do something
}
while True:
    pass
Alternative implementation:
while 1: ...
51
Determine whether the map m contains an entry for the key k
bool keyExists = m.ContainsKey(key)
k in m
Alternative implementation:
m.get(k)
52
Determine whether the map m contains an entry with the value v, for some key.
m.ContainsValue(v)
v in m.values()
Alternative implementation:
def k(x, m):
    for k, v in m.items():
        if v == x: return k
k = k(v, m)
Alternative implementation:
x = False
for y in m.items():
    if y[1] == v:
        x = y[0]
        break
53
Concatenate elements of string list x joined by the separator ", " to create a single string y.
string y = string.Join(", ", x);
y = ', '.join(x)
Alternative implementation:
y = ', '.join(map(str, x))
Alternative implementation:
f = lambda a, b: f'{a}, {b}'
y = reduce(f, x)
54
Calculate the sum s of the integer list or array x.
var s = x.Sum();
s = sum(x)
Alternative implementation:
s = reduce(add, x)
55
Create the string representation s (in radix 10) of the integer value i.
string s = i.ToString()
s = str(i)
56
Fork-join : launch the concurrent execution of procedure f with parameter i from 1 to 1000.
Tasks are independent and f(i) doesn't return any value.
Tasks need not run all at the same time, so you may use a pool.
Wait for the completion of the 1000 tasks and then print "Finished".
int numTasks = 1000;
Task<int>[] output = new System.Threading.Tasks.Task<int>[numTasks];
for (int i = 0; i < numTasks; i++)
{
  output[i] = Task.Factory.StartNew(
                   new Func <object, int>(LongRunningOperation), 2000);
}
Task.WaitAll(output);

int LongRunningOperation(object objMs)
{
  int ms = (int)objMs;
  Thread.Sleep(ms);
  return ms;
}
Alternative implementation:
await Task.WhenAll(Enumerable.Range(0, 1000).Select(i => Task.Run(() => f(i))));
Console.WriteLine("Finished");

static async Task f(int value)
{
    // Do something with value. Delay to simulate work
    await Task.Delay(500);
}
def f(i):
	i * i

with Pool(1000) as p:
	p.map(func=f, iterable=range(1, 1001))

print('Finished')
57
Create the list y containing the items from the list x that satisfy the predicate p. Respect the original ordering. Don't modify x in-place.
var y = x.FindAll(p);
Alternative implementation:
var y = x.Where(p).ToList();
y = list(filter(p, x))
Alternative implementation:
y = [element for element in x if p(element)]
Alternative implementation:
y = [*filter(p, x)]
58
Create the string lines from the content of the file with filename f.
string lines = File.ReadAllText(f);
lines = open(f).read()
Alternative implementation:
with open(f) as fo:
    lines = fo.read()
59
Print the message "x is negative" to standard error (stderr), with integer x value substitution (e.g. "-2 is negative").
Console.Error.WriteLine($"{x} is negative");
print(x, "is negative", file=sys.stderr)
60
Assign to x the string value of the first command line parameter, after the program name.
static void Main(string[] args)
{
    string x = args[0];
}
x = sys.argv[1]
61
Assign to the variable d the current date/time value, in the most standard type.
DateTime d = DateTime.Now;
d = datetime.datetime.now()
62
Set i to the first position of string y inside string x, if exists.

Specify if i should be regarded as a character index or as a byte index.

Explain the behavior when y is not contained in x.
var i = x.IndexOf(y);
i = x.find(y)
63
Assign to x2 the value of string x with all occurrences of y replaced by z.
Assume occurrences of y are not overlapping.
string x2 = x.Replace(y, z, StringComparison.Ordinal);
x2 = x.replace(y, z)
64
Assign to x the value 3^247
var x = BigInteger.Pow(3, 247);
x = 3 ** 247
65
From the real value x in [0,1], create its percentage string representation s with one digit after decimal point. E.g. 0.15625 -> "15.6%"
string s = $"{x:p1}";
s = '{:.1%}'.format(x)
Alternative implementation:
s = f"{x:.01%}"
Alternative implementation:
s = '%.1f%%' % (x * 100)
Alternative implementation:
s = format(x, '.1%')
66
Calculate the result z of x power n, where x is a big integer and n is a positive integer.
var z = BigInteger.Pow(x, n);
z = x**n
67
Calculate binom(n, k) = n! / (k! * (n-k)!). Use an integer type able to handle huge numbers.
public BigInteger binom(int n, int k)
{
	return factorial(n)/(factorial(k) * factorial(n-k));
}

public BigInteger factorial(int x)
{
	BigInteger result = 1;
	for(int i=1;i<=x;i++)
	{
	result = result * i;
	}
	return result;
}
def binom(n, k):
    return math.factorial(n) // math.factorial(k) // math.factorial(n - k)
Alternative implementation:
def binom(n, k):
    return math.comb(n, k)
68
Create an object x to store n bits (n being potentially large).
new BitArray(n);
x = bytearray(int(math.ceil(n / 8.0)))
Alternative implementation:
class BitSet:
    def __init__(self, n):
        self.a = [False] * n
    def __getitem__(self, i):
        return self.a[i]
    def __setitem__(self, k, v):
        self.a[k] = v
    def __str__(self):
        s = ('01'[x] for x in self.a)
        return ''.join(s)
x = BitSet(n)
69
Use seed s to initialize a random generator.

If s is constant, the generator output will be the same each time the program runs. If s is based on the current value of the system clock, the generator output will be different each time.
var random = new Random(s);
rand = random.Random(s)
70
Get the current datetime and provide it as a seed to a random generator. The generator sequence will be different at each run.
Random rng = new Random(DateTime.Now.Day);
rand = random.Random()
71
Basic implementation of the Echo program: Print all arguments except the program name, separated by space, followed by newline.
The idiom demonstrates how to skip the first argument if necessary, concatenate arguments as strings, append newline and print it to stdout.
public class Program
{
    public static void Main(string[] args)
    {
        Console.WriteLine(string.Join(" ", args));
    }
}
print(' '.join(sys.argv[1:]))
Alternative implementation:
print(*argv[1:])
74
Compute the greatest common divisor x of big integers a and b. Use an integer type able to handle huge numbers.
int gcd(int a, int b)
{
  while (b != 0)
  {
    int t = b;
    b = a % t;
    a = t;
  }
  return a;
}
Alternative implementation:
int gcd(int a, int b)
{
  if (b == 0) 
    return a;
  else 
    return gcd(b, a % b);
}
x = gcd(a, b)
Alternative implementation:
x = math.gcd(a, b)
75
Compute the least common multiple x of big integers a and b. Use an integer type able to handle huge numbers.
int gcd(int a, int b)
{
  while (b != 0)
  {
    int t = b;
    b = a % t;
    a = t;
  }
  return a;
}

int lcm(int a, int b)
{
  if (a == 0 || b == 0)
    return 0;
  return (a * b) / gcd(a, b);
}

int x = lcm(140, 72);
x = (a*b)//gcd(a, b)
Alternative implementation:
x = math.lcm(a, b)
76
Create the string s of integer x written in base 2.

E.g. 13 -> "1101"
String s = Convert.ToString(x,2);
Alternative implementation:
String s = Convert.ToString(x,2).PadLeft(16, '0');
s = '{:b}'.format(x)
Alternative implementation:
s = format(x, 'b')
77
Declare a complex x and initialize it with value (3i - 2). Then multiply it by i.
var x = new Complex(-2, 3);
x *= Complex.ImaginaryOne;
x = 3j-2
y = x * 1j
78
Execute a block once, then execute it again as long as boolean condition c is true.
do
{
    stuff();
} while(c);
while True:
    do_something()
    if not c:
        break
Alternative implementation:
x = True
while x:
    x = c
Alternative implementation:
import turtle

# 设置屏幕
screen = turtle.Screen()
screen.bgcolor("white")

# 创建小球
ball = turtle.Turtle()
ball.shape("circle")
ball.color("red")
ball.penup()
ball.speed(0)

# 初始速度和位置
ball.dx = 2
ball.dy = 2

# 动画循环
while True:
    # 移动小球
    ball.setx(ball.xcor() + ball.dx)
    ball.sety(ball.ycor() + ball.dy)
    
    # 边界检测
    if ball.ycor() > 290 or ball.ycor() < -290:
        ball.dy *= -1
    if ball.xcor() > 390 or ball.xcor() < -390:
    
79
Declare the floating point number y and initialize it with the value of the integer x .
float y = x;
y = float(x)
80
Declare integer y and initialize it with the value of floating point number x . Ignore non-integer digits of x .
Make sure to truncate towards zero: a negative x must yield the closest greater integer (not lesser).
int y = (int)x;
y = int(x)
81
Declare the integer y and initialize it with the rounded value of the floating point number x .
Ties (when the fractional part of x is exactly .5) must be rounded up (to positive infinity).
long y = (long)Math.Round(x);
y = int(x + 0.5)
Alternative implementation:
c = Context(rounding=ROUND_HALF_UP)
y = round(Decimal(x, c))
82
Find how many times string s contains substring t.
Specify if overlapping occurrences are counted.
int SubstringCount(string s, string t, bool allowOverlap = false)
{
  int p = 0;
  int tl = allowOverlap ? 1 : t.Length;
  int cnt = 0;

  while (1 == 1)
  {
    p = s.IndexOf(t, p);
    if (p == -1) break;
    p += tl;
    cnt++;
  }
  return cnt;
}
count = s.count(t)
83
Declare the regular expression r matching the strings "http", "htttp", "httttp", etc.
var r = new Regex("htt+p");
r = re.compile(r"htt+p")
Alternative implementation:
r = compile('ht{2,}p')
84
Count number c of 1s in the integer i in base 2.

E.g. i=6 → c=2
var c = BitOperations.PopCount((uint)i);
Alternative implementation:
public static int BitCount(int i)
{
    var c = 0;
    while (n != 0)
    {
        c++;
        n &= (n - 1); //walking through all the bits which are set to one
    }

    return c;
}
c = bin(i).count("1")
Alternative implementation:
c = i.bit_count()
85
Write boolean function addingWillOverflow which takes two integers x, y and return true if (x+y) overflows.

An overflow may be above the max positive value, or below the min negative value.
bool addingWillOverflow(int x, int y)
{
  bool willOverflow = false;

  if (x > 0 && y > 0)
    if (y > (int.MaxValue - x)) willOverflow = true;

  if (x < 0 && y < 0)
    if (y < (int.MinValue - x)) willOverflow = true;

  return willOverflow;
}
def adding_will_overflow(x,y):
    return False
86
Write the boolean function multiplyWillOverflow which takes two integers x, y and returns true if (x*y) overflows.

An overflow may reach above the max positive value, or below the min negative value.
public bool WillOverwflow(int x, int y) => int.MaxValue / x < y;
Alternative implementation:
public bool multiplyWillOverflow(int x, int y) 
{
	if (x == 0)
		return false;

	if (y > int.MaxValue / x)
		return true;

	if (y < int.MinValue / x)
		return true;

	return false;
}
def multiplyWillOverflow(x,y):
	return False
87
Exit immediately.
If some extra cleanup work is executed by the program runtime (not by the OS itself), describe it.
Environment.Exit(0)
sys.exit(1)
88
Create a new bytes buffer buf of size 1,000,000.
var buf = new byte[1000000];
buf = bytearray(1000000)
89
You've detected that the integer value of argument x passed to the current function is invalid. Write the idiomatic way to abort the function execution and signal the problem.
throw new ArgumentException(nameof(×));
raise ValueError("x is invalid")
90
Expose a read-only integer x to the outside world while being writable inside a structure or a class Foo.
class Foo
{
	public int x { get; private set; }
}
class Foo(object):
    def __init__(self):
        self._x = 0

    @property
    def x(self):
        """
        Doc for x
        """
        return self._x
91
Read from the file data.json and write its content into the object x.
Assume the JSON data is suitable for the type of x.
JObject x = JObject.Parse(File.ReadAllText("data.json"));
with open("data.json", "r") as input:
    x = json.load(input)
92
Write the contents of the object x into the file data.json.
await File.WriteAllTextAsync("data.json", JsonSerializer.Serialize(x));	
with open("data.json", "w") as output:
    json.dump(x, output)
93
Implement the procedure control which receives one parameter f, and runs f.
T control(Func<T> f) {
	return f();
}
def control(f):
    f()
Alternative implementation:
def control(f: Callable): f()
94
Print the name of the type of x. Explain if it is a static type or dynamic type.

This may not make sense in all languages.
System.Console.WriteLine( x.GetType() );
print(type(x))
Alternative implementation:
print(x.__class__)
95
Assign to variable x the length (number of bytes) of the local file at path.
var filePath = "Sample.txt";
var fileInfo = new FileInfo(filePath);
var _x = fileInfo.Length;

Alternative implementation:
long? FileSize(string path) {
    if (!File.Exists(path)) {
        return null;
    }
    return (new FileInfo(filePath)).Length;
}
x = os.path.getsize(path)
96
Set the boolean b to true if string s starts with prefix prefix, false otherwise.
bool b = s.StartsWith(prefix);
b = s.startswith(prefix)
97
Set boolean b to true if string s ends with string suffix, false otherwise.
bool b = s.EndsWith(suffix);
Alternative implementation:
var _b = _s.EndsWith(_suffix);
b = s.endswith(suffix)
98
Convert a timestamp ts (number of seconds in epoch-time) to a date with time d. E.g. 0 -> 1970-01-01 00:00:00
var d = DateTimeOffset.FromUnixTimeSeconds(ts).UtcDateTime;
d = datetime.date.fromtimestamp(ts)
99
Assign to the string x the value of the fields (year, month, day) of the date d, in format YYYY-MM-DD.
string x = d.ToString("yyyy-MM-dd");
d = date(2016, 9, 28)
x = d.strftime('%Y-%m-%d')
Alternative implementation:
d = date.today()
x = d.isoformat()
100
Sort elements of array-like collection items, using a comparator c.
var orderdEnumerable = x.OrderBy(y => y, c);
Alternative implementation:
Array.Sort(items, c);
Alternative implementation:
items.Sort(c);
items.sort(key=c)
Alternative implementation:
items.sort(key=functools.cmp_to_key(c))
101
Make an HTTP request with method GET to the URL u, then store the body of the response in the string s.
var client = new HttpClient();
s = await client.GetStringAsync(u);
with urllib.request.urlopen(u) as f:
    s = f.read()
Alternative implementation:
s = requests.get(u).content.decode()
103
Read from the file data.xml and write its contents into the object x.
Assume the XML data is suitable for the type of x.
XDocument x = XDocument.Load("data.xml");

x = lxml.etree.parse('data.xml')
105
1
var path=Environment.CommandLine;
var s=Path.GetFileName(path);
s = sys.argv[0]
106
Assign to string dir the path of the working directory.
(This is not necessarily the folder containing the executable itself)
string path = Directory.GetCurrentDirectory();
dir = os.getcwd()
107
Assign to string dir the path of the folder containing the currently running executable.
(This is not necessarily the working directory, though.)
dir = AppDomain.CurrentDomain.BaseDirectory;
dir = os.path.dirname(os.path.abspath(__file__))
Alternative implementation:
dir = str(Path(__file__).parent)
109
Set n to the number of bytes of a variable t (of type T).
int n = sizeof(T);
Alternative implementation:
int n;
unsafe
{
    n = sizeof(T);
}
Alternative implementation:
int n = Marshal.SizeOf(t);
n = pympler.asizeof.asizeof(t)
Alternative implementation:
n = getsizeof(t)
110
Set the boolean blank to true if the string s is empty, or null, or contains only whitespace ; false otherwise.
bool blank = string.IsNullOrWhiteSpace(s);
Alternative implementation:
bool blank = string.IsNullOrWhiteSpace(s);
blank = not s or s.isspace()
Alternative implementation:
blank = not s or \
        not sub(r'\s+', '', s)
Alternative implementation:
blank = not s or \
        not any(x not in ws for x in s)
111
From current process, run program x with command-line parameters "a", "b".
string[] args = { "a", "b"};
Process.Start(x, string.Join(" ", args));
subprocess.call(['x', 'a', 'b'])
112
Print each key k with its value x from an associative array mymap, in ascending order of k.
SortedDictionary<string, string> myMap;
foreach (var item in myMap)
{
  Console.WriteLine($"{item.Key}={item.Value}");
}
	
for k in sorted(mymap):
    print(mymap[k])
Alternative implementation:
print(*sorted(mymap.items()))
Alternative implementation:
for k, x in sorted(mymap.items()):
    print(k, x)
113
Print each key k with its value x from an associative array mymap, in ascending order of x.
Multiple entries may exist for the same value x.
Dictionary<String, String> mymap = new Dictionary<String, String>();
  
foreach(KeyValuePair<string, string> a in mymap.OrderBy(x => x.Value))
{
  Console.WriteLine("Key = {0}, Value = {1}", a.Key, a.Value);
}
for x, k in sorted((x, k) for k,x in mymap.items()):
    print(k, x)
Alternative implementation:
for key, value in sorted(d.items(), key=operator.itemgetter(1)):
    print(key, value)
Alternative implementation:
for x in sorted(mymap.items(), key=itemgetter(1)):
    print(x)
Alternative implementation:
for x in sorted(mymap, key=mymap.get):
    print(x, mymap[x])
115
Set boolean b to true if date d1 is strictly before date d2 ; false otherwise.
bool b = d1 < d2;
b = d1 < d2
116
Remove all occurrences of string w from string s1, and store the result in s2.
string s2 = s1.Replace(w, string.Empty);
s2 = s1.replace(w, '')
117
Set n to the number of elements of the list x.
int n = x.Count;
Alternative implementation:
int n = x.Length;
n = len(x)
118
Create the set y from the list x.
x may contain duplicates. y is unordered and has no repeated values.
var y = new HashSet<T>(x);
y = set(x)
Alternative implementation:
y = {*x}
119
Remove duplicates from the list x.
Explain if the original order is preserved.
var uniques = x.Distinct().ToList();
x = list(set(x))
Alternative implementation:
x = list(OrderedDict(zip(x, x)))
Alternative implementation:
def dedup(x):
  y = []
  for i in x:
    if not i in y:
      y.append(i)
  return y
Alternative implementation:
a, b, n = 0, 0, len(x)
t = None
while a != n:
    t, b = x[a], a + 1
    while b != n:
        if x[b] == t:
            del x[b]
            n = n - 1
        else: b = b + 1
    a = a + 1
Alternative implementation:
x = list({*x})
120
Read an integer value from the standard input into the variable n
n = int.Parse(Console.ReadLine());
n = int(input("Input Prompting String: "))
Alternative implementation:
n = int(input())
122
Create an enumerated type Suit with 4 possible values SPADES, HEARTS, DIAMONDS, CLUBS.
enum Suit
{
	Spades,
	Hearts,
	Diamonds,
	Clubs
}
class Suit:
	SPADES, HEARTS, DIAMONDS, CLUBS = range(4)
Alternative implementation:
class Suit(Enum):
	SPADES = 1
	HEARTS = 2
	DIAMONDS = 3
	CLUBS = 4
123
Verify that predicate isConsistent returns true, otherwise report assertion violation.
Explain if the assertion is executed even in production environment or not.
var result = isConsistent();
Debug.Assert(result);
Alternative implementation:
var result = isConsistent();
Trace.Assert(result);
assert isConsistent
124
Write the function binarySearch which returns the index of an element having the value x in the sorted array a, or -1 if no such element exists.
public static int binarySearch<T>(List<T> a, T x)
{
    var result = a.BinarySearch(x);
    return result >= 0 ? result : -1;
}
Alternative implementation:
public static int binarySearch<T>(T[] a, T x)
{
    var result = Array.BinarySearch<T>(a, x);
    return result >= 0 ? result : -1;
}
def binarySearch(a, x):
    i = bisect.bisect_left(a, x)
    return i if i != len(a) and a[i] == x else -1
125
measure the duration t, in nanoseconds, of a call to the function foo. Print this duration.
var stopwatch = new Stopwatch();
stopwatch.Start();
foo();
stopwatch.Stop();
var t = stopwatch.ElapsedMilliseconds;
t1 = time.perf_counter_ns()
foo()
t2 = time.perf_counter_ns()
print('Nanoseconds:', t2 - t1)
126
Write a function foo that returns a string and a boolean value.
public Tuple<string, bool> foo_PreCSharp7()
{
    // Only accessed via .Item1 and .Item2
    return new Tuple<string, bool>("string", true);
}

public (string, bool) foo_CSharp7UnnamedTuples()
{
    // Only accessed via .Item1 and .Item2
    return ("string", true);
}

public (string NamedStringArg, bool NamedBooleanArg) foo_CSharp7()
{
    // Can be accessed via .NamedStringArg or .NamedBooleanArg
    return ("string", true);
}
def foo():
    return 'string', True
Alternative implementation:
foo = lambda: ('abc', True)
131
Execute f1 if condition c1 is true, or else f2 if condition c2 is true, or else f3 if condition c3 is true.
Don't evaluate a condition when a previous condition was true.
if (c1)
{
    f1();
}
else if (c2)
{
    f2();
}
else if (c3)
{
    f3();
}
f1() if c1 else f2() if c2 else f3() if c3 else None
Alternative implementation:
if c1:
    f1()
elif c2:
    f2()
elif c3:
    f3()
Alternative implementation:
if c1: f1()
elif c2: f2()
elif c3: f3()
132
Run the procedure f, and return the duration of the execution of f.
var sw=new Stopwatch();
sw.Start();
f();
sw.Stop();
var duration=sw.Elapsed;

duration = timeit.timeit("f()", setup="from __main__ import f")
Alternative implementation:
start = time.time()
f()
end = time.time()
return end - start
133
Set boolean ok to true if string word is contained in string s as a substring, even if the case doesn't match, or to false otherwise.
bool ok = s.ToLower().Contains(word.ToLower());
Alternative implementation:
ok = s.Contains(word, StringComparison.CurrentCultureIgnoreCase);
ok = word.lower() in s.lower()
Alternative implementation:
p = '(?i)' + escape(word)
ok = not not search(p, s)
134
Declare and initialize a new list items, containing 3 elements a, b, c.
var items = new List<T>{a,b,c};
Alternative implementation:
T[] items = new T[] { a, b, c };
items = [a, b, c]
Alternative implementation:
items = list((a, b, c))
135
Remove at most 1 item from list items, having the value x.
This will alter the original list or return a new list, depending on which is more idiomatic.
If there are several occurrences of x in items, remove only one of them. If x is absent, keep items unchanged.
items.Remove(x);
items.remove(x)
Alternative implementation:
for i in range(len(items)):
    if items[i] == x:
        del items[i]
        break
Alternative implementation:
del items[items.index(x)]
136
Remove all occurrences of the value x from list items.
This will alter the original list or return a new list, depending on which is more idiomatic.
items.RemoveAll(r => r == x);
newlist = [item for item in items if item != x]
Alternative implementation:
items = [a for a in items if a != x]
Alternative implementation:
items = list(a for a in items if a != x)
Alternative implementation:
while items.count(x):
    items.remove(x)
Alternative implementation:
f = lambda a: a != x
items = list(filter(f, items))
Alternative implementation:
i, n = 0, len(items)
while i != n:
    if items[i] == x:
        del items[i]
        n = n - 1
    else:
        i = i + 1
137
Set the boolean b to true if the string s contains only characters in the range '0'..'9', false otherwise.
bool b = s.All(char.IsDigit);
b = s.isdigit()
Alternative implementation:
b = all(x in digits for x in s)
Alternative implementation:
try:
  int(s)
  b = true
except:
  b = false
138
Create a new temporary file on the filesystem.
string file = Path.GetTempFileName();
file = tempfile.TemporaryFile()
139
Create a new temporary folder on filesystem, for writing.
string newDir = Path.GetTempPath() + Guid.NewGuid();
Directory.CreateDirectory(newDir);
td = tempfile.TemporaryDirectory()
140
Delete from map m the entry having key k.

Explain what happens if k is not an existing key in m.
map.Remove(key);
m.pop(k, None)
141
Iterate in sequence over the elements of the list items1 then items2. For each iteration print the element.
items1.ForEach(Console.WriteLine);
items2.ForEach(Console.WriteLine);
Alternative implementation:
foreach (var item in items1.Concat(items2))
{
    Console.WriteLine(item);
}
for x in items1 + items2:
    print(x)
Alternative implementation:
for x in chain(items1, items2):
    print(x)
142
Assign to string s the hexadecimal representation (base 16) of integer x.

E.g. 999 -> "3e7"
String s = x.ToString("x")
s = hex(x)
Alternative implementation:
s = format(x, 'x')
Alternative implementation:
s = '%x' % x
143
Iterate alternatively over the elements of the lists items1 and items2. For each iteration, print the element.

Explain what happens if items1 and items2 have different size.
for(int i = 0; i < Math.Max(items1.Count, items2.Count); i++)
{
  if (i < items1.Count) Console.WriteLine(items1[i]);
  if (i < items2.Count) Console.WriteLine(items2[i]);
}
for pair in zip(item1, item2): print(pair)
Alternative implementation:
print(*zip_longest(items1, items2))
Alternative implementation:
a, b = iter(items1), iter(items2)
print(*zip_longest(a, b))
Alternative implementation:
a, b = len(items1), len(items2)
for i in range(max(a, b)):
    if i < a: print(items1[i])
    if i < b: print(items2[i])
144
Set boolean b to true if file at path fp exists on filesystem; false otherwise.

Beware that you should not do this and then in the next instruction assume the result is still valid, this is a race condition on any multitasking OS.
bool b = File.Exists(fp);
b = os.path.exists(fp)
Alternative implementation:
b = Path(fp).exists()
145
Print message msg, prepended by current date and time.

Explain what behavior is idiomatic: to stdout or stderr, and what the date format is.
Console.WriteLine($"[{DateTime.Now}] {msg}");
logging.basicConfig(stream=sys.stdout, level=logging.DEBUG, format="%(asctime)-15s %(message)s")
logger = logging.getLogger('NAME OF LOGGER')

logger.info(msg)
146
Extract floating point value f from its string representation s
var f=float.Parse(s);
s = u'545,2222'
locale.setlocale(locale.LC_ALL, 'de')
f = locale.atof(s)
Alternative implementation:
f = float(s)
Alternative implementation:
f = float(s)
147
Create string t from string s, keeping only ASCII characters
string t = Regex.Replace(s, @"[^\u0000-\u007F]+", string.Empty);
t = re.sub('[^\u0000-\u007f]', '',  s)
Alternative implementation:
t = s.encode("ascii", "ignore").decode()
Alternative implementation:
f = lambda x: ord(x) < 0x80
t = ''.join(filter(f, s))
Alternative implementation:
t = sub(r'[^\x00-\x7f]', '', s)
Alternative implementation:
t = sub(r'[^\0-\176]', '', s)
148
Read a list of integer numbers from the standard input, until EOF.
string input = Console.ReadLine();
string[] intlist = input.Split(new char[] {',', ' '});
	
foreach(string item in intlist)
{
  Console.WriteLine(Convert.ToInt32(item));
}
list(map(int, input().split()))
Alternative implementation:
numbers = [int(x) for x in input().split()]
Alternative implementation:
a = (x.split() for x in stdin)
a = map(int, chain(*a))
150
Remove the last character from the string p, if this character is a forward slash /
p = p.TrimEnd('/');
p = p.rstrip("/")
151
Remove last character from string p, if this character is the file path separator of current platform.

Note that this also transforms unix root path "/" into the empty string!
p.TrimEnd(Path.DirectorySeparatorChar);
if p.endswith(os.sep):
    p = p[:-1]
152
Create string s containing only the character c.
string s = c.ToString();
Alternative implementation:
var s = new string(c, 1);
s = c
153
Create the string t as the concatenation of the string s and the integer i.
var t = $"{s} {i}";
t = f"{s}{i}"
Alternative implementation:
t = s + str(i)
Alternative implementation:
t = '%s%s' % (s, i)
Alternative implementation:
t = '{}{}'.format(s, i)
154
Find color c, the average between colors c1, c2.

c, c1, c2 are strings of hex color codes: 7 chars, beginning with a number sign # .
Assume linear computations, ignore gamma corrections.
Color color1 = ColorTranslator.FromHtml(c1);
Color color2 = ColorTranslator.FromHtml(c2);
c = string.Format($"#{((color1.R + color2.R) / 2):X2}{((color1.G + color2.G) / 2):X2}{((color1.B + color2.B) / 2):X2}");
r1, g1, b1 = [int(c1[p:p+2], 16) for p in range(1,6,2)]
r2, g2, b2 = [int(c2[p:p+2], 16) for p in range(1,6,2)]
c = '#{:02x}{:02x}{:02x}'.format((r1+r2) // 2, (g1+g2) //2, (b1+b2)// 2)
Alternative implementation:
class RGB(numpy.ndarray):
  @classmethod
  def from_str(cls, rgbstr):
    return numpy.array([
      int(rgbstr[i:i+2], 16)
      for i in range(1, len(rgbstr), 2)
    ]).view(cls)
 
  def __str__(self):
    self = self.astype(numpy.uint8)
    return '#' + ''.join(format(n, 'x') for n in self)
 
c1 = RGB.from_str('#a1b1c1')
print(c1)
c2 = RGB.from_str('#1A1B1C')
print(c2)

print((c1 + c2) / 2)
Alternative implementation:
a = bytes.fromhex(c1[1:])
b = bytes.fromhex(c2[1:])
r, g, b = (sum(x) // 2 for x in zip(a, b))
c = (r << 16) + (g << 8) + b
c = f'{c:06x}'
155
Delete from filesystem the file having path filepath.
File.Delete(filepath);
path = pathlib.Path(_filepath)
path.unlink()
Alternative implementation:
os.remove(filepath)
156
Assign to the string s the value of the integer i in 3 decimal digits. Pad with zeros if i < 100. Keep all digits if i1000.
string s = string.Format("{0:000}",i);
s = format(i, '03d')
Alternative implementation:
s = '%03d' % i
157
Initialize a constant planet with string value "Earth".
const string _planet = "Earth";
PLANET = 'Earth'
158
Create a new list y from randomly picking exactly k elements from list x.

It is assumed that x has at least k elements.
Each element must have same probability to be picked.
Each element from x must be picked at most once.
Explain if the original ordering is preserved or not.
Random rnd = new Random();
List<int> y = x.OrderBy(r => rnd.Next()).Take(k).ToList();
y = random.sample(x, k)
160
Execute f32() if platform is 32-bit, or f64() if platform is 64-bit.
This can be either a compile-time condition (depending on target) or a runtime detection.
if(Environment.Is64BitOperatingSystem)
{
    f64();
}
else
{
    f32();
}
if sys.maxsize > 2**32:
    f64()
else:
    f32()

161
Multiply all the elements of the list elements by a constant c
elements.Select(x => x*c)
elements = [c * x for x in elements]
Alternative implementation:
f = lambda x: x * c
elements = [*map(f, elements)]
Alternative implementation:
for i, x in enumerate(elements):
    elements[i] = x * c
162
execute bat if b is a program option and fox if f is a program option.
void Main(string[] args)
{
  if (args.Contains("b")) bat();
  else if (args.Contains("f")) fox();
}
if 'b' in sys.argv[1:]: bat()
if 'f' in sys.argv[1:]: fox()
Alternative implementation:
options = {
	'b': bat
	'f': fox
}

for option, function in options:
	if option in sys.argv[1:]:
		function()
Alternative implementation:
a = dict.fromkeys(argv[1:])
for x in a.keys():
    match x:
        case 'b': bat()
        case 'f': fox()
Alternative implementation:
s = argv[1:]
for x, f in (('b', bat), ('f', fox)):
    if x in s: f()
163
Print all the list elements, two by two, assuming list length is even.
for(int i = 0; i < list.Count; i += 2) {
  Console.WriteLine(string.Format("{0}, {1}", list[i], list[i + 1]));
}
Alternative implementation:
foreach (var chunk in list.Chunk(2))
{
    Console.WriteLine(string.Join(' ', chunk));
}
for x in zip(list[::2], list[1::2]):
    print(x)
Alternative implementation:
def pairwise(iterable):
    "s -> (s0,s1), (s1,s2), (s2, s3), ..."
    a, b = tee(iterable)
    next(b, None)
    return zip(a, b)

for a, b in pairwise(list):
    print(a, b)
Alternative implementation:
for x in batched(a, 2): print(x)
Alternative implementation:
x = iter(list)
print(*zip_longest(x, x))
Alternative implementation:
for x in range(0, len(list), 2):
    print(list[x], list[x + 1])
164
Open the URL s in the default browser.
Set the boolean b to indicate whether the operation was successful.
var b = true;
try
{
    Process.Start(new ProcessStartInfo()
    {
        FileName = s,
        UseShellExecute = true,
    });
}
catch { b = false; }
webbrowser.open(s)
165
Assign to the variable x the last element of the list items.
var x = items.LastOrDefault();
Alternative implementation:
var x = items[items.Count-1];
Alternative implementation:
var x = items[^1];
x = items[-1]
166
Create the list ab containing all the elements of the list a, followed by all the elements of the list b.
var list1 = new List<int>(){1,2,3};
var list2 = new List<int>(){4,5,6};

var list3 = list1.Concat(list2);
ab = a + b
Alternative implementation:
ab = list(chain(a, b))
167
Create the string t consisting of the string s with its prefix p removed (if s starts with p).
var t = s.TrimStart(p);
t = s[s.startswith(p) and len(p):]
Alternative implementation:
t = s.removeprefix(p)
168
Create string t consisting of string s with its suffix w removed (if s ends with w).
string t = s.TrimEnd(w);
t = s.removesuffix(w)
169
Assign to the integer n the number of characters of the string s.
Make sure that multibyte characters are properly handled.
n can be different from the number of bytes of s.
int n = s.Length;
n = len(s)
170
Set n to the number of elements stored in mymap.

This is not always equal to the map capacity.
n = mymap.Count;
n = len(mymap)
171
Append the element x to the list s.
s.Add(x);
s.append(x)
172
Insert value v for key k in map m.
m[k] = v;
m[k] = v
Alternative implementation:
m.update({k: v})
173
Number will be formatted with a comma separator between every group of thousands.
$"{1000:n}"
f'{1000:,}'
Alternative implementation:
format(1000, ',')
Alternative implementation:
'{:,}'.format(1000)
174
Make a HTTP request with method POST to the URL u
new HttpClient().PostAsync(u, content);
data = parse.urlencode(<your data dict>).encode()
req =  request.Request(u, data=data, method="POST")
resp = request.urlopen(req)
175
From the array a of n bytes, build the equivalent hex string s of 2n digits.
Each byte (256 possible values) is encoded as two hexadecimal characters (16 possible values per digit).
Int32 s = BitConverter.ToInt32(sampleBuffer, 0);
s = s.Replace("-", string.Empty);
Alternative implementation:
var s = Convert.ToHexString(a);
s = a.hex()
176
From hex string s of 2n digits, build the equivalent array a of n bytes.
Each pair of hexadecimal characters (16 possible values per digit) is decoded into one byte (256 possible values).
byte[] a = new byte[s.Length/2];
for (int i = 0, h = 0; h < s.Length; i++, h += 2)
{
  a[i] = (byte) Int32.Parse(s.Substring(h, 2), System.Globalization.NumberStyles.HexNumber);
}
a = bytearray.fromhex(s)
177
Construct a list L that contains all filenames that have the extension ".jpg" , ".jpeg" or ".png" in directory D and all its subdirectories.
string D = @"C:\The\Search\Path";

// Assumes that the file system is case insensitive
HashSet<string> exts = new HashSet<string>(StringComparer.CurrentCultureIgnoreCase) { "jpg", "jpeg", "png" };
IEnumerable<string> L =
Directory
    .EnumerateFiles(D, "*", SearchOption.AllDirectories)
    .Where(currentFile => exts.Contains(Path.GetExtension(currentFile)));
extensions = [".jpg", ".jpeg", ".png"]
L = [f for f in os.listdir(D) if os.path.splitext(f)[1] in extensions]
Alternative implementation:
filtered_files = ["{}/{}".format(dirpath, filename) for dirpath, _, filenames in os.walk(D) for filename in filenames if re.match(r'^.*\.(?:jpg|jpeg|png)$', filename)]
Alternative implementation:
list(itertools.chain(*(glob.glob("*/**.%s" % ext) for ext in ["jpg", "jpeg", "png"])))
Alternative implementation:
extensions = [".jpg", ".jpeg", ".png"]
L = [f for f in glob.glob(os.path.join(D, "**/*"), recursive=True) if os.path.splitext(f)[1] in extensions]
178
Set boolean b to true if if the point with coordinates (x,y) is inside the rectangle with coordinates (x1,y1,x2,y2) , or to false otherwise.
Describe if the edges are considered to be inside the rectangle.
b = new Rect(new Point(x1, y1), new Point(x2, y2)).Contains(x, y);
b = (x1 < x < x2) and (y1 < y < y2)
Alternative implementation:
class Rectangle:
    def __init__(self, x, y, w, h):
        self.x, self.y = x, y
        self.w, self.h = w, h
    def contains(self, x, y):
        a, b = self.x, self.y
        w, h = self.w, self.h
        return a <= x <= (a + w) and \
               b <= y <= (b + h)
w, h = x2 - x1, y2 - y1
r = Rectangle(x1, y1, w, h)
b = r.contains(x, y)
179
Return the center c of the rectangle with coördinates(x1,y1,x2,y2)
class Point
{
	public float X { get; }
	public float Y { get; }

	public Point(float x, float y)
	{
		X = x;
		Y = y;
	}
}

class Rectangle
{
	Point Point1;
	Point Point2;

	public Rectangle(Point point1, Point point2)
	{
		Point1 = point1;
		Point2 = point2;
	}

	public Point GetCenter()
	{
		return new Point(
		(Point1.X + Point2.X) / 2,
		(Point1.Y + Point2.Y) / 2
		);
	}
}
center = ((x1+x2)/2, (y1+y2)/2)
Alternative implementation:
Point = namedtuple('Point', 'x y')
center = Point((x1+x2)/2, (y1+y2)/2)
Alternative implementation:
class Rectangle:
    def __init__(self, x, y, w, h):
        self.x, self.y = x, y
        self.w, self.h = w, h
    def center(self):
        return {
            'x': (self.x + self.w) / 2,
            'y': (self.y + self.h) / 2
        }
w, h = x2 - x1, y2 - y1
r = Rectangle(x1, y1, w, h)
c = r.center()
180
Create the list x containing the contents of the directory d.

x may contain files and subfolders.
No recursive subfolder listing.
var files = Directory.GetFiles(dirPath);
x = os.listdir(d)
182
Output the source of the current program. A quine is a computer program that takes no input and produces a copy of its own source code as its only output.

Reading the source file from disk is cheating.
public class Quine{public static void Main(){var s="public class Quine{{public static void Main(){{var s={0}{1}{0};System.Console.Write(s,(char)34,s);}}}}";System.Console.Write(s,(char)34,s);}}
s = 's = %r\nprint(s%%s)'
print(s%s)
183
Make a HTTP request with method PUT to the URL u
new HttpClient().PutAsync(u, content);
content_type = 'text/plain'
headers = {'Content-Type': content_type}
data = {}

r = requests.put(u, headers=headers, data=data)
status_code, content = r.status_code, r.content
184
Assign to t a string representing the day, month and year of the day after the current date.
var t = DateTime.Today.AddDays(1).ToShortDateString();
t = str(date.today() + timedelta(days=1))
Alternative implementation:
t = str(date.today() + timedelta(1))
185
Schedule the execution of f(42) in 30 seconds.
Task.Delay(TimeSpan.FromSeconds(30))
    .ContinueWith(_ => f(42));
timer = threading.Timer(30.0, f, args=(42,) ) 
timer.start() 
186
Exit a program cleanly indicating no error to OS
Environment.Exit(0);
sys.exit(0)
189
Produce a new list y containing the result of the function T applied to all elements e of the list x that match the predicate P.
var y = x.Where(P).Select(T).ToList();
y = [T(e) for e in x if P(e)]
Alternative implementation:
y = list(map(T, filter(P, x)))
191
Given a one-dimensional array a, check if any value is larger than x, and execute the procedure f if that is the case
if (a.Any(e => e > x))
    f();
if any(v > x for v in a):
    f()
Alternative implementation:
if any(z > x for z in a): f()
192
Declare a real variable a with at least 20 digits; if the type does not exist, issue an error at compile time.
decimal a = 1234567890.12345678901m;
a = decimal.Decimal('1234567890.123456789012345')
196
Given an integer array a of size n, pass the first, third, fifth and seventh, ... up to the m th element to a routine foo which sets all these elements to 42.
void Foo(out int element)
{
    element = 42;
}

for (int i = 0; i < m; i += 2)
{
    Foo(out a[i]);
}
def foo(data, r):
    for i in r: 
        data[i] = 42

foo(a, range(0, m+1, 2))
Alternative implementation:
def foo(s):
    global a
    m = (s.stop - 1) - s.start
    a[s] = [42] * ((m // s.step) + 1)
foo(slice(0, m + 1, 2))
197
Retrieve the contents of file at path into a list of strings lines, in which each element is a line of the file.
        public List<string> GetLines(string _path)
        {
            return File.ReadAllLines(_path).ToList();
        }
with open(path) as f:
    lines = f.readlines()
198
Abort program execution with error condition x (where x is an integer value)
System.Environment.Exit(x);
sys.exit(x)
199
Truncate a file F at the given file position.
var F = new FileStream("F", FileMode.Open)
// advance into F here
F.SetLength(F.Position);
F.truncate(F.tell())
200
Compute the hypotenuse h of the triangle where the sides adjacent to the square angle have lengths x and y.
double hypo(double x, double y)
{
    return Math.Sqrt(Math.Pow(x, 2) + Math.Pow(y, 2));
}
h = math.hypot(x, y)
202
Calculate the sum of squares s of data, an array of floating point values.
var s = data.Sum(x => x * x);
s = sum(i**2 for i in data)
Alternative implementation:
f = lambda x: x * x
s = sum(map(f, data))
203
Calculate the mean m and the standard deviation s of the list of floating point values data.
var m = data.Average();
var s = CalculateStdDev(data);

float CalculateStdDev(IEnumerable<float> values)
{
	double ret = 0;

	if (values.Count() > 0)
	{
		double avg = values.Average();
	      	double sum = values.Sum(d => Math.Pow(d - avg, 2));
	      	ret = Math.Sqrt((sum) / values.Count()-1);
	}
	return (float)ret;
}
m = statistics.mean(data)
sd = statistics.stdev(data)
204
Given a real number a, print the fractional part and the exponent of the internal representation of that number. For 3.14, this should print (approximately)

0.785 2
static void Frexp(double value, out double mantissa, out int exponent)
{
    var bits = BitConverter.DoubleToInt64Bits(value);
    var negative = (bits & (1L << 63)) != 0;
    exponent = (int)((bits >> 52) & 0x7FFL);
         Console.WriteLine("nt2: " + exponent);
    var mantissaLong = bits & 0xFFFFFFFFFFFFFL;

    if (exponent == 0)
    {
        exponent++;
    }
    else
    {
        mantissaLong |= 1L << 52;
    }

    exponent -= 1075;

    if (mantissaLong == 0)
    {
        mantissa = 
print(math.frexp(a))
205
Read an environment variable with the name "FOO" and assign it to the string variable foo. If it does not exist or if the system does not support environment variables, assign a value of "none".
string foo = Environment.GetEnvironmentVariable("FOO");
if (string.IsNullOrEmpty(foo)) foo = "none";
try:
    foo = os.environ['FOO']
except KeyError:
    foo = "none"
Alternative implementation:
foo = getenv('FOO', 'none')
Alternative implementation:
foo = os.environ.get('FOO', 'none')
206
Execute different procedures foo, bar, baz and barfl if the string str contains the name of the respective procedure. Do it in a way natural to the language.
switch (str)
{
    case nameof(Foo):
        Foo();
        break;
    case nameof(Bar):
        Bar();
        break;
    case nameof(Baz):
        Baz();
        break;
    case nameof(Barfl):
        Barfl();
        break;
}
switch = {'foo': foo, 
	'bar': bar, 
	'baz': baz, 
	'barfl': barfl
	}

switch_funct = switch.get(string)
if switch_funct : switch_funct()
Alternative implementation:
match str:
    case 'foo': foo()
    case 'bar': bar()
    case 'baz': baz()
    case 'barfl': barfl()
208
Given the arrays a,b,c,d of equal length and the scalar e, calculate a = e*(a+b*c+cos(d)).
Store the results in a.
for (int i = 0; i < a.Length; i++)
  a[i] = e * (a[i] + b[i] * c[i] + Math.Cos(d[i]));
for i in xrange(len(a)):
	a[i] = e*(a[i] + b[i] + c[i] + math.cos(a[i]))
Alternative implementation:
a = [e*(a[i] + b[i] + c[i] + math.cos(d[i])) for i in range(len(a))]
Alternative implementation:
f = lambda a, b, c, d: \
    e * (a + (b * c) + cos(d))
a = list(map(f, a, b, c, d))
Alternative implementation:
def f(a, b, c, d):
    return e * (a + (b * c) + cos(d))
a = list(map(f, a, b, c, d))
211
Create the folder at path on the filesystem
Directory.CreateDirectory(path)
os.mkdir(path)
212
Set the boolean b to true if path exists on the filesystem and is a directory; false otherwise.
bool b = Directory.Exists(path);
b = os.path.isdir(path)
214
Append extra character c at the end of string s to make sure its length is at least m.
The length is the number of characters, not the number of bytes.
s = s.PadRight(m, c);
s = s.ljust(m, c)
Alternative implementation:
s = f'{s:{c}<{m}}'
215
Prepend extra character c at the beginning of string s to make sure its length is at least m.
The length is the number of characters, not the number of bytes.
s = s.PadLeft(m, c);
s = s.rjust(m, c)
Alternative implementation:
s = f'{s:{c}>{m}}'
218
Create the list c containing all unique elements that are contained in both lists a and b.
c should not contain any duplicates, even if a and b do.
The order of c doesn't matter.
c = a.Intersect(b).ToList();
c = list(set(a) & set(b))
Alternative implementation:
c = list(set(a).intersection(b))
Alternative implementation:
c = [*{*a} & {*b}]
219
Create the string t from the value of string s with each sequence of spaces replaced by a single space.

Explain if only the space characters will be replaced, or the other whitespaces as well: tabs, newlines.
string t = Regex.Replace(s, " +", " ");
Alternative implementation:
string t = Regex.Replace(s, @"\s+", " ");
t = re.sub(' +', ' ', s)
Alternative implementation:
t: str = " ".join(s.split())
Alternative implementation:
t = ' '.join(split(' {2,}', s))
Alternative implementation:
t = ' '.join(split(r'\s{2,}', s))
220
Create t consisting of 3 values having different types.

Explain if the elements of t are strongly typed or not.
var t = (2.5f, "foo", true);
t = (2.5, "hello", -1)
Alternative implementation:
t = tuple('abc', 123, true)
221
Create string t from string s, keeping only digit characters 0, 1, 2, 3, 4, 5, 6, 7, 8, 9.
var t = string.Concat(s.Where(c => char.IsDigit(c)));
t = re.sub(r"\D", "", s)
Alternative implementation:
t = ''.join(x for x in s if x in digits)
222
Set i to the first index in list items at which the element x can be found, or -1 if items does not contain x.
var i = items.IndexOf(x)
i = items.index(x) if x in items else -1
223
Loop through list items checking a condition. Do something else if no matches are found.

A typical use case is looping through a series of containers looking for one that matches a condition. If found, an item is inserted; otherwise, a new container is created.

These are mostly used as an inner nested loop, and in a location where refactoring inner logic into a separate function reduces clarity.
if (!items.Any(i => MatchesCondition(i)))
{
	DoSomethingElse();
}
for item in items:
    if item == 'baz':
        print('found it')
        break
else:
    print('never found it')
224
Insert the element x at the beginning of the list items.
items.Insert(0, x);
Alternative implementation:
items = items.Prepend(x).ToList();
items = [x] + items
Alternative implementation:
items.insert(0, x)
225
Declare an optional integer argument x to procedure f, printing out "Present" and its value if it is present, "Not present" otherwise
void f(int? x = null)
{
    Console.WriteLine(x.HasValue ? $"Present {x}" : "Not Present");
}
def f(x=None):
    if x is None:
        print("Not present")
    else:
        print("Present", x)
226
Remove the last element from the list items.
items.RemoveAt(items.Count - 1);
items.pop()
227
Create the new list y containing the same elements as the list x.

Subsequent modifications of y must not affect x (except for the contents referenced by the elements themselves if they contain pointers).
List<T> y = x.ToList();
Alternative implementation:
List<Int32> y = new List<Int32>(x);
y = x[:]
Alternative implementation:
y = x.copy()
228
Copy the file at path src to dst.
File.Copy(src, dst, true); 
shutil.copy(src, dst)
231
Set b to true if the byte sequence s consists entirely of valid UTF-8 character code points, false otherwise.
var encoding = new UTF8Encoding(false, true);
bool b;
try
{
    encoding.GetCharCount(s);
    b = true;
}
catch (DecoderFallbackException)
{
    b = false;
}
try:
    s.decode('utf8')
    b = True
except UnicodeError:
    b = False

234
Assign to the string s the standard base64 encoding of the byte array data, as specified by RFC 4648.
string s = Convert.ToBase64String(data);
b = base64.b64encode(data)
s = b.decode()
235
Assign to byte array data the bytes represented by the base64 string s, as specified by RFC 4648.
byte[] bytes = Convert.FromBase64String(s);
data = base64.decode(s)
237
Assign to c the result of (a xor b)
int c = a ^ b;
c = a ^ b
238
Write in a new byte array c the xor result of byte arrays a and b.

a and b have the same size.
var c = a.Zip(b, (l, r) => (byte)(l ^ r)).ToArray();
c = bytes([aa ^ bb for aa, bb in zip(a, b)])
Alternative implementation:
c = bytes(map(xor, a, b))
Alternative implementation:
c = bytearray(map(xor, a, b))
Alternative implementation:
c = bytes(xor(*x) for x in zip(a, b))
Alternative implementation:
c = bytearray(xor(*x) for x in zip(a, b))
239
Assign to string x the first word of string s consisting of exactly 3 digits, or the empty string if no such match exists.

A word containing more digits, or 3 digits as a substring fragment, must not match.
string x = Regex.Match(s, @"\b\d\d\d\b").Value;
Alternative implementation:
var re = new Regex(@"\b\d\d\d\b");
string x = re.Match(s).Value;
m = re.search(r'\b\d\d\d\b', s)
x = m.group(0) if m else ''
242
Call a function f on each element e of a set x.
foreach(var e in x)
    f(e);
for e in x:
    f(e)
Alternative implementation:
list(map(lambda e: f(e), x))
Alternative implementation:
for e in x: f(e)
243
Print the contents of the list or array a on the standard output.
a.ForEach(Console.WriteLine);
Alternative implementation:
Console.WriteLine( string.Join(", ", a) );
print(a)
244
Print the contents of the map m to the standard output: keys and values.
Console.WriteLine(string.Join(Environment.NewLine, m));
print(m)
Alternative implementation:
pprint.pp(m, width=1)
246
Set c to the number of distinct elements in the list items.
int c = items.Distinct().Count();
c = len(set(items))
Alternative implementation:
c = []
for x in items:
    if x not in c:
        c.append(x)
c = len(c)
Alternative implementation:
c = 0
for a, x in enumerate(items):
    if x not in items[a + 1:]:
        c = c + 1
Alternative implementation:
c = len({*items})
247
Remove all the elements from list x that don't satisfy the predicate p, without allocating a new list.
Keep all the elements that do satisfy p.

For languages that don't have mutable lists, refer to idiom #57 instead.
x.RemoveAll(item => !p(item));
del_count = 0
for i in range(len(x)):
    if not p(x[i - del_count]):
        del x[i - del_count]
        del_count += 1
Alternative implementation:
i, n = 0, len(x)
while i != n:
    if not p(x[i]):
        del x[i]
        n = n - 1
    else:
        i = i + 1
248
Construct the "double precision" (64-bit) floating point number d from the mantissa m, the exponent e and the sign flag s (true means the sign is negative).
d = (s?-1:1) * m * double.Exp10(e);
sign = -1 if s else 1
d = math.ldexp(sign*m,e)
249
Define variables a, b and c in a concise way.
Explain if they need to have the same type.
var (a, b, c) = (42, "hello", 5.0);
a, b, c = 42, 'hello', 5.0
Alternative implementation:
a, b, c = 'xyz'
Alternative implementation:
a, b, *c = '110000'
Alternative implementation:
*a, b, c = '000011'
Alternative implementation:
a, b, c = Decimal(1.23).as_tuple()
250
Choose a value x from map m.
m must not be empty. Ignore the keys.
var arr = m.Values.ToArray();
var x = arr[Random.Shared.NextInt64(0, arr.Length)];
x = random.choice(list(m.values()))
251
Extract integer value i from its binary string representation s (in radix 2)
E.g. "1101" -> 13
int i = int.Parse(s, System.Globalization.NumberStyles.BinaryNumber);
i = int(s, 2)
Alternative implementation:
i = 0
for x in map(int, s):
    i = i * 2 + x
252
Assign to the variable x the string value "a" if calling the function condition returns true, or the value "b" otherwise.
x = condition() ? "a" : "b";
x = "a" if condition() else "b"
Alternative implementation:
x = 'ba'[condition()]
Alternative implementation:
x = ('b', 'a')[condition()]
254
Replace all exact occurrences of "foo" with "bar" in the string list x
int i;
while ((i = x.IndexOf("foo")) != -1)
    x[i] = "bar";

for i, v in enumerate(x):
  if v == "foo":
    x[i] = "bar"
Alternative implementation:
x = ["bar" if v=="foo" else v for v in x]
Alternative implementation:
for i, v in enumerate(x):
    if v == 'foo': x[i] = 'bar'
255
Print the values of the set x to the standard output.
The order of the elements is irrelevant and is not required to remain the same next time.
foreach (var el in x)
{
    Console.WriteLine(el);
}
Alternative implementation:
Console.WriteLine(string.Join(Environment.NewLine, x));
print(x)
256
Print the numbers 5, 4, ..., 0 (included), one line per number.
for (int i = 5; i >= 0; i--)
{
    Console.WriteLine(i);
}
for i in range(5, -1, -1):
    print(i)
Alternative implementation:
print(*reversed(range(6)), sep='\n')
257
Print each index i and value x from the list items, from the last down to the first.
for(int i = items.Count - 1; i >= 0; i--)
{
    Console.WriteLine($"Index = {i}, Item = {items[i]}");
}
for i in range(len(items)-1, -1, -1):
    print(i, items[i])
Alternative implementation:
for i, x in enumerate(reversed(items)):
  print(f'{i} {x}')
Alternative implementation:
x = enumerate(items)
print(*reversed([*x]))
258
Convert the string values from list a into a list of integers b.
var b = a.Select(i => int.Parse(i)).ToList();
b = [int(elem) for elem in a]
Alternative implementation:
b = [*map(int, a)]
259
Build the list parts consisting of substrings of the input string s, separated by any of the characters ',' (comma), '-' (dash), '_' (underscore).
var parts = Regex.Split(s, "[,_-]");
Alternative implementation:
var parts = s.Split(',', '-', '_');
parts = re.split('[,_\-]', s)
Alternative implementation:
p = '[%s]' % escape(',-_')
parts = split(p, s)
Alternative implementation:
d, parts, t = ',-_', [], 0
for i, x in enumerate(s):
    if x in d:
        parts.append(s[t:i])
        t = i + 1
parts.append(s[t:])
260
Declare a new list items of string elements, containing zero elements
var items = new List<string>();
Alternative implementation:
var items = Enumerable.Empty<string>();
items = []
261
Assign to the string x the value of fields (hours, minutes, seconds) of the date d, in format HH:MM:SS.
var x = date.ToString("HH:mm:ss");
d = datetime.datetime.now()
x = d.strftime('%H:%M:%S')
Alternative implementation:
d = datetime.now()
x = d.time().isoformat('seconds')
262
Assign to t the number of trailing 0 bits in the binary representation of the integer n.

E.g. for n=112, n is 1110000 in base 2 ⇒ t=4
var t = Convert.ToString(n, 2)
    .Reverse()
    .TakeWhile(i => i == '0')
    .Count();
Alternative implementation:
int t = 0;

if(n != 0)
{
    while((n & 1) == 0)
    {
        t++;
        n >>= 1;
    }
}
else
{
    t = 8 * sizeof(int);
}
t = bin(n)[::-1].find('1')
Alternative implementation:
b = len(s := format(n, 'b'))
t = b - len(s.rstrip('0'))
266
Assign to the string s the value of the string v repeated n times, and write it out.

E.g. v="abc", n=5 ⇒ s="abcabcabcabcabc"
var sb = new StringBuilder();
for(var i = 0; i < n; i++)
	sb.Append(v);

var s = sb.ToString();
Alternative implementation:
var s = string.Concat(Enumerable.Repeat(v, n));
Alternative implementation:
string s = string.Create(v.Length * n, (v, n), static (span, state) =>
{
    var (v, n) = state;
    var originSpan = v.AsSpan();
    for (var i = 0; i < n; i++)
    {
        var subSpan = span[(i * originSpan.Length)..];
        originSpan.CopyTo(subSpan);
    }
});
s = v * n
Alternative implementation:
s = ''.join(repeat(v, n))
267
Declare an argument x to a procedure foo that can be of any type. If the type of the argument is a string, print it, otherwise print "Nothing."

Test by passing "Hello, world!" and 42 to the procedure.
void foo(object x)
{
    if (x is string s)
    {
        Console.WriteLine(s);
    }
    else
    {
        Console.WriteLine("Nothing.");
    }
}

foo("Hello, world!");
foo(42);
Alternative implementation:
void foo<T>(T x)
{
    if (x is string s)
    {
        Console.WriteLine(s);
    }
    else
    {
        Console.WriteLine("Nothing.");
    }
}

foo("Hello, world!");
foo(42);
def foo(x):
    if isinstance(x, str):
        print(x)
    else:
        print('Nothing.')
    return

foo('Hello, world!')
foo(42)
Alternative implementation:
foo = lambda x: \
    print(x if type(x) is str else 'Nothing.')
foo('Hello, world!')
foo(42)
268
Define a type vector containing three floating point numbers x, y, and z. Write a user-defined operator x that calculates the cross product of two vectors a and b.
record Vector(double X, double Y, double Z)
{
    public static Vector operator *(Vector a, Vector b)
    {
        return new(
            a.Y*b.Z - a.Z*b.Y,
            a.Z*b.X - a.X*b.Z,
            a.X*b.Y - a.Y*b.X
        );
    }
}
class Vector:
    def __init__(self, x, y, z):
        self.x = x
        self.y = y
        self.z = z
        return

    def __mul__(self, other):
        return Vector(self.y * other.z - self.z * other.y,
                      self.z * other.x - self.x * other.z,
                      self.x * other.y - self.y * other.x)

result = a * b
Alternative implementation:
class Vector:
    def __init__(self, x, y, z):
        self.a = x, y, z
    def __getitem__(self, i):
        return self.a[i]
    def __mul__(self, b):
        a = self.a
        return {
            'x': a[1] * b[2] - a[2] * b[1],
            'y': a[2] * b[0] - a[0] * b[2],
            'z': a[0] * b[1] - a[1] * b[0]
        }
a = Vector(.1, .2, .3)
b = Vector(.4, .5, .6)
x = a * b
269
Given the enumerated type t with 3 possible values: bike, car, horse.
Set the enum value e to one of the allowed values of t.
Set the string s to hold the string representation of e (so, not the ordinal value).
Print s.
T e = T.Horse;
string s = e.ToString();
Console.WriteLine(s);
e = T.horse
s = e.name
print(s)
271
If a variable x passed to procedure tst is of type foo, print "Same type." If it is of a type that extends foo, print "Extends type." If it is neither, print "Not related."
public static void tst(Object x) {
  if (x.GetType() == typeof(foo))
    Console.WriteLine("Same type.");
  else if (x.GetType().IsAssignableTo(typeof(foo)))
    Console.WriteLine("Extends type.");
  else
    Console.WriteLine("Not related.");			
}
def tst(x):
    if type(x) == foo:
        print("Same type.")
    elif isinstance(x, foo):
        print("Extends type.")
    else:
        print("Not related.")
272
Fizz buzz is a children's counting game, and a trivial programming task used to affirm that a programmer knows the basics of a language: loops, conditions and I/O.

The typical fizz buzz game is to count from 1 to 100, saying each number in turn. When the number is divisible by 3, instead say "Fizz". When the number is divisible by 5, instead say "Buzz". When the number is divisible by both 3 and 5, say "FizzBuzz"
string FizzBuzzOrNumber(int number) => number switch {
    var n when n % 15 == 0 => "FizzBuzz",
    var n when n % 3 == 0 => "Fizz",
    var n when n % 5 == 0 => "Buzz",
    var n => n.ToString()
};

for (var i = 1; i <= 100; i++)
{
    Console.WriteLine(FizzBuzzOrNumber(i));
}
for i in range(1,101):
    if i % 15 == 0:
        print("FizzBuzz")
    elif i % 3 == 0:
        print("Fizz")
    elif i % 5 == 0:
        print("Buzz")
    else:
        print(i)
Alternative implementation:
n=1
while(n<=100):
    out=""
    if(n%3==0):
        out=out+"Fizz"
    if(n%5==0):
        out=out+"Buzz"
    if(out==""):
        out=out+str(n)
    print(out)
    n=n+1
Alternative implementation:
for i in range(100, 1):
    if i % 5 == 0 and not i % 3 == 0:
        print(i, "Buzz");
    if i % 3 == 0 and not i % 5 == 0:
        print(i, "Fizz");
    if i % 3 == 0 and i % 5 == 0:
        print(i, "FizzBuzz");
Alternative implementation:
for i in range(1, 100+1):
    out = ""
    if i % 3 == 0:
        out += "Fizz"
    if i % 5 == 0:
        out += "Buzz"
    print(out or i)
Alternative implementation:
s, a, b = '', 'Fizz', 'Buzz'
for x in range(1, 101):
    if not x % 3: s = a
    if not x % 5: s = s + b
    print(s or x)
    s = ''
274
Create the string t from the string s, removing all the spaces, newlines, tabulations, etc.
var t = new string(s.Where(c => !Char.IsWhiteSpace(c)).ToArray());
t = re.sub('\\s', '', s)
Alternative implementation:
t = ''.join(s.split())
Alternative implementation:
f = lambda x: x not in whitespace
t = ''.join(filter(f, s))
275
From the string s consisting of 8n binary digit characters ('0' or '1'), build the equivalent array a of n bytes.
Each chunk of 8 binary digits (2 possible values per digit) is decoded into one byte (256 possible values).
var a = Enumerable.Range(0, s.Length / 8)
        .Select(i => s.Substring(i * 8, 8).ToCharArray())
        .Select(block => (byte)block.Aggregate(0, (acc, c) => (acc << 1) + (c - '0')))
        .ToArray();
n = (len(s) - 1) // 8 + 1
a = bytearray(n)
for i in range(n):
    b = int(s[i * 8:(i + 1) * 8], 2)
    a[i] = b
Alternative implementation:
f = lambda x: int(s[x:x + 8], 2)
a = [*map(f, range(0, len(s), 8))]
Alternative implementation:
f = lambda x: int(''.join(x), 2)
a = [*map(f, batched(s, 8))]
Alternative implementation:
p = re.findall('.{8}', s)
a = [*map(lambda x: int(x, 2), p)]
Alternative implementation:
p = findall('.{8}', s)
a = bytes(int(x, 2) for x in p)
277
Remove the element e from the set x.

Explains what happens if e was already absent from x.
x.Remove(e);
x.remove(e)
278
Read one line into the string line.

Explain what happens if EOF is reached.
var line = Console.ReadLine();
line = sys.stdin.readline()
280
Remove all the elements from the map m that don't satisfy the predicate p.
Keep all the elements that do satisfy p.

Explain if the filtering happens in-place, i.e. if m is reused or if a new map is created.
m.Where(p);
m = {k:v for k, v in m.items() if p(v)}
Alternative implementation:
for k in list(m):
    if p(m[k]): m.pop(k)
Alternative implementation:
m = dict(filter(p, m.items()))
281
You have a Point with integer coordinates x and y. Create a map m with key type Point (or equivalent) and value type string. Insert "Hello" at position (42, 5).
m[new Point(x: 42, y: 5)] = "Hello";
m = dict()
p = Point(x=42, y=5)
m[p] = 'Hello'
Alternative implementation:
Point = namedtuple('Point', 'x y')

p = Point(42, 5)

m = {p: "Hello"}
Alternative implementation:
m = {Point(42, 5): 'Hello'}
Alternative implementation:
class Point:
    def __init__(self, x, y):
        self.x, self.y = x, y
    def __hash__(self):
        return hash((self.x, self.y))
    def __eq__(self, p):
        return self.x == p.x and \
               self.y == p.y
m = {Point(42, 5): 'Hello'}
284
Create a new list a (or array, or slice) of size n, where all elements are integers initialized with the value 0.
var a = new int[n];
a = [0] * n
Alternative implementation:
a = [*repeat(0, n)]
288
Set the boolean b to true if the set x contains the element e, false otherwise.
b = x.Contains(e);
b = e in x
289
Create the string s by concatenating the strings a and b.
string s = a + b;
Alternative implementation:
string s = String.Concat(a,b);
s = a + b
Alternative implementation:
s = f'{a}{b}'
294
Given an array a containing the three values 1, 12, 42, print out
"1, 12, 42" with a comma and a space after each integer except the last one.
Console.Write(string.Join(", ", a));
a = [1, 12, 42]
print(*a, sep=', ')
Alternative implementation:
print(a[0], end='')
for x in a[1:]:
    print(',', x, end='')
Alternative implementation:
print(', '.join(map(str, a)))
Alternative implementation:
f = lambda x, y: f'{x}, {y}'
print(reduce(f, a))
295
Given the enumerated type T, create a function TryStrToEnum that takes a string s as input and converts it into an enum value of type T.

Explain whether the conversion is case sensitive or not.
Explain what happens if the conversion fails.
static class StringToEnum {
  static bool TryStrToEnum<T>(
    string s, [NotNullWhen(true)] out T? eOut) where T : Enum {
    bool success = Enum.TryParse(typeof(T).GetType(), s, out var o);
    eOut = (T?)o;
    return success;
  }
}
t = T[s]
299
Write a line of comments.

This line will not be compiled or executed.
// This is a comment
# This is a comment
302
Given the integer x = 8, assign to the string s the value "Our sun has 8 planets", where the number 8 was evaluated from x.
var s = $"Our sun has {x} planets";
s = f'Our sun has {x} planets'
Alternative implementation:
s = 'Our sun has {} planets'.format(x)
Alternative implementation:
s = 'Our sun has %s planets' % x
304
Create the array of bytes data by encoding the string s in UTF-8.
byte[] data = Encoding.UTF8.GetBytes(s);
data = s.encode('utf8')
314
Set all the elements in the array x to the same value v
Array.Fill(x, v);
x[:] = [v] * len(x)
320
Set b to true if the string s is empty, false otherwise
var b = string.IsNullOrEmpty(s);
b = s == ''
Alternative implementation:
b = not s
326
Assign to t the number of milliseconds elapsed since 00:00:00 UTC on 1 January 1970.
var t = DateTime.UnixEpoch.Millisecond;
t = time.time() * 1000
327
Assign to t the value of the string s, with all letters mapped to their lower case.
var t = s.ToLower();
t = s.lower()
328
Assign to t the value of the string s, with all letters mapped to their upper case.
var t = s.ToUpper();
t = s.upper()
329
Assign to v the value stored in the map m for the key k.

Explain what happens if there is no entry for k in m.
var v = m[k];
v = m[k]
Alternative implementation:
v = m.get(k, "default value")
Alternative implementation:
v = m.get(k)
330
Create the list a containing all the values of the map m.

Ignore the keys of m. The order of a doesn't matter. a may contain duplicate values.
var a = m.Values.ToList();
a = list(m.values())
Alternative implementation:
a = [*m.values()]
331
Remove all entries from the map m.

Explain if other references to the same map now see an empty map as well.
m.Clear();
m.clear()
335
Create the map m containing all the elements e of the list a, using as key the field e.id.
var m = a.ToDictionary(e => e.id, e => e);
m = {e.id:e for e in a}
Alternative implementation:
m = dict((x.id, x) for x in a)
339
Set all the elements of the byte array a to zero
Array.Fill(a, (byte)0);
a = numpy.ones((n,), numpy.uint8)
a.fill(0)
340
Assign to c the value of the last character of the string s.

Explain the type of c, and what happens if s is empty.

Make sure to properly handle multi-bytes characters.
char c = s[^1];
c = s[-1]