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

Creative Commons Attribution-ShareAlike 3.0

Logo

Programming-Idioms.org

< Cheatsheets
  • The snippets are under the CC-BY-SA license.
  • Please consider keeping a bookmark
  • (instead of printing)
Go Rust
1
Print Hello World
Print a literal string on standard output 
fmt.Println("Hello World")
 
println!("Hello World");
2
Print Hello 10 times
Loop to execute some code a constant number of times 
for i := 0; i < 10; i++ {
	fmt.Println("Hello")
}
Alternative implementation:
fmt.Println(strings.Repeat("Hello\n", 10))
Alternative implementation:
for range 10 {
	fmt.Println("Hello")
}

for _ in 0..10 { println!("Hello"); }
Alternative implementation:
print!("{}", "Hello\n".repeat(10));
3
Create a procedure
Like a function which doesn't return any value, thus has only side effects (e.g. Print to standard output) 
func finish(name string) {
  fmt.Println("My job here is done. Good bye " + name)
}
Alternative implementation:
finish := func(name string) {
	fmt.Println("My job here is done. Good bye " + name)
}
 
fn finish(name: &str) {
    println!("My job here is done. Goodbye {}", name);
}
4
Create a function
Create a function which returns the square of an integer 
func square(x int) int {
  return x*x
}
 
fn square(x : u32) -> u32 { x * x }
5
Create a 2D Point data structure
Declare a container type for two floating-point numbers x and y 
type Point struct {
    x, y float64
}
 
struct Point {
    x: f64,
    y: f64,
}
Alternative implementation:
struct Point(f64, f64);
6
Iterate over list values
Do something with each item x of the list (or array) items, regardless indexes. 
for _, x := range items {
    doSomething(x)
}
 
for x in items {
	do_something(x);
}
Alternative implementation:
items.into_iter().for_each(|x| do_something(x));
7
Iterate over list indexes and values
Print each index i with its value x from an array-like collection items 
for i, x := range items {
    fmt.Printf("Item %d = %v \n", i, x)
}
 
for (i, x) in items.iter().enumerate() {
    println!("Item {} = {}", i, x);
}
Alternative implementation:
items.iter().enumerate().for_each(|(i, x)| {
    println!("Item {} = {}", i, x);
})
8
Create a map (associative array)
Create a new map object x, and provide some (key, value) pairs as initial content. 
x := map[string]int {"one": 1, "two": 2}
 
let mut x = BTreeMap::new();
x.insert("one", 1);
x.insert("two", 2);
Alternative implementation:
let x: HashMap<&str, i32> = [
    ("one", 1),
    ("two", 2),
].into_iter().collect();
9
Create a Binary Tree data structure
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. 
type BinTree struct {
	Label       valueType
	Left, Right *BinTree
}
Alternative implementation:
type BinTree[L any] struct {
	Label       L
	Left, Right *BinTree[L]
}
 
struct BinTree<T> {
    value: T,
    left: Option<Box<BinTree<T>>>,
    right: Option<Box<BinTree<T>>>,
}
10
Shuffle a list
Generate a random permutation of the elements of list x 
for i := range x {
	j := rand.Intn(i + 1)
	x[i], x[j] = x[j], x[i]
}
Alternative implementation:
y := make([]T, len(x))
perm := rand.Perm(len(x))
for i, v := range perm {
	y[v] = x[i]
}
Alternative implementation:
rand.Shuffle(len(x), func(i, j int) {
	x[i], x[j] = x[j], x[i]
})
Alternative implementation:
for i := len(x) - 1; i > 0; i-- {
	j := rand.Intn(i + 1)
	x[i], x[j] = x[j], x[i]
}
Alternative implementation:
func shuffle[T any](x []T) {
	rand.Shuffle(len(x), func(i, j int) {
		x[i], x[j] = x[j], x[i]
	})
}
 
let mut rng = StdRng::new().unwrap();
rng.shuffle(&mut x);
Alternative implementation:
let mut rng = thread_rng();
x.shuffle(&mut rng);
Alternative implementation:
pub fn shuffle<T>(vec: &mut [T]) {
    let n = vec.len();
    for i in 0..(n - 1) {
        let j = rand() % (n - i) + i;
        vec.swap(i, j);
    }
}

pub fn rand() -> usize {
    RandomState::new().build_hasher().finish() as usize
}
11
Pick a random element from a list
The list x must be non-empty. 
x[rand.Intn(len(x))]
Alternative implementation:
func pickT(x []T) T {
	return x[rand.Intn(len(x))]
}
Alternative implementation:
func pick[T any](x []T) T {
	return x[rand.Intn(len(x))]
}
 
x[rand::thread_rng().gen_range(0..x.len())]
Alternative implementation:
let mut rng = rand::thread_rng();
let choice = x.choose(&mut rng).unwrap();
12
Check if list contains a value
Check if the list contains the value x.
list is an iterable finite container. 
func Contains(list []T, x T) bool {
	for _, item := range list {
		if item == x {
			return true
		}
	}
	return false
}
Alternative implementation:
slices.Contains(list, x)
 
list.contains(&x);
Alternative implementation:
list.iter().any(|v| v == &x)
Alternative implementation:
(&list).into_iter().any(|v| v == &x)
Alternative implementation:
list.binary_search(&x).is_ok()
13
Iterate over map keys and values
Access each key k with its value x from an associative array mymap, and print them. 
for k, x := range mymap {
  fmt.Println("Key =", k, ", Value =", x)
}
 
for (k, x) in &mymap {
    println!("Key={key}, Value={val}", key=k, val=x);
}
14
Pick uniformly a random floating point number in [a..b)
Pick a random number greater than or equals to a, strictly inferior to b. Precondition : a < b. 
func pick(a, b  float64)  float64 {
	return a + (rand.Float64() * (b-a))
}
 
thread_rng().gen_range(a..b);
15
Pick uniformly a random integer in [a..b]
Pick a random integer greater than or equals to a, inferior or equals to b. Precondition : a < b. 
func pick(a,b int) int {
	return a + rand.Intn(b-a+1)
}
Alternative implementation:
func pick(a, b int) int {
	return a + rand.IntN(b-a+1)
}
 
fn pick(a: i32, b: i32) -> i32 {
    let between = Range::new(a, b);
    let mut rng = rand::thread_rng();
    between.ind_sample(&mut rng)
}
Alternative implementation:
Uniform::new_inclusive(a, b).sample(&mut rand::thread_rng())
16
Depth-first traversal of a binary tree
Call a function f on every node of binary tree bt, in depth-first infix order 
func (bt *BinTree) Dfs(f func(*BinTree)) {
	if bt == nil {
		return
	}
	bt.Left.Dfs(f)
	f(bt)
	bt.Right.Dfs(f)
}
Alternative implementation:
func (bt *BinTree[L]) Dfs(f func(*BinTree[L])) {
	if bt == nil {
		return
	}
	bt.Left.Dfs(f)
	f(bt)
	bt.Right.Dfs(f)
}
 
fn depthFirstTraverse<T>(bt: &mut BiTree<T>, f: fn(&mut BiTree<T>)) {
    if let Some(left) = &mut bt.left {
        depthFirstTraverse(left, f);
    }
    
    f(bt);
    
    if let Some(right) = &mut bt.right {
        depthFirstTraverse(right, f);
    }
}
17
Create a Tree data structure
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. 
type Tree struct {
	Key keyType
	Deco valueType
	Children []*Tree
}
Alternative implementation:
type Tree[L any] struct {
	Label    L
	Children []*Tree[L]
}
 
struct Node<T> {
  value: T,
  children: Vec<Node<T>>,
}
18
Depth-first traversal of a tree
Call a function f on every node of a tree, in depth-first prefix order 
func (t *Tree) Dfs(f func(*Tree)) {
	if t == nil {
		return
	}
	f(t)
	for _, child := range t.Children {
		child.Dfs(f)
	}
}
Alternative implementation:
func (t *Tree[L]) Dfs(f func(*Tree[L])) {
	if t == nil {
		return
	}
	f(t)
	for _, child := range t.Children {
		child.Dfs(f)
	}
}
 
pub struct Tree<V> {
    children: Vec<Tree<V>>,
    value: V
}

impl<V> Tree<V> {
    pub fn dfs<F: Fn(&V)>(&self, f: F) {
        self.dfs_helper(&f);
    }
    fn dfs_helper<F: Fn(&V)>(&self, f: &F) {
        (f)(&self.value);
        for child in &self.children {
            child.dfs_helper(f)
        }
    }
    // ...
}
19
Reverse a list
Reverse the order of the elements of the list x.
This may reverse "in-place" and destroy the original ordering. 
for i, j := 0, len(x)-1; i < j; i, j = i+1, j-1 {
	x[i], x[j] = x[j], x[i]
}
Alternative implementation:
func reverse[T any](x []T) {
	for i, j := 0, len(x)-1; i < j; i, j = i+1, j-1 {
		x[i], x[j] = x[j], x[i]
	}
}
Alternative implementation:
slices.Reverse(x)
 
let y: Vec<_> = x.into_iter().rev().collect();
Alternative implementation:
x.reverse();
20
Return two values
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. 
func search(m [][]int, x int) (bool, int, int) {
	for i := range m {
		for j, v := range m[i] {
			if v == x {
				return true, i, j
			}
		}
	}
	return false, 0, 0
}
 
fn search<T: Eq>(m: &Vec<Vec<T>>, x: &T) -> Option<(usize, usize)> {
    for (i, row) in m.iter().enumerate() {
        for (j, column) in row.iter().enumerate() {
            if *column == *x {
                return Some((i, j));
            }
        }
    }

    None
}
21
Swap values
Swap the values of the variables a and b
 
a, b = b, a
 
std::mem::swap(&mut a, &mut b);
Alternative implementation:
let (a, b) = (b, a);
22
Convert string to integer
Extract the integer value i from its string representation s (in radix 10) 
i, err  := strconv.Atoi(s)
Alternative implementation:
i, err := strconv.ParseInt(s, 10, 0)
 
let i = s.parse::<i32>().unwrap();
Alternative implementation:
let i: i32 = s.parse().unwrap_or(0);
Alternative implementation:
let i = match s.parse::<i32>() {
  Ok(i) => i,
  Err(_e) => -1,
};
23
Convert real number to string with 2 decimal places
Given a real number x, create its string representation s with 2 decimal digits following the dot. 
s := fmt.Sprintf("%.2f", x)
 
let s = format!("{:.2}", x);
24
Assign to string the japanese word ネコ
Declare a new string s and initialize it with the literal value "ネコ" (which means "cat" in japanese) 
s := "ネコ"
 
let s = "ネコ";
25
Send a value to another thread
Share the string value "Alan" with an existing running process which will then display "Hello, Alan" 
go func() {
	v := <-ch
	fmt.Printf("Hello, %v\n", v)
}()

ch <- "Alan"
 
let (send, recv) = channel();

thread::spawn(move || {
    loop {
        let msg = recv.recv().unwrap();
        println!("Hello, {:?}", msg);
    }  
});

send.send("Alan").unwrap();
26
Create a 2-dimensional array
Declare and initialize a matrix x having m rows and n columns, containing real numbers. 
const m, n = 3, 4
var x [m][n]float64
Alternative implementation:
func make2D(m, n int) [][]float64 {
	buf := make([]float64, m*n)

	x := make([][]float64, m)
	for i := range x {
		x[i] = buf[:n:n]
		buf = buf[n:]
	}
	return x
}
Alternative implementation:
func make2D[T any](m, n int) [][]T {
	buf := make([]T, m*n)

	x := make([][]T, m)
	for i := range x {
		x[i] = buf[:n:n]
		buf = buf[n:]
	}
	return x
}
 
let mut x = vec![vec![0.0f64; N]; M];
Alternative implementation:
let mut x = [[0.0; N] ; M];
27
Create a 3-dimensional array
Declare and initialize a 3D array x, having dimensions boundaries m, n, p, and containing real numbers. 
const m, n, p = 2, 2, 3
var x [m][n][p]float64
Alternative implementation:
func make3D(m, n, p int) [][][]float64 {
	buf := make([]float64, m*n*p)

	x := make([][][]float64, m)
	for i := range x {
		x[i] = make([][]float64, n)
		for j := range x[i] {
			x[i][j] = buf[:p:p]
			buf = buf[p:]
		}
	}
	return x
}
Alternative implementation:
func make3D[T any](m, n, p int) [][][]T {
	buf := make([]T, m*n*p)

	x := make([][][]T, m)
	for i := range x {
		x[i] = make([][]T, n)
		for j := range x[i] {
			x[i][j] = buf[:p:p]
			buf = buf[p:]
		}
	}
	return x
}
 
let x = vec![vec![vec![0.0f64; p]; n]; m];
Alternative implementation:
let x = [[[0.0f64; P]; N]; M];
28
Sort by a property
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. 
type ItemPSorter []Item
func (s ItemPSorter) Len() int{ return len(s) }
func (s ItemPSorter) Less(i,j int) bool{ return s[i].p<s[j].p }
func (s ItemPSorter) Swap(i,j int) { s[i],s[j] = s[j],s[i] }

func sortItems(items []Item){
	sorter := ItemPSorter(items)
	sort.Sort(sorter)
}
Alternative implementation:
less := func(i, j int) bool {
	return items[i].p < items[j].p
}
sort.Slice(items, less)
Alternative implementation:
compare := func(a, b Item) int {
	return cmp.Compare(a.p, b.p)
}
slices.SortFunc(items, compare)
 
items.sort_by(|a,b| a.p.cmp(&b.p));
Alternative implementation:
items.sort_by_key(|x| x.p);
29
Remove item from list, by its index
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 = append(items[:i], items[i+1:]...)
Alternative implementation:
copy(items[i:], items[i+1:])
items[len(items)-1] = nil
items = items[:len(items)-1]
Alternative implementation:
items = slices.Delete(items, i, i+1)
 
items.remove(i)
30
Parallelize execution of 1000 independent tasks
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. 
for i := range 1_000 {
	go f(i)
}
 
let threads: Vec<_> = (0..1000).map(|i| {
	thread::spawn(move || f(i))
}).collect();

for thread in threads {
	thread.join();
}
Alternative implementation:
(0..1000).into_par_iter().for_each(f);
31
Recursive factorial (simple)
Create the recursive function f which returns the factorial of the non-negative integer i, calculated from f(i-1) 
func f(i int) int {
  if i == 0 {
    return 1
  }
  return i * f(i-1)
}
 
fn f(n: u32) -> u32 {
    if n < 2 {
        1
    } else {
        n * f(n - 1)
    }
}
Alternative implementation:
fn factorial(num: u64) -> u64 {
    match num {
        0 | 1 => 1,
        _ => factorial(num - 1) * num,
    }
}
32
Integer exponentiation by squaring
Create function exp which calculates (fast) the value x power n.
x and n are non-negative integers. 
func exp(x, n int) int {
	switch {
	case n == 0:
		return 1
	case n == 1:
		return x
	case n%2 == 0:
		return exp(x*x, n/2)
	default:
		return x * exp(x*x, (n-1)/2)
	}
}
 
fn exp(x: u64, n: u64) -> u64 {
    match n {
        0 => 1,
        1 => x,
        i if i % 2 == 0 => exp(x * x, n / 2),
        _ => x * exp(x * x, (n - 1) / 2),
    }     
}
Alternative implementation:
fn exp(x: u64, n: u32) -> u64 {
    x.pow(n)
}
33
Atomically read and update variable
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. 
var lock sync.Mutex

lock.Lock()
x = f(x)
lock.Unlock()
 
let mut x = x.lock().unwrap();
*x = f(x);
34
Create a set of objects
Declare and initialize a set x containing unique objects of type T. 
x := make(map[T]bool)
Alternative implementation:
x := make(map[T]struct{})
 
let x: HashSet<T> = HashSet::new();
35
First-class function : compose
Implement a function compose (A -> C) with parameters f (A -> B) and g (B -> C), which returns the composition function g ∘ f 
func compose(f func(A) B, g func(B) C) func(A) C {
	return func(x A) C {
		return g(f(x))
	}
}
 
