CacheDB: 2026-04-27 21:17:12

0753-huffman

huffman

B Difficulty

README.md Preview

# 0753 - Huffman | **Version**: 1.0
`huffman` | Difficulty: **B** | **Updated**: 2026-04-23 13:05:20

**Sync Status:** ✅ Local: OK | ✅ Maratona: OK | ✅ API: OK (22/05/20 15:26)

## Overview
Serialização algorítmica de codificação de Huffman. O problema demanda construção de uma Árvore de Sufixos via Min-Heap O(N log N) e compressão bit a bit do fluxo com padding binário (Formato Sedgewick).

## Metadata
- **Author**: Unknown
- **Editorial**: O problema exige a implementação da compressão de Huffman com uma Fila de Prioridade (Heap). A serialização específica de Sedgewick segue: 1 bit para nós internos, 9 bits para folhas, 32 bits para o tamanho da string, seguidos pelos bits codificados. O total de bits deve ser preenchido para o próximo múltiplo de 8.
- **Success Msg**: Trie de Frequência validada com sucesso. A lógica de empacotamento assintótico foi acoplada perfeitamente sobre o algoritmo guloso de compressão estrutural, preservando alocamentos estritos de bits.

| Time Limit | Memory Limit | Time Complexity | Space Complexity |
| :--- | :--- | :--- | :--- |
| 4s | 256MB | O(N logN) | - |

## Stats
| Metric | Count |
| :--- | :--- |
| Test Scenarios | 24 |
| Solutions | 2 |

## Statements
| ID | Status | Level | Natural Languages | Skills |
| :--- | :--- | :--- | :--- | :--- |
| `a-huffman` | ✅ | A | pt | cryptography |

## Test Scenarios
| Name | Description | Count | Type | Level | Skills | DB Sync |
| :--- | :--- | :--- | :--- | :--- | :--- | :--- |
| **Alfabeto Completo** | String contendo todos os 256 bytes possíveis para validar o tamanho máximo da trie e a escrita de bits. | 3 | TDD | A | binary-tree-traversals, greedy-algorithms | ✅ 3/3 |
| **Teste de Carga e Performance** | Teste com 1 milhão de caracteres para garantir que a construção da árvore utilize um heap eficiente. | 5 | Performance | A | priority-queue-heap, greedy-algorithms | ✅ 5/5 |
| **Limite Exato de Byte** | Casos onde a soma total de bits é exatamente um múltiplo de 8, testando se o padding zero é aplicado corretamente. | 3 | TDD | B | binary-tree-traversals, greedy-algorithms | ✅ 3/3 |
| **Dados em Alta ASCII** | Teste com caracteres acima de 127 para validar o tratamento de bytes e a codificação de 8 bits na trie. | 3 | TDD | B | huffman-coding | ✅ 3/3 |
| **Caractere Único** | String composta por apenas um tipo de caractere para testar a estrutura mínima da trie e caminhos unitários. | 3 | TDD | C | huffman-coding, binary-tree-traversals | ✅ 3/3 |
| **Árvore Binária Mínima** | String com exatamente 2 caracteres únicos para testar a menor árvore válida possível (raiz e duas folhas). | 3 | TDD | C | priority-queue-heap, huffman-coding | ✅ 3/3 |
| **Exemplo ABRACADABRA!** | Validação básica usando o exemplo clássico do enunciado para verificar a lógica de construção e contagem. | 4 | TDD | D | huffman-coding | ✅ 4/4 |

## Solutions
- **Solução Ótima Básica** (`a-otima-basica`)
  - Languages: `py, java`
- **Algs4 Huffman** (`a-sedgewick`)
  - Languages: `java`

## Components
- ✅ Statements
- ✅ Solutions
- ✅ Test Cases

Actions

Workflow do Problema

Local Workspace

Pasta criada no disco
Metadados

Informações básicas preenchidas
Validação

Soluções passam nos testes
4

Sincronização

Enviado para DB e GitLab

Components

Statements ✅
Solutions 2 ✅
Test Cases 24 ✅

Database Info

DB ID 753

Name Huffman

Time Limit 4.0s

Mem Limit 250 MB

Version 0.8

Difficulty Level O

Test Cases 24

🚀 Quick Prompts

Structure Scaffolding

Generate metadata & folder structure

ID: 1.1

Context & Description

Draft description & editorial

ID: 1.2

