| Language | Version | Notes |
|---|---|---|
| C++ |
clang 19 using the latest C++ 23 standard, and libstdc++ provided by GCC 14. |
Compiled with Your code is compiled with level two optimization ( Most standard library headers are already included automatically for your convenience. |
| Java | java 25 |
Most standard library headers are already included automatically for your convenience. Includes |
| Python | python 2.7.18 |
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 is not maintained anymore. For the latest Python, please choose Python3 instead. |
| Python3 | Python 3.14 |
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 9.7 | Note: For legacy reason, we didn't enable any SQL mode, including ONLY_FULL_GROUP_BY, STRICT_TRANS_TABLES, NO_ZERO_IN_DATE, NO_ZERO_DATE, ERROR_FOR_DIVISION_BY_ZERO and more. |
| MS SQL Server | mssql server 2019 | |
| Oracle | Oracle SQL 11.2 | |
| C | gcc 14 |
Compiled with Your code is compiled with level two optimization ( Most standard library headers are already included automatically for your convenience. You may use data structures from GLib 2.0, such as For hash table operations, you may also use uthash. You may also use the type-safe containers from STC v5.0, such as 1. A min-heap: #define i_type MinHeap, int
#define i_cmp -c_default_cmp /* max-heap by default; negate for a min-heap */
#include <stc/pqueue.h>
MinHeap heap = {0};
MinHeap_push(&heap, 3);
int top = *MinHeap_top(&heap);
MinHeap_pop(&heap);
MinHeap_drop(&heap);
2. Counting with a hash map: #define i_type Counter, int, int /* type name, key type, value type */
#include <stc/hmap.h>
Counter cnt = {0};
Counter_insert(&cnt, x, 0).ref->second++;
const Counter_value *v = Counter_get(&cnt, x); /* NULL if not found */
c_foreach (it, Counter, cnt) {
printf("%d: %d\n", it.ref->first, it.ref->second);
}
Counter_drop(&cnt);
|
| C# | C# 14 with .NET 10 runtime | |
| JavaScript | Node.js 26.12.1 |
lodash.js@4.17.21 library is included by default. You may use data structures from datastructures-js library. Version info:
"@datastructures-js/binary-search-tree": "5.4.0" "@datastructures-js/deque": "1.0.8" "@datastructures-js/graph": "5.3.1" "@datastructures-js/heap": "4.3.7" "@datastructures-js/linked-list": "6.1.4" "@datastructures-js/priority-queue": "6.3.5" "@datastructures-js/queue": "4.3.0" "@datastructures-js/set": "4.2.2" "@datastructures-js/stack": "3.1.6" "@datastructures-js/trie": "4.2.3"
For Binary Search Tree, Trie, and Graph, please import them manually when you need to use them, as their names conflict with certain problems. |
| Ruby | Ruby 4.0 | Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms |
| Bash | bash 5.2.21 | |
| Swift | Swift 6.4.1 |
You may use the following packages: |
| Go | Go 1.27 | Support https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1 and https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha library. |
| Scala | Scala 3.9.0 on JDK 25. | |
| Kotlin | Kotlin 2.4.21 on JDK 25. | |
| Rust | Rust 1.99.1 |
Rust 1.99.1, using edition 2024. Your code will be compiled with opt-level 2. Supports rand v0.10 and regex v1 and itertools v0.15 from crates.io |
| PHP | PHP 8.5 | With bcmath module |
| Typescript | TypeScript 7.0.2, Node.js 26.12.1 | Compile Options: lodash.js@4.17.21 library is included by default. You may use data structures from datastructures-js library. Version info:
"@datastructures-js/binary-search-tree": "5.4.0" "@datastructures-js/deque": "1.0.8" "@datastructures-js/graph": "5.3.1" "@datastructures-js/heap": "4.3.7" "@datastructures-js/linked-list": "6.1.4" "@datastructures-js/priority-queue": "6.3.5" "@datastructures-js/queue": "4.3.0" "@datastructures-js/set": "4.2.2" "@datastructures-js/stack": "3.1.6" "@datastructures-js/trie": "4.2.3"
For Binary Search Tree, Trie, and Graph, please import them manually when you need to use them, as their names conflict with certain problems. |
| Racket | Racket CS v9.3 | Using Required |
| Erlang | Erlang/OTP 29 |
|
| Elixir | Elixir 1.20 with Erlang/OTP 29 |
|
| Dart | Dart 3.13 |
Dart 3.13. You may use package collection Your code will be run directly without compiling |
PostgreSQL |
PostgreSQL 18 |
|
Pandas |
Python 3.14 with Pandas 3.1.0 and NumPy 2.5.4 |
|
React |
Node.js 18 with react@18.2.0 |
|
Vanilla JS |
ECMAScript 2023 |