fn compose<'a, A, B, C, G, F>(f: F, g: G) -> Box<Fn(A) -> C + 'a>
	where F: 'a + Fn(A) -> B, G: 'a + Fn(B) -> C
{
	Box::new(move |x| g(f(x)))
}
Alternative implementation:
fn compose<A, B, C>(f: impl Fn(A) -> B, g: impl Fn(B) -> C) -> impl Fn(A) -> C {
    move |x| g(f(x))
}
36
First-class function : generic composition
Implement a function compose which returns composition function g ∘ f for any functions f and g having exactly 1 parameter. 
func composeIntFuncs(f func(int) int, g func(int) int) func(int) int {
	return func(x int) int {
		return g(f(x))
	}
}
Alternative implementation:
func compose[T, U, V any](f func(T) U, g func(U) V) func(T) V {
	return func(x T) V {
		return g(f(x))
	}
}
 
fn compose<'a, A, B, C, G, F>(f: F, g: G) -> Box<Fn(A) -> C + 'a>
	where F: 'a + Fn(A) -> B, G: 'a + Fn(B) -> C
{
	Box::new(move |x| g(f(x)))
}
Alternative implementation:
fn compose<A, B, C>(f: impl Fn(A) -> B, g: impl Fn(B) -> C) -> impl Fn(A) -> C {
    move |x| g(f(x))
}
37
Currying
Transform a function that takes multiple arguments into a function for which some of the arguments are preset. 
type PayFactory func(Company, *Employee, *Employee) Payroll

type CustomPayFactory func(*Employee) Payroll

func CurryPayFactory(pf PayFactory,company Company, boss *Employee) CustomPayFactory {
	return func(e *Employee) Payroll {
		return pf(company, boss, e)
	}
}
 
fn add(a: u32, b: u32) -> u32 {
    a + b
}

let add5 = move |x| add(5, x);
38
Extract a substring
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. 
t := string([]rune(s)[i:j])
 
let t = s.graphemes(true).skip(i).take(j - i).collect::<String>();
Alternative implementation:
let t = s.substring(i, j);
Alternative implementation:
let mut iter = s.grapheme_indices(true);
let i_idx = iter.nth(i).map(|x|x.0).unwrap_or(0);
let j_idx = iter.nth(j-i).map(|x|x.0).unwrap_or(0);
let t = s[i_idx..j_idx];
39
Check if string contains a word
Set the boolean ok to true if the string word is contained in string s as a substring, or to false otherwise. 
ok := strings.Contains(s, word)
 
let ok = s.contains(word);
40
Graph with adjacency lists
Declare a Graph data structure in which each Vertex has a collection of its neighbouring vertices. 
type Vertex struct{
	Id int
	Label string
	Neighbours map[*Vertex]bool
}

type Graph []*Vertex
Alternative implementation:
type Graph[L any] []*Vertex[L]

type Vertex[L any] struct {
	Label      L
	Neighbours map[*Vertex[L]]bool
}
41
Reverse a string
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. 
runes := []rune(s)
for i, j := 0, len(runes)-1; i < j; i, j = i+1, j-1 {
   runes[i], runes[j] = runes[j], runes[i]
}
t := string(runes)
Alternative implementation:
func reverse(s string) string {
	if len(s) <= 1 {
		return s
	}
	var b strings.Builder
	b.Grow(len(s))
	for len(s) > 0 {
		r, l := utf8.DecodeLastRuneInString(s)
		s = s[:len(s)-l]
		b.WriteRune(r)
	}
	return b.String()
}
Alternative implementation:
runes := []rune(s)
slices.Reverse(runes)
t := string(runes)
 
let t = s.chars().rev().collect::<String>();
Alternative implementation:
let t: String = s.chars().rev().collect();
42
Continue outer loop
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. 
mainloop:
	for _, v := range a {
		for _, w := range b {
			if v == w {
				continue mainloop
			}
		}
		fmt.Println(v)
	}
 
'outer: for va in &a {
    for vb in &b {
        if va == vb {
            continue 'outer;
        }
    }
    println!("{}", va);
}
43
Break outer loop
Look for a negative value v in 2D integer matrix m. Print it and stop searching. 
mainloop:
	for i, line := range m {
		for _, v := range line {
			if v < 0 {
				fmt.Println(v)
				break mainloop
			}
		}
	}
 
'outer: for v in m {
    'inner: for i in v {
        if i < 0 {
            println!("Found {}", i);
            break 'outer;
        }
    }
}
44
Insert element in list
Insert the element x at position i in the list s. Further elements must be shifted to the right. 
s = append(s, 0)
copy(s[i+1:], s[i:])
s[i] = x
Alternative implementation:
s = slices.Insert(s, i, x)
 
s.insert(i, x);
45
Pause execution for 5 seconds
Sleep for 5 seconds in current thread, before proceeding with the next instructions. 
time.Sleep(5 * time.Second)
 
thread::sleep(time::Duration::from_secs(5));
46
Extract beginning of string (prefix)
Create the string t consisting of the 5 first characters of the string s.
Make sure that multibyte characters are properly handled. 
t := s
r := []rune(s)
if len(r) > 5 {
	t = string(r[:5])
}
Alternative implementation:
i := 0
count := 0
for i = range s {
	if count >= 5 {
		break
	}
	count++
}
t := s
if count >= 5 {
	t = s[:i]
}
 
let t = s.char_indices().nth(5).map_or(s, |(i, _)| &s[..i]);
Alternative implementation:
let t = s.chars().take(5).collect::<String>();
47
Extract string suffix
Create string t consisting in the 5 last characters of string s.
Make sure that multibyte characters are properly handled. 
t := s
r := []rune(s)
if len(r) > 5 {
	t = string(r[len(r)-5:])
}
Alternative implementation:
i := len(s)
for j := 0; i > 0 && j < 5; j++ {
	_, size := utf8.DecodeLastRuneInString(s[0:i])
	i -= size
}
t := s[i:]
 
let last5ch = s.chars().count() - 5;
let t: String = s.chars().skip(last5ch).collect();
Alternative implementation:
let s = "a̐éö̲\r\n";
let t = s.grapheme_indices(true).rev().nth(5).map_or(s, |(i,_)|&s[i..]);
48
Multi-line string literal
Assign to variable s a string literal consisting in several lines of text, including newlines. 
s := `Huey
Dewey
Louie`
 
let s = "line 1
line 2
line 3";
Alternative implementation:
let s = r#"Huey
Dewey
Louie"#;
49
Split a space-separated string
Build list chunks consisting in substrings of the string s, separated by one or more space characters. 
chunks := strings.Split(s, " ")
Alternative implementation:
chunks := strings.Fields(s)
 
let chunks: Vec<_> = s.split_whitespace().collect();
Alternative implementation:
let chunks: Vec<_> = s.split_ascii_whitespace().collect();
Alternative implementation:
let chunks: Vec<_> = s.split(' ').collect();
50
Make an infinite loop
Write a loop that has no end clause. 
for {
	// Do something
}
 
loop {
	// Do something
}
51
Check if map contains key
Determine whether the map m contains an entry for the key k 
_, ok := m[k]
 
m.contains_key(&k)
52
Check if map contains value
Determine whether the map m contains an entry with the value v, for some key. 
func containsValue(m map[K]T, v T) bool {
	for _, x := range m {
		if x == v {
			return true
		}
	}
	return false
}
Alternative implementation:
func containsValue[M ~map[K]V, K, V comparable](m M, v V) bool {
	for _, x := range m {
		if x == v {
			return true
		}
	}
	return false
}
 
let does_contain = m.values().any(|&val| *val == v);
53
Join a list of strings
Concatenate elements of string list x joined by the separator ", " to create a single string y. 
y := strings.Join(x, ", ")
 
let y = x.join(", ");
54
Compute sum of integers
Calculate the sum s of the integer list or array x. 
s := 0
for _, v := range x {
	s += v
}
 
x.iter().sum()
Alternative implementation:
let s = x.iter().sum::<i32>();
55
Convert integer to string
Create the string representation s (in radix 10) of the integer value i. 
s := strconv.Itoa(i)
Alternative implementation:
s := strconv.FormatInt(i, 10)
Alternative implementation:
s := fmt.Sprintf("%d", i)
 
let s = i.to_string();
Alternative implementation:
let s = format!("{}", i);
56
Launch 1000 parallel tasks and wait for completion
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". 
var wg sync.WaitGroup
wg.Add(1_000)
for i := range 1_000 {
	go func() {
		f(i)
		wg.Done()
	}()
}
wg.Wait()
 
let threads: Vec<_> = (0..1000).map(|i| thread::spawn(move || f(i))).collect();

for t in threads {
	t.join();
}
57
Filter list
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. 
y := make([]T, 0, len(x))
for _, v := range x{
	if p(v){
		y = append(y, v)
	}
}
Alternative implementation:
n := 0
for _, v := range x {
	if p(v) {
		n++
	}
}
y := make([]T, 0, n)
for _, v := range x {
	if p(v) {
		y = append(y, v)
	}
}
Alternative implementation:
func filter[S ~[]T, T any](x S, p func(T) bool) S {
	var y S
	for _, v := range x {
		if p(v) {
			y = append(y, v)
		}
	}
	return y
}
Alternative implementation:
del := func(t *T) bool { return !p(t) }

y := slices.DeleteFunc(slices.Clone(x), del)
 
let y: Vec<_> = x.iter().filter(p).collect();
58
Extract file content to a string
Create the string lines from the content of the file with filename f. 
b, err := os.ReadFile(f)
if err != nil {
	// Handle error...
}
lines := string(b)
 
let mut file = File::open(f)?;
let mut lines = String::new();
file.read_to_string(&mut lines)?;
Alternative implementation:
let lines = fs::read_to_string(f).expect("Can't read file.");
59
Write to standard error stream
Print the message "x is negative" to standard error (stderr), with integer x value substitution (e.g. "-2 is negative"). 
fmt.Fprintln(os.Stderr, x, "is negative")
 
eprintln!("{} is negative", x);
60
Read command line argument
Assign to x the string value of the first command line parameter, after the program name. 
x := os.Args[1]
 
let first_arg = env::args().skip(1).next();

let fallback = "".to_owned();
let x = first_arg.unwrap_or(fallback);
Alternative implementation:
let x = env::args().nth(1).unwrap_or("".to_string());
61
Get current date
Assign to the variable d the current date/time value, in the most standard type. 
d := time.Now()
 
let d = time::now();
Alternative implementation:
let d = SystemTime::now();
62
Find substring position
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. 
i := strings.Index(x, y)
 
let i = x.find(y);
63
Replace fragment of a string
Assign to x2 the value of string x with all occurrences of y replaced by z.
Assume occurrences of y are not overlapping. 
x2 := strings.Replace(x, y, z, -1)
Alternative implementation:
x2 := strings.ReplaceAll(x, y, z)
 
let x2 = x.replace(&y, &z);
64
Big integer : value 3 power 247
Assign to x the value 3^247 
x := new(big.Int)
x.Exp(big.NewInt(3), big.NewInt(247), nil)
 
let a = 3.to_bigint().unwrap();
let x = num::pow(a, 247);
65
Format decimal number
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%" 
s := fmt.Sprintf("%.1f%%", 100.0*x)
 
let s = format!("{:.1}%", 100.0 * x);
66
Big integer exponentiation
Calculate the result z of x power n, where x is a big integer and n is a positive integer. 
nb := big.NewInt(int64(n))
var z big.Int
z.Exp(x, nb, nil)
 
let z = num::pow(x, n);
67
Binomial coefficient "n choose k"
Calculate binom(n, k) = n! / (k! * (n-k)!). Use an integer type able to handle huge numbers. 
z := new(big.Int)
z.Binomial(n, k)
 
fn binom(n: u64, k: u64) -> BigInt {
    let mut res = BigInt::one();
    for i in 0..k {
        res = (res * (n - i).to_bigint().unwrap()) /
              (i + 1).to_bigint().unwrap();
    }
    res
}
68
Create a bitset
Create an object x to store n bits (n being potentially large). 
var x *big.Int = new(big.Int)
Alternative implementation:
x := make([]bool, n)
Alternative implementation:
x := make([]uint64, (n+63)/64)
 
let mut x = vec![false; n];
69
Seed random generator
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. 
r := rand.New(rand.NewSource(s))
Alternative implementation:
r := rand.New(rand.NewPCG(s, s))
 
let s = 32;
let mut rng = StdRng::seed_from_u64(s);
70
Use clock as random generator seed
Get the current datetime and provide it as a seed to a random generator. The generator sequence will be different at each run. 
r := rand.New(rand.NewSource(time.Now().UnixNano()))
 
let d = SystemTime::now()
    .duration_since(SystemTime::UNIX_EPOCH)
    .expect("Duration since UNIX_EPOCH failed");
let mut rng = StdRng::seed_from_u64(d.as_secs());
71
Echo program implementation
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. 
func main() {
    fmt.Println(strings.Join(os.Args[1:], " "))
}
 
println!("{}", env::args().skip(1).collect::<Vec<_>>().join(" "));
Alternative implementation:
println!("{}", std::env::args().skip(1).format(" "));
73
Create a factory
Create a factory named fact for any sub class of Parent and taking exactly one string str as constructor parameter. 
type ParentFactory func(string) Parent

var fact ParentFactory = func(str string) Parent {
	return Parent{
		name: str,
	}
}
 
fn fact<Parent: std::str::FromStr>(str: String, _: Parent) -> Parent where <Parent as FromStr>::Err: Debug 
{
    return str.parse::<Parent>().unwrap();
}
74
Compute GCD
Compute the greatest common divisor x of big integers a and b. Use an integer type able to handle huge numbers. 
x.GCD(nil, nil, a, b)
 
let x = a.gcd(&b);
75
Compute LCM
Compute the least common multiple x of big integers a and b. Use an integer type able to handle huge numbers. 
gcd.GCD(nil, nil, a, b)
x.Div(a, gcd).Mul(x, b)
 
let x = a.lcm(&b);
76
Binary digits from an integer
Create the string s of integer x written in base 2.

E.g. 13 -> "1101" 
s := strconv.FormatInt(x, 2)
Alternative implementation:
s := fmt.Sprintf("%b", x)
 
let s = format!("{:b}", x);
Alternative implementation:
let s = format!("{x:b}");
77
Complex number
Declare a complex x and initialize it with value (3i - 2). Then multiply it by i. 
x := 3i - 2
x *= 1i
 
let mut x = Complex::new(-2, 3);
x *= Complex::i();
78
"do while" loop
Execute a block once, then execute it again as long as boolean condition c is true. 
for{
   someThing()
   someOtherThing()
   if !c {
     break
   }
}
Alternative implementation:
for done := false; !done; {
	someThing()
	someOtherThing()
	done = !c()
}
 
loop {
    doStuff();
    if !c { break; }
}
Alternative implementation:
while {
   doStuff();
   c
} { /* EMPTY */ }
79
Convert integer to floating point number
Declare the floating point number y and initialize it with the value of the integer x . 
y := float64(x)
 
let y = x as f64;
80
Truncate floating point number to integer
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). 
y := int(x)
 
let y = x as i32;
81
Round floating point number to integer
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). 
y := int(math.Floor(x + 0.5))
 
let y = x.round() as i64;
82
Count substring occurrences
Find how many times string s contains substring t.
Specify if overlapping occurrences are counted. 
x := strings.Count(s, t)
 
let c = s.matches(t).count();
83
Regex with character repetition
Declare the regular expression r matching the strings "http", "htttp", "httttp", etc. 
r := regexp.MustCompile("htt+p")
 
let r = Regex::new(r"htt+p").unwrap();
84
Count bits set in integer binary representation
Count number c of 1s in the integer i in base 2.

E.g. i=6 → c=2 
func PopCountUInt64(i uint64) (c int) {
	i -= (i >> 1) & 0x5555555555555555
	i = (i>>2)&0x3333333333333333 + i&0x3333333333333333
	i += i >> 4
	i &= 0x0f0f0f0f0f0f0f0f
	i *= 0x0101010101010101
	return int(i >> 56)
}

func PopCountUInt32(i uint32) (n int) {
	i -= (i >> 1) & 0x55555555
	i = (i>>2)&0x33333333 + i&0x33333333
	i += i >> 4
	i &= 0x0f0f0f0f
	i *= 0x01010101
	return int(i >> 24)
}
Alternative implementation:
c := bits.OnesCount(i)
 