Statements List

ID	Level	Natural Languages	Skills	Status	Action
a-huffman	A	a b c d	cryptography	✅

Statement Details

Select a statement above to view details.

Actions

Statistics

1 Total Statements

By Type (ID)

a-huffman 1

By Level

Level A 1

🚀 Quick Prompts

Statement Analysis

Analyze ambiguity & clarity

ID: 2.1

WOK Statement Generation

Rewrite in WOK Universe theme

ID: 2.2

Statement Expansion

Expand to 4 difficulty levels

ID: 2.3

Database Test Cases 24 cases

ID	Rank	Status	Scenario	Filename	MD5	Description	Image	Disk Sync
13626	10	Sample	`d-sample` TDD	`sample-02`	I `93b56113c7db4a8119f8e3b3e88b9e21`	-	-	✅ Linked
13626	10	Sample	`d-sample` TDD	-	O `b700cdab4d7a16f4f987d3cf4ae418f0`	-	-	✅ Linked
14886	20	Sample	`d-sample` TDD	`sample-03`	I `1e280e1713df124d35709cf6138d9f91`	-	-	✅ Linked
14886	20	Sample	`d-sample` TDD	-	O `7d5a97c8f3788e0b30a9a22cc345763d`	-	-	✅ Linked
14887	30	Sample	`d-sample` TDD	`sample-04`	I `87f9a50be21c4e763c1835dcf833d769`	-	-	✅ Linked
14887	30	Sample	`d-sample` TDD	-	O `705b774dcb65e1f515867a8440377ea5`	-	-	✅ Linked
14906	40	Sample	`d-sample` TDD	`sample-01`	I `dce5995a27e5b1f0cbfadab2df3d8fa1`	-	-	✅ Linked
14906	40	Sample	`d-sample` TDD	-	O `767259c06e2473cc5f4ab9e9c47597a5`	-	-	✅ Linked
14891	50		`c-single-char` TDD	`single-char-01`	I `1a59ec850a6875040fa007d71e168834`	-	-	✅ Linked
14891	50		`c-single-char` TDD	-	O `4f500be4a8fc3a7df6e6bd4b99698e58`	-	-	✅ Linked
14892	60		`c-single-char` TDD	`single-char-02`	I `7e7b9318270b56576900435721bfe887`	-	-	✅ Linked
14892	60		`c-single-char` TDD	-	O `4f500be4a8fc3a7df6e6bd4b99698e58`	-	-	✅ Linked
14893	70		`c-single-char` TDD	`single-char-03`	I `41ff0912a07fdc52799ff27b38e7f140`	-	-	✅ Linked
14893	70		`c-single-char` TDD	-	O `4f500be4a8fc3a7df6e6bd4b99698e58`	-	-	✅ Linked
14888	80		`c-minimal-bin-tree` TDD	`minimal-bin-tree-01`	I `635068e280803f2e997133288f3e0120`	-	-	✅ Linked
14888	80		`c-minimal-bin-tree` TDD	-	O `3a0408eb05360c748f4af55035e40180`	-	-	✅ Linked
14889	90		`c-minimal-bin-tree` TDD	`minimal-bin-tree-02`	I `b46c0b8885874810dd41350647a615ad`	-	-	✅ Linked
14889	90		`c-minimal-bin-tree` TDD	-	O `48396e194db73ca7e84394ef36d8d616`	-	-	✅ Linked
14890	100		`c-minimal-bin-tree` TDD	`minimal-bin-tree-03`	I `84311c0885e8c7fe82daec3db82aee38`	-	-	✅ Linked
14890	100		`c-minimal-bin-tree` TDD	-	O `48396e194db73ca7e84394ef36d8d616`	-	-	✅ Linked
14900	110		`b-high-ascii-data` TDD	`high-ascii-data-01`	I `359a7b98dc9fcc16c56606a99f6575b7`	-	-	✅ Linked
14900	110		`b-high-ascii-data` TDD	-	O `fc970d9740b0dcc888515811d7cc5123`	-	-	✅ Linked
14901	120		`b-high-ascii-data` TDD	`high-ascii-data-02`	I `8950b41b08cdbac3c76c233946d0be86`	-	-	✅ Linked
14901	120		`b-high-ascii-data` TDD	-	O `53cb1504f1397b56a83cdabbb395e533`	-	-	✅ Linked
14902	130		`b-high-ascii-data` TDD	`high-ascii-data-03`	I `741b35de1e6b023c3f02f488b601fa29`	-	-	✅ Linked
14902	130		`b-high-ascii-data` TDD	-	O `cd94c73352e3f7225604f0aac31a2a9e`	-	-	✅ Linked
14894	140		`b-exact-byte-boundary` TDD	`exact-byte-boundary-01`	I `ec690397aa3d212ecfa8602463d627fe`	-	-	✅ Linked
14894	140		`b-exact-byte-boundary` TDD	-	O `51043993a5f2402909f4b54143f712ed`	-	-	✅ Linked
14895	150		`b-exact-byte-boundary` TDD	`exact-byte-boundary-02`	I `b9a817630233c0fc95dc9fd33db6483d`	-	-	✅ Linked
14895	150		`b-exact-byte-boundary` TDD	-	O `b700cdab4d7a16f4f987d3cf4ae418f0`	-	-	✅ Linked
14896	160		`b-exact-byte-boundary` TDD	`exact-byte-boundary-03`	I `bffe2ff7886204dc210dc19f987f2490`	-	-	✅ Linked
14896	160		`b-exact-byte-boundary` TDD	-	O `b2c9d6ebcb0eaa29eca1bbac7699f721`	-	-	✅ Linked
14897	170	Sample	`a-full-alphabet` TDD	`full-alphabet-01`	I `8d912fd1993550fe2d0022e0b9fbdcc7`	-	-	✅ Linked
14897	170	Sample	`a-full-alphabet` TDD	-	O `52fe30432f023d4bc66e425e493f5a6b`	-	-	✅ Linked
14898	180		`a-full-alphabet` TDD	`full-alphabet-02`	I `e441758df9e668463351f2565cee93a4`	-	-	✅ Linked
14898	180		`a-full-alphabet` TDD	-	O `031173f886eac934a43de282bb6ae025`	-	-	✅ Linked
14899	190		`a-full-alphabet` TDD	`full-alphabet-03`	I `03e1733c430e921eac2add0892a6d726`	-	-	✅ Linked
14899	190		`a-full-alphabet` TDD	-	O `52fe30432f023d4bc66e425e493f5a6b`	-	-	✅ Linked
13628	200		`a-performance-load` Performance	`performance-load-02`	I `950649824e1a3988e90a8c37f71c3c33`	-	-	✅ Linked
13628	200		`a-performance-load` Performance	-	O `b1cf18642b1040e9e3c794933501201c`	-	-	✅ Linked
13629	210		`a-performance-load` Performance	`performance-load-03`	I `359fb8832915fc77bec738a62e02650c`	-	-	✅ Linked
13629	210		`a-performance-load` Performance	-	O `1c4948457b1a06d53954387f023973a2`	-	-	✅ Linked
13630	220		`a-performance-load` Performance	`performance-load-04`	I `ad2d47be24e261b32018ff94861207d1`	-	-	✅ Linked
13630	220		`a-performance-load` Performance	-	O `5d8fccdf9dbba5b7a6ec2463117787d6`	-	-	✅ Linked
14905	230		`a-performance-load` Performance	`performance-load-01`	I `586c9213c62416d59872ffedd5c4d5ea`	-	-	✅ Linked
14905	230		`a-performance-load` Performance	-	O `178ac7f5899bd2efb457c7ba6ee17326`	-	-	✅ Linked
13632	240		`a-performance-load` Performance	`performance-load-05`	I `a2218caa0d48078ee78065cd9ab1e9c5`	-	-	✅ Linked
13632	240		`a-performance-load` Performance	-	O `ff63aa27bfe5d4030077861f3fe913fd`	-	-	✅ Linked

