{"cpp": ["C++", "

Compiled with clang 19 using the latest C++ 23 standard, and libstdc++ provided by GCC 14.

\r\n\r\n

Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\r\n\r\n

Most standard library headers are already included automatically for your convenience.

"], "java": ["Java", "

OpenJDK 25. Using compile arguments: --enable-preview --release 25

\r\n\r\n

Most standard library headers are already included automatically for your convenience.

\r\n

Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

"], "python": ["Python", "

Python 2.7.18.

\r\n\r\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\r\n\r\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\r\n\r\n

Note that Python 2.7 is not maintained anymore. For the latest Python, please choose Python3 instead.

"], "c": ["C", "

Compiled with gcc 14 using the gnu11 standard.

\r\n\r\n

Your code is compiled with level one optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\r\n\r\n

Most standard library headers are already included automatically for your convenience.

\r\n\r\n

You may use data structures from GLib 2.0, such as GQueue, GTree and more.

\r\n\r\n

For hash table operations, you may also use uthash. \"uthash.h\" is included by default. Below are some examples:

\r\n\r\n

1. Adding an item to a hash.\r\n

\r\nstruct hash_entry {\r\n    int id;            /* we'll use this field as the key */\r\n    char name[10];\r\n    UT_hash_handle hh; /* makes this structure hashable */\r\n};\r\n\r\nstruct hash_entry *users = NULL;\r\n\r\nvoid add_user(struct hash_entry *s) {\r\n    HASH_ADD_INT(users, id, s);\r\n}\r\n

\r\n

\r\n\r\n

2. Looking up an item in a hash:\r\n

\r\nstruct hash_entry *find_user(int user_id) {\r\n    struct hash_entry *s;\r\n    HASH_FIND_INT(users, &user_id, s);\r\n    return s;\r\n}\r\n

\r\n

\r\n\r\n

3. Deleting an item in a hash:\r\n

\r\nvoid delete_user(struct hash_entry *user) {\r\n    HASH_DEL(users, user);  \r\n}\r\n

\r\n

"], "csharp": ["C#", "

C# 14 with .NET 10 runtime

"], "javascript": ["JavaScript", "

Node.js 22.14.0.

\r\n\r\n

Your code is run with --harmony flag, enabling new ES6 features.

\r\n\r\n

lodash.js@4.17.21 library is included by default.

\r\n\r\n

You may use data structures from datastructures-js library. Version info:

\r\n\r\n

\r\n

\r\n\"@datastructures-js/binary-search-tree\": \"5.4.0\"\r\n\"@datastructures-js/deque\": \"1.0.8\"\r\n\"@datastructures-js/graph\": \"5.3.1\"\r\n\"@datastructures-js/heap\": \"4.3.7\"\r\n\"@datastructures-js/linked-list\": \"6.1.4\"\r\n\"@datastructures-js/priority-queue\": \"6.3.5\"\r\n\"@datastructures-js/queue\": \"4.3.0\"\r\n\"@datastructures-js/set\": \"4.2.2\"\r\n\"@datastructures-js/stack\": \"3.1.6\"\r\n\"@datastructures-js/trie\": \"4.2.3\"\r\n

\r\n

\r\n\r\n

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", "

Ruby 3.2

\r\n\r\n

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

"], "swift": ["Swift", "

Swift 6.0.

\r\n\r\n

You may use the following packages:
\r\nswift-algorithms 1.2.0
\r\nswift-collections 1.1.4
\r\nswift-numerics 1.0.2

"], "golang": ["Go", "

Go 1.23

\r\n

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.

"], "python3": ["Python3", "

Python 3.14.

\r\n\r\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\r\n\r\n

For Map/TreeMap data structure, you may use sortedcontainers library.

"], "scala": ["Scala", "

Scala 3.3.1.

"], "kotlin": ["Kotlin", "

Kotlin 2.1.10.

"], "rust": ["Rust", "

Rust 1.88.0, using edition 2024.. Your code will be compiled with opt-level 2.

\r\n\r\n

Supports rand v0.8 and regex\u00a0v1 and itertools\u00a0v0.14 from crates.io

"], "php": ["PHP", "

PHP 8.2.

\r\n

With bcmath module

"], "typescript": ["Typescript", "

TypeScript 5.7.3, Node.js 22.14.0.

\r\n\r\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2024

\r\n\r\n

lodash.js@4.17.21 library is included by default.

\r\n\r\n

You may use data structures from datastructures-js library. Version info:

\r\n\r\n

\r\n

\r\n\"@datastructures-js/binary-search-tree\": \"5.4.0\"\r\n\"@datastructures-js/deque\": \"1.0.8\"\r\n\"@datastructures-js/graph\": \"5.3.1\"\r\n\"@datastructures-js/heap\": \"4.3.7\"\r\n\"@datastructures-js/linked-list\": \"6.1.4\"\r\n\"@datastructures-js/priority-queue\": \"6.3.5\"\r\n\"@datastructures-js/queue\": \"4.3.0\"\r\n\"@datastructures-js/set\": \"4.2.2\"\r\n\"@datastructures-js/stack\": \"3.1.6\"\r\n\"@datastructures-js/trie\": \"4.2.3\"\r\n

\r\n

\r\n\r\n

For Binary Search Tree, Trie, and Graph, please import them manually when you need to use them, as their names conflict with certain problems.

"], "dart": ["Dart", "

Dart 3.2. You may use package collection

\r\n\r\n

Your code will be run directly without compiling

"]}