let c = i.count_ones();
85
Check if integer addition will overflow
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. 
func addingWillOverflow(x int, y int) bool {
	if x > 0 {
		return y > math.MaxInt-x
	}
	return y < math.MinInt-x
}
 
fn adding_will_overflow(x: usize, y: usize) -> bool {
    x.checked_add(y).is_none()
}
86
Check if integer multiplication will overflow
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. 
func multiplyWillOverflow(x, y uint64) bool {
   if x <= 1 || y <= 1 {
     return false
   }
   d := x * y
   return d/y != x
}
 
fn multiply_will_overflow(x: i64, y: i64) -> bool {
    x.checked_mul(y).is_none()
}
87
Stop program
Exit immediately.
If some extra cleanup work is executed by the program runtime (not by the OS itself), describe it. 
os.Exit(0)
 
std::process::exit(0);
88
Allocate 1M bytes
Create a new bytes buffer buf of size 1,000,000. 
buf := make([]byte, 1_000_000)
 
let buf: Vec<u8> = Vec::with_capacity(1000000);
89
Handle invalid argument
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. 
return nil, fmt.Errorf("invalid value for x: %v", x)
 
enum CustomError { InvalidAnswer }

fn do_stuff(x: i32) -> Result<i32, CustomError> {
    if x != 42 {
        Err(CustomError::InvalidAnswer)
    } else {
        Ok(x)
    }
}
90
Read-only outside
Expose a read-only integer x to the outside world while being writable inside a structure or a class Foo. 
type Foo struct {
	x int
}

func (f *Foo) X() int {
	return f.x
}
 
struct Foo {
    x: usize
}

impl Foo {
    pub fn new(x: usize) -> Self {
        Foo { x }
    }

    pub fn x<'a>(&'a self) -> &'a usize {
        &self.x
    }

    pub fn bar(&mut self) {
        self.x += 1;
    }
}
91
Load JSON file into object
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. 
buffer, err := os.ReadFile("data.json")
if err != nil {
	return err
}
err = json.Unmarshal(buffer, &x)
if err != nil {
	return err
}
Alternative implementation:
r, err := os.Open(filename)
if err != nil {
	return err
}
decoder := json.NewDecoder(r)
err = decoder.Decode(&x)
if err != nil {
	return err
}
 
let x = ::serde_json::from_reader(File::open("data.json")?)?;
92
Save object into JSON file
Write the contents of the object x into the file data.json. 
buffer, err := json.MarshalIndent(x, "", "  ")
if err != nil {
	return err
}
err = os.WriteFile("data.json", buffer, 0644)
 
::serde_json::to_writer(&File::create("data.json")?, &x)?
93
Pass a runnable procedure as parameter
Implement the procedure control which receives one parameter f, and runs f. 
func control(f func()) {
	f()
}
 
fn control(f: impl Fn()) {
    f();
}
94
Print the type of a variable
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. 
fmt.Println(reflect.TypeOf(x))
Alternative implementation:
fmt.Printf("%T", x)
 
fn type_of<T>(_: &T) -> &'static str {
    std::intrinsics::type_name::<T>()
}

println!("{}", type_of(&x));
95
Get file size
Assign to variable x the length (number of bytes) of the local file at path. 
info, err := os.Stat(path)
if err != nil {
	return err
}
x := info.Size()
 
let x = fs::metadata(path)?.len();
Alternative implementation:
let x = path.metadata()?.len();
Alternative implementation:
let x = fs::metadata(path)?.st_size();
96
Check string prefix
Set the boolean b to true if string s starts with prefix prefix, false otherwise. 
b := strings.HasPrefix(s, prefix)
 
let b = s.starts_with(prefix);
97
Check string suffix
Set boolean b to true if string s ends with string suffix, false otherwise. 
b := strings.HasSuffix(s, suffix)
 
let b = s.ends_with(suffix);
98
Epoch seconds to date object
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 
d := time.Unix(ts, 0)
 
let d = NaiveDateTime::from_timestamp(ts, 0);
99
Format date YYYY-MM-DD
Assign to the string x the value of the fields (year, month, day) of the date d, in format YYYY-MM-DD. 
x := d.Format("2006-01-02")
 
Utc::today().format("%Y-%m-%d")
Alternative implementation:
let format = format_description!("[year]-[month]-[day]");
let x = d.format(&format).expect("Failed to format the date");
100
Sort by a comparator
Sort elements of array-like collection items, using a comparator c. 
type ItemCSorter []Item
func (s ItemCSorter) Len() int           { return len(s) }
func (s ItemCSorter) Less(i, j int) bool { return c(s[i], s[j]) }
func (s ItemCSorter) Swap(i, j int)      { s[i], s[j] = s[j], s[i] }

func sortItems(items []Item) {
	sorter := ItemCSorter(items)
	sort.Sort(sorter)
}
Alternative implementation:
type ItemsSorter struct {
	items []Item
	c     func(x, y Item) bool
}

func (s ItemsSorter) Len() int           { return len(s.items) }
func (s ItemsSorter) Less(i, j int) bool { return s.c(s.items[i], s.items[j]) }
func (s ItemsSorter) Swap(i, j int)      { s.items[i], s.items[j] = s.items[j], s.items[i] }

func sortItems(items []Item, c func(x, y Item) bool) {
	sorter := ItemsSorter{
		items,
		c,
	}
	sort.Sort(sorter)
}
Alternative implementation:
sort.Slice(items, func(i, j int) bool {
	return c(items[i], items[j])
})
Alternative implementation:
slices.SortFunc(items, c)
 
items.sort_by(c);
101
Load from HTTP GET request into a string
Make an HTTP request with method GET to the URL u, then store the body of the response in the string s. 
res, err := http.Get(u)
if err != nil {
	return err
}
buffer, err := io.ReadAll(res.Body)
res.Body.Close()
if err != nil {
	return err
}
s := string(buffer)
 
let client = Client::new();
let s = client.get(u).send().and_then(|res| res.text())?;
Alternative implementation:
let s = ureq::get(u).call().into_string()?;
Alternative implementation:
let mut response = reqwest::blocking::get(u)?;
let mut s = String::new();
response.read_to_string(&mut s)?;
102
Load from HTTP GET request into a file
Make an HTTP request with method GET to the URL u, then store the body of the response in the file result.txt. Try to save the data as it arrives if possible, without having all its content in memory at once. 
out, err := os.Create("result.txt")
if err != nil {
	return err
}
defer out.Close()

resp, err := http.Get(u)
if err != nil {
	return err
}
defer func() {
	io.Copy(io.Discard, resp.Body)
	resp.Body.Close()
}()
if resp.StatusCode != 200 {
	return fmt.Errorf("Status: %v", resp.Status)
}

_, err = io.Copy(out, resp.Body)
if err != nil {
	return err
}
 
let client = Client::new();
match client.get(&u).send() {
    Ok(res) => {
        let file = File::create("result.txt")?;
        ::std::io::copy(res, file)?;
    },
    Err(e) => eprintln!("failed to send request: {}", e),
};
103
Load XML file into struct
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. 
buffer, err := os.ReadFile("data.xml")
if err != nil {
	return err
}
err = xml.Unmarshal(buffer, &x)
if err != nil {
	return err
}
104
Save object into XML file
Write the contents of the object x into the file data.xml. 
buffer, err := xml.MarshalIndent(x, "", "  ")
if err != nil {
	return err
}
err = os.WriteFile("data.xml", buffer, 0644)
105
Current executable name
1 
path := os.Args[0]
s = filepath.Base(path)
Alternative implementation:
path, err := os.Executable()
if err != nil {
  panic(err)
}
s = filepath.Base(path)
 
fn get_exec_name() -> Option<String> {
    std::env::current_exe()
        .ok()
        .and_then(|pb| pb.file_name().map(|s| s.to_os_string()))
        .and_then(|s| s.into_string().ok())
}

fn main() -> () {
    let s = get_exec_name().unwrap();
    println!("{}", s);
}
Alternative implementation:
let s = std::env::current_exe()
    .expect("Can't get the exec path")
    .file_name()
    .expect("Can't get the exec name")
    .to_string_lossy()
    .into_owned();
106
Get program working directory
Assign to string dir the path of the working directory.
(This is not necessarily the folder containing the executable itself) 
dir, err := os.Getwd()
 
let dir = env::current_dir().unwrap();
107
Get folder containing current program
Assign to string dir the path of the folder containing the currently running executable.
(This is not necessarily the working directory, though.) 
programPath := os.Args[0]
absolutePath, err := filepath.Abs(programPath)
if err != nil {
	return err
}
dir := filepath.Dir(absolutePath)
 
let dir = std::env::current_exe()?
    .canonicalize()
    .expect("the current exe should exist")
    .parent()
    .expect("the current exe should be a file")
    .to_string_lossy()
    .to_owned();
109
Number of bytes of a type
Set n to the number of bytes of a variable t (of type T). 
var t T
tType := reflect.TypeOf(t)
n := tType.Size()
 
let n = std::mem::size_of::<T>();
110
Check if string is blank
Set the boolean blank to true if the string s is empty, or null, or contains only whitespace ; false otherwise. 
blank := strings.TrimSpace(s) == ""
 
let blank = s.trim().is_empty();
Alternative implementation:
let blank = s.chars().all(|c| c.is_whitespace());
111
Launch other program
From current process, run program x with command-line parameters "a", "b". 
err := exec.Command("x", "a", "b").Run()
 
let output = Command::new("x")
    .args(&["a", "b"])
    .spawn()
    .expect("failed to execute process");
Alternative implementation:
let output = Command::new("x")
        .args(&["a", "b"])
        .output()
        .expect("failed to execute process");
Alternative implementation:
let output = Command::new("x")
        .args(&["a", "b"])
        .status()
        .expect("failed to execute process");
112
Iterate over map entries, ordered by keys
Print each key k with its value x from an associative array mymap, in ascending order of k. 
keys := make([]string, 0, len(mymap))
for k := range mymap {
	keys = append(keys, k)
}
sort.Strings(keys)

for _, k := range keys {
	x := mymap[k]
	fmt.Println("Key =", k, ", Value =", x)
}
Alternative implementation:
keys := maps.Keys(mymap)
slices.Sort(keys)

for _, k := range keys {
	x := mymap[k]
	fmt.Println("Key =", k, ", Value =", x)
}
Alternative implementation:
keys := maps.Keys(mymap)
slices.SortFunc(keys, compare)

for _, k := range keys {
	x := mymap[k]
	fmt.Println("Key =", k, ", Value =", x)
}
 
for (k, x) in mymap {
    println!("({}, {})", k, x);
}
113
Iterate over map entries, ordered by values
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. 
type entry struct {
	key   string
	value int
}

type entries []entry
func (list entries) Len() int { return len(list) }
func (list entries) Less(i, j int) bool { return list[i].value < list[j].value }
func (list entries) Swap(i, j int) { list[i], list[j] = list[j], list[i] }

entries := make(entries, 0, len(mymap))
for k, x := range mymap {
	entries = append(entries, entry{key: k, values: x})
}
sort.Sort(entries)

for _, e := range entries {
	fmt.Println("Key =", e.key, ", Value =", e.value)
}
Alternative implementation:
type entry struct {
	key   string
	value int
}

entries := make([]entry, 0, len(mymap))
for k, x := range mymap {
	entries = append(entries, entry{key: k, value: x})
}
sort.Slice(entries, func(i, j int) bool {
	return entries[i].value < entries[j].value
})

for _, e := range entries {
	fmt.Println("Key =", e.key, ", Value =", e.value)
}
 
for (k, x) in mymap.iter().sorted_by_key(|x| x.1) {
	println!("[{},{}]", k, x);
}
Alternative implementation:
let mut items: Vec<_> = mymap.iter().collect();
items.sort_by_key(|item| item.1);
for (k, x) in items {
    println!("[{},{}]", k, x);
}
114
Test deep equality
Set boolean b to true if objects x and y contain the same values, recursively comparing all referenced elements in x and y.
Tell if the code correctly handles recursive types. 
b := reflect.DeepEqual(x, y)
 
let b = x == y;
115
Compare dates
Set boolean b to true if date d1 is strictly before date d2 ; false otherwise. 
b := d1.Before(d2)
 
let b = d1 < d2;
116
Remove occurrences of word from string
Remove all occurrences of string w from string s1, and store the result in s2. 
s2 := strings.Replace(s1, w, "", -1)
Alternative implementation:
s2 := strings.ReplaceAll(s1, w, "")
 
s2 = s1.replace(w, "");
Alternative implementation:
let s2 = str::replace(s1, w, "");
117
Get list size
Set n to the number of elements of the list x. 
n := len(x)
 
let n = x.len();
118
List to set
Create the set y from the list x.
x may contain duplicates. y is unordered and has no repeated values. 
y := make(map[T]struct{}, len(x))
for _, v := range x {
	y[v] = struct{}{}
}
Alternative implementation:
func sliceToSet[T comparable](x []T) map[T]struct{} {
	y := make(map[T]struct{}, len(x))
	for _, v := range x {
		y[v] = struct{}{}
	}
	return y
}
 
let y: HashSet<_> = x.into_iter().collect();
119
Deduplicate list
Remove duplicates from the list x.
Explain if the original order is preserved. 
y := make(map[T]struct{}, len(x))
for _, v := range x {
	y[v] = struct{}{}
}
x2 := make([]T, 0, len(y))
for _, v := range x {
	if _, ok := y[v]; ok {
		x2 = append(x2, v)
		delete(y, v)
	}
}
x = x2
Alternative implementation:
seen := make(map[T]bool)
j := 0
for _, v := range x {
	if !seen[v] {
		x[j] = v
		j++
		seen[v] = true
	}
}
x = x[:j]
Alternative implementation:
seen := make(map[T]bool)
j := 0
for _, v := range x {
	if !seen[v] {
		x[j] = v
		j++
		seen[v] = true
	}
}
for i := j; i < len(x); i++ {
	x[i] = nil
}
x = x[:j]
Alternative implementation:
func deduplicate[S ~[]T, T comparable](x S) S {
	seen := make(map[T]bool)
	j := 0
	for _, v := range x {
		if !seen[v] {
			x[j] = v
			j++
			seen[v] = true
		}
	}
	var zero T
	for i := j; i < len(x); i++ {
		// Avoid memory leak
		x[i] = zero
	}
	return x[:j]
}
Alternative implementation:
slices.Sort(x)
x = slices.Compact(x)

x.sort();
x.dedup();
Alternative implementation:
let dedup: Vec<_> = x.iter().unique().collect();
120
Read integer from stdin
Read an integer value from the standard input into the variable n 
_, err := fmt.Scan(&n)
Alternative implementation:
_, err := fmt.Scanf("%d", &n)
 
fn get_input() -> String {
    let mut buffer = String::new();
    std::io::stdin().read_line(&mut buffer).expect("Failed");
    buffer
}

let n = get_input().trim().parse::<i64>().unwrap();
Alternative implementation:
let mut input = String::new();
io::stdin().read_line(&mut input).unwrap();
let n: i32 = input.trim().parse().unwrap();
Alternative implementation:
let n: i32 = std::io::stdin()
    .lock()
    .lines()
    .next()
    .expect("stdin should be available")
    .expect("couldn't read from stdin")
    .trim()
    .parse()
    .expect("input was not an integer");
Alternative implementation:
let n: i32 = read!();
121
UDP listen and read
Listen UDP traffic on port p and read 1024 bytes into the buffer b. 
ServerAddr,err := net.ResolveUDPAddr("udp",p)
if err != nil {
	return err
}
ServerConn, err := net.ListenUDP("udp", ServerAddr)
if err != nil {
	return err
}
defer ServerConn.Close()
n,addr,err := ServerConn.ReadFromUDP(b[:1024])
if err != nil {
	return err
}
if n<1024 {
	return fmt.Errorf("Only %d bytes could be read.", n)
}
 
let mut b = [0 as u8; 1024];
let sock = UdpSocket::bind(("localhost", p)).unwrap();
sock.recv_from(&mut b).unwrap();
122
Declare an enumeration
Create an enumerated type Suit with 4 possible values SPADES, HEARTS, DIAMONDS, CLUBS. 
type Suit int