📊 Sync Statistics

Total (Disk) 24

Total (Database) 24

✓ Synchronized 24

⚠ Desynchronized 0

Duplicates (MD5)

Duplicates in (MD5) 0

Desync = (DB missing on Disk) + (Disk missing on DB)

Actions

Testcase Scenarios Sync

YAML Source vs Database

Slug	Level	Name	Type	Skills	Status
`a-full-alphabet`	A	Alfabeto Completo String contendo todos os 256 bytes possíveis...	TDD	binary-tree-traversals 1pts greedy-algorithms 1pts	Synced
`a-performance-load`	A	Teste de Carga e Performance Teste com 1 milhão de caracteres para garantir...	PERFORMANCE	priority-queue-heap 2pts greedy-algorithms 1pts	Synced
`b-high-ascii-data`	B	Dados em Alta ASCII Teste com caracteres acima de 127 para validar...	TDD	huffman-coding 1pts	Synced
`b-exact-byte-boundary`	B	Limite Exato de Byte Casos onde a soma total de bits é exatamente...	TDD	binary-tree-traversals 1pts greedy-algorithms 1pts	Synced
`c-single-char`	C	Caractere Único String composta por apenas um tipo de...	TDD	huffman-coding 1pts binary-tree-traversals 1pts	Synced
`c-minimal-bin-tree`	C	Árvore Binária Mínima String com exatamente 2 caracteres únicos para...	TDD	priority-queue-heap 1pts huffman-coding 1pts	Synced
`d-sample`	D	Exemplo ABRACADABRA! Validação básica usando o exemplo clássico do...	TDD	huffman-coding 1pts	Synced

