- The snippets are under the CC-BY-SA license.
- Please consider keeping a bookmark
- (instead of printing)
Python | Go | |||
---|---|---|---|---|
1 |
Print a literal string on standard output
|
|
||
2 |
Loop to execute some code a constant number of times
|
|
||
3 |
Like a function which doesn't return any value, thus has only side effects (e.g. Print to standard output)
|
|
Alternative implementation:
|
|
4 |
Create a function which returns the square of an integer
|
|
||
5 |
Declare a container type for two floating-point numbers x and y
|
Alternative implementation:
|
|
|
6 |
Do something with each item x of the list (or array) items, regardless indexes.
|
|
|
|
7 |
Print each index i with its value x from an array-like collection items
|
|
||
8 |
Create a new map object x, and provide some (key, value) pairs as initial content.
|
|
||
9 |
The structure must be recursive because left child and right child are binary trees too. A node has access to children nodes, but not to its parent.
|
|
|
|
10 |
Generate a random permutation of the elements of list x
|
Alternative implementation:
Alternative implementation:
Alternative implementation:
Alternative implementation:
|
||
11 |
The list x must be non-empty.
|
|||
12 |
Check if the list contains the value x.
list is an iterable finite container. |
|
||
13 |
Access each key k with its value x from an associative array mymap, and print them.
|
|
||
14 |
Pick a random number greater than or equals to a, strictly inferior to b. Precondition : a < b.
|
|||
15 |
Pick a random integer greater than or equals to a, inferior or equals to b. Precondition : a < b.
|
|||
16 |
Call a function f on every node of binary tree bt, in depth-first infix order
|
Alternative implementation:
|
||
17 |
The structure must be recursive. A node may have zero or more children. A node has access to its children nodes, but not to its parent.
|
|
||
18 |
Call a function f on every node of a tree, in depth-first prefix order
|
Alternative implementation:
|
||
19 |
Reverse the order of the elements of the list x.
This may reverse "in-place" and destroy the original ordering. |
|
Alternative implementation:
|
|
20 |
Implement a function search which looks for item x in a 2D matrix m.
Return indices i, j of the matching cell. Think of the most idiomatic way in the language to return the two values at the same time. |
Alternative implementation:
|
|
|
21 |
Swap the values of the variables a and b
|
|
|
|
22 |
Extract the integer value i from its string representation s (in radix 10)
|
|||
23 |
Given a real number x, create its string representation s with 2 decimal digits following the dot.
|
|||
24 |
Declare a new string s and initialize it with the literal value "ネコ" (which means "cat" in japanese)
|
|||
25 |
Share the string value "Alan" with an existing running process which will then display "Hello, Alan"
|
|||
26 |
Declare and initialize a matrix x having m rows and n columns, containing real numbers.
|
|
Alternative implementation:
Alternative implementation:
|
|
27 |
Declare and initialize a 3D array x, having dimensions boundaries m, n, p, and containing real numbers.
|
Alternative implementation:
|
Alternative implementation:
Alternative implementation:
|
|
28 |
Sort the elements of the list (or array-like collection) items in ascending order of x.p, where p is a field of the type Item of the objects in items.
|
Alternative implementation:
|
||
29 |
Remove i-th item from list items.
This will alter the original list or return a new list, depending on which is more idiomatic. Note that in most languages, the smallest valid value for i is 0. |
Alternative implementation:
|
||
30 |
Launch the concurrent execution of the procedure f with parameter i from 1 to 1000.
Tasks are independent and f(i) doesn't return any value. Tasks need not run all at the same time, so you may use a pool. |
|
||
31 |
Create the recursive function f which returns the factorial of the non-negative integer i, calculated from f(i-1)
|
|
||
32 |
Create function exp which calculates (fast) the value x power n.
x and n are non-negative integers. |
|
||
33 |
Assign to the variable x the new value f(x), making sure that no other thread may modify x between the read and the write.
|
|
||
34 |
Declare and initialize a set x containing unique objects of type T.
|
|
||
35 |
Implement a function compose (A -> C) with parameters f (A -> B) and g (B -> C), which returns the composition function g ∘ f
|
|
||
36 |
Implement a function compose which returns composition function g ∘ f for any functions f and g having exactly 1 parameter.
|
Alternative implementation:
|
||
37 |
Transform a function that takes multiple arguments into a function for which some of the arguments are preset.
|
|
||
38 |
Find substring t consisting in characters i (included) to j (excluded) of string s.
Character indices start at 0 unless specified otherwise. Make sure that multibyte characters are properly handled. |
|
|
|
39 |
Set the boolean ok to true if the string word is contained in string s as a substring, or to false otherwise.
|
|
||
40 |
Declare a Graph data structure in which each Vertex has a collection of its neighbouring vertices.
|
Alternative implementation:
|
||
41 |
Create the string t containing the same characters as the string s, in reverse order.
The original string s must remain unaltered. Each character must be handled correctly regardless its number of bytes in memory. |
|
Alternative implementation:
|
|
42 |
Print each item v of list a which is not contained in list b.
For this, write an outer loop to iterate on a and an inner loop to iterate on b. |
Alternative implementation:
|
|
|
43 |
Look for a negative value v in 2D integer matrix m. Print it and stop searching.
|
Alternative implementation:
Alternative implementation:
Alternative implementation:
|
||
44 |
Insert the element x at position i in the list s. Further elements must be shifted to the right.
|
|||
45 |
Sleep for 5 seconds in current thread, before proceeding with the next instructions.
|
|||
46 |
Create the string t consisting of the 5 first characters of the string s.
Make sure that multibyte characters are properly handled. |
|
Alternative implementation:
|
|
47 |
Create string t consisting in the 5 last characters of string s.
Make sure that multibyte characters are properly handled. |
|
|
|
48 |
Assign to variable s a string literal consisting in several lines of text, including newlines.
|
|
||
49 |
Build list chunks consisting in substrings of the string s, separated by one or more space characters.
|
|
||
50 |
Write a loop that has no end clause.
|
|
||
51 |
Determine whether the map m contains an entry for the key k
|
|
||
52 |
Determine whether the map m contains an entry with the value v, for some key.
|
Alternative implementation:
|
||
53 |
Concatenate elements of string list x joined by the separator ", " to create a single string y.
|
|
||
54 |
Calculate the sum s of the integer list or array x.
|
|
|
|
55 |
Create the string representation s (in radix 10) of the integer value i.
|
|||
56 |
Fork-join : launch the concurrent execution of procedure f with parameter i from 1 to 1000.
Tasks are independent and f(i) doesn't return any value. Tasks need not run all at the same time, so you may use a pool. Wait for the completion of the 1000 tasks and then print "Finished". |
|
|
|
57 |
Create the list y containing the items from the list x that satisfy the predicate p. Respect the original ordering. Don't modify x in-place.
|
Alternative implementation:
Alternative implementation:
|
||
58 |
Create the string lines from the content of the file with filename f.
|
|||
59 |
Print the message "x is negative" to standard error (stderr), with integer x value substitution (e.g. "-2 is negative").
|
|
||
60 |
Assign to x the string value of the first command line parameter, after the program name.
|
|
||
61 |
Assign to the variable d the current date/time value, in the most standard type.
|
|||
62 |
Set i to the first position of string y inside string x, if exists.
Specify if i should be regarded as a character index or as a byte index. Explain the behavior when y is not contained in x. |
|||
63 |
Assign to x2 the value of string x with all occurrences of y replaced by z.
Assume occurrences of y are not overlapping. |
|
||
64 |
Assign to x the value 3^247
|
|||
65 |
From the real value x in [0,1], create its percentage string representation s with one digit after decimal point. E.g. 0.15625 -> "15.6%"
|
|
||
66 |
Calculate the result z of x power n, where x is a big integer and n is a positive integer.
|
|||
67 |
Calculate binom(n, k) = n! / (k! * (n-k)!). Use an integer type able to handle huge numbers.
|
|||
68 |
Create an object x to store n bits (n being potentially large).
|
|||
69 |
Use seed s to initialize a random generator.
If s is constant, the generator output will be the same each time the program runs. If s is based on the current value of the system clock, the generator output will be different each time. |
|
||
70 |
Get the current datetime and provide it as a seed to a random generator. The generator sequence will be different at each run.
|
|
||
71 |
Basic implementation of the Echo program: Print all arguments except the program name, separated by space, followed by newline.
The idiom demonstrates how to skip the first argument if necessary, concatenate arguments as strings, append newline and print it to stdout. |
|
||
73 |
Create a factory named fact for any sub class of Parent and taking exactly one string str as constructor parameter.
|
|
||
74 |
Compute the greatest common divisor x of big integers a and b. Use an integer type able to handle huge numbers.
|
|
||
75 |
Compute the least common multiple x of big integers a and b. Use an integer type able to handle huge numbers.
|
|
|
|
76 |
Create the string s of integer x written in base 2.
E.g. 13 -> "1101" |
|||
77 |
Declare a complex x and initialize it with value (3i - 2). Then multiply it by i.
|
|
||
78 |
Execute a block once, then execute it again as long as boolean condition c is true.
|
Alternative implementation:
|
||
79 |
Declare the floating point number y and initialize it with the value of the integer x .
|
|
|
|
80 |
Declare integer y and initialize it with the value of floating point number x . Ignore non-integer digits of x .
Make sure to truncate towards zero: a negative x must yield the closest greater integer (not lesser). |
|||
81 |
Declare the integer y and initialize it with the rounded value of the floating point number x .
Ties (when the fractional part of x is exactly .5) must be rounded up (to positive infinity). |
|||
82 |
Find how many times string s contains substring t.
Specify if overlapping occurrences are counted. |
|
||
83 |
Declare the regular expression r matching the strings "http", "htttp", "httttp", etc.
|
|||
84 |
Count number c of 1s in the integer i in base 2.
E.g. i=6 → c=2 |
|
||
85 |
Write boolean function addingWillOverflow which takes two integers x, y and return true if (x+y) overflows.
An overflow may be above the max positive value, or below the min negative value. |
|
||
86 |
Write the boolean function multiplyWillOverflow which takes two integers x, y and returns true if (x*y) overflows.
An overflow may reach above the max positive value, or below the min negative value. |
|
||
87 |
Exit immediately.
If some extra cleanup work is executed by the program runtime (not by the OS itself), describe it. |
|
||
88 |
Create a new bytes buffer buf of size 1,000,000.
|
|||
89 |
You've detected that the integer value of argument x passed to the current function is invalid. Write the idiomatic way to abort the function execution and signal the problem.
|
|
||
90 |
Expose a read-only integer x to the outside world while being writable inside a structure or a class Foo.
|
|
||
91 |
Read from the file data.json and write its content into the object x.
Assume the JSON data is suitable for the type of x. |
|
|
|
92 |
Write the contents of the object x into the file data.json.
|
|
||
93 |
Implement the procedure control which receives one parameter f, and runs f.
|
|
||
94 |
Print the name of the type of x. Explain if it is a static type or dynamic type.
This may not make sense in all languages. |
|||
95 |
Assign to variable x the length (number of bytes) of the local file at path.
|
|||
96 |
Set the boolean b to true if string s starts with prefix prefix, false otherwise.
|
|||
97 |
Set boolean b to true if string s ends with string suffix, false otherwise.
|
|
||
98 |
Convert a timestamp ts (number of seconds in epoch-time) to a date with time d. E.g. 0 -> 1970-01-01 00:00:00
|
|||
99 |
Assign to the string x the value of the fields (year, month, day) of the date d, in format YYYY-MM-DD.
|
|
||
100 |
Sort elements of array-like collection items, using a comparator c.
|
Alternative implementation:
Alternative implementation:
|
||
101 |
Make an HTTP request with method GET to the URL u, then store the body of the response in the string s.
|
|
||
102 |
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.
|
Alternative implementation:
|
|
|
103 |
Read from the file data.xml and write its contents into the object x.
Assume the XML data is suitable for the type of x. |
|||
104 |
Write the contents of the object x into the file data.xml.
|
|||
105 |
1
|
|||
106 |
Assign to string dir the path of the working directory.
(This is not necessarily the folder containing the executable itself) |
|
||
107 |
Assign to string dir the path of the folder containing the currently running executable.
(This is not necessarily the working directory, though.) |
|||
108 |
Print the value of variable x, but only if x has been declared in this program.
This makes sense in some languages, not all of them. (Null values are not the point, rather the very existence of the variable.) |
|||
109 |
Set n to the number of bytes of a variable t (of type T).
|
|
||
110 |
Set the boolean blank to true if the string s is empty, or null, or contains only whitespace ; false otherwise.
|
|||
111 |
From current process, run program x with command-line parameters "a", "b".
|
|
||
112 |
Print each key k with its value x from an associative array mymap, in ascending order of k.
|
Alternative implementation:
|
||
113 |
Print each key k with its value x from an associative array mymap, in ascending order of x.
Multiple entries may exist for the same value x. |
Alternative implementation:
|
||
114 |
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. |
|||
115 |
Set boolean b to true if date d1 is strictly before date d2 ; false otherwise.
|
|
||
116 |
Remove all occurrences of string w from string s1, and store the result in s2.
|
|||
117 |
Set n to the number of elements of the list x.
|
|||
118 |
Create the set y from the list x.
x may contain duplicates. y is unordered and has no repeated values. |
Alternative implementation:
|
||
119 |
Remove duplicates from the list x.
Explain if the original order is preserved. |
Alternative implementation:
Alternative implementation:
Alternative implementation:
|
||
120 |
Read an integer value from the standard input into the variable n
|
|||
121 |
Listen UDP traffic on port p and read 1024 bytes into the buffer b.
|
|
||
122 |
Create an enumerated type Suit with 4 possible values SPADES, HEARTS, DIAMONDS, CLUBS.
|
|||
123 |
Verify that predicate isConsistent returns true, otherwise report assertion violation.
Explain if the assertion is executed even in production environment or not. |
|||
124 |
Write the function binarySearch which returns the index of an element having the value x in the sorted array a, or -1 if no such element exists.
|
Alternative implementation:
Alternative implementation:
|
||
125 |
measure the duration t, in nanoseconds, of a call to the function foo. Print this duration.
|
|
||
126 |
Write a function foo that returns a string and a boolean value.
|
|||
127 |
Import the source code for the function foo body from a file "foobody.txt".
|
|
||
128 |
Call a function f on every node of a tree, in breadth-first prefix order
|
|
||
129 |
Call the function f on every vertex accessible from the vertex start, in breadth-first prefix order
|
|
||
130 |
Call th function f on every vertex accessible from the vertex v, in depth-first prefix order
|
Alternative implementation:
|
||
131 |
Execute f1 if condition c1 is true, or else f2 if condition c2 is true, or else f3 if condition c3 is true.
Don't evaluate a condition when a previous condition was true. |
|
||
132 |
Run the procedure f, and return the duration of the execution of f.
|
|
||
133 |
Set boolean ok to true if string word is contained in string s as a substring, even if the case doesn't match, or to false otherwise.
|
|
||
134 |
Declare and initialize a new list items, containing 3 elements a, b, c.
|
|
||
135 |
Remove at most 1 item from list items, having the value x.
This will alter the original list or return a new list, depending on which is more idiomatic. If there are several occurrences of x in items, remove only one of them. If x is absent, keep items unchanged. |
|
Alternative implementation:
Alternative implementation:
|
|
136 |
Remove all occurrences of the value x from list items.
This will alter the original list or return a new list, depending on which is more idiomatic. |
|
Alternative implementation:
Alternative implementation:
Alternative implementation:
|
|
137 |
Set the boolean b to true if the string s contains only characters in the range '0'..'9', false otherwise.
|
Alternative implementation:
|
|
|
138 |
Create a new temporary file on the filesystem.
|
|
||
139 |
Create a new temporary folder on filesystem, for writing.
|
|
||
140 |
Delete from map m the entry having key k.
Explain what happens if k is not an existing key in m. |
|||
141 |
Iterate in sequence over the elements of the list items1 then items2. For each iteration print the element.
|
|
||
142 |
Assign to string s the hexadecimal representation (base 16) of integer x.
E.g. 999 -> "3e7" |
|||
143 |
Iterate alternatively over the elements of the lists items1 and items2. For each iteration, print the element.
Explain what happens if items1 and items2 have different size. |
Alternative implementation:
|
||
144 |
Set boolean b to true if file at path fp exists on filesystem; false otherwise. Bewar |