const (
  Spades Suit = iota
  Hearts
  Diamonds
  Clubs
)
 
enum Suit {
    Spades,
    Hearts,
    Diamonds,
    Clubs,
}
123
Assert condition
Verify that predicate isConsistent returns true, otherwise report assertion violation.
Explain if the assertion is executed even in production environment or not. 
if !isConsistent() {
	panic("State consistency violated")
}
 
assert!(is_consistent);
124
Binary search for a value in sorted array
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. 
func binarySearch(a []T, x T) int {
	imin, imax := 0, len(a)-1
	for imin <= imax {
		imid := imin + (imax-imin) / 2
		switch {
		case a[imid] == x:
			return imid
		case a[imid] < x:
			imin = imid + 1
		default:
			imax = imid - 1
		}
	}
	return -1
}
Alternative implementation:
func binarySearch(a []int, x int) int {
	i := sort.SearchInts(a, x)
	if i < len(a) && a[i] == x {
		return i
	}
	return -1
}
Alternative implementation:
func binarySearch(a []T, x T) int {
	f := func(i int) bool { return a[i] >= x }
	i := sort.Search(len(a), f)
	if i < len(a) && a[i] == x {
		return i
	}
	return -1
}
Alternative implementation:
func binarySearch(a []T, x T) int {
	if i, ok := slices.BinarySearch(a, x); ok {
		return i
	} else {
		return -1
	}
}
 
a.binary_search(&x).unwrap_or(-1);
125
Measure function call duration
measure the duration t, in nanoseconds, of a call to the function foo. Print this duration. 
t1 := time.Now()
foo()
t := time.Since(t1)
ns := int64(t / time.Nanosecond)
fmt.Printf("%dns\n", ns)
Alternative implementation:
t1 := time.Now()
foo()
t := time.Since(t1)
ns := t.Nanoseconds()
fmt.Printf("%dns\n", ns)
 
let start = Instant::now();
foo();
let duration = start.elapsed();
println!("{}", duration);
126
Multiple return values
Write a function foo that returns a string and a boolean value. 
func foo() (string, bool) {
	return "Too good to be", true
}
 
fn foo() -> (String, bool) {
    (String::from("bar"), true)
}
127
Source code inclusion
Import the source code for the function foo body from a file "foobody.txt". 
//go:embed foobody.txt
var s string


fn main() {
    include!("foobody.txt");
}
128
Breadth-first traversing of a tree
Call a function f on every node of a tree, in breadth-first prefix order 
func (root *Tree) Bfs(f func(*Tree)) {
	if root == nil {
		return
	}
	queue := []*Tree{root}
	for len(queue) > 0 {
		t := queue[0]
		queue = queue[1:]
		f(t)
		queue = append(queue, t.Children...)
	}
}
 
struct Tree<V> {
    children: Vec<Tree<V>>,
    value: V
}

impl<V> Tree<V> {
    fn bfs(&self, f: impl Fn(&V)) {
        let mut q = VecDeque::new();
        q.push_back(self);

        while let Some(t) = q.pop_front() {
            (f)(&t.value);
            for child in &t.children {
                q.push_back(child);
            }
        }
    }
}
129
Breadth-first traversal in a graph
Call the function f on every vertex accessible from the vertex start, in breadth-first prefix order 
func (start *Vertex) Bfs(f func(*Vertex)) {
	queue := []*Vertex{start}
	seen := map[*Vertex]bool{start: true}
	for len(queue) > 0 {
		v := queue[0]
		queue = queue[1:]
		f(v)
		for next, isEdge := range v.Neighbours {
			if isEdge && !seen[next] {
				queue = append(queue, next)
				seen[next] = true
			}
		}
	}
}
 
struct Vertex<V> {
	value: V,
	neighbours: Vec<Weak<RefCell<Vertex<V>>>>,
}

// ...

fn bft(start: Rc<RefCell<Vertex<V>>>, f: impl Fn(&V)) {
	let mut q = vec![start];
	let mut i = 0;
	while i < q.len() {
	    let v = Rc::clone(&q[i]);
	    i += 1;
	    (f)(&v.borrow().value);
	    for n in &v.borrow().neighbours {
	        let n = n.upgrade().expect("Invalid neighbour");
	        if q.iter().all(|v| v.as_ptr() != n.as_ptr()) {
	            q.push(n);
	        }
	    }
	}
}
130
Depth-first traversal in a graph
Call th function f on every vertex accessible from the vertex v, in depth-first prefix order 
func (v *Vertex) Dfs(f func(*Vertex), seen map[*Vertex]bool) {
	seen[v] = true
	f(v)
	for next, isEdge := range v.Neighbours {
		if isEdge && !seen[next] {
			next.Dfs(f, seen)
		}
	}
}
Alternative implementation:
func (v *Vertex[L]) Dfs(f func(*Vertex[L]), seen map[*Vertex[L]]bool) {
	seen[v] = true
	f(v)
	for next, isEdge := range v.Neighbours {
		if isEdge && !seen[next] {
			next.Dfs(f, seen)
		}
	}
}
 
struct Vertex<V> {
	value: V,
	neighbours: Vec<Weak<RefCell<Vertex<V>>>>,
}

// ...

fn dft_helper(start: Rc<RefCell<Vertex<V>>>, f: &impl Fn(&V), s: &mut Vec<*const Vertex<V>>) {
	s.push(start.as_ptr());
	(f)(&start.borrow().value);
	for n in &start.borrow().neighbours {
		let n = n.upgrade().expect("Invalid neighbor");
		if s.iter().all(|&p| p != n.as_ptr()) {
			Self::dft_helper(n, f, s);
		}
	}
}
131
Successive conditions
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. 
switch {
case c1:
	f1()
case c2:
	f2()
case c3:
	f3()
}
 
if c1 { f1() } else if c2 { f2() } else if c3 { f3() }
Alternative implementation:
match true {
    _ if c1 => f1(),
    _ if c2 => f2(),
    _ if c3 => f3(),
    _ => (),
}
132
Measure duration of procedure execution
Run the procedure f, and return the duration of the execution of f. 
func clock(f func()) time.Duration {
	t := time.Now()
	f()
	return time.Since(t)
}
 
let start = Instant::now();
f();
let duration = start.elapsed();
133
Case-insensitive string contains
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. 
lowerS, lowerWord := strings.ToLower(s), strings.ToLower(word)
ok := strings.Contains(lowerS, lowerWord)
 
let re = Regex::new(&format!("(?i){}", regex::escape(word))).unwrap();
let ok = re.is_match(&s);
Alternative implementation:
let re =
    RegexBuilder::new(&regex::escape(word))
    .case_insensitive(true)
    .build().unwrap();

let ok = re.is_match(s);
Alternative implementation:
let ok = s.to_ascii_lowercase().contains(&word.to_ascii_lowercase());
134
Create a new list
Declare and initialize a new list items, containing 3 elements a, b, c. 
items := []T{a, b, c}
 
let items = vec![a, b, c];
135
Remove item from list, by its value
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. 
for i, y := range items {
	if y == x {
		items = append(items[:i], items[i+1:]...)
		break
	}
}
Alternative implementation:
for i, y := range items {
	if y == x {
		copy(items[i:], items[i+1:])
		items[len(items)-1] = nil
		items = items[:len(items)-1]
		break
	}
}
Alternative implementation:
func removeFirstByValue[S ~[]T, T comparable](items *S, x T) {
	for i, y := range *items {
		if y == x {
			*items = slices.Delete(*items, i, i+1)
			return
		}
	}
}
Alternative implementation:
func removeFirstByValue[S ~[]T, T comparable](items *S, x T) {
	if i := slices.Index(*items, x); i != -1 {
		*items = slices.Delete(*items, i, i+1)
	}
}
 
if let Some(i) = items.iter().position(|item| *item == x) {
    items.remove(i);
}
136
Remove all occurrences of a value from a list
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. 
items2 := make([]T, 0, len(items))
for _, v := range items {
	if v != x {
		items2 = append(items2, v)
	}
}
Alternative implementation:
j := 0
for i, v := range items {
	if v != x {
		items[j] = items[i]
		j++
	}
}
items = items[:j]
Alternative implementation:
j := 0
for i, v := range items {
	if v != x {
		items[j] = items[i]
		j++
	}
}
for k := j; k < len(items); k++ {
	items[k] = nil
}
items = items[:j]
Alternative implementation:
func removeAll[S ~[]T, T comparable](items *S, x T) {
	j := 0
	for i, v := range *items {
		if v != x {
			(*items)[j] = (*items)[i]
			j++
		}
	}
	var zero T
	for k := j; k < len(*items); k++ {
		(*items)[k] = zero
	}
	*items = (*items)[:j]
}
Alternative implementation:
items = slices.DeleteFunc(items, func(e T) bool {
	return e == x
})
 
items = items.into_iter().filter(|&item| item != x).collect();
Alternative implementation:
items.retain(|&item| item != x);
137
Check if string contains only digits
Set the boolean b to true if the string s contains only characters in the range '0'..'9', false otherwise. 
b := true
for _, c := range s {
	if c < '0' || c > '9' {
		b = false
		break
	}
}
Alternative implementation:
isNotDigit := func(c rune) bool { return c < '0' || c > '9' }
b := strings.ContainsFunc(s, isNotDigit) 
let chars_are_numeric: Vec<bool> = s.chars()
				.map(|c|c.is_numeric())
				.collect();
let b = !chars_are_numeric.contains(&false);
Alternative implementation:
let b = s.chars().all(char::is_numeric);
Alternative implementation:
let b = s.bytes().all(|c| c.is_ascii_digit());
138
Create temp file
Create a new temporary file on the filesystem. 
tmpfile, err := os.CreateTemp("", "")
 
let temp_dir = TempDir::new("prefix")?;
let temp_file = File::open(temp_dir.path().join("file_name"))?;
139
Create temp directory
Create a new temporary folder on filesystem, for writing. 
dir, err := os.MkdirTemp("", "")
 
let tmp = TempDir::new("prefix")?;
140
Delete map entry
Delete from map m the entry having key k.

Explain what happens if k is not an existing key in m. 
delete(m, k)
 
m.remove(&k);
141
Iterate in sequence over two lists
Iterate in sequence over the elements of the list items1 then items2. For each iteration print the element. 
for _, v := range items1 {
	fmt.Println(v)
}
for _, v := range items2 {
	fmt.Println(v)
}
 
for i in item1.iter().chain(item2.iter()) {
    print!("{} ", i);
}
142
Hexadecimal digits of an integer
Assign to string s the hexadecimal representation (base 16) of integer x.

E.g. 999 -> "3e7" 
s := strconv.FormatInt(x, 16)
Alternative implementation:
s := fmt.Sprintf("%x", x)
 
let s = format!("{:X}", x);
143
Iterate alternatively over two lists
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 i := 0; i < len(items1) || i < len(items2); i++ {
	if i < len(items1) {
		fmt.Println(items1[i])
	}
	if i < len(items2) {
		fmt.Println(items2[i])
	}
}
Alternative implementation:
for i := range min(len(items1), len(items2)) {
	fmt.Println(items1[i])
	fmt.Println(items2[i])

}
 
for pair in izip!(&items1, &items2) {
    println!("{}", pair.0);
    println!("{}", pair.1);
}
144
Check if file exists
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. 
_, err := os.Stat(fp)
b := !os.IsNotExist(err)
 
let b = std::path::Path::new(fp).exists();
145
Print log line with datetime
Print message msg, prepended by current date and time.

Explain what behavior is idiomatic: to stdout or stderr, and what the date format is. 
log.Println(msg)
 
eprintln!("[{}] {}", humantime::format_rfc3339_seconds(std::time::SystemTime::now()), msg);
146
Convert string to floating point number
Extract floating point value f from its string representation s 
f, err := strconv.ParseFloat(s, 64)
 
let f = s.parse::<f32>().unwrap();
Alternative implementation:
let f: f32 = s.parse().unwrap();
147
Remove all non-ASCII characters
Create string t from string s, keeping only ASCII characters 
re := regexp.MustCompile("[[:^ascii:]]")
t := re.ReplaceAllLiteralString(s, "")
Alternative implementation:
t := strings.Map(func(r rune) rune {
	if r > unicode.MaxASCII {
		return -1
	}
	return r
}, s)
 
let t = s.replace(|c: char| !c.is_ascii(), "");
Alternative implementation:
let t = s.chars().filter(|c| c.is_ascii()).collect::<String>();
148
Read list of integers from stdin
Read a list of integer numbers from the standard input, until EOF. 
var ints []int
s := bufio.NewScanner(os.Stdin)
s.Split(bufio.ScanWords)
for s.Scan() {
	i, err := strconv.Atoi(s.Text())
	if err == nil {
		ints = append(ints, i)
	}
}
if err := s.Err(); err != nil {
	return err
}
 
let mut string = String::new();
io::stdin().read_to_string(&mut string)?;
let result = string
    .lines()
    .map(i32::from_str)
    .collect::<Result<Vec<_>, _>>();
149
Rescue the princess
As an exception, this content is not under license CC BY-SA 3.0 like the rest of this website.
150
Remove trailing slash
Remove the last character from the string p, if this character is a forward slash / 
p = strings.TrimSuffix(p, "/")
 
if p.ends_with('/') { p.pop(); }
151
Remove string trailing path separator
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! 
sep := fmt.Sprintf("%c", os.PathSeparator)
p = strings.TrimSuffix(p, sep)
Alternative implementation:
sep := fmt.Sprintf("%c", filepath.Separator)
p = strings.TrimSuffix(p, sep)
 
let p = if ::std::path::is_separator(p.chars().last().unwrap()) {
    &p[0..p.len()-1]
} else {
    p
};
Alternative implementation:
p = p.strip_suffix(std::path::is_separator).unwrap_or(p);
152
Turn a character into a string
Create string s containing only the character c. 
s := fmt.Sprintf("%c", c)
 
let s = c.to_string();
153
Concatenate string with integer
Create the string t as the concatenation of the string s and the integer i. 
t := fmt.Sprintf("%s%d", s, i)
Alternative implementation:
t := s + strconv.Itoa(i)
 
let t = format!("{}{}", s, i);
Alternative implementation:
let t = format!("{s}{i}");
154
Halfway between two hex color codes
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. 
r1, _ := strconv.ParseInt(c1[1:3], 16, 0)
r2, _ := strconv.ParseInt(c2[1:3], 16, 0)
r := (r1 + r2) / 2

g1, _ := strconv.ParseInt(c1[3:5], 16, 0)
g2, _ := strconv.ParseInt(c2[3:5], 16, 0)
g := (g1 + g2) / 2

b1, _ := strconv.ParseInt(c1[5:7], 16, 0)
b2, _ := strconv.ParseInt(c2[5:7], 16, 0)
b := (b1 + b2) / 2

c := fmt.Sprintf("#%02X%02X%02X", r, g, b)
Alternative implementation:
var buf [7]byte
buf[0] = '#'
for i := 0; i < 3; i++ {
	sub1 := c1[1+2*i : 3+2*i]
	sub2 := c2[1+2*i : 3+2*i]
	v1, _ := strconv.ParseInt(sub1, 16, 0)
	v2, _ := strconv.ParseInt(sub2, 16, 0)
	v := (v1 + v2) / 2
	sub := fmt.Sprintf("%02X", v)
	copy(buf[1+2*i:3+2*i], sub)
}
c := string(buf[:])
 
"Too long for text box, see online demo"
155
Delete file
Delete from filesystem the file having path filepath. 
err := os.Remove(filepath)
 
let r = fs::remove_file(filepath);
156
Format integer with zero-padding
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 i ≥ 1000. 
s := fmt.Sprintf("%03d", i)
 
let s = format!("{:03}", i);
157
Declare constant string
Initialize a constant planet with string value "Earth". 
const planet = "Earth"
 
const PLANET: &str = "Earth";
158
Random sublist
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. 
y := make([]T, k)
perm := rand.Perm(len(x))
for i, v := range perm[:k] {
	y[i] = x[v]
}
 