Local Test Cases (Disk)

Scenario: a-full-alphabet 3 cases

Name	Files (Input / Output)	Status	Actions
full-alphabet-01 #14897 📄 📷	Input `full-alphabet-01.in` 8d912fd1993550fe2d0022e0b9fbdcc7 Output `full-alphabet-01.out` 52fe30432f023d4bc66e425e493f5a6b	✅ Synced (ID: 14897)	🔍 Details
full-alphabet-02 #14898 📄 📷	Input `full-alphabet-02.in` e441758df9e668463351f2565cee93a4 Output `full-alphabet-02.out` 031173f886eac934a43de282bb6ae025	✅ Synced (ID: 14898)	🔍 Details
full-alphabet-03 #14899 📄 📷	Input `full-alphabet-03.in` 03e1733c430e921eac2add0892a6d726 Output `full-alphabet-03.out` 52fe30432f023d4bc66e425e493f5a6b	✅ Synced (ID: 14899)	🔍 Details

Scenario: a-performance-load 5 cases

Name	Files (Input / Output)	Status	Actions
performance-load-01 #14905 📄 📷	Input `performance-load-01.in` 586c9213c62416d59872ffedd5c4d5ea Output `performance-load-01.out` 178ac7f5899bd2efb457c7ba6ee17326	✅ Synced (ID: 14905)	🔍 Details
performance-load-02 #13628 📄 📷	Input `performance-load-02.in` 950649824e1a3988e90a8c37f71c3c33 Output `performance-load-02.out` b1cf18642b1040e9e3c794933501201c	✅ Synced (ID: 13628)	🔍 Details
performance-load-03 #13629 📄 📷	Input `performance-load-03.in` 359fb8832915fc77bec738a62e02650c Output `performance-load-03.out` 1c4948457b1a06d53954387f023973a2	✅ Synced (ID: 13629)	🔍 Details
performance-load-04 #13630 📄 📷	Input `performance-load-04.in` ad2d47be24e261b32018ff94861207d1 Output `performance-load-04.out` 5d8fccdf9dbba5b7a6ec2463117787d6	✅ Synced (ID: 13630)	🔍 Details
performance-load-05 #13632 📄 📷	Input `performance-load-05.in` a2218caa0d48078ee78065cd9ab1e9c5 Output `performance-load-05.out` ff63aa27bfe5d4030077861f3fe913fd	✅ Synced (ID: 13632)	🔍 Details

Scenario: b-exact-byte-boundary 3 cases

Name	Files (Input / Output)	Status	Actions
exact-byte-boundary-01 #14894 📄 📷	Input `exact-byte-boundary-01.in` ec690397aa3d212ecfa8602463d627fe Output `exact-byte-boundary-01.out` 51043993a5f2402909f4b54143f712ed	✅ Synced (ID: 14894)	🔍 Details
exact-byte-boundary-02 #14895 📄 📷	Input `exact-byte-boundary-02.in` b9a817630233c0fc95dc9fd33db6483d Output `exact-byte-boundary-02.out` b700cdab4d7a16f4f987d3cf4ae418f0	✅ Synced (ID: 14895)	🔍 Details
exact-byte-boundary-03 #14896 📄 📷	Input `exact-byte-boundary-03.in` bffe2ff7886204dc210dc19f987f2490 Output `exact-byte-boundary-03.out` b2c9d6ebcb0eaa29eca1bbac7699f721	✅ Synced (ID: 14896)	🔍 Details

