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 | task stringclasses 7
values | mode stringclasses 3
values | question listlengths 1 1 | ground_truth stringlengths 1 347 | release_date timestamp[ms]date 2025-10-13 00:00:00 2025-10-13 00:00:00 | removal_date stringclasses 1
value |
|---|---|---|---|---|---|---|
65e3e7e55126305ed1540b0359c23c56aba5014e371d2c71f34fa6612a6e2d5a | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['a', 'F'], ['d', 'F'], ['i', 'F'], ['o', 'F'], ['ac', 'F'], ['as', 'F'], ['dy', 'F'], ['is', 'F'], ['ob', 'F'], ['aca', 'F'], ['asd', 'F'], ['ash', 'T'], ['dyh', 'F'], ['isy', 'F'], ['obw', 'F'], ['acan', 'F'], ['asdt', 'F'], ['dyhg', 'F'], ['isyt', 'F'], ['obwo', 'F'], ['acanv', 'F'], ['asdto', 'F'], ['dy... | 2025-10-13T00:00:00 | |
38c1a1c3c7235560a348e055c3a34a34530d8fb72d918b296c377a254e3e0520 | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['b', 'F'], ['r', 'F'], ['z', 'F'], ['by', 'F'], ['rv', 'F'], ['zb', 'F'], ['byb', 'F'], ['byl', 'F'], ['rvm', 'F'], ['zbd', 'F'], ['bybi', 'T'], ['rvmu', 'F'], ['rvmue', 'F']] | 2025-10-13T00:00:00 | |
42217f1c418edb87987eb8e856699d41025872faa781615831b46f1145586e6e | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['b', 'F'], ['g', 'F'], ['h', 'F'], ['bc', 'F'], ['gi', 'F'], ['gt', 'F'], ['hz', 'F'], ['bcd', 'T'], ['hzt', 'F'], ['hztr', 'F']] | 2025-10-13T00:00:00 | |
0319cf5a4667b7d23f1dafdc97130206fed87c22c4969edeb4bea170407b99c2 | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['n', 'F'], ['v', 'F'], ['ng', 'F'], ['nm', 'F'], ['vb', 'F'], ['ve', 'F'], ['ngx', 'F'], ['nmh', 'F'], ['nmn', 'F'], ['vbe', 'F'], ['vei', 'F'], ['ngxf', 'F'], ['nmhp', 'T'], ['nmnr', 'F'], ['vbep', 'F'], ['ngxff', 'F'], ['vbepf', 'F'], ['vbepft', 'T']] | 2025-10-13T00:00:00 | |
09718652513381fbfdc83cfd6f70b96e78cb55a3cd1c1f0634422d731487c77e | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F']] | 2025-10-13T00:00:00 | |
53e631196ddf7a02db80c42a36c52d5846765f0785cd3f0fef7c0de9808233ce | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['k', 'F'], ['v', 'F'], ['ko', 'F'], ['vi', 'F'], ['koi', 'T'], ['kom', 'T'], ['viq', 'F'], ['viqp', 'F']] | 2025-10-13T00:00:00 | |
1488a7696875060bacca5d13a3de3ae1784509af566411eeecdb30ddd6270bab | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['d', 'F'], ['z', 'F'], ['di', 'F'], ['zu', 'F'], ['div', 'F'], ['zuv', 'T'], ['divu', 'F']] | 2025-10-13T00:00:00 | |
1a374f44d93f43a78950d9b7ce6e644e4f17b03242523dae3610839ed4ebdd48 | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['n', 'F'], ['nc', 'F'], ['ncq', 'T']] | 2025-10-13T00:00:00 | |
e714598e75e61aa33ac75bed773fd1ad61307f5cf14c2fc6c7f10a3877be6a68 | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['o', 'F'], ['r', 'F'], ['v', 'F'], ['oz', 'F'], ['ri', 'F'], ['vc', 'F'], ['vu', 'F'], ['vz', 'F'], ['ozi', 'F'], ['rij', 'T'], ['vcu', 'F'], ['vub', 'F'], ['vzq', 'F'], ['vcuh', 'F'], ['vubr', 'F'], ['vcuht', 'F']] | 2025-10-13T00:00:00 | |
6824609bbc32deb99ee913772bcd26360221cc5fa20c4f6ffceabf27b63ad43b | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['p', 'F'], ['t', 'F'], ['pg', 'F'], ['te', 'F'], ['pgj', 'F'], ['teg', 'F'], ['teu', 'F'], ['pgjj', 'T'], ['tege', 'F'], ['teuh', 'F']] | 2025-10-13T00:00:00 | |
38369ef5f7246f332b7dcf9406eb023940c2c5e7250ffe2b8f6e66523cb38609 | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['f', 'F'], ['k', 'F'], ['m', 'F'], ['fa', 'F'], ['fh', 'F'], ['kz', 'F'], ['me', 'F'], ['faz', 'F'], ['fhq', 'F'], ['kzg', 'T'], ['mek', 'F'], ['fazz', 'F'], ['fhqd', 'F'], ['mekp', 'F'], ['fhqdq', 'F'], ['mekpk', 'F']] | 2025-10-13T00:00:00 | |
eee8eae6bf3a7adfec65f967eefb487b44301cc7da1e9a5afa020587fac10e0b | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['a', 'F'], ['i', 'F'], ['p', 'F'], ['ai', 'F'], ['io', 'F'], ['pd', 'F'], ['aia', 'F'], ['ioc', 'F'], ['pdx', 'T'], ['iocx', 'F']] | 2025-10-13T00:00:00 | |
1185b4058e0c2a54d7148dba22785435b477ed2e93d5980d807054812481e22f | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['a', 'F'], ['q', 'F'], ['ab', 'F'], ['qu', 'F'], ['abi', 'F'], ['qut', 'F'], ['abia', 'T'], ['qutb', 'F'], ['qutbr', 'F']] | 2025-10-13T00:00:00 | |
a5ba5f80b41ed6003fe3cc9f176322793e9c5fe540a2cab2c9b9139b92b04183 | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['i', 'F'], ['n', 'F'], ['u', 'F'], ['id', 'F'], ['nn', 'F'], ['uh', 'F'], ['ut', 'F'], ['idl', 'T'], ['nne', 'F'], ['nnek', 'F'], ['nnekh', 'F']] | 2025-10-13T00:00:00 | |
568a9aae65ce220eadc09cf5208992362ecfc4e1dd01c18eaf38f80c6010f0e6 | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['a', 'F'], ['az', 'F'], ['azd', 'T']] | 2025-10-13T00:00:00 | |
29909db716dd4f1f16213dd19bec1d6786c9a8b642a256aa027b7758d1d04d6a | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F']] | 2025-10-13T00:00:00 | |
3d0860b9aeb2b29dc5b37ca941aebd65cd3de8a5974171ca841f2c3d1ae7136e | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['l', 'F'], ['r', 'F'], ['lk', 'F'], ['rf', 'F'], ['ri', 'F'], ['lkm', 'T'], ['rfu', 'F'], ['rie', 'F'], ['rfuj', 'F'], ['riec', 'F'], ['rfujs', 'F']] | 2025-10-13T00:00:00 | |
fb5297d391cd6946def0399057561e9902e0cbe2826f74533eab13b15bb243c7 | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['e', 'F'], ['q', 'F'], ['v', 'F'], ['en', 'F'], ['qi', 'F'], ['vi', 'F'], ['vv', 'F'], ['enc', 'F'], ['env', 'F'], ['qig', 'T'], ['vir', 'F'], ['virl', 'F']] | 2025-10-13T00:00:00 | |
3738d82408e4d3663446f244e496891cef0a198741f40caa8919455743a32cd1 | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F']] | 2025-10-13T00:00:00 | |
6525825d9fc4c0bf4df67b5030761d71fc13f9a1be6789dd597acdd232867849 | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['a', 'F'], ['b', 'F'], ['al', 'F'], ['av', 'F'], ['bi', 'F'], ['alu', 'F'], ['avv', 'F'], ['bif', 'F'], ['alua', 'F'], ['avvl', 'F'], ['bifw', 'F'], ['aluaz', 'F'], ['avvlk', 'T'], ['bifwv', 'T']] | 2025-10-13T00:00:00 | |
e04fd3ac86c873239b2edf9ac57a40078dc182ab7a12a9acfa10dcaf6c5a6d55 | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['e', 'F'], ['j', 'F'], ['ez', 'F'], ['jm', 'F'], ['eze', 'T'], ['ezi', 'F'], ['ezk', 'F'], ['jmq', 'T'], ['ezes', 'F'], ['ezij', 'F'], ['ezit', 'F'], ['ezkf', 'F'], ['ezesp', 'F'], ['ezits', 'F']] | 2025-10-13T00:00:00 | |
92eccacf158f1193927fada26a9c28500033e29781e911910fa52aeefce85968 | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['a', 'F'], ['p', 'F'], ['ad', 'F'], ['pd', 'F'], ['pu', 'F'], ['adj', 'T'], ['pde', 'F'], ['pun', 'F'], ['pdeh', 'F'], ['punk', 'T'], ['pdehu', 'F'], ['punkp', 'F']] | 2025-10-13T00:00:00 | |
89d86335f7c8381bc5780dc1b9cf39e93697b0f0f6183b2a096effabee89f40b | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['v', 'F'], ['vk', 'F'], ['vq', 'F'], ['vkm', 'F'], ['vky', 'F'], ['vql', 'F'], ['vqw', 'F'], ['vkmz', 'T'], ['vkyy', 'F'], ['vqwe', 'F']] | 2025-10-13T00:00:00 | |
b52f88a241800bddd94f61ec4d8b85feee23f618356db3322338886c147445f4 | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['p', 'F'], ['q', 'F'], ['py', 'F'], ['qp', 'F'], ['pyw', 'F'], ['qpc', 'F'], ['pywc', 'F'], ['qpcf', 'T'], ['pywcs', 'F']] | 2025-10-13T00:00:00 | |
d03f01b1301e629377600b991234eb58fe25785c1ea23655ca928f84a75ec4eb | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['e', 'F'], ['p', 'F'], ['ea', 'F'], ['ph', 'F'], ['eal', 'F'], ['pha', 'F'], ['ealy', 'T'], ['phaq', 'F'], ['ealyv', 'T'], ['phaqb', 'F']] | 2025-10-13T00:00:00 | |
b37475416eed877e481d7cecd99e3f3dc3b9e95f67f93e6baf99e5a3c5915be6 | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['s', 'F'], ['y', 'F'], ['sz', 'F'], ['ym', 'F'], ['szw', 'T'], ['ymw', 'F'], ['ymwp', 'F']] | 2025-10-13T00:00:00 | |
668d865095aaa252dd159c661839cd19d2ba842aba19b099930fd65e544170d4 | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['s', 'F'], ['w', 'F'], ['su', 'F'], ['ww', 'F'], ['suy', 'T']] | 2025-10-13T00:00:00 | |
1d27675c2fa8dd512aa03d78add8888724010c3fe941d2478dd825c3db69daaa | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['o', 'F'], ['s', 'F'], ['of', 'F'], ['oj', 'F'], ['su', 'F'], ['ofh', 'F'], ['ojr', 'F'], ['suw', 'T'], ['ofhr', 'F'], ['ojrl', 'F'], ['ojrlf', 'F']] | 2025-10-13T00:00:00 | |
eb57ea7654b0b6324f87015858208162cd733fb6bac15b208a000e72d87226f9 | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['y', 'F'], ['yo', 'F'], ['yor', 'F'], ['york', 'F'], ['yorkz', 'T']] | 2025-10-13T00:00:00 | |
a41b75c8103b36b717daab02c32d243a814b89bdcc138bc0be0468f49bb1ea49 | dawg | CodeMaybe | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['f', 'F'], ['g', 'F'], ['h', 'F'], ['l', 'F'], ['fs', 'F'], ['gm', 'F'], ['gx', 'F'], ['hf', 'F'], ['lq', 'F'], ['fsm', 'F'], ['fsx', 'T'], ['hfo', 'F'], ['lqi', 'F'], ['hfoy', 'F'], ['lqij', 'F']] | 2025-10-13T00:00:00 | |
4414763c3add3f71414775349182ed5d594860f9a0b8b6abfed5129b09b3278a | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['a', 'F'], ['d', 'F'], ['i', 'F'], ['o', 'F'], ['ac', 'F'], ['as', 'F'], ['dy', 'F'], ['is', 'F'], ['ob', 'F'], ['aca', 'F'], ['asd', 'F'], ['ash', 'T'], ['dyh', 'F'], ['isy', 'F'], ['obw', 'F'], ['acan', 'F'], ['asdt', 'F'], ['dyhg', 'F'], ['isyt', 'F'], ['obwo', 'F'], ['acanv', 'F'], ['asdto', 'F'], ['dy... | 2025-10-13T00:00:00 | |
50242b05504ffa724e7031bf29ae79ae8bc2953f9c199414b60462c2e3d62e1e | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['b', 'F'], ['r', 'F'], ['z', 'F'], ['by', 'F'], ['rv', 'F'], ['zb', 'F'], ['byb', 'F'], ['byl', 'F'], ['rvm', 'F'], ['zbd', 'F'], ['bybi', 'T'], ['rvmu', 'F'], ['rvmue', 'F']] | 2025-10-13T00:00:00 | |
727ae095e7abc5e426fc06e36ae6a0a328c008e3650dc5f598bb400aaec1492a | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['b', 'F'], ['g', 'F'], ['h', 'F'], ['bc', 'F'], ['gi', 'F'], ['gt', 'F'], ['hz', 'F'], ['bcd', 'T'], ['hzt', 'F'], ['hztr', 'F']] | 2025-10-13T00:00:00 | |
f962cecb1f9d1a48f82f2620b53812e1d46d64582430bd154045dd0ec7cef095 | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['n', 'F'], ['v', 'F'], ['ng', 'F'], ['nm', 'F'], ['vb', 'F'], ['ve', 'F'], ['ngx', 'F'], ['nmh', 'F'], ['nmn', 'F'], ['vbe', 'F'], ['vei', 'F'], ['ngxf', 'F'], ['nmhp', 'T'], ['nmnr', 'F'], ['vbep', 'F'], ['ngxff', 'F'], ['vbepf', 'F'], ['vbepft', 'T']] | 2025-10-13T00:00:00 | |
92f2b762f91ec3e63a098934d909ed29251b6ef3c77f2c7e62362a260569dcd8 | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F']] | 2025-10-13T00:00:00 | |
4c73d6d4325e87610b11cfa4b493d0988a386c48a91e5f4d4d7f23d3af672b32 | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['k', 'F'], ['v', 'F'], ['ko', 'F'], ['vi', 'F'], ['koi', 'T'], ['kom', 'T'], ['viq', 'F'], ['viqp', 'F']] | 2025-10-13T00:00:00 | |
ac22375bb2797a58b9966730eefd448c1a592980db197fc53005785e1804f529 | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['d', 'F'], ['z', 'F'], ['di', 'F'], ['zu', 'F'], ['div', 'F'], ['zuv', 'T'], ['divu', 'F']] | 2025-10-13T00:00:00 | |
c4c1a47cc429a977f8ab89f27dd64c7b1b5ca9ef4619a7b43f7cf33e433bd676 | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['n', 'F'], ['nc', 'F'], ['ncq', 'T']] | 2025-10-13T00:00:00 | |
4a3550530b6cc6b6d4bfee58ca8aae13613560a2125cd42bd87c7154d19bdba4 | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['o', 'F'], ['r', 'F'], ['v', 'F'], ['oz', 'F'], ['ri', 'F'], ['vc', 'F'], ['vu', 'F'], ['vz', 'F'], ['ozi', 'F'], ['rij', 'T'], ['vcu', 'F'], ['vub', 'F'], ['vzq', 'F'], ['vcuh', 'F'], ['vubr', 'F'], ['vcuht', 'F']] | 2025-10-13T00:00:00 | |
ad84a64a300ad1af6ae8382d87aa71ffc1b8e4a9995673b87f30b79c2024b4c3 | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['p', 'F'], ['t', 'F'], ['pg', 'F'], ['te', 'F'], ['pgj', 'F'], ['teg', 'F'], ['teu', 'F'], ['pgjj', 'T'], ['tege', 'F'], ['teuh', 'F']] | 2025-10-13T00:00:00 | |
59955e9427b25ecdee766ed3d1ba631fdfd178403452dc5fc244bef077d6a627 | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['f', 'F'], ['k', 'F'], ['m', 'F'], ['fa', 'F'], ['fh', 'F'], ['kz', 'F'], ['me', 'F'], ['faz', 'F'], ['fhq', 'F'], ['kzg', 'T'], ['mek', 'F'], ['fazz', 'F'], ['fhqd', 'F'], ['mekp', 'F'], ['fhqdq', 'F'], ['mekpk', 'F']] | 2025-10-13T00:00:00 | |
42efffd4602274f20c91d13530529682b8162814f7723f8b2ba88c496064aa4e | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['a', 'F'], ['i', 'F'], ['p', 'F'], ['ai', 'F'], ['io', 'F'], ['pd', 'F'], ['aia', 'F'], ['ioc', 'F'], ['pdx', 'T'], ['iocx', 'F']] | 2025-10-13T00:00:00 | |
a4d067d4d270715507183d76a0beef8937a2c15ae7c06a49943425b295d423d7 | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['a', 'F'], ['q', 'F'], ['ab', 'F'], ['qu', 'F'], ['abi', 'F'], ['qut', 'F'], ['abia', 'T'], ['qutb', 'F'], ['qutbr', 'F']] | 2025-10-13T00:00:00 | |
49323970abf9ff4cd50ee19cf79a8412ea230bd1d4894f575b5f058e9db660f5 | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['i', 'F'], ['n', 'F'], ['u', 'F'], ['id', 'F'], ['nn', 'F'], ['uh', 'F'], ['ut', 'F'], ['idl', 'T'], ['nne', 'F'], ['nnek', 'F'], ['nnekh', 'F']] | 2025-10-13T00:00:00 | |
9e8de4910c4683957a70b40c7f164e6873a7211e01d9f0759780371426ffdd0f | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['a', 'F'], ['az', 'F'], ['azd', 'T']] | 2025-10-13T00:00:00 | |
5804bf63d0b93415e787a7c5caaf3e4be3e204e9d12bd803e1212b6362a0fcfa | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F']] | 2025-10-13T00:00:00 | |
2e4c573c4683300e0773035c0a238627eb621ae3d807a2b83ddee76ce00c96c8 | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['l', 'F'], ['r', 'F'], ['lk', 'F'], ['rf', 'F'], ['ri', 'F'], ['lkm', 'T'], ['rfu', 'F'], ['rie', 'F'], ['rfuj', 'F'], ['riec', 'F'], ['rfujs', 'F']] | 2025-10-13T00:00:00 | |
74a3aa3f1d381d94586b08909bd855251a3bbee759918bdffd1520b191fa9a44 | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['e', 'F'], ['q', 'F'], ['v', 'F'], ['en', 'F'], ['qi', 'F'], ['vi', 'F'], ['vv', 'F'], ['enc', 'F'], ['env', 'F'], ['qig', 'T'], ['vir', 'F'], ['virl', 'F']] | 2025-10-13T00:00:00 | |
3261044b7dcd940cd60b2cb7719975b5b332a6c1172c6ef679e7fe909e96072e | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F']] | 2025-10-13T00:00:00 | |
d89cd040d487162e46fc12a23c54057efed42d9ee8b2e72b3861040fd444268f | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['a', 'F'], ['b', 'F'], ['al', 'F'], ['av', 'F'], ['bi', 'F'], ['alu', 'F'], ['avv', 'F'], ['bif', 'F'], ['alua', 'F'], ['avvl', 'F'], ['bifw', 'F'], ['aluaz', 'F'], ['avvlk', 'T'], ['bifwv', 'T']] | 2025-10-13T00:00:00 | |
b53e040aa2efeab0757a7be1fd9006b76d3b2017d09640ef837fab161ac775ba | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['e', 'F'], ['j', 'F'], ['ez', 'F'], ['jm', 'F'], ['eze', 'T'], ['ezi', 'F'], ['ezk', 'F'], ['jmq', 'T'], ['ezes', 'F'], ['ezij', 'F'], ['ezit', 'F'], ['ezkf', 'F'], ['ezesp', 'F'], ['ezits', 'F']] | 2025-10-13T00:00:00 | |
cc6e6071f4f694a36dd098d536b330c7601a449a484e512197d220b7d570e43f | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['a', 'F'], ['p', 'F'], ['ad', 'F'], ['pd', 'F'], ['pu', 'F'], ['adj', 'T'], ['pde', 'F'], ['pun', 'F'], ['pdeh', 'F'], ['punk', 'T'], ['pdehu', 'F'], ['punkp', 'F']] | 2025-10-13T00:00:00 | |
6931365ded9abf2d75a0213563750a7fbb8f8c7489777ab4e89686b7c3f87ba8 | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['v', 'F'], ['vk', 'F'], ['vq', 'F'], ['vkm', 'F'], ['vky', 'F'], ['vql', 'F'], ['vqw', 'F'], ['vkmz', 'T'], ['vkyy', 'F'], ['vqwe', 'F']] | 2025-10-13T00:00:00 | |
6a9f5709a586a8070314997bb5cbd6a33ae963a71ac4abcc1897485d19da8555 | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['p', 'F'], ['q', 'F'], ['py', 'F'], ['qp', 'F'], ['pyw', 'F'], ['qpc', 'F'], ['pywc', 'F'], ['qpcf', 'T'], ['pywcs', 'F']] | 2025-10-13T00:00:00 | |
18a328200db44695a3d7bafc1abd53cb7b900ae4ce467e593854ed5357f6a27e | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['e', 'F'], ['p', 'F'], ['ea', 'F'], ['ph', 'F'], ['eal', 'F'], ['pha', 'F'], ['ealy', 'T'], ['phaq', 'F'], ['ealyv', 'T'], ['phaqb', 'F']] | 2025-10-13T00:00:00 | |
1c2647a86eee1e5269288b21f8f227e731343797c782725de5a4f3e84068fa22 | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['s', 'F'], ['y', 'F'], ['sz', 'F'], ['ym', 'F'], ['szw', 'T'], ['ymw', 'F'], ['ymwp', 'F']] | 2025-10-13T00:00:00 | |
97b66d30aa59385554f86bf7f08cdb26f13c65fb363fa3e40ff08f3c2a1fe9e5 | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['s', 'F'], ['w', 'F'], ['su', 'F'], ['ww', 'F'], ['suy', 'T']] | 2025-10-13T00:00:00 | |
b220a0995ba755b094e6a8255db6ab238253c17c7fcae0cf1052d7611194f645 | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['o', 'F'], ['s', 'F'], ['of', 'F'], ['oj', 'F'], ['su', 'F'], ['ofh', 'F'], ['ojr', 'F'], ['suw', 'T'], ['ofhr', 'F'], ['ojrl', 'F'], ['ojrlf', 'F']] | 2025-10-13T00:00:00 | |
9159ae9cb86f3e50e1b6870189b33ceb2113191bfd2a1319b5bce458615bd3a2 | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['y', 'F'], ['yo', 'F'], ['yor', 'F'], ['york', 'F'], ['yorkz', 'T']] | 2025-10-13T00:00:00 | |
f9cc53f6e442cb9a2d28b3496baeb33626a75d23d82f99589314fb50e4d71d68 | dawg | CodeEnforce | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['f', 'F'], ['g', 'F'], ['h', 'F'], ['l', 'F'], ['fs', 'F'], ['gm', 'F'], ['gx', 'F'], ['hf', 'F'], ['lq', 'F'], ['fsm', 'F'], ['fsx', 'T'], ['hfo', 'F'], ['lqi', 'F'], ['hfoy', 'F'], ['lqij', 'F']] | 2025-10-13T00:00:00 | |
f7b2bff8efec8a796bce156d1b8509ab0eb8d60ec801e97826067c0c4208298d | dawg | CodeOnly | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['a', 'F'], ['d', 'F'], ['i', 'F'], ['o', 'F'], ['ac', 'F'], ['as', 'F'], ['dy', 'F'], ['is', 'F'], ['ob', 'F'], ['aca', 'F'], ['asd', 'F'], ['ash', 'T'], ['dyh', 'F'], ['isy', 'F'], ['obw', 'F'], ['acan', 'F'], ['asdt', 'F'], ['dyhg', 'F'], ['isyt', 'F'], ['obwo', 'F'], ['acanv', 'F'], ['asdto', 'F'], ['dy... | 2025-10-13T00:00:00 | |
92b7a1dfb95d9e6b087142c9443591a35cb1c0fa1e11dd81f819201fd1f60dd6 | dawg | CodeOnly | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['b', 'F'], ['r', 'F'], ['z', 'F'], ['by', 'F'], ['rv', 'F'], ['zb', 'F'], ['byb', 'F'], ['byl', 'F'], ['rvm', 'F'], ['zbd', 'F'], ['bybi', 'T'], ['rvmu', 'F'], ['rvmue', 'F']] | 2025-10-13T00:00:00 | |
81fd52aaa974c7e094773075bfaa1b7630e700599993a26a4176fc4727f3db22 | dawg | CodeOnly | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['b', 'F'], ['g', 'F'], ['h', 'F'], ['bc', 'F'], ['gi', 'F'], ['gt', 'F'], ['hz', 'F'], ['bcd', 'T'], ['hzt', 'F'], ['hztr', 'F']] | 2025-10-13T00:00:00 | |
4da12ac5f5e79d19e48c4a6e01d20539d7244c3791ccd8865afd15b6d4e04c70 | dawg | CodeOnly | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['n', 'F'], ['v', 'F'], ['ng', 'F'], ['nm', 'F'], ['vb', 'F'], ['ve', 'F'], ['ngx', 'F'], ['nmh', 'F'], ['nmn', 'F'], ['vbe', 'F'], ['vei', 'F'], ['ngxf', 'F'], ['nmhp', 'T'], ['nmnr', 'F'], ['vbep', 'F'], ['ngxff', 'F'], ['vbepf', 'F'], ['vbepft', 'T']] | 2025-10-13T00:00:00 | |
3296c84b6479a31c7fc8064c0447c322fce5269008f198ce16a49d105282440d | dawg | CodeOnly | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F']] | 2025-10-13T00:00:00 | |
d93e0726b8fd36a12bbb7f0e6db7d20d03b664c04b125c02155eb684ea5dfd3d | dawg | CodeOnly | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['k', 'F'], ['v', 'F'], ['ko', 'F'], ['vi', 'F'], ['koi', 'T'], ['kom', 'T'], ['viq', 'F'], ['viqp', 'F']] | 2025-10-13T00:00:00 | |
c032a7cf36a405086237b998a0c1b201a435baa9c3262388a0b7fa55748a3133 | dawg | CodeOnly | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['d', 'F'], ['z', 'F'], ['di', 'F'], ['zu', 'F'], ['div', 'F'], ['zuv', 'T'], ['divu', 'F']] | 2025-10-13T00:00:00 | |
106d31e21894b7eb58b5502e8e23a381e9c987e005bb63b5ac92ead207f5fb34 | dawg | CodeOnly | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['n', 'F'], ['nc', 'F'], ['ncq', 'T']] | 2025-10-13T00:00:00 | |
c6a467d5f58e9f87ca6cb1e66caf6e07eaf4bc0433565f9424fd872ee6d3cbb5 | dawg | CodeOnly | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['o', 'F'], ['r', 'F'], ['v', 'F'], ['oz', 'F'], ['ri', 'F'], ['vc', 'F'], ['vu', 'F'], ['vz', 'F'], ['ozi', 'F'], ['rij', 'T'], ['vcu', 'F'], ['vub', 'F'], ['vzq', 'F'], ['vcuh', 'F'], ['vubr', 'F'], ['vcuht', 'F']] | 2025-10-13T00:00:00 | |
2d860ff5f3dcdeba8d3c020e552c8b38a84333b82abe0af0cacef68de4058aa2 | dawg | CodeOnly | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['p', 'F'], ['t', 'F'], ['pg', 'F'], ['te', 'F'], ['pgj', 'F'], ['teg', 'F'], ['teu', 'F'], ['pgjj', 'T'], ['tege', 'F'], ['teuh', 'F']] | 2025-10-13T00:00:00 | |
a50fe063d92797e9893a96c774249ece7c30dbc727b64cfeb37ec91b8a1f5907 | dawg | CodeOnly | [
"A Directed Acyclic Word Graph (DAWG) encodes a set of lowercase words (a-z) as a compressed trie in a directed acyclic graph.\nEach node has an is_end flag ('T' for true, and 'F' for false) indicating whether the path from the root to that node spells a complete word.\nEach edge carries a single-character label, e... | [['', 'F'], ['f', 'F'], ['k', 'F'], ['m', 'F'], ['fa', 'F'], ['fh', 'F'], ['kz', 'F'], ['me', 'F'], ['faz', 'F'], ['fhq', 'F'], ['kzg', 'T'], ['mek', 'F'], ['fazz', 'F'], ['fhqd', 'F'], ['mekp', 'F'], ['fhqdq', 'F'], ['mekpk', 'F']] | 2025-10-13T00:00:00 |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 7