let mut rng = &mut rand::thread_rng();
let y = x.choose_multiple(&mut rng, k).cloned().collect::<Vec<_>>();
159
Trie
Define a Trie data structure, where entries have an associated value.
(Not all nodes are entries) 
type Trie struct {
	c        rune
	children map[rune]*Trie
	isEntry  bool
	value    V
}
 
struct Trie {
    val: String,
    nodes: Vec<Trie>
}
160
Detect if 32-bit or 64-bit architecture
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 strconv.IntSize==32 {
	f32()
}
if strconv.IntSize==64 {
	f64()
}
 
match std::mem::size_of::<&char>() {
    4 => f32(),
    8 => f64(),
    _ => {}
}
Alternative implementation:
#[cfg(target_pointer_width = "64")]
f64();

#[cfg(target_pointer_width = "32")]
f32();
161
Multiply all the elements of a list
Multiply all the elements of the list elements by a constant c 
for i := range elements {
	elements[i] *= c
}
 
let elements = elements.into_iter().map(|x| c * x).collect::<Vec<_>>();
Alternative implementation:
elements.iter_mut().for_each(|x| *x *= c);
162
Execute procedures depending on options
execute bat if b is a program option and fox if f is a program option. 
var b = flag.Bool("b", false, "Do bat")
var f = flag.Bool("f", false, "Do fox")

func main() {
	flag.Parse()
	if *b {
		bar()
	}
	if *f {
		fox()
	}
}
 
if let Some(arg) = ::std::env::args().nth(1) {
    if &arg == "f" {
        fox();
    } else if &arg = "b" {
        bat();
    } else {
	eprintln!("invalid argument: {}", arg),
    }
} else {
    eprintln!("missing argument");
}
Alternative implementation:
if let Some(arg) = ::std::env::args().nth(1) {
    match arg.as_str() {
        "f" => fox(),
        "b" => box(),
        _ => eprintln!("invalid argument: {}", arg),
    };
} else {
    eprintln!("missing argument");
}
163
Print list elements by group of 2
Print all the list elements, two by two, assuming list length is even. 
for i := 0; i+1 < len(list); i += 2 {
	fmt.Println(list[i], list[i+1])
}
 
for pair in list.chunks(2) {
    println!("({}, {})", pair[0], pair[1]);
}
164
Open URL in the default browser
Open the URL s in the default browser.
Set the boolean b to indicate whether the operation was successful. 
b := open.Start(s) == nil
Alternative implementation:
var err error
switch runtime.GOOS {
case "linux":
	err = exec.Command("xdg-open", s).Start()
case "windows":
	err = exec.Command("rundll32", "url.dll,FileProtocolHandler", s).Start()
case "darwin":
	err = exec.Command("open", s).Start()
default:
	err = fmt.Errorf("unsupported platform")
}
b := err == nil
 
webbrowser::open(s).expect("failed to open URL");
165
Last element of list
Assign to the variable x the last element of the list items. 
x := items[len(items)-1]
 
let x = items[items.len()-1];
Alternative implementation:
let x = items.last().unwrap();
166
Concatenate two lists
Create the list ab containing all the elements of the list a, followed by all the elements of the list b. 
ab := append(a, b...)
Alternative implementation:
var ab []T
ab = append(append(ab, a...), b...)
Alternative implementation:
ab := make([]T, len(a)+len(b))
copy(ab, a)
copy(ab[len(a):], b)
 
let ab = [a, b].concat();
167
Trim prefix
Create the string t consisting of the string s with its prefix p removed (if s starts with p). 
t := strings.TrimPrefix(s, p)
 
let t = s.trim_start_matches(p);
Alternative implementation:
let t = if s.starts_with(p) { &s[p.len()..] } else { s };
Alternative implementation:
let t = s.strip_prefix(p).unwrap_or(s);
168
Trim suffix
Create string t consisting of string s with its suffix w removed (if s ends with w). 
t := strings.TrimSuffix(s, w)
 
let t = s.trim_end_matches(w);
Alternative implementation:
let t = s.strip_suffix(w).unwrap_or(s);
169
String length
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. 
n := utf8.RuneCountInString(s)
 
let n = s.chars().count();
170
Get map size
Set n to the number of elements stored in mymap.

This is not always equal to the map capacity. 
n := len(mymap)
 
let n = mymap.len();
171
Add an element at the end of a list
Append the element x to the list s. 
s = append(s, x)
 
s.push(x);
172
Insert an entry in a map
Insert value v for key k in map m. 
m[k] = v
 
m.insert(k, v);
173
Format a number with grouped thousands
Number will be formatted with a comma separator between every group of thousands. 
p := message.NewPrinter(language.English)
s := p.Sprintf("%d\n", 1000)
 
println!("{}", 1000.separated_string());
174
Make HTTP POST request
Make a HTTP request with method POST to the URL u 
response, err := http.Post(u, contentType, body)
Alternative implementation:
response, err := http.PostForm(u, formValues)
 
let client = reqwest::blocking::Client::new();
let mut response = client.post(u).body("abc").send()?;
175
Bytes to hex string
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). 
s := hex.EncodeToString(a)
Alternative implementation:
s := fmt.Sprintf("%x", a)
 
let s = a.encode_hex::<String>();
Alternative implementation:
let mut s = String::with_capacity(2 * n);
for byte in a {
    write!(s, "{:02X}", byte)?;
}
Alternative implementation:
let s = HEXLOWER.encode(&a);
Alternative implementation:
fn byte_to_hex(byte: u8) -> (u8, u8) {
    static HEX_LUT: [u8; 16] = [b'0', b'1', b'2', b'3', b'4', b'5', b'6', b'7', b'8', b'9', b'a', b'b', b'c', b'd', b'e', b'f'];

    let upper = HEX_LUT[(byte >> 4) as usize];
    let lower = HEX_LUT[(byte & 0xF) as usize];
    (lower, upper)
}

let utf8_bytes: Vec<u8> = a.iter().copied().flat_map(|byte| {
        let (lower, upper) = byte_to_hex(byte);
        [upper, lower]
    }).collect();
let s = unsafe { String::from_utf8_unchecked(utf8_bytes) };
176
Hex string to byte array
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). 
a, err := hex.DecodeString(s)
if err != nil {
	log.Fatal(err)
}
 
let a: Vec<u8> = Vec::from_hex(s).expect("Invalid Hex String");
Alternative implementation:
let a: Vec<u8> = decode(s).expect("Hex string should be valid");
Alternative implementation:
let a: Vec<u8> = HEXLOWER_PERMISSIVE.decode(&s.into_bytes()).unwrap();
177
Find files for a list of filename extensions
Construct a list L that contains all filenames that have the extension ".jpg" , ".jpeg" or ".png" in directory D and all its subdirectories. 
L := []string{}
err := filepath.Walk(D, func(path string, info os.FileInfo, err error) error {
	if err != nil {
		fmt.Printf("failure accessing a path %q: %v\n", path, err)
		return err
	}
	for _, ext := range []string{".jpg", ".jpeg", ".png"} {
		if strings.HasSuffix(path, ext) {
			L = append(L, path)
			break
		}
	}
	return nil
})
 
let d = Path::new("/path/to/D");
let l: Vec<PathBuf> = d
    .read_dir()?
    .filter_map(|f| f.ok())
    .filter(|f| match f.path().extension() {
        None => false,
        Some(ex) => ex == "jpg" || ex == "jpeg" || ex == "png"
    })
    .map(|f| f.path())
    .collect();
178
Check if point is inside rectangle
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. 
p := image.Pt(x, y)
r := image.Rect(x1, y1, x2, y2)
b := p.In(r)
 
struct Rect {
    x1: i32,
    x2: i32,
    y1: i32,
    y2: i32,
}

impl Rect {
    fn contains(&self, x: i32, y: i32) -> bool {
        return self.x1 < x && x < self.x2 && self.y1 < y && y < self.y2;
    }
}
179
Get center of a rectangle
Return the center c of the rectangle with coördinates(x1,y1,x2,y2) 
c := image.Pt((x1+x2)/2, (y1+y2)/2)
 
struct Rectangle {
    x1: f64,
    y1: f64,
    x2: f64,
    y2: f64,
}

impl Rectangle {
    pub fn center(&self) -> (f64, f64) {
	    ((self.x1 + self.x2) / 2.0, (self.y1 + self.y2) / 2.0)
    }
}
180
List files in directory
Create the list x containing the contents of the directory d.

x may contain files and subfolders.
No recursive subfolder listing. 
x, err := os.ReadDir(d)
 
let x = std::fs::read_dir(d).unwrap();
Alternative implementation:
let x = std::fs::read_dir(d)?.collect::<Result<Vec<_>, _>>()?;
182
Quine program
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. 
package main

import "fmt"

func main() {
	fmt.Printf("%s%c%s%c\n", s, 0x60, s, 0x60)
}

var s = `package main

import "fmt"

func main() {
	fmt.Printf("%s%c%s%c\n", s, 0x60, s, 0x60)
}

var s = `
 