Scenario: b-high-ascii-data 3 cases

Name	Files (Input / Output)	Status	Actions
high-ascii-data-01 #14900 📄 📷	Input `high-ascii-data-01.in` 359a7b98dc9fcc16c56606a99f6575b7 Output `high-ascii-data-01.out` fc970d9740b0dcc888515811d7cc5123	✅ Synced (ID: 14900)	🔍 Details
high-ascii-data-02 #14901 📄 📷	Input `high-ascii-data-02.in` 8950b41b08cdbac3c76c233946d0be86 Output `high-ascii-data-02.out` 53cb1504f1397b56a83cdabbb395e533	✅ Synced (ID: 14901)	🔍 Details
high-ascii-data-03 #14902 📄 📷	Input `high-ascii-data-03.in` 741b35de1e6b023c3f02f488b601fa29 Output `high-ascii-data-03.out` cd94c73352e3f7225604f0aac31a2a9e	✅ Synced (ID: 14902)	🔍 Details

Scenario: c-minimal-bin-tree 3 cases

Name	Files (Input / Output)	Status	Actions
minimal-bin-tree-01 #14888 📄 📷	Input `minimal-bin-tree-01.in` 635068e280803f2e997133288f3e0120 Output `minimal-bin-tree-01.out` 3a0408eb05360c748f4af55035e40180	✅ Synced (ID: 14888)	🔍 Details
minimal-bin-tree-02 #14889 📄 📷	Input `minimal-bin-tree-02.in` b46c0b8885874810dd41350647a615ad Output `minimal-bin-tree-02.out` 48396e194db73ca7e84394ef36d8d616	✅ Synced (ID: 14889)	🔍 Details
minimal-bin-tree-03 #14890 📄 📷	Input `minimal-bin-tree-03.in` 84311c0885e8c7fe82daec3db82aee38 Output `minimal-bin-tree-03.out` 48396e194db73ca7e84394ef36d8d616	✅ Synced (ID: 14890)	🔍 Details

Scenario: c-single-char 3 cases

Name	Files (Input / Output)	Status	Actions
single-char-01 #14891 📄 📷	Input `single-char-01.in` 1a59ec850a6875040fa007d71e168834 Output `single-char-01.out` 4f500be4a8fc3a7df6e6bd4b99698e58	✅ Synced (ID: 14891)	🔍 Details
single-char-02 #14892 📄 📷	Input `single-char-02.in` 7e7b9318270b56576900435721bfe887 Output `single-char-02.out` 4f500be4a8fc3a7df6e6bd4b99698e58	✅ Synced (ID: 14892)	🔍 Details
single-char-03 #14893 📄 📷	Input `single-char-03.in` 41ff0912a07fdc52799ff27b38e7f140 Output `single-char-03.out` 4f500be4a8fc3a7df6e6bd4b99698e58	✅ Synced (ID: 14893)	🔍 Details

Scenario: d-sample 4 cases

Name	Files (Input / Output)	Status	Actions
sample-01 #14906 📄 📷	Input `sample-01.in` dce5995a27e5b1f0cbfadab2df3d8fa1 Output `sample-01.out` 767259c06e2473cc5f4ab9e9c47597a5	✅ Synced (ID: 14906)	🔍 Details
sample-02 #13626 📄 📷	Input `sample-02.in` 93b56113c7db4a8119f8e3b3e88b9e21 Output `sample-02.out` b700cdab4d7a16f4f987d3cf4ae418f0	✅ Synced (ID: 13626)	🔍 Details
sample-03 #14886 📄 📷	Input `sample-03.in` 1e280e1713df124d35709cf6138d9f91 Output `sample-03.out` 7d5a97c8f3788e0b30a9a22cc345763d	✅ Synced (ID: 14886)	🔍 Details
sample-04 #14887 📄 📷	Input `sample-04.in` 87f9a50be21c4e763c1835dcf833d769 Output `sample-04.out` 705b774dcb65e1f515867a8440377ea5	✅ Synced (ID: 14887)	🔍 Details

📊 Sync Statistics

Total (Disk) 24

Total (Database) 24

✓ Synchronized 24

⚠ Desynchronized 0

Duplicates (MD5)

Duplicates in (MD5) 0

Desync = (DB missing on Disk) + (Disk missing on DB)

Actions

