Design Bitset
<p>A <strong>Bitset</strong> is a data structure that compactly stores bits.</p>

<p>Implement the <code>Bitset</code> class:</p>

<ul>
	<li><code>Bitset(int size)</code> Initializes the Bitset with <code>size</code> bits, all of which are <code>0</code>.</li>
	<li><code>void fix(int idx)</code> Updates the value of the bit at the index <code>idx</code> to <code>1</code>. If the value was already <code>1</code>, no change occurs.</li>
	<li><code>void unfix(int idx)</code> Updates the value of the bit at the index <code>idx</code> to <code>0</code>. If the value was already <code>0</code>, no change occurs.</li>
	<li><code>void flip()</code> Flips the values of each bit in the Bitset. In other words, all bits with value <code>0</code> will now have value <code>1</code> and vice versa.</li>
	<li><code>boolean all()</code> Checks if the value of <strong>each</strong> bit in the Bitset is <code>1</code>. Returns <code>true</code> if it satisfies the condition, <code>false</code> otherwise.</li>
	<li><code>boolean one()</code> Checks if there is <strong>at least one</strong> bit in the Bitset with value <code>1</code>. Returns <code>true</code> if it satisfies the condition, <code>false</code> otherwise.</li>
	<li><code>int count()</code> Returns the <strong>total number</strong> of bits in the Bitset which have value <code>1</code>.</li>
	<li><code>String toString()</code> Returns the current composition of the Bitset. Note that in the resultant string, the character at the <code>i<sup>th</sup></code> index should coincide with the value at the <code>i<sup>th</sup></code> bit of the Bitset.</li>
</ul>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input</strong>
[&quot;Bitset&quot;, &quot;fix&quot;, &quot;fix&quot;, &quot;flip&quot;, &quot;all&quot;, &quot;unfix&quot;, &quot;flip&quot;, &quot;one&quot;, &quot;unfix&quot;, &quot;count&quot;, &quot;toString&quot;]
[[5], [3], [1], [], [], [0], [], [], [0], [], []]
<strong>Output</strong>
[null, null, null, null, false, null, null, true, null, 2, &quot;01010&quot;]

<strong>Explanation</strong>
Bitset bs = new Bitset(5); // bitset = &quot;00000&quot;.
bs.fix(3);     // the value at idx = 3 is updated to 1, so bitset = &quot;00010&quot;.
bs.fix(1);     // the value at idx = 1 is updated to 1, so bitset = &quot;01010&quot;. 
bs.flip();     // the value of each bit is flipped, so bitset = &quot;10101&quot;. 
bs.all();      // return False, as not all values of the bitset are 1.
bs.unfix(0);   // the value at idx = 0 is updated to 0, so bitset = &quot;00101&quot;.
bs.flip();     // the value of each bit is flipped, so bitset = &quot;11010&quot;. 
bs.one();      // return True, as there is at least 1 index with value 1.
bs.unfix(0);   // the value at idx = 0 is updated to 0, so bitset = &quot;01010&quot;.
bs.count();    // return 2, as there are 2 bits with value 1.
bs.toString(); // return &quot;01010&quot;, which is the composition of bitset.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= size &lt;= 10<sup>5</sup></code></li>
	<li><code>0 &lt;= idx &lt;= size - 1</code></li>
	<li>At most <code>10<sup>5</sup></code> calls will be made <strong>in total</strong> to <code>fix</code>, <code>unfix</code>, <code>flip</code>, <code>all</code>, <code>one</code>, <code>count</code>, and <code>toString</code>.</li>
	<li>At least one call will be made to <code>all</code>, <code>one</code>, <code>count</code>, or <code>toString</code>.</li>
	<li>At most <code>5</code> calls will be made to <code>toString</code>.</li>
</ul>

