- The snippets are under the CC-BY-SA license.
- Please consider keeping a bookmark
- (instead of printing)
|
|
|||
---|---|---|---|---|
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)
|
|||
4 |
Create a function which returns the square of an integer
|
|||
5 |
Declare a container type for two floating-point numbers x and y
|
|||
6 |
Do something with each item x of an array-like collection items, regardless indexes.
|
Alternative implementation:
|
|
|
7 |
Print each index i with its value x from an array-like collection items
|
|
for (int i = 0; i < items.length; i++) { T x = items[i]; System.out.printf("Item %d = %s%n", i, x); } |
|
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.
|
Alternative implementation:
interface Tree<T>{ boolean search(T x); } class Nil<T extends Comparable<? super T>> implements Tree<T>{ public boolean search(T x) { return false; } } class Node<T extends Comparable<? super T>> implements Tree<T> { T item; Tree<T> left; Tree<T> right; public Node(T i, Tree<T> l, Tree<T> r) { item=i; left=l; right=r; } public boolean search(T x) { int cmp = x.compareTo(item); return cmp==0 || (cmp<0 && left.search(x)) || (cmp>0 && right.search(x)); } |
||
10 |
Generate a random permutation of the elements of list x
|
|
||
11 |
The list x must be non-empty.
|
|||
12 |
Check if the list contains the value x.
list is an iterable finite container. |
|
Alternative implementation:
boolean <T> contains(T[] list, T x){ if( x==null){ for(T y:list) if( y==null ) return true; }else{ for(T y:list) if( x.equals(y) ) return true; } return false; } |
|
13 |
Access each key k with its value x from an associative array mymap, and print them.
|
Alternative implementation:
|
for (Map.Entry<Object, Object> entry : mymap.entrySet()) { Object k = entry.getKey(); Object x = entry.getValue(); System.out.println("Key=" + k + ", Value=" + x); } |
|
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
|
void dfs(BinTree bt) { if (bt.left != null) { dfs(bt.left); } f(bt); if (bt.right != null) { dfs(bt.right); } } Alternative implementation:
class BinTree { // ... void dfs() { if( left != null ) left.dfs(); f(this); if( right != null ) right.dfs(); } } |
||
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
|
|||
19 |
Reverse the order of the elements of list x.
This may reverse "in-place" and destroy the original ordering. |
|
static <T> void reverse(List<T> x){ int n = x.size(); for(int i=0;i<n/2;i++){ T tmp = x.get(i); x.set(i, x.get(n-i-1)); x.set(n-i-1, tmp); } } |
|
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. |
function search(m, x) { for (var i = 0; i < m.length; i++) { for (var j = 0; j < m[i].length; j++) { if (m[i][j] == x) { return [i, j]; } } } return false; } |
static class Position{ int i; int j; } Position search(int[][] m, int x){ for(int i=0;i<m.length;i++) for(int j=0;j<m[i].length;j++) if(m[i][j] == x){ Position pos= new Position(); pos.i = i; pos.j = j; return pos; } return null; } |
|
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"
|
{ // in file worker.js onmessage = ({data}) => { console.log (`Hello, ${data}`) } } { // in file main.js const worker = new Worker ('worker.js') worker.postMessage ('Alan') } |
|
|
26 |
Declare and initialize a matrix x having m rows and n columns, containing real numbers.
|
|
||
27 |
Declare and initialize a 3D array x, having dimensions boundaries m, n, p, and containing real numbers.
|
|
||
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.
|
Arrays.sort(items, new Comparator<Item>(){ public int compare(Item a, Item b){ return a.p - b.p; } }); Alternative implementation:
Collections.sort(items, new Comparator<Item>(){ @Override public int compare(Item a, Item b){ return a.p - b.p; } }); |
||
29 |
Remove i-th item from list items.
This will alter the original list or return a new list, depending on which is more idiomatic. Note that in most languages, the smallest valid value for i is 0. |
|
||
30 |
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. |
|||
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. |
function exp(x, n) { if (n===0) return 1; if (n===1) return x; return n%2 ? x * exp(x*x, (n-1)/2) : exp(x*x, n/2); } |
int exp(int x, int n){ if(n==0) return 1; if(n==1) return x; if(n%2==0) return exp(x*x, n/2); else return x * exp(x*x, (n-1)/2); } |
|
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 composition function g ∘ f
|
|
public Function<A, C> compose(Function<A, B> f, Function<B, C> g) { return x -> g.apply(f.apply(x)); } Alternative implementation:
Function<Integer, Integer> addOne = i-> i + 1; Function<Integer, String> toString = i-> i.toString(); Function<Integer, String> printIncremented = toString.compose(addOne); |
|
36 |
Implement a function compose which returns composition function g ∘ f for any functions f and g having exactly 1 parameter.
|
|||
37 |
Transform a function that takes multiple arguments into a function for which some of the arguments are preset.
|
function curry (fn, scope) { scope = scope || window; // omit curry function first arguments fn and scope var args = Array.prototype.slice.call(arguments, 2); return function() { var trueArgs = args.concat(Array.prototype.slice.call(arguments, 0)); fn.apply(scope, trueArgs); }; } |
||
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 boolean ok to true if 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.
|
|||
41 |
Create string t containing the same characters as string s, in reverse order.
Original string s must remain unaltered. Each character must be handled correctly regardless its number of bytes in memory. |
|||
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. |
|
||
43 |
Look for a negative value v in 2D integer matrix m. Print it and stop searching.
|
OUTER: for (var i in m) { for (var j in m[i]) { if (m[i][j] < 0) { console.log("Negative value found: "+m[i][j]); break OUTER; } } } |
mainloop: for(int i=0;i<m.length;i++) for(int j=0;j<m[i].length;j++) if(m[i][j]<0){ System.out.println(m[i][j]); break mainloop; } |
|
44 |
Insert element x at position i in 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 string t consisting of the 5 first characters of string s.
Make sure that multibyte characters are properly handled. |
|
||
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.
|
let s = "This is a very long string which needs \n" + "to wrap across multiple lines because \n" + "otherwise my code is unreadable."; Alternative implementation:
let s = "This is a very long string which needs \ to wrap across multiple lines because \ otherwise my code is unreadable."; Alternative implementation:
let s = `This is a very long string which needs to wrap across multiple lines because otherwise my code is unreadable.`; |
String s = "This is a very long string which needs \n" + "to wrap across multiple lines because \n" + "otherwise my code is unreadable."; Alternative implementation:
String s = """ This is a very long string which needs to wrap across multiple lines because otherwise my code is unreadable. """; |
|
49 |
Build list chunks consisting in substrings of input 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.
|
|||
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". |
{ // in file worker.js onmessage = f } { // in file main.js for (let i = 0; i < 1000; i++) { new Worker ('worker.js') .postMessage (i) } } Alternative implementation:
const tasks = []; for (let i = 0; i < 1000; i++) { tasks.push(f(i)); } await Promise.all(tasks); console.log("Finished"); |
class Task implements Runnable { int i; Task(int i) { this.i = i; } @Override public void run() { f(i); } } ExecutorService executor = Executors.newFixedThreadPool(4); for (int i = 1; i <= 1000; i++) { Task task = new Task(i); executor.submit(task); } executor.shutdown(); executor.awaitTermination(10L, TimeUnit.MINUTES); System.out.println("Finished"); Alternative implementation:
ExecutorService executor = Executors.newFixedThreadPool(4); for (int i = 1; i <= 1000; i++) { Task task = new Task(i); executor.submit(() -> f(i)); } executor.awaitTermination(10L, TimeUnit.MINUTES); System.out.println("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.
|
|||
58 |
Create 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%"
|
Alternative implementation:
const percentFormatter = new Intl.NumberFormat('en-US', { style: 'percent', maximumSignificantDigits: 3 }); const s = percentFormatter.format(x); |
||
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.
|
static BigInteger binom(int N, int K) { BigInteger ret = BigInteger.ONE; for (int k = 0; k < K; k++) { ret = ret.multiply(BigInteger.valueOf(N-k)) .divide(BigInteger.valueOf(k+1)); } return ret; } |
||
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.
|
class Parent { constructor(str) {} fact(new_class, str) { if (new_class.prototype instanceof Parent) { return new new_class(str) } } } class Child extends Parent {} |
||
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.
|
|
|
|
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 integer y and initialize it with the rounded value of 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 regular expression r matching 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 boolean function multiplyWillOverflow 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. |
|||
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.
|
const Foo = function Counter () { let n = 0 Object.defineProperty (this, 'value', {get: () => n++}) } { const counter = new Foo () counter.value // 0 counter.value // 1 } |
||
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 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 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.
|
Alternative implementation:
|
||
100 |
Sort elements of array-like collection items, using a comparator c.
|
|||
101 |
Make an HTTP request with method GET to the URL u, then store the body of the response in the string s.
|
Alternative implementation:
var xmlHttp = new XMLHttpRequest(); xmlHttp.onreadystatechange = function() { if (xmlHttp.readyState == 4 && xmlHttp.status == 200) s = xmlHttp.responseText; } xmlHttp.open("GET", u, true); xmlHttp.send(null); |
String s = HttpClient.newHttpClient().send(HttpRequest.newBuilder() .uri(URI.create(u)) .GET() .build(), HttpResponse.BodyHandlers.ofString()) .body(); |
|
105 |
Assign to the string s the name of the currently executing program (but not its full path).
|
|
|
|
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.) |
|
||
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.
|
|
SortedMap<K, V> mymap = new TreeMap<>(); ... for(Map.Entry<K, V> e: mymap.entrySet()) System.out.println("Key=" + e.getKey() + ", Value=" + e.getValue()); Alternative implementation:
List<K> keys = new ArrayList<>(mymap.keySet()); Collections.sort(keys); for(K k: keys) System.out.println("Key=" + k + ", Value=" + mymap.get(k)); Alternative implementation:
var map = Map.of("a", 1, "d", 4, "c", 3, "b", 2); new TreeMap<>(map).entrySet().forEach(System.out::println); |
|
113 |
Print each key k with its value x from an associative array mymap, in ascending order of x.
Note that multiple entries may exist for the same value x. |
|||
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. |
Alternative implementation:
const arrayDeepEqual = (a, b) => a.length === b.length && a.every((x, i) => deepEqual(x, b[i])) const deepEqual = (a, b) => Array.isArray(a) && Array.isArray(b) ? arrayDeepEqual(a, b) : typeof a == 'object' && a && typeof b == 'object' && b ? arrayDeepEqual(Object.entries(a), Object.entries(b)) : Number.isNaN(a) && Number.isNaN(b) || a === b const b = deepEqual(x, y) |
||
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. |
|
||
119 |
Remove duplicates from the list x.
Explain if the original order is preserved. |
Alternative implementation:
final HashSet<T> seen = new HashSet<T>(); final Iterator<T> listIt = x.iterator(); while (listIt.hasNext()) { final T curr = listIt.next(); if (seen.contains(curr)) { listIt.remove(); } else { seen.add(curr); } } |
||
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 buffer b.
|
int len = 1024; int p = 8888; byte[] b = new byte[len]; try (DatagramSocket socket = new DatagramSocket(p)) { DatagramPacket packet = new DatagramPacket(b, len); socket.receive(packet); } |
||
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.
|
|||
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
|
|||
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. |
Alternative implementation:
|
||
132 |
Run procedure f, and return the duration of the execution of f.
|
function clock(f) { var start = new Date().getTime(); f(); var end = new Date().getTime(); return end - start; } |
long clock(Runnable f) { long t0 = System.currentTimeMillis(); f.run(); long t1 = System.currentTimeMillis(); return t1 - t0; } |
|
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 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. |
|
||
136 |
Remove all occurrences of value x from list items.
This will alter the original list or return a new list, depending on which is more idiomatic. |
|
||
137 |
Set the boolean b to true if the string s contains only characters in the range '0'..'9', false otherwise.
|
|
||
138 |
Create a new temporary file on the filesystem.
|
Alternative implementation:
|
|
|
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.
|
Alternative implementation:
for (T item : items1) { System.out.println(item); } for (T item : items2) { System.out.println(item); } |
||
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 list items1 and items2. For each iteration, print the element.
Explain what happens if items1 and items2 have different size. |
const shorter = _items1.length > _items2.length ? _items2 : _items1; const longer = _items1.length <= _items2.length ? _items2 : _items1; shorter.map((m, i) => { console.log(m); console.log(longer[i]); }); Alternative implementation:
const iterator1 = items1[Symbol.iterator]() const iterator2 = items2[Symbol.iterator]() let result1 = iterator1.next() let result2 = iterator2.next() while(!(result1.done && result2.done)) { if (!result1.done) { console.log(result1.value) result1 = iterator1.next() } if (!result2.done) { console.log(result2.value) result2 = iterator2.next() } } |
Iterator<String> iter1 = items1.iterator(); Iterator<String> iter2 = items2.iterator(); while (iter1.hasNext() || iter2.hasNext()) { if (iter1.hasNext()) { System.out.println(iter1.next()); } if (iter2.hasNext()) { System.out.println(iter2.next()); } } |
|
144 |
Set boolean b to true if file at path fp exists on filesystem; false otherwise.
Beware that you should never do this and then in the next instruction assume the result is still valid, this is a race condition on any multitasking OS. |
|
|
|
145 |
Print message msg, prepended by current date and time.
Explain what behavior is idiomatic: to stdout or stderr, and what the date format is. |
|
|
|
146 |
Extract floating point value f from its string representation s
|
|||
147 |
Create string t from string s, keeping only ASCII characters
|
|||
148 |
Read a list of integer numbers from the standard input, until EOF.
|
process.stdin.on('data', processLine) function processLine (line) { const string = line + '' console.log(string) } |
||
149 |
As an exception, this content is not under license CC BY-SA 3.0 like the rest of this website.
|
|||
150 |
Remove last character from string p, if this character is a slash /.
|
|||
151 |
Remove last character from string p, if this character is the file path separator of current platform.
Note that this also transforms unix root path "/" into the empty string! |
|
||
152 |
Create string s containing only the character c.
|
|
||
153 |
Create the string t as the concatenation of the string s and the integer i.
|
|
|
|
154 |
Find color c, the average between colors c1, c2.
c, c1, c2 are strings of hex color codes: 7 chars, beginning with a number sign # . Assume linear computations, ignore gamma corrections. |
var c = "#"; for(var i = 0; i<3; i++) { var sub1 = c1.substring(1+2*i, 3+2*i); var sub2 = c2.substring(1+2*i, 3+2*i); var v1 = parseInt(sub1, 16); var v2 = parseInt(sub2, 16); var v = Math.floor((v1 + v2) / 2); var sub = v.toString(16).toUpperCase(); var padsub = ('0'+sub).slice(-2); c += padsub; } |
String r1 = c1.substring(1,3); String g1 = c1.substring(3,5); String b1 = c1.substring(5,7); String r2 = c2.substring(1,3); String g2 = c2.substring(3,5); String b2 = c2.substring(5,7); String r = String.format("%02X", (Integer.parseInt(r1, 16)+Integer.parseInt(r2, 16))/2 ); String g = String.format("%02X", (Integer.parseInt(g1, 16)+Integer.parseInt(g2, 16))/2 ); String b = String.format("%02X", (Integer.parseInt(b1, 16)+Integer.parseInt(b2, 16))/2 ); String c = "#" + r + g + b; Alternative implementation:
StringBuilder sb = new StringBuilder("#"); for(int i=0;i<3;i++) { String sub1 = c1.substring(1+2*i,3+2*i); String sub2 = c2.substring(1+2*i,3+2*i); int v1 = Integer.parseInt(sub1, 16); int v2 = Integer.parseInt(sub2, 16); int v = (v1 + v2)/2; String sub = String.format("%02X", v); sb.append(sub); } String c = sb.toString(); |
|
155 |
Delete from filesystem the file having path filepath.
|
|
|
|
156 |
Assign to the string s the value of the integer i in 3 decimal digits. Pad with zeros if i < 100. Keep all digits if i ≥ 1000.
|
|||
157 |
Initialize a constant planet with string value "Earth".
|
|||
158 |
Create a new list y from randomly picking exactly k elements from list x.
It is assumed that x has at least k elements. Each element must have same probability to be picked. Each element from x must be picked at most once. Explain if the original ordering is preserved or not. |
|||
160 |
Execute f32() if platform is 32-bit, or f64() if platform is 64-bit.
This can be either a compile-time condition (depending on target) or a runtime detection. |
|||
161 |
Multiply all the elements of the list elements by a constant c
|
|||
162 |
execute bat if b is a program option and fox if f is a program option.
|
|
||
163 |
Print all the list elements, two by two, assuming list length is even.
|
|||
165 |
Assign to variable x the last element of list items.
|
|
||
166 |
Create the list ab containing all the elements of the list a, followed by all the elements of the list b.
|
|
||
167 |
Create string t consisting of string s with its prefix p removed (if s starts with p).
|
|
|
|
168 |
Create string t consisting of string s with its suffix w removed (if s ends with w).
|
|||
169 |
Assign to the integer n the number of characters of the string s.
Make sure that multibyte characters are properly handled. n can be different from the number of bytes of s. |
|
|
|
170 |
Set n to the number of elements stored in mymap.
This is not always equal to the map capacity. |
|
|
|
171 |
Append element x to the list s.
|
|||
172 |
Insert value v for key k in map m.
|
|
|
|
173 |
Number will be formatted with a comma separator between every group of thousands.
|
|
||
174 |
Make a HTTP request with method POST to the URL u
|
|
||
175 |
From 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). |
|
||
176 |
From hex string s of 2n digits, build the equivalent array a of n bytes.
Each pair of hexadecimal characters (16 possible values per digit) is decoded into one byte (256 possible values). |
|
||
178 |
Set boolean b to true if if the point with coordinates (x,y) is inside the rectangle with coordinates (x1,y1,x2,y2) , or to false otherwise.
Describe if the edges are considered to be inside the rectangle. |
|||
179 |
Return the center c of the rectangle with coördinates(x1,y1,x2,y2)
|
|||
180 |
Create list x containing the contents of directory d.
x may contain files and subfolders. No recursive subfolder listing. |
|
|
|
182 |
Output the source of the program.
|
|||
183 |
Make a HTTP request with method PUT to the URL u
|
|
||
184 |
Assign to variable t a string representing the day, month and year of the day after the current date.
|
var nextDate = new Date(new Date().getTime() + 24 * 60 * 60 * 1000); var day = nextDate.getDate() var month = nextDate.getMonth() + 1 var year = nextDate.getFullYear() var t = `${day}/${month}/${year}`; Alternative implementation:
Alternative implementation:
var now = new Date() var year = now.getFullYear() var month = now.getMonth() var day = now.getDate() var tomorrow = new Date(0) tomorrow.setFullYear(year, month, day + 1) tomorrow.setHours(0, 0, 0, 0) var shortDateFormat = Intl.DateTimeFormat(undefined, { dateStyle: "short" }) var t = shortDateFormat.format(tomorrow) |
|
|
185 |
Schedule the execution of f(42) in 30 seconds.
|
ScheduledExecutorService executorService = Executors.newSingleThreadScheduledExecutor(); executorService.schedule(() -> _f(42), delayInSeconds, TimeUnit.SECONDS); |
||
186 |
Exit a program cleanly indicating no error to OS
|
|
||
187 |
Disjoint Sets hold elements that are partitioned into a number of disjoint (non-overlapping) sets.
|
public class DisjointSetElement { private DisjointSetElement representative = this; public DisjointSetElement getRepresentative() { if (representative != this) { representative = representative.getRepresentative(); } return representative; } public void union(DisjointSetElement other) { other.getRepresentative().representative = getRepresentative(); } } |