Solução Ótima Básica

ID: a-otima-basica

Implementação em Python que calcula a serialização de Huffman e o padding para byte-alignment.

Implementations

Algs4 Huffman

ID: a-sedgewick

Implementação original complexa do Sedgewick baseada em BinaryStdIn/Out.

Implementations

java Imperative

✅ Huffman.java

Solutions Check Report

## Solutions Check Report (Detalhado / Debug)
**Generated**: 2026-06-01T17:27:26.834428
**Solution**: `solutions/a-otima-basica/Solution.java`

### Compilation
✅ Compilation successful

### Resultados

<table class="results-table"><thead><tr><th>Test Case</th><th>Result</th><th>Time (s)</th></tr></thead><tbody>
<tr class="scenario-row"><td colspan="3"><strong>a-full-alphabet - TDD</strong></td></tr>
<tr id="row-a-full-alphabet-full-alphabet-01-in"><td>full-alphabet-01.in</td><td>✅ PASS</td><td>0.038</td></tr>
<tr id="row-a-full-alphabet-full-alphabet-02-in"><td>full-alphabet-02.in</td><td>✅ PASS</td><td>0.039</td></tr>
<tr id="row-a-full-alphabet-full-alphabet-03-in"><td>full-alphabet-03.in</td><td>✅ PASS</td><td>0.037</td></tr>
<tr class="scenario-row"><td colspan="3"><strong>a-performance-load - Performance</strong></td></tr>
<tr id="row-a-performance-load-performance-load-01-in"><td>performance-load-01.in</td><td>✅ PASS</td><td>0.038</td></tr>
<tr id="row-a-performance-load-performance-load-02-in"><td>performance-load-02.in</td><td>✅ PASS</td><td>0.038</td></tr>
<tr id="row-a-performance-load-performance-load-03-in"><td>performance-load-03.in</td><td>✅ PASS</td><td>0.034</td></tr>
<tr id="row-a-performance-load-performance-load-04-in"><td>performance-load-04.in</td><td>✅ PASS</td><td>0.033</td></tr>
<tr id="row-a-performance-load-performance-load-05-in"><td>performance-load-05.in</td><td>✅ PASS</td><td>0.070</td></tr>
<tr class="scenario-row"><td colspan="3"><strong>b-exact-byte-boundary - TDD</strong></td></tr>
<tr id="row-b-exact-byte-boundary-exact-byte-boundary-01-in"><td>exact-byte-boundary-01.in</td><td>✅ PASS</td><td>0.034</td></tr>
<tr id="row-b-exact-byte-boundary-exact-byte-boundary-02-in"><td>exact-byte-boundary-02.in</td><td>✅ PASS</td><td>0.034</td></tr>
<tr id="row-b-exact-byte-boundary-exact-byte-boundary-03-in"><td>exact-byte-boundary-03.in</td><td>✅ PASS</td><td>0.033</td></tr>
<tr class="scenario-row"><td colspan="3"><strong>b-high-ascii-data - TDD</strong></td></tr>
<tr id="row-b-high-ascii-data-high-ascii-data-01-in"><td>high-ascii-data-01.in</td><td>✅ PASS</td><td>0.034</td></tr>
<tr id="row-b-high-ascii-data-high-ascii-data-02-in"><td>high-ascii-data-02.in</td><td>✅ PASS</td><td>0.033</td></tr>
<tr id="row-b-high-ascii-data-high-ascii-data-03-in"><td>high-ascii-data-03.in</td><td>✅ PASS</td><td>0.034</td></tr>
<tr class="scenario-row"><td colspan="3"><strong>c-minimal-bin-tree - TDD</strong></td></tr>
<tr id="row-c-minimal-bin-tree-minimal-bin-tree-01-in"><td>minimal-bin-tree-01.in</td><td>✅ PASS</td><td>0.033</td></tr>
<tr id="row-c-minimal-bin-tree-minimal-bin-tree-02-in"><td>minimal-bin-tree-02.in</td><td>✅ PASS</td><td>0.036</td></tr>
<tr id="row-c-minimal-bin-tree-minimal-bin-tree-03-in"><td>minimal-bin-tree-03.in</td><td>✅ PASS</td><td>0.036</td></tr>
<tr class="scenario-row"><td colspan="3"><strong>c-single-char - TDD</strong></td></tr>
<tr id="row-c-single-char-single-char-01-in"><td>single-char-01.in</td><td>✅ PASS</td><td>0.036</td></tr>
<tr id="row-c-single-char-single-char-02-in"><td>single-char-02.in</td><td>✅ PASS</td><td>0.036</td></tr>
<tr id="row-c-single-char-single-char-03-in"><td>single-char-03.in</td><td>✅ PASS</td><td>0.034</td></tr>
<tr class="scenario-row"><td colspan="3"><strong>d-sample - TDD</strong></td></tr>
<tr id="row-d-sample-sample-01-in"><td>sample-01.in</td><td>✅ PASS</td><td>0.033</td></tr>
<tr id="row-d-sample-sample-02-in"><td>sample-02.in</td><td>✅ PASS</td><td>0.036</td></tr>
<tr id="row-d-sample-sample-03-in"><td>sample-03.in</td><td>✅ PASS</td><td>0.034</td></tr>
<tr id="row-d-sample-sample-04-in"><td>sample-04.in</td><td>✅ PASS</td><td>0.034</td></tr>
</tbody></table>