fn main() {
    let x = "fn main() {\n    let x = ";
    let y = "print!(\"{}{:?};\n    let y = {:?};\n    {}\", x, x, y, y)\n}\n";
    print!("{}{:?};
    let y = {:?};
    {}", x, x, y, y)
}
Alternative implementation:
fn main(){print!("{},{0:?})}}","fn main(){print!(\"{},{0:?})}}\"")}
183
Make HTTP PUT request
Make a HTTP request with method PUT to the URL u 
req, err := http.NewRequest("PUT", u, body)
if err != nil {
	return err
}
req.Header.Set("Content-Type", contentType)
req.ContentLength = contentLength
response, err := http.DefaultClient.Do(req)
184
Tomorrow
Assign to t a string representing the day, month and year of the day after the current date. 
t := time.Now().Add(24 * time.Hour).Format("2006-01-02")
 
let t = chrono::Utc::now().date().succ().to_string();
185
Execute function in 30 seconds
Schedule the execution of f(42) in 30 seconds. 
timer := time.AfterFunc(
	30*time.Second,
	func() {
		f(42)
	})
Alternative implementation:
go func() {
	time.Sleep(30 * time.Second)
	f(42)
}()
 
sleep(Duration::new(30, 0));
f(42);
186
Exit program cleanly
Exit a program cleanly indicating no error to OS 
os.Exit(0)
Alternative implementation:
defer os.Exit(0)
 
exit(0);
188
Matrix multiplication
Perform matrix multiplication of a real matrix a with nx rows and ny columns, a real matrix b with ny rows and nz columns and assign the value to a real matrix c with nx rows and nz columns. 
c := new(mat.Dense)
c.Mul(a, b)
 
let c = a.dot(&b);
189
Filter and transform list
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 []Result
for _, e := range x {
	if P(e) {
		y = append(y, T(e))
	}
}
 
let y = x.iter()
	.filter(P)
        .map(T)
	.collect::<Vec<_>>();
190
Call an external C function
Declare an external C function with the prototype

void foo(double *a, int n);

and call it, passing an array (or a list) of size 10 to a and 10 to n.

Use only standard features of your language. 
// void foo(double *a, int n);
// double a[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
import "C"

C.foo(C.a, 10)
 
extern "C" {
    /// # Safety
    ///
    /// `a` must point to an array of at least size 10
    fn foo(a: *mut libc::c_double, n: libc::c_int);
}

let mut a = [0.0, 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0];
let n = 10;
unsafe {
    foo(a.as_mut_ptr(), n);
}
191
Check if any value in a list is larger than a limit
Given a one-dimensional array a, check if any value is larger than x, and execute the procedure f if that is the case 
for _, v := range a {
	if v > x {
		f()
		break
	}
}
Alternative implementation:
if slices.ContainsFunc(a, func(i int) bool {
	return i > x
}) {
	f()
}
 
if a.iter().any(|&elem| elem > x) {
    f()
}
192
Declare a real variable with at least 20 digits
Declare a real variable a with at least 20 digits; if the type does not exist, issue an error at compile time. 
a, _, err := big.ParseFloat("123456789.123456789123465789", 10, 200, big.ToZero)
 
let a = Decimal::from_str("1234567890.123456789012345").unwrap();
193
Transpose a two-dimensional matrix
Declare two two-dimensional arrays a and b of dimension n*m and m*n, respectively. Assign to b the transpose of a (i.e. the value with index interchange). 
let a = DMatrix::<u8>::from_fn(n, m, |_, _| rand::thread_rng().gen());
let b = a.transpose();
195
Pass a two-dimensional array
Pass an array a of real numbers to the procedure (resp. function) foo. Output the size of the array, and the sum of all its elements when each element is multiplied with the array indices i and j (assuming they start from one). 
func foo(a [][]int) {
	fmt.Println("array is ", len(a)[0], " x ", len(a))
	x := 0
	for i, v1 := range a {
		for j, v2 := range v1 {
			x += v2*(i+1)*(j+1)
		}
	}
	fmt.Println("result: ", x)
}
 
fn foo(a: Vec<Vec<usize>>) {
    println!(
        "Length of array: {}",
        a.clone()
            .into_iter()
            .flatten()
            .collect::<Vec<usize>>()
            .len()
    );

    let mut sum = 0;
    for (i, j) in izip!(&a[0], &a[1]) {
        sum += i * j
    }

    println!("Sum of all products of indices: {}", sum);
}
196
Pass a sub-array
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. 
fn foo(el: &mut i32) {
    *el = 42;
}
a.iter_mut().take(m).step_by(2).for_each(foo);
197
Get a list of lines from a file
Retrieve the contents of file at path into a list of strings lines, in which each element is a line of the file. 
func readLines(path string) ([]string, error) {
	b, err := os.ReadFile(path)
	if err != nil {
		return nil, err
	}
	lines := strings.Split(string(b), "\n")
	return lines, nil
}
Alternative implementation:
func readLines(path string) ([][]byte, error) {
	b, err := os.ReadFile(path)
	if err != nil {
		return nil, err
	}
	lines := bytes.Split(b, []byte{'\n'})
	return lines, nil
}
 
let lines = BufReader::new(File::open(path).unwrap())
	.lines()
	.collect::<Vec<_>>();
198
Abort program execution with error condition
Abort program execution with error condition x (where x is an integer value) 
os.Exit(x)
 
process::exit(x);
199
Truncate a file at the current file position
Truncate a file F at the given file position. 
err := os.Truncate(F, position)
 
let pos = f.stream_position()?;
f.set_len(pos)?;
200
Return hypotenuse
Compute the hypotenuse h of the triangle where the sides adjacent to the square angle have lengths x and y. 
h := math.Hypot(x, y)
 
fn hypot(x:f64, y:f64)-> f64 {
    let num = x.powi(2) + y.powi(2);
    num.powf(0.5)
}
Alternative implementation:
let h = x.hypot(y);
201
Euclidean norm
Calculate n, the Euclidean norm of data, where data is a list of floating point values. 
func Euclidean(data []float64) float64 {
	n := 0.0
	for _, val := range data {
		n += val * val
	}
	return math.Sqrt(n)
 
fn euclidean(data: Vec<f64>) -> f64 {
    let mut n = 0.0;
    for i in data {
        n += i*i;
    }
    return sqrt(n as f64)
}
let n = euclidean(data);
202
Sum of squares
Calculate the sum of squares s of data, an array of floating point values. 
var s float64
for _, d := range data {
	s += math.Pow(d, 2)
}
 
let s = data.iter().map(|x| x.powi(2)).sum::<f32>();
203
Calculate mean and standard deviation
Calculate the mean m and the standard deviation s of the list of floating point values data. 
m, s := stat.MeanStdDev(data, nil)
 
let sum: f64 = data.iter().sum();
let m = sum / (data.len() as f64);
let sum_of_squares: f64 = data.iter().map(|item| (item - m) * (item - m)).sum();
let s = (sum_of_squares / (list.len() as f64)).sqrt();
204
Return fraction and exponent of a real number
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
 
fmt.Println(math.Frexp(a))
 
let sign = if a < 0.0 { a = -a; -1 } else { 1 };
let exponent = (a + f64::EPSILON).log2().ceil() as i32;
let fraction = a / 2.0f64.powi(exponent);
205
Get an environment variable
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". 
foo, ok := os.LookupEnv("FOO")
if !ok {
	foo = "none"
}
Alternative implementation:
foo := os.Getenv("FOO")
if foo == "" {
	foo = "none"
}
 
let foo = match env::var("FOO") {
    Ok(val) => val,
    Err(_e) => "none".to_string(),
};
Alternative implementation:
let foo = env::var("FOO").unwrap_or("none".to_string());
Alternative implementation:
let foo = match env::var("FOO") {
    Ok(val) => val,
    Err(_e) => "none".to_string(),
};
Alternative implementation:
if let Ok(tnt_root) = env::var("TNT_ROOT") {
     //
}
206
Switch statement with strings
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 "foo":
	foo()
case "bar":
	bar()
case "baz":
	baz()
case "barfl":
	barfl()
}
 
match str {
    "foo" => foo(),
    "bar" => bar(),
    "baz" => baz(),
    "barfl" => barfl(),
    _ => {}
}
207
Allocate a list that is automatically deallocated
Allocate a list a containing n elements (n assumed to be too large for a stack) that is automatically deallocated when the program exits the scope it is declared in. 
a := make([]T, n)
 
let a = vec![0; n];
208
Formula with arrays
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. 
func applyFormula(a, b, c, d []float64, e float64) {
	for i, v := range a {
		a[i] = e * (v + b[i] + c[i] + math.Cos(d[i]))
	}
}
 
for i in 0..a.len() {
    a[i] = e * (a[i] + b[i] * c[i] + d[i].cos());
}
209
Type with automatic deep deallocation
Declare a type t which contains a string s and an integer array n with variable size, and allocate a variable v of type t. Allocate v.s and v.n and set them to the values "Hello, world!" for s and [1,4,9,16,25], respectively. Deallocate v, automatically deallocating v.s and v.n (no memory leaks). 
type t struct {
	s string
	n []int
}

v := t{
	s: "Hello, world!",
	n: []int{1, 4, 9, 16, 25},
}
 
struct T {
	s: String,
	n: Vec<usize>,
}

fn main() {
	let v = T {
		s: "Hello, world!".into(),
		n: vec![1,4,9,16,25]
	};
}
210
Compiler version and options
Assign, at runtime, the compiler version and the options the program was compiled with to variables version and options, respectively, and print them. For interpreted languages, substitute the version of the interpreter.

Example output:

GCC version 10.0.0 20190914 (experimental)
-mtune=generic -march=x86-64
 
version := runtime.Version()
211
Create folder
Create the folder at path on the filesystem 
err := os.Mkdir(path, os.ModeDir)
Alternative implementation:
err := os.MkdirAll(path, os.ModeDir)
 
fs::create_dir(path)?;
Alternative implementation:
fs::create_dir_all(path)?;
212
Check if folder exists
Set the boolean b to true if path exists on the filesystem and is a directory; false otherwise. 
info, err := os.Stat(path)
b := !os.IsNotExist(err) && info.IsDir()
 
let b: bool = Path::new(path).is_dir();
213
Case-insensitive string compare
Compare four strings in pair-wise variations. The string comparison can be implemented with an equality test or a containment test, must be case-insensitive and must apply Unicode casefolding. 
for x in strings
    .iter()
    .combinations(2)
    .filter(|x| x[0].to_lowercase() == x[1].to_lowercase())
{
    println!("{:?} == {:?}", x[0], x[1])
}
214
Pad string on the right
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. 
if n := utf8.RuneCountInString(s); n < m {
	s += strings.Repeat(c, m-n)
}
 
let out = s.pad_to_width_with_char(m, c);
215
Pad string on the left
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. 
if n := utf8.RuneCountInString(s); n < m {
	s = strings.Repeat(c, m-n) + s
}
 
if let Some(columns_short) = m.checked_sub(s.width()) {
    let padding_width = c
        .width()
        .filter(|n| *n > 0)
        .expect("padding character should be visible");
    // Saturate the columns_short
    let padding_needed = columns_short + padding_width - 1 / padding_width;
    let mut t = String::with_capacity(s.len() + padding_needed);
    t.extend((0..padding_needed).map(|_| c)
    t.push_str(&s);
    s = t;
}
216
Pad a string on both sides
Add the extra character c at the beginning and ending of string s to make sure its length is at least m.
After the padding the original content of s should be at the center of the result.
The length is the number of characters, not the number of bytes.

E.g. with s="abcd", m=10 and c="X" the result should be "XXXabcdXXX". 
n := utf8.RuneCountInString(s)
if n < m {
	nleft := (m - n) / 2
	nright := (m - n) - nleft
	left, right := strings.Repeat(string(c), nleft), strings.Repeat(string(c), nright)
	s = left + s + right
}
 
let n = (m + s.len())/2;
s = format!("{s:X>n$}");
s = format!("{out:X<m$}");
Alternative implementation:
s = s.pad(m, c, Alignment::Middle, true);
217
Create a Zip archive
Create a zip-file with filename name and add the files listed in list to that zip-file. 
buf := new(bytes.Buffer)
w := zip.NewWriter(buf)
for _, filename := range list {
	input, err := os.Open(filename)
	if err != nil {
		return err
	}
	output, err := w.Create(filename)
	if err != nil {
		return err
	}
	_, err = io.Copy(output, input)
	if err != nil {
		return err
	}
}

err := w.Close()
if err != nil {
	return err
}

err = os.WriteFile(name, buf.Bytes(), 0777)
if err != nil {
	return err
}
 
let path = std::path::Path::new(_name);
let file = std::fs::File::create(&path).unwrap();
let mut zip = zip::ZipWriter::new(file); zip.start_file("readme.txt", FileOptions::default())?;                                                          
zip.write_all(b"Hello, World!\n")?;
zip.finish()?;
Alternative implementation:
fn zip(_name: &str, _list: Vec<&str>) -> zip::result::ZipResult<()>
{
    let path = std::path::Path::new(_name);
    let file = std::fs::File::create(&path).unwrap();
    let mut zip = zip::ZipWriter::new(file);
    for i in _list.iter() {
        zip.start_file(i as &str, FileOptions::default())?;
    }
    zip.finish()?;
    Ok(())
}
218
List intersection
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. 
seta := make(map[T]bool, len(a))
for _, x := range a {
	seta[x] = true
}
setb := make(map[T]bool, len(a))
for _, y := range b {
	setb[y] = true
}

var c []T
for x := range seta {
	if setb[x] {
		c = append(c, x)
	}
}
Alternative implementation:
func intersection[S ~[]T, T comparable](a, b S) S {
	seta := make(map[T]bool, len(a))
	for _, x := range a {
		seta[x] = true
	}
	setb := make(map[T]bool, len(b))
	for _, y := range b {
		setb[y] = true
	}

	var c S
	for x := range seta {
		if setb[x] {
			c = append(c, x)
		}
	}
	return c
}
Alternative implementation:
func intersection[S ~[]T, T comparable](a, b S) S {
	s, l := a, b
	if len(b) < len(a) {
		s, l = b, a
	}

	set := make(map[T]struct{}, len(s))
	for _, x := range s {
		set[x] = struct{}{}
	}

	c := make(S, 0, len(s))
	for _, x := range l {
		if _, found := set[x]; found {
			c = append(c, x)
			delete(set, x)
		}
	}
	return c
}
 
let unique_a = a.iter().collect::<HashSet<_>>();
let unique_b = b.iter().collect::<HashSet<_>>();

let c = unique_a.intersection(&unique_b).collect::<Vec<_>>();
Alternative implementation:
let set_a: HashSet<_> = a.into_iter().collect();
let set_b: HashSet<_> = b.into_iter().collect();
let c = set_a.intersection(&set_b);
219
Replace multiple spaces with single space
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. 
whitespaces := regexp.MustCompile(`\s+`)
t := whitespaces.ReplaceAllString(s, " ")
 
let re = Regex::new(r"\s+").unwrap();
let t = re.replace_all(s, " ");
220
Create a tuple value
Create t consisting of 3 values having different types.

Explain if the elements of t are strongly typed or not. 
t := []any{
	2.5,
	"hello",
	make(chan int),
}
Alternative implementation:
a, b, c := 2.5, "hello", make(chan int)
 
let t = (2.5, "hello", -1);
221
Remove all non-digits characters
Create string t from string s, keeping only digit characters 0, 1, 2, 3, 4, 5, 6, 7, 8, 9. 
re := regexp.MustCompile("[^\\d]")
t := re.ReplaceAllLiteralString(s, "")
 
let t: String = s.chars().filter(|c| c.is_digit(10)).collect();
222
Find the first index of an element in list
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. 
i := -1
for j, e := range items {
	if e == x {
		i = j
		break
	}
}
Alternative implementation:
i := slices.Index(items, x)
 
let opt_i = items.iter().position(|y| *y == x);


let i = match opt_i {
   Some(index) => index as i32,
   None => -1
};
Alternative implementation:
let i = items.iter().position(|y| *y == x).map_or(-1, |n| n as i32);
223
for else loop
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. 
for _, item := range items {
    if item == "baz" {
        fmt.Println("found it")
        goto exit
    }
}
{
    fmt.Println("not found")
}
exit:
 
let mut found = false;
for item in items {
    if item == &"baz" {
        println!("found it");
        found = true;
        break;
    }
}
if !found {
    println!("never found it");
}
Alternative implementation:
if let None = items.iter().find(|&&item| item == "rockstar programmer") {
        println!("NotFound");
    };
Alternative implementation:
items
    .iter()
    .find(|&&item| item == "rockstar programmer")
    .or_else(|| {
        println!("NotFound");
        Some(&"rockstar programmer")
    });
Alternative implementation:
if 'search: loop {
    for i in items {
        if i == &"qux" {
            println!("found it");
            break 'search false;
        }
    }
    break 'search true
} {
    println!("not found!");
}
Alternative implementation:
'label: {
	for &item in items {
		if item == "baz" {
			println!("found");
			break 'label;
		}
	}
	println!("not found");
}
224
Add element to the beginning of the list
Insert the element x at the beginning of the list items. 
items = append([]T{x}, items...)
Alternative implementation:
items = append(items, x)
copy(items[1:], items)
items[0] = x
Alternative implementation:
func prepend[S ~[]T, T any](items *S, x ...T) {
	*items = append(x, *items...)
}
Alternative implementation:
func prepend[S ~[]T, T any](items *S, x ...T) {
	*items = append(*items, x...)
	copy((*items)[len(x):], *items)
	copy(*items, x)
}
 
items.push_front(x);
225
Declare and use an optional argument
Declare an optional integer argument x to procedure f, printing out "Present" and its value if it is present, "Not present" otherwise 
func f(x ...int) {
	if len(x) > 0 {
		println("Present", x[0])
	} else {
		println("Not present")
	}
}
 
fn f(x: Option<()>) {
    match x {
        Some(x) => println!("Present {}", x),
        None => println!("Not present"),
    }
}
226
Delete last element from list
Remove the last element from the list items. 
items = items[:len(items)-1]
Alternative implementation:
items = slices.Delete(items, len(items)-1, len(items))
 
items.pop();
227
Copy a list
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). 
y := make([]T, len(x))
copy(y, x)
Alternative implementation:
y := slices.Clone(x)
 
let y = x.clone();
228
Copy a file
Copy the file at path src to dst. 
func copy(dst, src string) error {
	data, err := os.ReadFile(src)
	if err != nil {
		return err
	}
	stat, err := os.Stat(src)
	if err != nil {
		return err
	}
	return os.WriteFile(dst, data, stat.Mode())
}
Alternative implementation:
func copy(dst, src string) error {
	data, err := os.ReadFile(src)
	if err != nil {
		return err
	}
	stat, err := os.Stat(src)
	if err != nil {
		return err
	}
	err = os.WriteFile(dst, data, stat.Mode())
	if err != nil {
		return err
	}
	return os.Chmod(dst, stat.Mode())
}
Alternative implementation:
func copy(dst, src string) error {
	f, err := os.Open(src)
	if err != nil {
		return err
	}
	defer f.Close()
	stat, err := f.Stat()
	if err != nil {
		return err
	}
	g, err := os.OpenFile(dst, os.O_WRONLY|os.O_CREATE|os.O_TRUNC, stat.Mode())
	if err != nil {
		return err
	}
	defer g.Close()
	_, err = io.Copy(g, f)
	if err != nil {
		return err
	}
	return os.Chmod(dst, stat.Mode())
}
 
fs::copy(src, dst).unwrap();
229
Cancel an operation
Interrupt an ongoing processing p. 
ctx, cancel := context.WithCancel(context.Background())
go p(ctx)

somethingElse()

cancel()
230
Timeout
Cancel an ongoing processing p if it has not finished after 5s. 
ctx, cancel := context.WithTimeout(context.Background(), 5*time.Second)
defer cancel()
p(ctx)
 
timeout(Duration::from_secs(5), p()).await;
231
Test if bytes are a valid UTF-8 string
Set b to true if the byte sequence s consists entirely of valid UTF-8 character code points, false otherwise. 
b := utf8.Valid(s)
 
let b = std::str::from_utf8(&bytes).is_ok();
232
Read a command line boolean flag
Print "verbose is true" if the flag -v was passed to the program command line, "verbose is false" otherwise. 
var verbose = flag.Bool("v", false, "verbose")
flag.Parse()
fmt.Println("verbose is", *verbose)
 
let matches = App::new("My Program")
                .arg(Arg::with_name("verbose")
                    .short("v")
                    .takes_value(false))
                .get_matches();
                   
if matches.is_present("verbose") {
    println!("verbose is true")
} else {
    println!("verbose is false")
}
233
Read a command line string flag
Print the value of the flag -country passed to the program command line, or the default value "Canada" if no such flag was passed. 
var country = flag.String("country", "Canada", "user home country")
flag.Parse()
fmt.Println("country is", *country)
234
Encode bytes to base64
Assign to the string s the standard base64 encoding of the byte array data, as specified by RFC 4648. 
s := base64.StdEncoding.EncodeToString(data)
 
let s = base64::encode(data);
235
Decode base64
Assign to byte array data the bytes represented by the base64 string s, as specified by RFC 4648. 
data, err := base64.StdEncoding.DecodeString(s)
 
let bytes = base64::decode(s).unwrap();
236
Large quotient
Initialize a quotient q = a/b of arbitrary precision. a and b are large integers. 
q := new(big.Rat)
q.SetString(str)
Alternative implementation:
q := new(big.Rat)
q.SetFrac(a, b)
Alternative implementation:
q := big.NewRat(a, b)
237
Xor integers
Assign to c the result of (a xor b) 
c := a ^ b
Alternative implementation:
c := new(big.Int)
c.Xor(a, b)
 
let c = a ^ b;
238
Xor byte arrays
Write in a new byte array c the xor result of byte arrays a and b.

a and b have the same size. 
c := make([]byte, len(a))
for i := range a {
	c[i] = a[i] ^ b[i]
}
Alternative implementation:
var c T
for i := range a {
	c[i] = a[i] ^ b[i]
}
 
let c: Vec<_> = a.iter().zip(b).map(|(x, y)| x ^ y).collect();
239
Find first regular expression match
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. 
re := regexp.MustCompile(`\b\d\d\d\b`)
x := re.FindString(s)
 
let re = Regex::new(r"\b\d\d\d\b").expect("failed to compile regex");
let x = re.find(s).map(|x| x.as_str()).unwrap_or("");
240
Sort 2 lists together
Lists a and b have the same length. Apply the same permutation to a and b to have them sorted based on the values of a. 
type sorter struct {
	k []K
	t []T
}

func (s *sorter) Len() int {
	return len(s.k)
}

func (s *sorter) Swap(i, j int) {
	s.k[i], s.k[j] = s.k[j], s.k[i]
	s.t[i], s.t[j] = s.t[j], s.t[i]
}

func (s *sorter) Less(i, j int) bool {
	return s.k[i] < s.k[j]
}

sort.Sort(&sorter{
	k: a,
	t: b,
})
 
let mut tmp: Vec<_> = a.iter().zip(b).collect();
tmp.as_mut_slice().sort_by_key(|(&x, _y)| x);
let (aa, bb): (Vec<i32>, Vec<i32>) = tmp.into_iter().unzip();
241
Yield priority to other threads
Explicitly decrease the priority of the current process, so that other execution threads have a better chance to execute now. Then resume normal execution and call the function busywork. 
runtime.Gosched()
busywork()
 