['design-underground-system']
[]
[{"value": "cpp", "text": "C++", "defaultCode": "class Bitset {\npublic:\n    Bitset(int size) {\n        \n    }\n    \n    void fix(int idx) {\n        \n    }\n    \n    void unfix(int idx) {\n        \n    }\n    \n    void flip() {\n        \n    }\n    \n    bool all() {\n        \n    }\n    \n    bool one() {\n        \n    }\n    \n    int count() {\n        \n    }\n    \n    string toString() {\n        \n    }\n};\n\n/**\n * Your Bitset object will be instantiated and called as such:\n * Bitset* obj = new Bitset(size);\n * obj->fix(idx);\n * obj->unfix(idx);\n * obj->flip();\n * bool param_4 = obj->all();\n * bool param_5 = obj->one();\n * int param_6 = obj->count();\n * string param_7 = obj->toString();\n */"}, {"value": "java", "text": "Java", "defaultCode": "class Bitset {\n\n    public Bitset(int size) {\n        \n    }\n    \n    public void fix(int idx) {\n        \n    }\n    \n    public void unfix(int idx) {\n        \n    }\n    \n    public void flip() {\n        \n    }\n    \n    public boolean all() {\n        \n    }\n    \n    public boolean one() {\n        \n    }\n    \n    public int count() {\n        \n    }\n    \n    public String toString() {\n        \n    }\n}\n\n/**\n * Your Bitset object will be instantiated and called as such:\n * Bitset obj = new Bitset(size);\n * obj.fix(idx);\n * obj.unfix(idx);\n * obj.flip();\n * boolean param_4 = obj.all();\n * boolean param_5 = obj.one();\n * int param_6 = obj.count();\n * String param_7 = obj.toString();\n */"}, {"value": "python", "text": "Python", "defaultCode": "class Bitset(object):\n\n    def __init__(self, size):\n        \"\"\"\n        :type size: int\n        \"\"\"\n        \n\n    def fix(self, idx):\n        \"\"\"\n        :type idx: int\n        :rtype: None\n        \"\"\"\n        \n\n    def unfix(self, idx):\n        \"\"\"\n        :type idx: int\n        :rtype: None\n        \"\"\"\n        \n\n    def flip(self):\n        \"\"\"\n        :rtype: None\n        \"\"\"\n        \n\n    def all(self):\n        \"\"\"\n        :rtype: bool\n        \"\"\"\n        \n\n    def one(self):\n        \"\"\"\n        :rtype: bool\n        \"\"\"\n        \n\n    def count(self):\n        \"\"\"\n        :rtype: int\n        \"\"\"\n        \n\n    def toString(self):\n        \"\"\"\n        :rtype: str\n        \"\"\"\n        \n\n\n# Your Bitset object will be instantiated and called as such:\n# obj = Bitset(size)\n# obj.fix(idx)\n# obj.unfix(idx)\n# obj.flip()\n# param_4 = obj.all()\n# param_5 = obj.one()\n# param_6 = obj.count()\n# param_7 = obj.toString()"}, {"value": "python3", "text": "Python3", "defaultCode": "class Bitset:\n\n    def __init__(self, size: int):\n        \n\n    def fix(self, idx: int) -> None:\n        \n\n    def unfix(self, idx: int) -> None:\n        \n\n    def flip(self) -> None:\n        \n\n    def all(self) -> bool:\n        \n\n    def one(self) -> bool:\n        \n\n    def count(self) -> int:\n        \n\n    def toString(self) -> str:\n        \n\n\n# Your Bitset object will be instantiated and called as such:\n# obj = Bitset(size)\n# obj.fix(idx)\n# obj.unfix(idx)\n# obj.flip()\n# param_4 = obj.all()\n# param_5 = obj.one()\n# param_6 = obj.count()\n# param_7 = obj.toString()"}, {"value": "c", "text": "C", "defaultCode": "\n\n\ntypedef struct {\n    \n} Bitset;\n\n\nBitset* bitsetCreate(int size) {\n    \n}\n\nvoid bitsetFix(Bitset* obj, int idx) {\n    \n}\n\nvoid bitsetUnfix(Bitset* obj, int idx) {\n    \n}\n\nvoid bitsetFlip(Bitset* obj) {\n    \n}\n\nbool bitsetAll(Bitset* obj) {\n    \n}\n\nbool bitsetOne(Bitset* obj) {\n    \n}\n\nint bitsetCount(Bitset* obj) {\n    \n}\n\nchar* bitsetToString(Bitset* obj) {\n    \n}\n\nvoid bitsetFree(Bitset* obj) {\n    \n}\n\n/**\n * Your Bitset struct will be instantiated and called as such:\n * Bitset* obj = bitsetCreate(size);\n * bitsetFix(obj, idx);\n \n * bitsetUnfix(obj, idx);\n \n * bitsetFlip(obj);\n \n * bool param_4 = bitsetAll(obj);\n \n * bool param_5 = bitsetOne(obj);\n \n * int param_6 = bitsetCount(obj);\n \n * char* param_7 = bitsetToString(obj);\n \n * bitsetFree(obj);\n*/"}, {"value": "csharp", "text": "C#", "defaultCode": "public class Bitset {\n\n    public Bitset(int size) {\n        \n    }\n    \n    public void Fix(int idx) {\n        \n    }\n    \n    public void Unfix(int idx) {\n        \n    }\n    \n    public void Flip() {\n        \n    }\n    \n    public bool All() {\n        \n    }\n    \n    public bool One() {\n        \n    }\n    \n    public int Count() {\n        \n    }\n    \n    public string ToString() {\n        \n    }\n}\n\n/**\n * Your Bitset object will be instantiated and called as such:\n * Bitset obj = new Bitset(size);\n * obj.Fix(idx);\n * obj.Unfix(idx);\n * obj.Flip();\n * bool param_4 = obj.All();\n * bool param_5 = obj.One();\n * int param_6 = obj.Count();\n * string param_7 = obj.ToString();\n */"}, {"value": "javascript", "text": "JavaScript", "defaultCode": "/**\n * @param {number} size\n */\nvar Bitset = function(size) {\n    \n};\n\n/** \n * @param {number} idx\n * @return {void}\n */\nBitset.prototype.fix = function(idx) {\n    \n};\n\n/** \n * @param {number} idx\n * @return {void}\n */\nBitset.prototype.unfix = function(idx) {\n    \n};\n\n/**\n * @return {void}\n */\nBitset.prototype.flip = function() {\n    \n};\n\n/**\n * @return {boolean}\n */\nBitset.prototype.all = function() {\n    \n};\n\n/**\n * @return {boolean}\n */\nBitset.prototype.one = function() {\n    \n};\n\n/**\n * @return {number}\n */\nBitset.prototype.count = function() {\n    \n};\n\n/**\n * @return {string}\n */\nBitset.prototype.toString = function() {\n    \n};\n\n/** \n * Your Bitset object will be instantiated and called as such:\n * var obj = new Bitset(size)\n * obj.fix(idx)\n * obj.unfix(idx)\n * obj.flip()\n * var param_4 = obj.all()\n * var param_5 = obj.one()\n * var param_6 = obj.count()\n * var param_7 = obj.toString()\n */"}, {"value": "typescript", "text": "TypeScript", "defaultCode": "class Bitset {\n    constructor(size: number) {\n        \n    }\n\n    fix(idx: number): void {\n        \n    }\n\n    unfix(idx: number): void {\n        \n    }\n\n    flip(): void {\n        \n    }\n\n    all(): boolean {\n        \n    }\n\n    one(): boolean {\n        \n    }\n\n    count(): number {\n        \n    }\n\n    toString(): string {\n        \n    }\n}\n\n/**\n * Your Bitset object will be instantiated and called as such:\n * var obj = new Bitset(size)\n * obj.fix(idx)\n * obj.unfix(idx)\n * obj.flip()\n * var param_4 = obj.all()\n * var param_5 = obj.one()\n * var param_6 = obj.count()\n * var param_7 = obj.toString()\n */"}, {"value": "php", "text": "PHP", "defaultCode": "class Bitset {\n    /**\n     * @param Integer $size\n     */\n    function __construct($size) {\n        \n    }\n  \n    /**\n     * @param Integer $idx\n     * @return NULL\n     */\n    function fix($idx) {\n        \n    }\n  \n    /**\n     * @param Integer $idx\n     * @return NULL\n     */\n    function unfix($idx) {\n        \n    }\n  \n    /**\n     * @return NULL\n     */\n    function flip() {\n        \n    }\n  \n    /**\n     * @return Boolean\n     */\n    function all() {\n        \n    }\n  \n    /**\n     * @return Boolean\n     */\n    function one() {\n        \n    }\n  \n    /**\n     * @return Integer\n     */\n    function count() {\n        \n    }\n  \n    /**\n     * @return String\n     */\n    function toString() {\n        \n    }\n}\n\n/**\n * Your Bitset object will be instantiated and called as such:\n * $obj = Bitset($size);\n * $obj->fix($idx);\n * $obj->unfix($idx);\n * $obj->flip();\n * $ret_4 = $obj->all();\n * $ret_5 = $obj->one();\n * $ret_6 = $obj->count();\n * $ret_7 = $obj->toString();\n */"}, {"value": "swift", "text": "Swift", "defaultCode": "\nclass Bitset {\n\n    init(_ size: Int) {\n        \n    }\n    \n    func fix(_ idx: Int) {\n        \n    }\n    \n    func unfix(_ idx: Int) {\n        \n    }\n    \n    func flip() {\n        \n    }\n    \n    func all() -> Bool {\n        \n    }\n    \n    func one() -> Bool {\n        \n    }\n    \n    func count() -> Int {\n        \n    }\n    \n    func toString() -> String {\n        \n    }\n}\n\n/**\n * Your Bitset object will be instantiated and called as such:\n * let obj = Bitset(size)\n * obj.fix(idx)\n * obj.unfix(idx)\n * obj.flip()\n * let ret_4: Bool = obj.all()\n * let ret_5: Bool = obj.one()\n * let ret_6: Int = obj.count()\n * let ret_7: String = obj.toString()\n */"}, {"value": "kotlin", "text": "Kotlin", "defaultCode": "class Bitset(size: Int) {\n\n    fun fix(idx: Int) {\n        \n    }\n\n    fun unfix(idx: Int) {\n        \n    }\n\n    fun flip() {\n        \n    }\n\n    fun all(): Boolean {\n        \n    }\n\n    fun one(): Boolean {\n        \n    }\n\n    fun count(): Int {\n        \n    }\n\n    fun toString(): String {\n        \n    }\n\n}\n\n/**\n * Your Bitset object will be instantiated and called as such:\n * var obj = Bitset(size)\n * obj.fix(idx)\n * obj.unfix(idx)\n * obj.flip()\n * var param_4 = obj.all()\n * var param_5 = obj.one()\n * var param_6 = obj.count()\n * var param_7 = obj.toString()\n */"}, {"value": "dart", "text": "Dart", "defaultCode": "class Bitset {\n\n  Bitset(int size) {\n    \n  }\n  \n  void fix(int idx) {\n    \n  }\n  \n  void unfix(int idx) {\n    \n  }\n  \n  void flip() {\n    \n  }\n  \n  bool all() {\n    \n  }\n  \n  bool one() {\n    \n  }\n  \n  int count() {\n    \n  }\n  \n  String toString() {\n    \n  }\n}\n\n/**\n * Your Bitset object will be instantiated and called as such:\n * Bitset obj = Bitset(size);\n * obj.fix(idx);\n * obj.unfix(idx);\n * obj.flip();\n * bool param4 = obj.all();\n * bool param5 = obj.one();\n * int param6 = obj.count();\n * String param7 = obj.toString();\n */"}, {"value": "golang", "text": "Go", "defaultCode": "type Bitset struct {\n    \n}\n\n\nfunc Constructor(size int) Bitset {\n    \n}\n\n\nfunc (this *Bitset) Fix(idx int)  {\n    \n}\n\n\nfunc (this *Bitset) Unfix(idx int)  {\n    \n}\n\n\nfunc (this *Bitset) Flip()  {\n    \n}\n\n\nfunc (this *Bitset) All() bool {\n    \n}\n\n\nfunc (this *Bitset) One() bool {\n    \n}\n\n\nfunc (this *Bitset) Count() int {\n    \n}\n\n\nfunc (this *Bitset) ToString() string {\n    \n}\n\n\n/**\n * Your Bitset object will be instantiated and called as such:\n * obj := Constructor(size);\n * obj.Fix(idx);\n * obj.Unfix(idx);\n * obj.Flip();\n * param_4 := obj.All();\n * param_5 := obj.One();\n * param_6 := obj.Count();\n * param_7 := obj.ToString();\n */"}, {"value": "ruby", "text": "Ruby", "defaultCode": "class Bitset\n\n=begin\n    :type size: Integer\n=end\n    def initialize(size)\n        \n    end\n\n\n=begin\n    :type idx: Integer\n    :rtype: Void\n=end\n    def fix(idx)\n        \n    end\n\n\n=begin\n    :type idx: Integer\n    :rtype: Void\n=end\n    def unfix(idx)\n        \n    end\n\n\n=begin\n    :rtype: Void\n=end\n    def flip()\n        \n    end\n\n\n=begin\n    :rtype: Boolean\n=end\n    def all()\n        \n    end\n\n\n=begin\n    :rtype: Boolean\n=end\n    def one()\n        \n    end\n\n\n=begin\n    :rtype: Integer\n=end\n    def count()\n        \n    end\n\n\n=begin\n    :rtype: String\n=end\n    def to_string()\n        \n    end\n\n\nend\n\n# Your Bitset object will be instantiated and called as such:\n# obj = Bitset.new(size)\n# obj.fix(idx)\n# obj.unfix(idx)\n# obj.flip()\n# param_4 = obj.all()\n# param_5 = obj.one()\n# param_6 = obj.count()\n# param_7 = obj.to_string()"}, {"value": "scala", "text": "Scala", "defaultCode": "class Bitset(_size: Int) {\n\n    def fix(idx: Int): Unit = {\n        \n    }\n\n    def unfix(idx: Int): Unit = {\n        \n    }\n\n    def flip(): Unit = {\n        \n    }\n\n    def all(): Boolean = {\n        \n    }\n\n    def one(): Boolean = {\n        \n    }\n\n    def count(): Int = {\n        \n    }\n\n    def toString(): String = {\n        \n    }\n\n}\n\n/**\n * Your Bitset object will be instantiated and called as such:\n * val obj = new Bitset(size)\n * obj.fix(idx)\n * obj.unfix(idx)\n * obj.flip()\n * val param_4 = obj.all()\n * val param_5 = obj.one()\n * val param_6 = obj.count()\n * val param_7 = obj.toString()\n */"}, {"value": "rust", "text": "Rust", "defaultCode": "struct Bitset {\n\n}\n\n\n/** \n * `&self` means the method takes an immutable reference.\n * If you need a mutable reference, change it to `&mut self` instead.\n */\nimpl Bitset {\n\n    fn new(size: i32) -> Self {\n        \n    }\n    \n    fn fix(&self, idx: i32) {\n        \n    }\n    \n    fn unfix(&self, idx: i32) {\n        \n    }\n    \n    fn flip(&self) {\n        \n    }\n    \n    fn all(&self) -> bool {\n        \n    }\n    \n    fn one(&self) -> bool {\n        \n    }\n    \n    fn count(&self) -> i32 {\n        \n    }\n    \n    fn to_string(&self) -> String {\n        \n    }\n}\n\n/**\n * Your Bitset object will be instantiated and called as such:\n * let obj = Bitset::new(size);\n * obj.fix(idx);\n * obj.unfix(idx);\n * obj.flip();\n * let ret_4: bool = obj.all();\n * let ret_5: bool = obj.one();\n * let ret_6: i32 = obj.count();\n * let ret_7: String = obj.to_string();\n */"}, {"value": "racket", "text": "Racket", "defaultCode": "(define bitset%\n  (class object%\n    (super-new)\n    \n    ; size : exact-integer?\n    (init-field\n      size)\n    \n    ; fix : exact-integer? -> void?\n    (define/public (fix idx)\n      )\n    ; unfix : exact-integer? -> void?\n    (define/public (unfix idx)\n      )\n    ; flip : -> void?\n    (define/public (flip)\n      )\n    ; all : -> boolean?\n    (define/public (all)\n      )\n    ; one : -> boolean?\n    (define/public (one)\n      )\n    ; count : -> exact-integer?\n    (define/public (count)\n      )\n    ; to-string : -> string?\n    (define/public (to-string)\n      )))\n\n;; Your bitset% object will be instantiated and called as such:\n;; (define obj (new bitset% [size size]))\n;; (send obj fix idx)\n;; (send obj unfix idx)\n;; (send obj flip)\n;; (define param_4 (send obj all))\n;; (define param_5 (send obj one))\n;; (define param_6 (send obj count))\n;; (define param_7 (send obj to-string))"}, {"value": "erlang", "text": "Erlang", "defaultCode": "-spec bitset_init_(Size :: integer()) -> any().\nbitset_init_(Size) ->\n  .\n\n-spec bitset_fix(Idx :: integer()) -> any().\nbitset_fix(Idx) ->\n  .\n\n-spec bitset_unfix(Idx :: integer()) -> any().\nbitset_unfix(Idx) ->\n  .\n\n-spec bitset_flip() -> any().\nbitset_flip() ->\n  .\n\n-spec bitset_all() -> boolean().\nbitset_all() ->\n  .\n\n-spec bitset_one() -> boolean().\nbitset_one() ->\n  .\n\n-spec bitset_count() -> integer().\nbitset_count() ->\n  .\n\n-spec bitset_to_string() -> unicode:unicode_binary().\nbitset_to_string() ->\n  .\n\n\n%% Your functions will be called as such:\n%% bitset_init_(Size),\n%% bitset_fix(Idx),\n%% bitset_unfix(Idx),\n%% bitset_flip(),\n%% Param_4 = bitset_all(),\n%% Param_5 = bitset_one(),\n%% Param_6 = bitset_count(),\n%% Param_7 = bitset_to_string(),\n\n%% bitset_init_ will be called before every test case, in which you can do some necessary initializations."}, {"value": "elixir", "text": "Elixir", "defaultCode": "defmodule Bitset do\n  @spec init_(size :: integer) :: any\n  def init_(size) do\n    \n  end\n\n  @spec fix(idx :: integer) :: any\n  def fix(idx) do\n    \n  end\n\n  @spec unfix(idx :: integer) :: any\n  def unfix(idx) do\n    \n  end\n\n  @spec flip() :: any\n  def flip() do\n    \n  end\n\n  @spec all() :: boolean\n  def all() do\n    \n  end\n\n  @spec one() :: boolean\n  def one() do\n    \n  end\n\n  @spec count() :: integer\n  def count() do\n    \n  end\n\n  @spec to_string() :: String.t\n  def to_string() do\n    \n  end\nend\n\n# Your functions will be called as such:\n# Bitset.init_(size)\n# Bitset.fix(idx)\n# Bitset.unfix(idx)\n# Bitset.flip()\n# param_4 = Bitset.all()\n# param_5 = Bitset.one()\n# param_6 = Bitset.count()\n# param_7 = Bitset.to_string()\n\n# Bitset.init_ will be called before every test case, in which you can do some necessary initializations."}]
{
  "classname": "Bitset",
  "constructor": {
    "params": [
      {
        "type": "integer",
        "name": "size"
      }
    ]
  },
  "methods": [
    {
      "params": [
        {
          "type": "integer",
          "name": "idx"
        }
      ],
      "name": "fix",
      "return": {
        "type": "void"
      }
    },
    {
      "params": [
        {
          "type": "integer",
          "name": "idx"
        }
      ],
      "name": "unfix",
      "return": {
        "type": "void"
      }
    },
    {
      "params": [],
      "name": "flip",
      "return": {
        "type": "void"
      }
    },
    {
      "params": [],
      "name": "all",
      "return": {
        "type": "boolean"
      }
    },
    {
      "params": [],
      "name": "one",
      "return": {
        "type": "boolean"
      }
    },
    {
      "params": [],
      "name": "count",
      "return": {
        "type": "integer"
      }
    },
    {
      "params": [],
      "name": "toString",
      "return": {
        "type": "string"
      }
    }
  ],
  "return": {
    "type": "boolean"
  },
  "systemdesign": true,
  "manual": false
}
{"cpp": ["C++", "<p>Compiled with <code> clang 19 </code> using the latest C++ 23 standard, and <code>libstdc++</code> provided by GCC 14.</p>\r\n\r\n<p>Your code is compiled with level two optimization (<code>-O2</code>). <a href=\"https://github.com/google/sanitizers/wiki/AddressSanitizer\" target=\"_blank\">AddressSanitizer</a> is also enabled to help detect out-of-bounds and use-after-free bugs.</p>\r\n\r\n<p>Most standard library headers are already included automatically for your convenience.</p>"], "java": ["Java", "<p><code>OpenJDK 21</code>. Using compile arguments: <code>--enable-preview --release 21</code></p>\r\n\r\n<p>Most standard library headers are already included automatically for your convenience.</p>\r\n<p>Includes <code>Pair</code> class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.</p>"], "python": ["Python", "<p><code>Python 2.7.18</code>.</p>\r\n\r\n<p>Most libraries are already imported automatically for your convenience, such as <a href=\"https://docs.python.org/2/library/array.html\" target=\"_blank\">array</a>, <a href=\"https://docs.python.org/2/library/bisect.html\" target=\"_blank\">bisect</a>, <a href=\"https://docs.python.org/2/library/collections.html\" target=\"_blank\">collections</a>. If you need more libraries, you can import it yourself.</p>\r\n\r\n<p>For Map/TreeMap data structure, you may use <a href=\"http://www.grantjenks.com/docs/sortedcontainers/\" target=\"_blank\">sortedcontainers</a> library.</p>\r\n\r\n<p>Note that Python 2.7 <a href=\"https://www.python.org/dev/peps/pep-0373/\" target=\"_blank\">is not maintained anymore</a>. For the latest Python, please choose Python3 instead.</p>"], "c": ["C", "<p>Compiled with <code>gcc 14</code> using the gnu11 standard.</p>\r\n\r\n<p>Your code is compiled with level one optimization (<code>-O2</code>). <a href=\"https://github.com/google/sanitizers/wiki/AddressSanitizer\" target=\"_blank\">AddressSanitizer</a> is also enabled to help detect out-of-bounds and use-after-free bugs.</p>\r\n\r\n<p>Most standard library headers are already included automatically for your convenience.</p>\r\n\r\n<p>For hash table operations, you may use <a href=\"https://troydhanson.github.io/uthash/\" target=\"_blank\">uthash</a>. \"uthash.h\" is included by default. Below are some examples:</p>\r\n\r\n<p><b>1. Adding an item to a hash.</b>\r\n<pre>\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</pre>\r\n</p>\r\n\r\n<p><b>2. Looking up an item in a hash:</b>\r\n<pre>\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</pre>\r\n</p>\r\n\r\n<p><b>3. Deleting an item in a hash:</b>\r\n<pre>\r\nvoid delete_user(struct hash_entry *user) {\r\n    HASH_DEL(users, user);  \r\n}\r\n</pre>\r\n</p>"], "csharp": ["C#", "<p><a href=\"https://learn.microsoft.com/en-us/dotnet/csharp/whats-new/csharp-13\" target=\"_blank\">C# 13</a> with .NET 9 runtime</p>"], "javascript": ["JavaScript", "<p><code>Node.js 22.14.0</code>.</p>\r\n\r\n<p>Your code is run with <code>--harmony</code> flag, enabling <a href=\"http://node.green/\" target=\"_blank\">new ES6 features</a>.</p>\r\n\r\n<p><a href=\"https://lodash.com\" target=\"_blank\">lodash.js</a> library is included by default.</p>\r\n\r\n<p>For Priority Queue / Queue data structures, you may use 6.3.2 version of <a href=\"https://github.com/datastructures-js/priority-queue/tree/v6.3.2\" target=\"_blank\">datastructures-js/priority-queue</a> and 4.2.3 version of <a href=\"https://github.com/datastructures-js/queue/tree/v4.2.3\" target=\"_blank\">datastructures-js/queue</a> and 1.0.4 version of <a href=\"https://github.com/datastructures-js/deque/tree/v1.0.4\" target=\"_blank\">datastructures-js/deque</a>.</p>"], "ruby": ["Ruby", "<p><code>Ruby 3.2</code></p>\r\n\r\n<p>Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms</p>"], "swift": ["Swift", "<p><code>Swift 6.0</code>.</p>\r\n\r\n<p>You may use the following packages:<br/>\r\n<a href=\"https://github.com/apple/swift-algorithms/tree/1.2.0\" target=\"_blank\">swift-algorithms 1.2.0</a><br/>\r\n<a href=\"https://github.com/apple/swift-collections/tree/1.1.4\" target=\"_blank\">swift-collections 1.1.4</a><br/>\r\n<a href=\"https://github.com/apple/swift-numerics/tree/1.0.2\" target=\"_blank\">swift-numerics 1.0.2</a></p>"], "golang": ["Go", "<p><code>Go 1.23</code></p>\r\n<p>Support <a href=\"https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1\" target=\"_blank\">https://pkg.go.dev/github.com/emirpasic/gods@v1.18.1</a> and <a href=\"https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha\" target=\"_blank\">https://pkg.go.dev/github.com/emirpasic/gods/v2@v2.0.0-alpha</a> library.</p>"], "python3": ["Python3", "<p><code>Python 3.11</code>.</p>\r\n\r\n<p>Most libraries are already imported automatically for your convenience, such as <a href=\"https://docs.python.org/3/library/array.html\" target=\"_blank\">array</a>, <a href=\"https://docs.python.org/3/library/bisect.html\" target=\"_blank\">bisect</a>, <a href=\"https://docs.python.org/3/library/collections.html\" target=\"_blank\">collections</a>. If you need more libraries, you can import it yourself.</p>\r\n\r\n<p>For Map/TreeMap data structure, you may use <a href=\"http://www.grantjenks.com/docs/sortedcontainers/\" target=\"_blank\">sortedcontainers</a> library.</p>"], "scala": ["Scala", "<p><code>Scala 3.3.1</code>.</p>"], "kotlin": ["Kotlin", "<p><code>Kotlin 2.1.10</code>.</p>"], "rust": ["Rust", "<p><code>Rust 1.85.0</code>. Your code will be compiled with <code>opt-level</code> 2.</p>\r\n\r\n<p>Supports <a href=\"https://crates.io/crates/rand\" target=\"_blank\">rand v0.8</a> and <a href=\"https://crates.io/crates/regex\" target=\"_blank\">regex\u00a0v1</a> and <a href=\"https://crates.io/crates/itertools\" target=\"_blank\">itertools\u00a0v0.14</a> from crates.io</p>"], "php": ["PHP", "<p><code>PHP 8.2</code>.</p>\r\n<p>With bcmath module</p>"], "typescript": ["Typescript", "<p><code>TypeScript 5.7.3, Node.js 22.14.0</code>.</p>\r\n\r\n<p>Compile Options: <code>--alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2024</code></p>\r\n\r\n<p><a href=\"https://lodash.com\" target=\"_blank\">lodash.js</a> library is included by default.</p>\r\n\r\n<p>For Priority Queue / Queue data structures, you may use 6.3.2 version of <a href=\"https://github.com/datastructures-js/priority-queue/tree/v6.3.2\" target=\"_blank\">datastructures-js/priority-queue</a> and 4.2.3 version of <a href=\"https://github.com/datastructures-js/queue/tree/v4.2.3\" target=\"_blank\">datastructures-js/queue</a> and 1.0.4 version of <a href=\"https://github.com/datastructures-js/deque/tree/v1.0.4\" target=\"_blank\">datastructures-js/deque</a>.</p>"], "racket": ["Racket", "<p><a href=\"https://docs.racket-lang.org/guide/performance.html#%28tech._c%29\" target=\"_blank\">Racket CS</a> v8.15</p>\r\n\r\n<p>Using <code>#lang racket</code></p>\r\n\r\n<p>Required <code>data/gvector data/queue data/order data/heap</code> automatically for your convenience</p>"], "erlang": ["Erlang", "Erlang/OTP 26"], "elixir": ["Elixir", "Elixir 1.17 with Erlang/OTP 26"], "dart": ["Dart", "<p>Dart 3.2. You may use package <a href=\"https://pub.dev/packages/collection/versions/1.18.0\" target=\"_blank\">collection</a></p>\r\n\r\n<p>Your code will be run directly without compiling</p>"]}
['Array', 'Hash Table', 'String', 'Design']