✅ Verification

Validate your solutions against test cases using the metadata rules.

🚀 Quick Prompts

Solution Generation

Create Optimal/Sub-optimal code

ID: 3.1

📄 Enunciados

A 1

Idiomas: pt

💡 Soluções

py: 1 java: 2

✅ 0 ❌ 0

🧪 Casos de Teste

7 Scen.

Total no Disco 24

Total no Banco 24

Sincronização 100.0%

Metadata (form)

Version

Name

Slug

ID Beecrowd

Difficulty

Time Complexity

Space Complexity

Time Limit (s)

Memory Limit (MB)

Origin

Author (Problem)

Author (Editorial)

Default Statement

Topics

Skills

Description

Editorial

Success message

metadata.yaml

# yaml-language-server: $schema=https://api.mundodocodigo.com.br/api/public/json/wok-problem.json --- version: '1.0' id: 753 name: Huffman origin: arvores-huffman slug: huffman authorSlugProblem: Unknown description: Serialização algorítmica de codificação de Huffman. O problema demanda construção de uma Árvore de Sufixos via Min-Heap O(N log N) e compressão bit a bit do fluxo com padding binário (Formato Sedgewick). editorial: 'O problema exige a implementação da compressão de Huffman com uma Fila de Prioridade (Heap). A serialização específica de Sedgewick segue: 1 bit para nós internos, 9 bits para folhas, 32 bits para o tamanho da string, seguidos pelos bits codificados. O total de bits deve ser preenchido para o próximo múltiplo de 8.' successmsg: Trie de Frequência validada com sucesso. A lógica de empacotamento assintótico foi acoplada perfeitamente sobre o algoritmo guloso de compressão estrutural, preservando alocamentos estritos de bits. difficultyLevelId: B timeComplexity: O(N logN) timeLimitSegs: 4 memoryLimitMb: 256 defaultStatement: a_pt_huffman.md skills: - binary-tree-traversals - greedy-algorithms - huffman-coding - priority-queue-heap statements: - id: a-huffman testScenarioLevel: A thematicSkills: - points: 1 skill: cryptography testScenarios: - id: d-sample name: Exemplo ABRACADABRA! description: Validação básica usando o exemplo clássico do enunciado para verificar a lógica de construção e contagem. helpTip: 'I/O Sanity Check e Estrutura Unitária. Validação morfológica direta: atesta se o parser constrói a árvore ótima, computando overhead sintético de base (59 bits Trie, 32 bits Size) sobre os dados.' level: D testType: TDD skills: - points: 1 skill: huffman-coding - id: c-single-char name: Caractere Único description: String composta por apenas um tipo de caractere para testar a estrutura mínima da trie e caminhos unitários. helpTip: Árvore Degenerada O(1). Restrição de extremidade onde a Trie colapsa para nó único de 9 bits. Analise seu DFS/BFS para não referenciar ponteiros nulos no salto. level: C testType: TDD skills: - points: 1 skill: huffman-coding - points: 1 skill: binary-tree-traversals - id: a-full-alphabet name: Alfabeto Completo description: String contendo todos os 256 bytes possíveis para validar o tamanho máximo da trie e a escrita de bits. helpTip: "Densidade Perfeita (Worst-Case Trie). A entrada contém todos os 256 bytes possíveis. Cuidado no Java: evite usar String/StringBuffer (corrompe encoding de Extended ASCII) e leia estritamente como array de bytes (ex: System.in.readAllBytes()). Lembre-se também de descontar o saldo de linha ('\\r' e/ou '\\n' no final do array) para não alterar os dados reais." level: A testType: TDD skills: - points: 1 skill: binary-tree-traversals - points: 1 skill: greedy-algorithms - id: a-performance-load name: Teste de Carga e Performance description: Teste com 1 milhão de caracteres para garantir que a construção da árvore utilize um heap eficiente. helpTip: Saturação Computacional O(N log N). Buscas de mínimos (O(N)) em cada passo causarão TLE (Timeout) na ordenação primária. Implemente incondicionalmente uma Priority Queue min-heap. level: A testType: PERFORMANCE skills: - points: 2 skill: priority-queue-heap - points: 1 skill: greedy-algorithms - id: c-minimal-bin-tree name: Árvore Binária Mínima description: String com exatamente 2 caracteres únicos para testar a menor árvore válida possível (raiz e duas folhas). helpTip: Minimal Overhead O(1). Duplicidade exata do alfabeto gerando um único salto sub-folha. Revise se os ponteiros binários não estão sobrepondo contadores nas bifurcações simétricas. level: C testType: TDD skills: - points: 1 skill: priority-queue-heap - points: 1 skill: huffman-coding - id: b-exact-byte-boundary name: Limite Exato de Byte description: Casos onde a soma total de bits é exatamente um múltiplo de 8, testando se o padding zero é aplicado corretamente. helpTip: Alinhamento de Padding Direto. Somas brutas já finalizam em limites contíguos múltiplos lógicos. Trate operações Modulo % 8 falsas para não derivar 1 byte adicional artificialmente. level: B testType: TDD skills: - points: 1 skill: binary-tree-traversals - points: 1 skill: greedy-algorithms - id: b-high-ascii-data name: Dados em Alta ASCII description: Teste com caracteres acima de 127 para validar o tratamento de bytes e a codificação de 8 bits na trie. helpTip: Overflow de Byte com Sinal. Caracteres ANSI > 127 invertem sinal (NumberFormatException) em arrays estáticos de C/Java. Aplique bitmasks unsigned (0xFF) localizadas O(1) de acesso direto. level: B testType: TDD skills: - points: 1 skill: huffman-coding solutions: - id: a-otima-basica name: Solução Ótima Básica description: Implementação em Python que calcula a serialização de Huffman e o padding para byte-alignment. level: A implementations: - filenames: - solution.py language: py paradigm: Imperative - filenames: - Solution.java language: java paradigm: Imperative - id: a-sedgewick name: Algs4 Huffman description: Implementação original complexa do Sedgewick baseada em BinaryStdIn/Out. level: A implementations: - filenames: - Huffman.java language: java paradigm: Imperative