::std::thread::yield_now();
busywork();
242
Iterate over a set
Call a function f on each element e of a set x. 
for e := range x {
	f(e)
}
 
for item in &x {
    f(item);
}
243
Print list
Print the contents of the list or array a on the standard output. 
fmt.Println(a)
 
println!("{:?}", a)
244
Print a map
Print the contents of the map m to the standard output: keys and values. 
fmt.Println(m)
Alternative implementation:
fmt.Printf("%q", m)
 
println!("{:?}", m);
245
Print value of custom type
Print the value of object x having custom type T, for log or debug. 
fmt.Println(x)
 
println!("{:?}", x);
246
Count distinct elements
Set c to the number of distinct elements in the list items. 
distinct := make(map[T]bool)
for _, v := range items {
	distinct[v] = true
}
c := len(distinct)
Alternative implementation:
func count[T comparable](items []T) int {
	distinct := make(map[T]bool)
	for _, v := range items {
		distinct[v] = true
	}
	return len(distinct)
}
 
let c = items.iter().unique().count();
247
Filter list in-place
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. 
j := 0
for i, v := range x {
	if p(v) {
		x[j] = x[i]
		j++
	}
}
x = x[:j]
Alternative implementation:
j := 0
for i, v := range x {
	if p(v) {
		x[j] = x[i]
		j++
	}
}
for k := j; k < len(x); k++ {
	x[k] = nil
}
x = x[:j]
Alternative implementation:
func Filter[S ~[]T, T any](x *S, p func(T) bool) {
	j := 0
	for i, v := range *x {
		if p(v) {
			(*x)[j] = (*x)[i]
			j++
		}
	}
	var zero T
	for k := j; k < len(*x); k++ {
		(*x)[k] = zero
	}
	*x = (*x)[:j]
}
Alternative implementation:
del := func(t *T) bool { return !p(t) }

x = slices.DeleteFunc(x, del)
 
let mut j = 0;
for i in 0..x.len() {
    if p(x[i]) {
        x[j] = x[i];
        j += 1;
    }
}
x.truncate(j);
Alternative implementation:
x.retain(p);
248
Construct a 64-bit floating-point value
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). 
if s {
	m = -m
}
d := math.Ldexp(m, e)
 
let d = if s { -1.0 } else { 1.0 } * m as f64 * 2.0f64.powf(e as f64);
249
Declare and assign multiple variables
Define variables a, b and c in a concise way.
Explain if they need to have the same type. 
a, b, c := 42, "hello", 5.0
 
let (a, b, c) = (42, "hello", 5.0);
250
Pick a random value from a map
Choose a value x from map m.
m must not be empty. Ignore the keys. 
func pick(m map[K]V) V {
	k := rand.Intn(len(m))
	i := 0
	for _, x := range m {
		if i == k {
			return x
		}
		i++
	}
	panic("unreachable")
}
Alternative implementation:
func pick(m map[K]V) V {
	k := rand.Intn(len(m))
	for _, x := range m {
		if k == 0 {
			return x
		}
		k--
	}
	panic("unreachable")
}
Alternative implementation:
func pick[K comparable, V any](m map[K]V) V {
	k := rand.Intn(len(m))
	i := 0
	for _, x := range m {
		if i == k {
			return x
		}
		i++
	}
	panic("unreachable")
}
Alternative implementation:
import "sync"

var mu sync.RWMutex

func pick(m map[int]any) any {
	mu.RLock()
	defer mu.RUnlock()
	for _, v := range m {
		return v
	}
	return nil
}

let mut rng = rand::thread_rng();
let x = m.values().choose(&mut rng).expect("m is empty");
251
Parse binary digits
Extract integer value i from its binary string representation s (in radix 2)
E.g. "1101" -> 13 
i, err := strconv.ParseInt(s, 2, 0)
 
let i = i32::from_str_radix(s, 2).expect("Not a binary number!");
252
Conditional assignment
Assign to the variable x the string value "a" if calling the function condition returns true, or the value "b" otherwise. 
if condition() {
	x = "a"
} else {
	x = "b"
}
 
x = if condition() { "a" } else { "b" };
253
Print stack trace
Print the stack frames of the current execution thread of the program. 
debug.PrintStack()
 
let bt = Backtrace::new();
println!("{:?}", bt);
254
Replace value in list
Replace all exact occurrences of "foo" with "bar" in the string list x 
for i, v := range x {
	if v == "foo" {
		x[i] = "bar"
	}
}
Alternative implementation:
func replaceAll[T comparable](s []T, old, new T) {
	for i, v := range s {
		if v == old {
			s[i] = new
		}
	}
}

replaceAll(x, "foo", "bar")
 
for v in &mut x {
    if *v == "foo" {
        *v = "bar";
    }
}
255
Print a set
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. 
for _, v := range x {
	fmt.Println(v)
}
 
println!("{:?}", x);
256
Count backwards
Print the numbers 5, 4, ..., 0 (included), one line per number. 
for i := 5; i >= 0; i-- {
	fmt.Println(i)
}
 
(0..=5).rev().for_each(|i| println!("{}", i));
Alternative implementation:
for i in (0..=5).rev() {
    println!("{}", i);
}
257
Traverse list backwards
Print each index i and value x from the list items, from the last down to the first. 
for i := len(items) - 1; i >= 0; i-- {
	x := items[i]
	fmt.Printf("Item %d = %v \n", i, x)
}
 
for (i, item) in items.iter().enumerate().rev() {
    println!("{} = {}", i, *item);
}
Alternative implementation:
  for (i, x) in items.iter().rev().enumerate() {
    println!("{i} = {x}");
  }
258
Convert list of strings to list of integers
Convert the string values from list a into a list of integers b. 
b := make([]int, len(a))
var err error
for i, s := range a {
	b[i], err = strconv.Atoi(s)
	if err != nil {
		return err
	}
}
 
let b: Vec<i64> = a.iter().map(|x| x.parse::<i64>().unwrap()).collect();
Alternative implementation:
let b: Vec<i32> = a.iter().flat_map(|s| s.parse().ok()).collect();
259
Split on several separators
Build the list parts consisting of substrings of the input string s, separated by any of the characters ',' (comma), '-' (dash), '_' (underscore). 
re := regexp.MustCompile("[,\\-_]")
parts := re.Split(s, -1)
 
let parts: Vec<_> = s.split(&[',', '-', '_'][..]).collect();
260
Create an empty list of strings
Declare a new list items of string elements, containing zero elements 
var items []string
 
let items: Vec<String> = vec![];
261
Format time hours-minutes-seconds
Assign to the string x the value of fields (hours, minutes, seconds) of the date d, in format HH:MM:SS. 
x := d.Format("15:04:05")
 
let format = format_description!("[hour]:[minute]:[second]");
let x = d.format(&format).expect("Failed to format the time");
262
Count trailing zero bits
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 
t := bits.TrailingZeros(n)
 
let t = n.trailing_zeros();
263
Integer logarithm in base 2
Write two functions log2d and log2u, which calculate the binary logarithm of their argument n rounded down and up, respectively. n is assumed to be positive. Print the result of these functions for numbers from 1 to 12. 
fn log2d(n: f64) -> f64 {
    n.log2().floor()
}

fn log2u(n: f64) -> f64 {
    n.log2().ceil()
}

fn main() {
    for n in 1..=12 {
        let f = f64::from(n);
        println!("{} {} {}", n, log2d(f), log2u(f));
    }
}
264
Automated passing of array bounds
Pass a two-dimensional integer array a to a procedure foo and print the size of the array in each dimension. Do not pass the bounds manually. Call the procedure with a two-dimensional array. 
fn foo(matrix: &[Vec<i32>]) {
    let iter = matrix.iter();
    let (vertical, _) = iter.size_hint();
    let horizontal = iter
        .max()
        .expect("empty array!")
        .len();
    println!("{horizontal} by {vertical}");
}

fn main() {
    let matrix = vec![
        vec![1, 2, 3],
        vec![4, 5, 6],
    ];
    foo(&matrix);
}
Alternative implementation:
fn foo<const X: usize, const Y: usize>(_: [[i32;X];Y]) {
    println!("{} {}", Y, X);
}

let a = [
    [1, 2, 3],
    [4, 5, 6],
];
foo(a);
265
Even parity bit
Calculate the parity p of the integer variable i : 0 if it contains an even number of bits set, 1 if it contains an odd number of bits set. 
let p = i.count_ones() % 2;
266
Repeated string
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" 
s := strings.Repeat(v, n)
fmt.Println(s)
 
let s = v.repeat(n);
267
Pass string to argument that can be of any type
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. 
func foo(x any) {
	if s, ok := x.(string); ok {
		fmt.Println(s)
	} else {
		fmt.Println("Nothing.")
	}
}

func main() {
	foo("Hello, world!")
	foo(42)
}
 
fn foo(x: &dyn Any) {
    if let Some(s) = x.downcast_ref::<String>() {
        println!("{}", s);
    } else {
        println!("Nothing")
    }
}

fn main() {
    foo(&"Hello, world!".to_owned());
    foo(&42);
}
268
User-defined operator
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. 
struct Vector {
    x: f32,
    y: f32,
    z: f32,
}

impl Mul for Vector {
    type Output = Self;

    fn mul(self, rhs: Self) -> Self {
        Self {
            x: self.y * rhs.z - self.z * rhs.y,
            y: self.z * rhs.x - self.x * rhs.z,
            z: self.x * rhs.y - self.y * rhs.x,
        }
    }
}
269
Enum to String
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. 
let e = t::bike;
let s = format!("{:?}", e);

println!("{}", s);
271
Test for type extension
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." 
fn type_of<T>(_: &T) -> &str {
    std::any::type_name::<T>()
}


if type_of(&x) == type_of(&foo) {
    println!("x & foo -> same type");
} else {
    println!("x & foo -> not related");
}
272
Play FizzBuzz
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" 
for n:=1; n<=100; n++ {
	    out:=""
	    if n%3==0 {
		    out=out+"Fizz"
	    }
	    if n%5==0 {
		    out=out+"Buzz"
	    }
	    if out=="" {
		    out=out+strconv.Itoa(n)
	    }
	    fmt.Println(out)
    }
 
for i in 1..101 {
    match i {
        i if (i % 15) == 0 => println!("FizzBuzz"),
        i if (i % 3) == 0 => println!("Fizz"),
        i if (i % 5) == 0 => println!("Buzz"),
        _ => println!("{i}"),
    }
}
273
Check if folder is empty
Set the boolean b to true if the directory at filepath p is empty (i.e. doesn't contain any other files and directories) 
dir, err := os.Open(p)
if err != nil {
	panic(err)
}
defer dir.Close()
_, err = dir.Readdirnames(1)
b := err == io.EOF
 
let b = fs::read_dir(p).unwrap().count() == 0;
274
Remove all white space characters
Create the string t from the string s, removing all the spaces, newlines, tabulations, etc. 
t := strings.Map(func(r rune) rune {
	if unicode.IsSpace(r) {
		return -1
	}
	return r
}, s)
 
let t: String = s.chars().filter(|c| !c.is_whitespace()).collect();
275
Binary digits to byte array
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). 
n := len(s) / 8
a := make([]byte, n)
for i := range a {
	b, err := strconv.ParseInt(s[i*8:i*8+8], 2, 0)
	if err != nil {
		log.Fatal(err)
	}
	a[i] = byte(b)
}
 
let a: Vec<u8> = s.as_bytes()
    .chunks(8)
    .map(|chunk| unsafe {
        let chunk_str = std::str::from_utf8_unchecked(chunk);
        u8::from_str_radix(chunk_str, 2).unwrap_unchecked()
    })
    .collect();
276
Insert an element in a set
Insert an element e into the set x. 
x[e] = struct{}{}
Alternative implementation:
x[e] = true
 
x.insert(e);
277
Remove an element from a set
Remove the element e from the set x.

Explains what happens if e was already absent from x. 
delete(x, e)
Alternative implementation:
delete(x, e)
 
x.remove(e);
Alternative implementation:
x.take(e)
278
Read one line from the standard input
Read one line into the string line.

Explain what happens if EOF is reached. 
s := bufio.NewScanner(os.Stdin)
if ok := s.Scan(); !ok {
	log.Fatal(s.Err())
}
line := s.Text()
 
let mut buffer = String::new();
let mut stdin = io::stdin();
stdin.read_line(&mut buffer).unwrap();
279
Read list of strings from the standard input
Read all the lines (until EOF) into the list of strings lines. 
var lines []string
s := bufio.NewScanner(os.Stdin)
for s.Scan() {
	line := s.Text()
	lines = append(lines, line)
}
if err := s.Err(); err != nil {
	log.Fatal(err)
}
 
let lines = std::io::stdin().lock().lines().map(|x| x.unwrap()).collect::<Vec<String>>();
280
Filter map
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. 
for k, v := range m {
	if !p(v) {
		delete(m, k)
	}
}
Alternative implementation:
maps.DeleteFunc(m, func(k K, v V) bool {
	return !p(v)
})
 
m.retain(|_, &mut v| p(v));
281
Use a Point as a map key
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 := map[Point]string{}
p := Point{x: 42, y: 5}
m[p] = "Hello"
 
let mut map: HashMap<Point, String> = HashMap::new();
map.insert(Point { x: 42, y: 5 }, "Hello".into());
282
Use a custom type as map key
Declare a type Foo, and create a new map with Foo as key type.

Mention the conditions on Foo required to make it a possible map key type. 
type Foo struct {
	name string
	x, y int
}

m := make(map[Foo]string)
283
Split with a custom string separator
Build the list parts consisting of substrings of input string s, separated by the string sep. 
parts := strings.Split(s, sep)
 
let parts = s.split(sep);
Alternative implementation:
let parts = s.split(sep).collect::<Vec<&str>>();
Alternative implementation:
let parts: Vec<&str> = s.split(sep).collect();
284
Create a zeroed list of integers
Create a new list a (or array, or slice) of size n, where all elements are integers initialized with the value 0. 
a := make([]int, n)
 
let a = vec![0; n];
285
Set variable to NaN
Given two floating point variables a and b, set a to a to a quiet NaN and b to a signalling NaN. Use standard features of the language only, without invoking undefined behavior. 
let a: f64 = f64::NAN;
286
Iterate over characters of a string
Print a line "Char i is c" for each character c of the string s, where i is the character index of c in s (not the byte index).

Make sure that multi-byte characters are properly handled, and count for a single character. 
i := 0
for _, c := range s {
	fmt.Printf("Char %d is %c\n", i, c)
	i++
}
 
for (i, c) in s.chars().enumerate() {
    println!("Char {} is {}", i, c);
}
287
Number of bytes of a string
Assign to n the number of bytes in the string s.

This can be different from the number of characters. If n includes more bytes than the characters per se (trailing zero, length field, etc.) then explain it. One byte is 8 bits. 
n := len(s)
 
let n = s.len();
288
Check if set contains a value
Set the boolean b to true if the set x contains the element e, false otherwise. 
b := x[e]
Alternative implementation:
_, b := x[e]
 
let b = x.contains(&e);
289
Concatenate two strings
Create the string s by concatenating the strings a and b. 
s := a + b
 
let s = format!("{}{}", a, b);
Alternative implementation:
let s = a + b;
290
Sort sublist
Sort the part of the list items from index i (included) to index j (excluded), in place, using the comparator c.

Elements before i and after j must remain unchanged. 
sub := items[i:j]
sort.Slice(sub, func(a, b int) bool {
	return c(sub[a], sub[b])
})
Alternative implementation:
slices.SortFunc(items[i:j], c)
 
items[i..j].sort_by(c);
291
Remove sublist
Delete all the elements from index i (included) to index j (excluded) from the list items. 
copy(items[i:], items[j:])
for k, n := len(items)-j+i, len(items); k < n; k++ {
	items[k] = nil
}
items = items[:len(items)-j+i]
Alternative implementation:
items = append(items[:i], items[j:]...)
Alternative implementation:
items = slices.Delete(items, i, j)
 
items.drain(i..j)
292
Write "Ni Hao" in Chinese to standard output in UTF-8
Write "Hello World and 你好" to standard output in UTF-8.
 
