DSR-Bench
Collection
Datasets of DSR-Bench: a benchmark aiming to evaluate LLMs' capacity for structural reasoning through data structure tasks. • 5 items • Updated
question_id stringlengths 64 64 | category stringclasses 6
values | task stringclasses 17
values | operation stringclasses 16
values | question stringlengths 229 7.1k | ground_truth stringlengths 0 3.07k | prompt stringclasses 5
values | length stringclasses 3
values | release_date timestamp[ms]date 2025-05-14 00:00:00 2025-05-14 00:00:00 | removal_date stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|
0480425417ffee6c99473b63e6582562f457548e237556409ec0f7524dce5254 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [[91, 1]], [], [[53, 64], [83, 51]], [], [[45, 88]], [], [], [], [[49, 45]] | Stepwise | short | 2025-05-14T00:00:00 | |
b3540068e0e6b76bd0dd73a1abe77a3048fbd43401dde25cfcf4ee9a737e9d73 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [[63, 74]], [[34, 24]], [], [], [], [[68, 10]], [[9, 59], [59, 5]] | Stepwise | short | 2025-05-14T00:00:00 | |
fc22a01e1bd35011beee3d9f73bd0f417cc6e82ec5821bbed085c2d7b9a9f465 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [[3, 15], [83, 81]], [], [], [], [], [[18, 31]], [[9, 88]] | Stepwise | short | 2025-05-14T00:00:00 | |
919389a3a02807ead73cf99c31e00fdcee14e6c023f623a98e375c5761ce5bf9 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[80, 22], [10, 54]], [], [[52, 10]], [[63, 63]], [], [], [], [], [], [[49, 33]] | Stepwise | short | 2025-05-14T00:00:00 | |
785781e918ec36cf376d9d6e9809105532b65c90fda82ba0e595c67533468557 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[70, 39], [20, 41]], [], [[62, 88]], [], [[44, 33]], [], [], [], [], [] | Stepwise | short | 2025-05-14T00:00:00 | |
d07e36fbd600e20d09a0fd5de2ea8710847fd81dac4ecf086d1b4f1eaa365a57 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [[43, 64], [63, 43]], [], [], [[86, 7]], [[97, 75]], [], [[99, 58]] | Stepwise | short | 2025-05-14T00:00:00 | |
594babf4decd0b98bfa0b22da2e56efdbb307b1b800312875e942068ba3434b6 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[20, 38], [60, 13]], [], [], [], [], [], [[56, 11]], [[97, 16]], [], [] | Stepwise | short | 2025-05-14T00:00:00 | |
0c75e8cde1fd991643b2a064a6326efa75e8311e401860f6473a8ec8bc578668 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[60, 5], [0, 66]], [[1, 89], [51, 95], [31, 6]], [], [], [], [[75, 44], [15, 74]], [], [], [], [[69, 1], [9, 89]] | Stepwise | short | 2025-05-14T00:00:00 | |
e0aba1621c88ca2648863f1bb21c69d191fd36fffaacebffd2606f6202b9a6c0 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [[21, 13], [51, 69]], [], [], [], [[75, 4]], [], [[47, 9]], [], [[49, 38]] | Stepwise | short | 2025-05-14T00:00:00 | |
61babb2b282cfc6b4f29677ce026fb0da4ea341a47203459467a6f088d24a8d0 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[30, 45]], [[71, 97]], [], [], [[4, 98], [94, 34]], [], [], [], [], [] | Stepwise | short | 2025-05-14T00:00:00 | |
0be4b3b393b5d7907098118907700f320582553c264144a5684660ae6fb8fc5f | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [[72, 40]], [], [], [[95, 46]], [], [], [], [[99, 23]] | Stepwise | short | 2025-05-14T00:00:00 | |
fe04d8fa3d6943cc2a56091b2255ddf671f6e2fcd75adaf43a01e57e42ff9099 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [], [], [], [[76, 75]], [], [], [[9, 36]] | Stepwise | short | 2025-05-14T00:00:00 | |
34bd110fa51e64271051071339a61f203a72328e1685d157fe9346dce218c64e | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [[91, 54]], [], [], [], [[15, 90]], [], [[97, 2]], [], [] | Stepwise | short | 2025-05-14T00:00:00 | |
fa357d5fb1e8af5a5e3b06562ff25b08e5d475b963621592c898e3a73eacb907 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [[91, 42]], [], [], [], [], [[26, 3]], [], [], [] | Stepwise | short | 2025-05-14T00:00:00 | |
e0ab9e1251a481e1728ae4e94a925f2026c4e1258eeb3ca7557373ac95ca8d70 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [[81, 31]], [[92, 41]], [], [], [[15, 52]], [], [[47, 20]], [[8, 49]], [] | Stepwise | short | 2025-05-14T00:00:00 | |
f999e12db5bddb62e9137ffb083683d081a5c3a0fd6206cebfd07fae1fd0ec79 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[60, 75]], [], [], [], [[94, 13], [24, 22]], [[65, 63], [25, 24]], [[66, 38]], [], [[48, 19]], [] | Stepwise | short | 2025-05-14T00:00:00 | |
e068bb51ebed9a3c025d68f3507e10c6b8d390d4c8b636115daed9c44409a788 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[20, 71]], [], [], [[93, 92]], [], [], [], [], [], [] | Stepwise | short | 2025-05-14T00:00:00 | |
35797634278025f87080e6e0e31dbaa7431433c785457ce62113c93e0cbb4606 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [[81, 85], [51, 90]], [], [], [[74, 76], [14, 74]], [], [], [], [], [] | Stepwise | short | 2025-05-14T00:00:00 | |
1322fa101c0ffd6105cc47f110dbb896bb9941dd62c692d0a18a35ca0fbae688 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [[13, 85]], [], [], [], [], [[18, 98], [8, 17]], [] | Stepwise | short | 2025-05-14T00:00:00 | |
5b22f8919cdc4913f3357bccefe6da487a39ed424e2cf7d111805718c58ee1c0 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[60, 93]], [[51, 42]], [[32, 5]], [[33, 74], [93, 51], [83, 21]], [], [], [], [], [[38, 82], [28, 46]], [[19, 36]] | Stepwise | short | 2025-05-14T00:00:00 | |
a7a011c242bbb4e542c80b082ee36edb32c22429a2b1826c9be7677dc91bed08 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[20, 64]], [[31, 5]], [], [[63, 68]], [], [], [], [[77, 6]], [], [] | Stepwise | short | 2025-05-14T00:00:00 | |
ff359f7b9e53f70747c28c6487d7a596409ac99a6da5447a2a85bf8d4b6e673b | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [[3, 88]], [], [[45, 56]], [], [], [[78, 79]], [[99, 6]] | Stepwise | short | 2025-05-14T00:00:00 | |
69fc5bf7260e1b1eb2ed6c556b24d4ac9afb7fa35cee231acdb1968a18562885 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [[71, 88]], [], [], [[24, 39], [34, 21]], [], [], [], [], [] | Stepwise | short | 2025-05-14T00:00:00 | |
cd45192de1cc97ae5bf6b61280851a5dc0b83ac38bd927b5b389e604d0f8dab0 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[60, 40]], [[21, 79]], [], [], [], [], [], [], [], [] | Stepwise | short | 2025-05-14T00:00:00 | |
c0fc58972f27b9c7372c14163d68b40710d6a63e5c58c0b6efd473fbe75ca476 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[70, 79]], [], [], [], [], [[45, 98]], [], [[97, 67]], [], [] | Stepwise | short | 2025-05-14T00:00:00 | |
227f10ab6d4eedf85c8ef34e1b86c6a6283f0b99822cf3c55ad7770df092d61f | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [[92, 97]], [[3, 16]], [], [], [[96, 80]], [[57, 88]], [], [[89, 46]] | Stepwise | short | 2025-05-14T00:00:00 | |
2fd539401e2cee15ecce1555e37f46b33062dcaeda58b49103fb68c57037ee5d | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [[72, 76], [22, 37]], [], [[24, 9]], [], [], [[17, 38], [77, 34]], [], [] | Stepwise | short | 2025-05-14T00:00:00 | |
7e0011ff7ea23f965c0a9cd20db6daafe1417838f3d1bc7b5e5f7c4cedafba20 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [[73, 38]], [], [], [[26, 88], [6, 89]], [[37, 55]], [[68, 10]], [] | Stepwise | short | 2025-05-14T00:00:00 | |
64103e894acf8a46a2eb3a41ccf4c101848bfa02443f6af2cf4eb30d8c6667b8 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[80, 67], [10, 80], [90, 34], [70, 42]], [], [[2, 18], [92, 38], [12, 78]], [], [], [[65, 74], [55, 28]], [], [], [], [] | Stepwise | short | 2025-05-14T00:00:00 | |
ecbd58c13beee351228c9e5c5cd24c20c6d6d555811c4be71e6cb648faf937eb | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [], [[74, 18]], [], [[96, 58]], [], [], [[79, 64]] | Stepwise | short | 2025-05-14T00:00:00 | |
cc704f7b420398d86b829e865a4e8dcdb6aea19043447fa92da017d37f413b03 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [[91, 1]], [], [[53, 64], [83, 51]], [], [[45, 88]], [], [], [], [[49, 45]] | 0-CoT | short | 2025-05-14T00:00:00 | |
18a6910ffb6183faba57ee8f779125fe0914fa25392e637b4d47cd66c39daa28 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [[63, 74]], [[34, 24]], [], [], [], [[68, 10]], [[9, 59], [59, 5]] | 0-CoT | short | 2025-05-14T00:00:00 | |
45d2a139d1ec672a8a51ebbb27a95424d97c1143cecd36ab4f6041059e77dc3b | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [[3, 15], [83, 81]], [], [], [], [], [[18, 31]], [[9, 88]] | 0-CoT | short | 2025-05-14T00:00:00 | |
e814ee37f3e85203f904de1adb6113c2f09ce3b66f409f9cc6bf10119d89fcbb | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[80, 22], [10, 54]], [], [[52, 10]], [[63, 63]], [], [], [], [], [], [[49, 33]] | 0-CoT | short | 2025-05-14T00:00:00 | |
ebe6887b3944120bc91b990064b952fabe4be4ebdecc53ac1b5dc00e404b002a | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[70, 39], [20, 41]], [], [[62, 88]], [], [[44, 33]], [], [], [], [], [] | 0-CoT | short | 2025-05-14T00:00:00 | |
9b8b442f80a280e5e37d5024633de02a5289ecb35591096c06cd3c0b130bc299 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [[43, 64], [63, 43]], [], [], [[86, 7]], [[97, 75]], [], [[99, 58]] | 0-CoT | short | 2025-05-14T00:00:00 | |
b8e7f28ac491eed57a8267c629873e48dfd69d9b9c1757b551b57dacf23747eb | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[20, 38], [60, 13]], [], [], [], [], [], [[56, 11]], [[97, 16]], [], [] | 0-CoT | short | 2025-05-14T00:00:00 | |
5e7f7c59dcec5a6088adba41b8e887742905d3109454ab7b472c28ce585c9680 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[60, 5], [0, 66]], [[1, 89], [51, 95], [31, 6]], [], [], [], [[75, 44], [15, 74]], [], [], [], [[69, 1], [9, 89]] | 0-CoT | short | 2025-05-14T00:00:00 | |
824a44f1e877c6cbc749ae3e906df0c661ea47c3c2a5cf76f7215d16e01b2186 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [[21, 13], [51, 69]], [], [], [], [[75, 4]], [], [[47, 9]], [], [[49, 38]] | 0-CoT | short | 2025-05-14T00:00:00 | |
a89403d9c6aa1afb64821d913eb160c75596a44a0368e266b51b48d043d8996c | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[30, 45]], [[71, 97]], [], [], [[4, 98], [94, 34]], [], [], [], [], [] | 0-CoT | short | 2025-05-14T00:00:00 | |
646a468c54f643532f42d416dbc5894414eb9f551bbd09ea958f02ff346d1920 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [[72, 40]], [], [], [[95, 46]], [], [], [], [[99, 23]] | 0-CoT | short | 2025-05-14T00:00:00 | |
d57458c473b846f437620231776e290686fc857a02b3837b45e2a24d7a00d33b | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [], [], [], [[76, 75]], [], [], [[9, 36]] | 0-CoT | short | 2025-05-14T00:00:00 | |
ed010f7aea491ee007e51970b87a4a74d4c085dae897d8da9835077932cabcc8 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [[91, 54]], [], [], [], [[15, 90]], [], [[97, 2]], [], [] | 0-CoT | short | 2025-05-14T00:00:00 | |
7eb9c4c7c922d6daf2a92ead67106ba783d507b6764ecedce4bae2eac56ed6e2 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [[91, 42]], [], [], [], [], [[26, 3]], [], [], [] | 0-CoT | short | 2025-05-14T00:00:00 | |
239b0224dd76214fb34577bf681b127f20160cdf7d992aadb2eb32a521d317c6 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [[81, 31]], [[92, 41]], [], [], [[15, 52]], [], [[47, 20]], [[8, 49]], [] | 0-CoT | short | 2025-05-14T00:00:00 | |
0c4780c14d44a48811e283887eb84a2fe93e944db413f766f8b73f036aa62c81 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[60, 75]], [], [], [], [[94, 13], [24, 22]], [[65, 63], [25, 24]], [[66, 38]], [], [[48, 19]], [] | 0-CoT | short | 2025-05-14T00:00:00 | |
41fd8cb1f4ad9cce3bccb18e45ba050b09d1f7cc0739f03f76113e5a7b7f675e | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[20, 71]], [], [], [[93, 92]], [], [], [], [], [], [] | 0-CoT | short | 2025-05-14T00:00:00 | |
ff94f0dbefbf7351ffe8ab9e54f8d34407417ceb3b7a0e56b5d7879312377122 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [[81, 85], [51, 90]], [], [], [[74, 76], [14, 74]], [], [], [], [], [] | 0-CoT | short | 2025-05-14T00:00:00 | |
3e5a896a5d30ea4fbbb4a232ab8ea93eef44595c9aa34ccc5e1cdfa9fdd0dafd | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [[13, 85]], [], [], [], [], [[18, 98], [8, 17]], [] | 0-CoT | short | 2025-05-14T00:00:00 | |
e8706eb96560b40263f695589e582d064fe68720efdb9ea538e170118b0229d5 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[60, 93]], [[51, 42]], [[32, 5]], [[33, 74], [93, 51], [83, 21]], [], [], [], [], [[38, 82], [28, 46]], [[19, 36]] | 0-CoT | short | 2025-05-14T00:00:00 | |
139a57a2b79ad2d5b0aeb6a8ad6403a11d16df987359392349a4b810ad1b4789 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[20, 64]], [[31, 5]], [], [[63, 68]], [], [], [], [[77, 6]], [], [] | 0-CoT | short | 2025-05-14T00:00:00 | |
a94a466838bf898a9fe9eda189719ae6178eb6bf5acf9dbaf3a7c8c61217d2ad | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [[3, 88]], [], [[45, 56]], [], [], [[78, 79]], [[99, 6]] | 0-CoT | short | 2025-05-14T00:00:00 | |
087730a700d9d90ff63525e9c2c2ea230a66469e62961f3fdffd21bc29e9ec8f | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [[71, 88]], [], [], [[24, 39], [34, 21]], [], [], [], [], [] | 0-CoT | short | 2025-05-14T00:00:00 | |
276b24db58a6c6dba4413ea22862a5ed1722b12eb1b85f9845ef2a5ed2a2aa61 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[60, 40]], [[21, 79]], [], [], [], [], [], [], [], [] | 0-CoT | short | 2025-05-14T00:00:00 | |
de257065c899fedb4cee777f49285a9154e0a98fd4c45c211e78c0fa7603b8d5 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[70, 79]], [], [], [], [], [[45, 98]], [], [[97, 67]], [], [] | 0-CoT | short | 2025-05-14T00:00:00 | |
3dd2852005683d3e18f5f92b260221e8b46174d3bef6073d915e996a516f7570 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [[92, 97]], [[3, 16]], [], [], [[96, 80]], [[57, 88]], [], [[89, 46]] | 0-CoT | short | 2025-05-14T00:00:00 | |
a77cffebd9d50e68b155da223393f7d7c42fe34b4fd4e89e549d9b7552064659 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [[72, 76], [22, 37]], [], [[24, 9]], [], [], [[17, 38], [77, 34]], [], [] | 0-CoT | short | 2025-05-14T00:00:00 | |
40dab6b669f3efb47e4960df69f8cfb935edc58b5f693362e5867dbe13e3faa6 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [[73, 38]], [], [], [[26, 88], [6, 89]], [[37, 55]], [[68, 10]], [] | 0-CoT | short | 2025-05-14T00:00:00 | |
d5d992eb819035d326c4223630668a00af76bbc830f89bd5513923086b06bb61 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[80, 67], [10, 80], [90, 34], [70, 42]], [], [[2, 18], [92, 38], [12, 78]], [], [], [[65, 74], [55, 28]], [], [], [], [] | 0-CoT | short | 2025-05-14T00:00:00 | |
a212249ae37c942b4a1a1ea24dafc81f0416891a9a027465e92827a3d2a54fa2 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [], [[74, 18]], [], [[96, 58]], [], [], [[79, 64]] | 0-CoT | short | 2025-05-14T00:00:00 | |
15173fc248184945ee6f98893ff6eb742a8ba5b4f1dd10e0de4563b758ea8884 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [[91, 1]], [], [[53, 64], [83, 51]], [], [[45, 88]], [], [], [], [[49, 45]] | None | short | 2025-05-14T00:00:00 | |
1b84921c6f174eb63b8b0706cca95449e6c7bfb29f052e0bb4e88caf36227870 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [[63, 74]], [[34, 24]], [], [], [], [[68, 10]], [[9, 59], [59, 5]] | None | short | 2025-05-14T00:00:00 | |
8e648a02283b53f04e3f43e9b0b4990b983ff3b4208695d496b0cadc92477812 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [[3, 15], [83, 81]], [], [], [], [], [[18, 31]], [[9, 88]] | None | short | 2025-05-14T00:00:00 | |
64e1f77a0187597a8ee0254a2b4781b1a0e89be9e1365d7441833d32ca39a91c | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[80, 22], [10, 54]], [], [[52, 10]], [[63, 63]], [], [], [], [], [], [[49, 33]] | None | short | 2025-05-14T00:00:00 | |
c7767bbd7e53ac2906767621b3da295b6fa948bd5ba89d9ca70835f7ec6e53e6 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[70, 39], [20, 41]], [], [[62, 88]], [], [[44, 33]], [], [], [], [], [] | None | short | 2025-05-14T00:00:00 | |
b38966a3c9e96795c416c995f105f8026036058dfa19917492d714fc840fad3e | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [[43, 64], [63, 43]], [], [], [[86, 7]], [[97, 75]], [], [[99, 58]] | None | short | 2025-05-14T00:00:00 | |
070165d6e73bb0839b5031a6787ccb8e4403ebc61f2e05f66134b4742a149b75 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[20, 38], [60, 13]], [], [], [], [], [], [[56, 11]], [[97, 16]], [], [] | None | short | 2025-05-14T00:00:00 | |
49b9545e47fa1a49e6dd564410d67e1461756a9f191b787c0f970a678e37bdb0 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[60, 5], [0, 66]], [[1, 89], [51, 95], [31, 6]], [], [], [], [[75, 44], [15, 74]], [], [], [], [[69, 1], [9, 89]] | None | short | 2025-05-14T00:00:00 | |
55190205265add1f0c7fa955b74f731fd542043333344bb0c52ab774396f54b6 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [[21, 13], [51, 69]], [], [], [], [[75, 4]], [], [[47, 9]], [], [[49, 38]] | None | short | 2025-05-14T00:00:00 | |
0939d73e9160f14fe4e09af46c3428732ba50b0c402e0203f7a15040b247487a | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[30, 45]], [[71, 97]], [], [], [[4, 98], [94, 34]], [], [], [], [], [] | None | short | 2025-05-14T00:00:00 | |
d1edad3cd20108d2cdfe006d9f3680d1757dd19813db48c44b48e045beae19da | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [[72, 40]], [], [], [[95, 46]], [], [], [], [[99, 23]] | None | short | 2025-05-14T00:00:00 | |
031641c05b5061b14a87fdfdbe6c787edf94f23c7602c72f6dd8e77029e9ea55 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [], [], [], [[76, 75]], [], [], [[9, 36]] | None | short | 2025-05-14T00:00:00 | |
0674cf9e25e015ba4e07784366ab5e615687b96abaf440298855c32bf2ff0314 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [[91, 54]], [], [], [], [[15, 90]], [], [[97, 2]], [], [] | None | short | 2025-05-14T00:00:00 | |
679ac512ce8566488cbacf0022bce02f307fab55e36ea9178c451a5a5aad54a2 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [[91, 42]], [], [], [], [], [[26, 3]], [], [], [] | None | short | 2025-05-14T00:00:00 | |
244cab4081ea48450aba2cef54ba0252c8f595bed0808131f54201796f6b1903 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [[81, 31]], [[92, 41]], [], [], [[15, 52]], [], [[47, 20]], [[8, 49]], [] | None | short | 2025-05-14T00:00:00 | |
0dd1c4bbfb104b5562b5dc8188677aab5081fb08ae80fa595e5495dd8ce79a0f | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[60, 75]], [], [], [], [[94, 13], [24, 22]], [[65, 63], [25, 24]], [[66, 38]], [], [[48, 19]], [] | None | short | 2025-05-14T00:00:00 | |
d4ce533a42e9137abd3473f403d27454bac2aef3ae5b4cc1b38440abd599ce98 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[20, 71]], [], [], [[93, 92]], [], [], [], [], [], [] | None | short | 2025-05-14T00:00:00 | |
1ebfc44a6cfc8ed55725997b71c59fba29acad943a1ae38c8ddde36c727deeea | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [[81, 85], [51, 90]], [], [], [[74, 76], [14, 74]], [], [], [], [], [] | None | short | 2025-05-14T00:00:00 | |
91e868de2db06402cd019d913c08bb3d3814aef357fd11b37f3585b021770810 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [[13, 85]], [], [], [], [], [[18, 98], [8, 17]], [] | None | short | 2025-05-14T00:00:00 | |
25cc88a13538ab073afb68a8b5480a8538d7184a986d4d8747ff0fb67427f669 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[60, 93]], [[51, 42]], [[32, 5]], [[33, 74], [93, 51], [83, 21]], [], [], [], [], [[38, 82], [28, 46]], [[19, 36]] | None | short | 2025-05-14T00:00:00 | |
56dbd09b9fc72d87430a880f5df07fdaf9d7a166833140c976514f73756921fe | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[20, 64]], [[31, 5]], [], [[63, 68]], [], [], [], [[77, 6]], [], [] | None | short | 2025-05-14T00:00:00 | |
2a5c50b7d85032c1f020cea7d92148def314f092dd118141b97b39b2366ce9cb | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [[3, 88]], [], [[45, 56]], [], [], [[78, 79]], [[99, 6]] | None | short | 2025-05-14T00:00:00 | |
1f8d434c617f66e17cb32b0555ec8d80453e3103a8e06b4012c4356783a90ee9 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [[71, 88]], [], [], [[24, 39], [34, 21]], [], [], [], [], [] | None | short | 2025-05-14T00:00:00 | |
f07b31af927e13c684052ccc661fcd27077b15b0ca4879203d46435608e1ab16 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[60, 40]], [[21, 79]], [], [], [], [], [], [], [], [] | None | short | 2025-05-14T00:00:00 | |
0d141192207fe96b58ec3b00b31a145b8def890fa5def58a1c063347e6b8f33d | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[70, 79]], [], [], [], [], [[45, 98]], [], [[97, 67]], [], [] | None | short | 2025-05-14T00:00:00 | |
a3228cb1b0199b3708435996b3a8cf2f35779b0a0128cecb8eabeb59ab7aa047 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [[92, 97]], [[3, 16]], [], [], [[96, 80]], [[57, 88]], [], [[89, 46]] | None | short | 2025-05-14T00:00:00 | |
9f93c717967f0eaf2f1084f699abb8e23bf0a81dfc677572f399cc29d3d6f3c9 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [[72, 76], [22, 37]], [], [[24, 9]], [], [], [[17, 38], [77, 34]], [], [] | None | short | 2025-05-14T00:00:00 | |
d0e8fd595dd43b2e63c45d6f15e18d639bbe4f94993a0b34d66944d777e0cea9 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [[73, 38]], [], [], [[26, 88], [6, 89]], [[37, 55]], [[68, 10]], [] | None | short | 2025-05-14T00:00:00 | |
28248c568794332bf29cf17c4f633aaf57c714477db5f90eccb4c9373f3fab50 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[80, 67], [10, 80], [90, 34], [70, 42]], [], [[2, 18], [92, 38], [12, 78]], [], [], [[65, 74], [55, 28]], [], [], [], [] | None | short | 2025-05-14T00:00:00 | |
f1d14ca8ea65d96051500f3efad57bd036b9e07ffaa4c8c5d570bf3b8163bc63 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [], [[74, 18]], [], [[96, 58]], [], [], [[79, 64]] | None | short | 2025-05-14T00:00:00 | |
349b04ed2d6b91b972b33ec48aba014e49cd583959a281d1c255acfae3e84579 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [[91, 1]], [], [[53, 64], [83, 51]], [], [[45, 88]], [], [], [], [[49, 45]] | CoT | short | 2025-05-14T00:00:00 | |
98b02a56aedfab9ae192c19cf8ef5ff57c5dab0e04328651c501914a9662dd2d | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [[63, 74]], [[34, 24]], [], [], [], [[68, 10]], [[9, 59], [59, 5]] | CoT | short | 2025-05-14T00:00:00 | |
0cedfdc4ac01275792708cd357172468a680eef39f89050eb5d28ac175490d92 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [[3, 15], [83, 81]], [], [], [], [], [[18, 31]], [[9, 88]] | CoT | short | 2025-05-14T00:00:00 | |
464d7b959b836a31ba5fdf317c53e03e2a6cef6f397d08b8c9726628e636dce6 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[80, 22], [10, 54]], [], [[52, 10]], [[63, 63]], [], [], [], [], [], [[49, 33]] | CoT | short | 2025-05-14T00:00:00 | |
38d807d742bdabe846c15b823aa8cce3539591e1cee915ee58a07c189f435243 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[70, 39], [20, 41]], [], [[62, 88]], [], [[44, 33]], [], [], [], [], [] | CoT | short | 2025-05-14T00:00:00 | |
cd13a8056782695ffaa8b138e893a8d62e9a7a89193be619783e1c73e4a15ce5 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [], [], [[43, 64], [63, 43]], [], [], [[86, 7]], [[97, 75]], [], [[99, 58]] | CoT | short | 2025-05-14T00:00:00 | |
0a562ee5b8812ed98b178bfc560958937bf8a3318dcdd814aeba08b354afeea9 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[20, 38], [60, 13]], [], [], [], [], [], [[56, 11]], [[97, 16]], [], [] | CoT | short | 2025-05-14T00:00:00 | |
e53b7044e8d4b040ce43affdb3cfb3d73ff22e4db091193f4de8af16b0a1d10a | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[60, 5], [0, 66]], [[1, 89], [51, 95], [31, 6]], [], [], [], [[75, 44], [15, 74]], [], [], [], [[69, 1], [9, 89]] | CoT | short | 2025-05-14T00:00:00 | |
793949ea7e29600742f380580ccfb305b35eb91fea41bbd871f7b0f5d0bed64a | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [], [[21, 13], [51, 69]], [], [], [], [[75, 4]], [], [[47, 9]], [], [[49, 38]] | CoT | short | 2025-05-14T00:00:00 | |
7012f5430e7dfd5faba687156595648ec6f12545599ddcc32e38392f648aacd5 | associative | hashmap | compound | A hashmap is a dictionary that stores key-value pairs. It has two operations: (add, (key, value)) and (delete, key).
1. (add, (key, value)) adds a (key, value) pair to the hashmap by a) mapping key to a bucket using hash function, and b) put (key, value) pair in the bucket. If key exists in the bucket already, update... | [[30, 45]], [[71, 97]], [], [], [[4, 98], [94, 34]], [], [], [], [], [] | CoT | short | 2025-05-14T00:00:00 |
End of preview. Expand in Data Studio
Dataset Card for "DSR-Bench-main"
DSR-Bench is a benchmark for LLMs designed to test their structural reasoning ability: the ability to understand and manipulate data according to specific relationships such as order, hierarchy, and connectivity. It contains 6 categories of 20 data structures, 30 operations, summing up to a total of 2700 questions.
Dataset Summary
The strengths of DSR-Bench include:
Hierarchical organization: Tasks are organized by increasing structural complexity, enabling a fine-grained analysis of specific reasoning skills. Within each category, we design a range of tasks to isolate different sources of structural complexity, allowing structural reasoning to be broken down into progressively more challenging tasks. This approach precisely identifies the specific types of data relationships that pose difficulties for LLM reasoning.
Deterministic evaluation: Each data structure task has a concise and well-defined correct final state, allowing for deterministic and unambiguous scoring. Unlike open-ended tasks, this design supports fully automated evaluation without the need for human or model-based judgment, resulting in a fairer and more objective evaluation pipeline.
Low-contamination data: All tasks are generated efficiently from synthetic distributions, significantly reducing contamination risks from pretraining data. This setup also enables large-scale evaluation with minimal human involvement.
Data Fields
Category
Linear (Sequential): Linear relationships are the simplest forms of structured data, exemplified by structures such as arrays. Tasks in this category evaluate the ability to handle sequential access, index-based operations, and ordered insertions or deletions under strict positional constraints.
Temporal (Time-based ordering): Temporal reasoning is central to systems that depend on ordered execution over time, such as event queues and schedulers. Structures such as stacks, queues, priority queues, and skip lists operate under Last-In-First-Out (LIFO), First-In-First-Out (FIFO), priority, or probabilistic rules. The tasks designed for these structures test whether a model can simulate these ordered processes and maintain consistent state transitions.
Associative (Key-value mapping): Associative structures, such as hashmaps, tries, and suffix trees, support efficient lookup and structured access in systems like databases. Tasks in this category probe the model’s ability to understand and manipulate mappings, perform key-based insertions and retrievals, and carry out pattern matching within nested or hashed structures.
Hierarchical (Tree-like): Hierarchical data structures appear in contexts ranging from file systems to database indexing. We include binary search trees, heaps, red-black trees, and B+ trees in the benchmark. These tasks assess whether the model can maintain different structural properties, perform updates efficiently, and simulate recursive operations.
Network (Connectivity and group membership): Graphs naturally capture many-to-many relationships, for example, in social networks where users interact with multiple others. In contrast, disjoint sets represent partitions and are useful for tracking group membership or connected components. Tasks in this category evaluate a model’s ability to reason about connectivity, perform graph traversals, and manage dynamic groupings via union-find or path compression.
Hybrid (Combined relationships): Real-world systems often employ hybrid data structures that combine multiple relational principles. This category includes LRU caches, integrating temporal and memory constraints; bloom filters, designed for probabilistic set membership queries; and Directed Acyclic Word Graphs, which are trie-like hierarchical graphs. These tasks assess whether a model can generalize beyond individual structural concepts and reason over combined constraints.
Task
Specifies which data structure task is the
Operation
Specifies what operation on the data structure the task asks the model to perform. Compound tasks are ones consisting a sequence of operations (such as add and delete for heap), aiming to test LLMs' multi-step reasoning ability.
- Downloads last month
- 9