0753-huffman

README.md Preview

Actions

Workflow do Problema

Local Workspace

Metadados

Validação

Sincronização

Components

Database Info

🚀 Quick Prompts

Statements List

Statement Details

Actions

Statistics

By Type (ID)

By Level

🚀 Quick Prompts

Database Test Cases 24 cases

📊 Sync Statistics

Actions

Test Case Details

Testcase Scenarios Sync

Local Test Cases (Disk)

Scenario: a-full-alphabet 3 cases

Scenario: a-performance-load 5 cases

Scenario: b-exact-byte-boundary 3 cases

Scenario: b-high-ascii-data 3 cases

Scenario: c-minimal-bin-tree 3 cases

Scenario: c-single-char 3 cases

Scenario: d-sample 4 cases

📊 Sync Statistics

Actions

Solução Ótima Básica

Implementations

Algs4 Huffman

Implementations

Solutions Check Report

✅ Verification

🚀 Quick Prompts

📄 Enunciados

💡 Soluções

🧪 Casos de Teste

Metadata (form)

Git Status

Git Workflow

Problem Analysis Report

🛠️ Validation Tools

✅ Synced with API

✅ Synced with Database

Actions

📋 Processo de Criação

Select a Prompt

📤 API Synchronization

📄 Recreating README.md...

💻 Git Action Output

Running Verification...

Ajuda

📄 Sync Statements to DB

🚀 Batch Auto-Link Process

⬇️ Repo Sync Output

📝 Update Manifest Output

Ajuda