Language | Version | Notes |
---|---|---|
C++ | Compiled with clang 11 using the latest C++ 20 standard. |
Your code is compiled with level two optimization ( Most standard library headers are already included automatically for your convenience. |
Java | java 17 |
Most standard library headers are already included automatically for your convenience. Includes |
Python | python 2.7.12 |
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself. For Map/TreeMap data structure, you may use sortedcontainers library. Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead. |
Python3 | Python 3.10 |
Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself. For Map/TreeMap data structure, you may use sortedcontainers library. |
MySQL | MySQL 8.0 | |
MS SQL Server | mssql server 2019 | |
Oracle | Oracle SQL 11.2 | |
C | gcc 8.2 |
Compiled with Your code is compiled with level one optimization ( Most standard library headers are already included automatically for your convenience. For hash table operations, you may use uthash. "uthash.h" is included by default. Below are some examples: 1. Adding an item to a hash. struct hash_entry { int id; /* we'll use this field as the key */ char name[10]; UT_hash_handle hh; /* makes this structure hashable */ }; struct hash_entry *users = NULL; void add_user(struct hash_entry *s) { HASH_ADD_INT(users, id, s); }
2. Looking up an item in a hash: struct hash_entry *find_user(int user_id) { struct hash_entry *s; HASH_FIND_INT(users, &user_id, s); return s; }
3. Deleting an item in a hash: void delete_user(struct hash_entry *user) { HASH_DEL(users, user); } |
C# | C# 10 with .NET 6 runtime |
|
JavaScript | node.js 16.13.2 |
Your code is run with lodash.js library is included by default. For Priority Queue / Queue data structures, you may use version 4.1 datastructures-js/priority-queue and datastructures-js/queue. |
Ruby | ruby 3.1 |
Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms |
Bash | bash 4.3.30 | |
Swift | swift 5.5.2 | |
Go | go 1.18 | Support https://github.com/emirpasic/gods/tree/v1.18.1 library. |
Scala | Scala 2.13.7 | |
Kotlin | Kotlin 1.9.0 | |
Rust | 1.58.2 |
Supports rand v0.6 from crates.io |
PHP | PHP 8.1 | With bcmath module |
Typescript | TypeScript 5.1.6, Node.js 16.13.2 |
Your code is run with lodash.js library is included by default. |
Racket | Racket 8.3 |
|
Erlang |
Erlang/OTP 25.0
|
|
Elixir |
Elixir 1.13.4 with Erlang/OTP 25.0
|
|
Dart |
Dart 2.17.3
|
Your code will be run directly without compiling |