fmt.Println("Hello World and 你好")
 
println!("Hello World and 你好")
293
Create a stack
Create a new stack s, push an element x, then pop the element into the variable y. 
type Stack[T any] struct {
	items []T
}

func (s *Stack[T]) Push(t T) {
	s.items = append(s.items, t)
}

func (s *Stack[T]) Pop() T {
	n := len(s.items)
	t := s.items[n-1]
	var zero T
	s.items[n-1] = zero
	s.items = s.items[:n-1]
	return t
}

var s = new(Stack[string])
s.Push(x)
y := s.Pop()
 
let mut s: Vec<T> = vec![];
s.push(x);
let y = s.pop().unwrap();
294
Print a comma-separated list of integers
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.
 
a := []int{1, 12, 42}

for i, j := range a {
	if i > 0 {
		fmt.Print(", ")
	}
	fmt.Print(j)
}
 
let a = [1, 12, 42];
println!("{}", a.map(|i| i.to_string()).join(", "))
295
String to Enum
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.
 
enum MyEnum {
    Foo,
    Bar,
    Baz,
}

impl FromStr for MyEnum{
    type Err =  String;

    fn from_str(s: &str) -> Result<Self, Self::Err> {
        match s.to_lowercase().as_str() {
            "foo" => Ok(MyEnum::Foo),
            "bar" => Ok(MyEnum::Bar),
            "baz" => Ok(MyEnum::Baz),
            _ => Err("Could not convert str to enum".to_string())
        }
    }
}
296
Replace last occurrence of substring
Assign to x2 the value of string x with the last occurrence of y replaced by z.
If y is not contained in x, then x2 has the same value as x. 
func replaceLast(x, y, z string) (x2 string) {
	i := strings.LastIndex(x, y)
	if i == -1 {
		return x
	}
	return x[:i] + z + x[i+len(y):]
}
297
Sort a list of strings, case-insensitively
Sort the string list data in a case-insensitive manner.

The sorting must not destroy the original casing of the strings. 
func lessCaseInsensitive(s, t string) bool {
	for {
		if len(t) == 0 {
			return false
		}
		if len(s) == 0 {
			return true
		}
		c, sizec := utf8.DecodeRuneInString(s)
		d, sized := utf8.DecodeRuneInString(t)

		lowerc := unicode.ToLower(c)
		lowerd := unicode.ToLower(d)

		if lowerc < lowerd {
			return true
		}
		if lowerc > lowerd {
			return false
		}

		s = s[sizec:]
		t = t[sized:]
	}
}

sort.Slice(data, func(i, j int) bool { return lessCaseInsensitive(data[i], data[j]) })
Alternative implementation:
sort.Slice(data, func(i, j int) bool {
	return strings.ToLower(data[i]) < strings.ToLower(data[j])
})
Alternative implementation:
slices.SortFunc(data, func(a, b string) int {
	return cmp.Compare(strings.ToLower(a), strings.ToLower(b))
})
298
Copy a map
Create the map y by cloning the map x.

y is a shallow copy, not a deep copy. 
y := make(map[K]V, len(x))
for k, v := range x {
	y[k] = v
}
Alternative implementation:
y := maps.Clone(x)
299
Comment out a single line
Write a line of comments.

This line will not be compiled or executed. 
// This is a comment
 
// This is a comment
301
Recursive Fibonacci sequence
Compute the Fibonacci sequence of n numbers using recursion.

Note that naive recursion is extremely inefficient for this task. 
func fibonacci(n int) int {
	if n <= 1 {
		return n
	}
	return fibonacci(n-1) + fibonacci(n-2)
} 
fn fib(n: i32) -> i32{
    if n < 2 {
        1
    }else{
        fib(n - 2) + fib(n - 1)
    }
}
302
String interpolation
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. 
s := fmt.Sprintf("Our sun has %d planets", x)
 
let s = format!("Our sun has {} planets", x);
Alternative implementation:
let s = format!("Our sun has {x} planets");
304
Encode string into UTF-8 bytes
Create the array of bytes data by encoding the string s in UTF-8. 
data := []byte(s)
 
let data = s.into_bytes();
306
Ensure list capacity
Preallocate memory in the list x for a minimum total capacity of 200 elements.

This is not possible in all languages. It is only meant as a performance optimization, should not change the length of x, and should not have any effect on correctness. 
if cap(x) < 200 {
	y := make([]T, len(x), 200)
	copy(y, x)
	x = y
}
Alternative implementation:
x = slices.Grow(x, 200)
 
x.reserve(200);
307
XOR encrypt/decrypt string
Create a function that XOR encrypts/decrypts a string 
fn xor(s: Vec<u8>, key: &[u8]) -> Vec<u8> {
    let mut b = key.iter().cycle();
    s.into_iter().map(|x| x ^ b.next().unwrap()).collect()
}
308
Integer to string in base b
Create the string representation s of the integer value n in base b.

18 in base 3 -> "200"
26 in base 5 -> "101"
121 in base 12 -> "a1"

 
s := strconv.FormatInt(int64(n), b)
 
let s = radix(n, b);
309
Clone a 2D array
Create the new 2-dimensional array y containing a copy of the elements of the 2-dimensional array x.

x and y must not share memory. Subsequent modifications of y must not affect x. 
buf := make([]T, m*n)
y = make([][]T, m)
for i := range y {
	y[i] = buf[:n:n]
	buf = buf[n:]
	copy(y[i], x[i])
}
Alternative implementation:
func clone2D[M ~[][]T, T any](in M) (out M) {
	if len(in) == 0 {
		return nil
	}

	m, n := len(in), len(in[0])

	buf := make([]T, m*n)

	out = make(M, m)
	for i := range out {
		out[i] = buf[:n:n]
		buf = buf[n:]
		copy(out[i], in[i])
	}
	return out
}
 
let y = x.clone();
310
Fill array with random bytes
Fill the byte array a with randomly generated bytes. 
_, err := rand.Read(a)
 
let mut rng = rand::thread_rng();
rng.fill(&mut a);
312
List equality
Set b to true if the lists p and q have the same size and the same elements, false otherwise. 
b := slices.Equal(p, q)
 
b = p == q;
313
Map equality
Set b to true if the maps m and n have the same key/value entries, false otherwise. 
b := maps.Equal(m, n)
314
Fill array with value
Set all the elements in the array x to the same value v 
for i := range x {
	x[i] = v
}
Alternative implementation:
func fill[T any](x []T, v T) {
	for i := range x {
		x[i] = v
	}
}
 
x.fill(v);
315
Memoization
Given any function f, create an object or function m that stores the results of f, and calls f only on inputs for which the result is not stored yet. 
func memoize[T comparable, U any](f func(T) U) func(T) U {
	memory := make(map[T]U)

	return func(t T) U {
		if u, seen := memory[t]; seen {
			return u
		}
		u := f(t)
		memory[t] = u
		return u
	}
}
316
Count occurrences in a list
Determine the number c of elements in the list x that satisfy the predicate p. 
c := 0
for _, v := range x {
	if p(v) {
		c++
	}
}
Alternative implementation:
func count[T any](x []T, p func(T) bool) int {
	c := 0
	for _, v := range x {
		if p(v) {
			c++
		}
	}
	return c
}
317
Random string
Create a string s of n characters having uniform random values out of the 62 alphanumeric values A-Z, a-z, 0-9 
const alphanum = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789"

func randomString(n int) string {
	a := make([]byte, n)
	for i := range a {
		a[i] = alphanum[rand.Intn(len(alphanum))]
	}
	return string(a)
}
Alternative implementation:
const alphanum = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789"

func randomString(n int, rng *rand.Rand) string {
	a := make([]byte, n)
	for i := range a {
		a[i] = alphanum[rng.Intn(len(alphanum))]
	}
	return string(a)
}
Alternative implementation:
var alphanum = []rune("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789")

func randomString(n int, rng *rand.Rand) string {
	a := make([]rune, n)
	for i := range a {
		a[i] = alphanum[rng.Intn(len(alphanum))]
	}
	return string(a)
}
 
fn random_string(n: usize) -> String {
    rand::thread_rng()
        .sample_iter(Alphanumeric)
        .take(n)
        .map(char::from)
        .collect()
}
Alternative implementation:
fn random_string(n: usize) -> String {
    Alphanumeric.sample_string(&mut rand::thread_rng(), n)
}
318
Cryptographically secure random number
Assign to the integer x a random number between 0 and 17 (inclusive), from a crypto secure random number generator. 
bi, err := rand.Int(rand.Reader, big.NewInt(18))
x := int(bi.Int64())
 
let mut rng = rand::thread_rng();
let x = rng.gen_range(0..18);
319
Generator function
Write a function g that behaves like an iterator.
Explain if it can be used directly in a for loop. 
func generator() chan int {
	ch := make(chan int, 16)
	go func() {
		defer close(ch)
		timeout := time.After(2 * time.Minute)
		
		for i := 0; i < 1024; i++ {
			select {
			case ch <- i:
			case <-timeout:
				return
			}
		}
	}()
	return ch
}
320
Test if string is empty
Set b to true if the string s is empty, false otherwise 
b := s == ""
 
b = s.is_empty()
321
Access character in string, by index
Assign to c the value of the i-th character of the string s.

Make sure to properly handle multi-byte characters. i is the character index, which may not be equal to the byte index. 
c := []rune(s)[i]
 
let c = s.chars().nth(i).expect("s is too short");
322
replace value of variable with new one and return old value 
old, x = x, new
 
std::mem::replace(&mut x, v);
323
Set HTTP request header
Make an HTTP request with method GET to the URL u, with the request header "accept-encoding: gzip", then store the body of the response in the buffer data. 
req, err := http.NewRequest("GET", u, nil)
if err != nil {
	return err
}
req.Header.Set("accept-encoding", "gzip")
res, err := http.DefaultClient.Do(req)
if err != nil {
	return err
}
data, err := io.ReadAll(res.Body)
res.Body.Close()
if err != nil {
	return err
}
324
Read HTTP response header
Set the string c to the (first) value of the header "cache-control" of the HTTP response res. 
c := res.Header.Get("cache-control")
325
Create a queue
Create a new queue q, then enqueue two elements x and y, then dequeue an element into the variable z. 
type Queue[T any] struct {
	items []T
}

func (q *Queue[T]) Enqueue(t T) {
	q.items = append(q.items, t)
}

func (q *Queue[T]) Dequeue() T {
	t := q.items[0]
	var zero T
	q.items[0] = zero
	q.items = q.items[1:]
	return t
}

q := new(Queue[string])
q.Enqueue(x)
q.Enqueue(y)
z := q.Dequeue()
 
let mut q = VecDeque::new();
q.push_back(x);
q.push_back(x);
let z = q.pop_front(); 
println!("1st item ~> {}",z.unwrap());
326
Milliseconds since Unix epoch
Assign to t the number of milliseconds elapsed since 00:00:00 UTC on 1 January 1970. 
t := time.Now().UnixMilli()
327
Convert string to lower case
Assign to t the value of the string s, with all letters mapped to their lower case. 
t := strings.ToLower(s)
 
let t = s.to_lowercase()
328
Convert string to upper case
Assign to t the value of the string s, with all letters mapped to their upper case. 
t := strings.ToUpper(s)
 
let t = s.to_uppercase();
329
Read value in a map
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. 
v := m[k]
Alternative implementation:
v, ok := m[k]
330
Map to list
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. 
a := make([]V, 0, len(m))
for _, v := range m {
	a = append(a, v)
}
Alternative implementation:
a := maps.Values(m)
 
let a = m.into_values().collect::<Vec<_>>();
331
Clear map
Remove all entries from the map m.

Explain if other references to the same map now see an empty map as well. 
clear(m)
332
List of the keys of a map
Create the list k containing all the keys of the map m 
k := maps.Keys(m)
Alternative implementation:
k := make([]K, 0, len(m))
for key := range m {
	k = append(k, key)
}
 
m.keys().collect::<Vec<_>>()
333
Pretty-print object in JSON
Print the object x in human-friendly JSON format, with newlines and indentation. 
buffer, err := json.MarshalIndent(x, "", "  ")
if err != nil {
	log.Fatal(err)
}
fmt.Println(string(buffer))
334
Combine 2 maps
Create the new map c containing all of the (key, value) entries of the two maps a and b.

Explain what happens for keys existing in both a and b. 
c := make(M, len(a)+len(b))
for k, v := range a {
	c[k] = v
}
for k, v := range b {
	c[k] = v
}
335
List to map
Create the map m containing all the elements e of the list a, using as key the field e.id. 
m := make(map[K]V, len(a))
for _, e := range a {
	m[e.id] = e
}
 
let mut m = HashMap::new();

for e in a {
	m.entry(e.id).or_insert_with(Vec::new).push(e);
}
336
Exponent
Compute x = b ⁿ

b raised to the power of n is equal to the product of n terms b × b × ... × b 
let x = b.pow(n)
337
Convert string to integer, explicit base
Extract the integer value i from its string representation s, in radix b 
i, err := strconv.ParseInt(s, b, 0)
339
Clear a byte array
Set all the elements of the byte array a to zero 
clear(a[:])
Alternative implementation:
clear(a)
 
a.fill(0);
340
Last character of string
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. 
r := []rune(s)
c := r[len(r)-1]
Alternative implementation:
c, _ := utf8.DecodeLastRuneInString(s)
 
let c = s.chars().last().unwrap();
341
Find substring last position
Set i to the position of the last occurrence of the string y inside the 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. 
i := strings.LastIndex(x, y)
 
let i = x.rfind(y);
342
Leap year?
Determine if the current year is a leap year. 
let leap_year = year % 4 == 0 && (year % 100 != 0 || year % 400 == 0);
343
Rename file
Rename the file at path1 into path2 
err := os.Rename(path1, path2)
344
Extract filename extension
Assign to ext the fragment of the string f after the last dot character, or the empty string if f does not contain a dot.

E.g. "photo.jpg" -> "jpg"

ext must not contain the dot character. 
ext := strings.TrimPrefix(filepath.Ext(f), ".")
345
Convert string to big integer
Create the integer value i initialized from its string representation s (in radix 10)

Use an integer type that can hold huge values. Explain what happens if s cannot be parsed. 
i := new(big.Int)
_, ok := i.SetString(s, 10)
346
Repeated list
Create the list y from the list x repeated n times 
94102
347
Copy folder
Copy the directory path1 to path2, with all its contents 
err := os.CopyFS(path2, os.DirFS(path1))
352
Parallelize 3 computations
Execute the functions f1, f2, f3 concurrently, and assign their respective return values to a1, a2, a3. 
var wg sync.WaitGroup
wg.Add(3)
go func() {
	a1 = f1()
	wg.Done()
}()
go func() {
	a2 = f2()
	wg.Done()
}()
go func() {
	a3 = f3()
	wg.Done()
}()
wg.Wait()
353
Test if list is sorted
Set the boolean b to true if the list items has all its elements in increasing order, false otherwise.

The order is not strict: the ordered list may contain duplicate elements. 
b := slices.IsSorted(items)
354
Increment map entry
Set the value for the key k in the map m to 1 if the entry doesn't exist yet in m, or increment the entry value if it already exists. 
m[k]++
355
Absolute value
Assign to y the absolute value of the number n 
y := math.Abs(x)
Alternative implementation:
y := new(big.Float)
y.Abs(x)
Alternative implementation:
y := new(big.Int)
y.Abs(x)
Alternative implementation:
y := x
if y < 0 {
	y = -x
}
356
Parse list of integers
Create the list of integers items for the string s containing integers separated by one or more whitespace characters (space, tab, newline). 
parts := strings.Fields(s)
items := make([]int, len(parts))
for i, part := range parts {
	v, err := strconv.Atoi(part)
	if err != nil {
		return err
	}
	items[i] = v
}
357
Swap elements of list
Swap the elements at indices i, j in the list items 
items[i], items[j] = items[j], items[i]
 
items.swap(i, j);
359
Euclidean division
Set q and r to the quotient and the remainder of the integer a divided by the integer b, such that a = b * q + r.

a is the dividend, b is the divisor.

E.g. a=31, b=7 ⟶ q=4, r=3 
q := new(big.Int)
r := new(big.Int)
q.DivMod(a, b, r)