es
Feedback
Abeni Codes

Abeni Codes

Ir al canal en Telegram

I post about my insights, new discoveries, projects and advices related to tech mainly and other topics once in a while. You can DM me @abeni_al7 for professional or collaborative queries.

Mostrar más
163
Suscriptores
Sin datos24 horas
+17 días
+330 días

Carga de datos en curso...

Canales Similares
Sin datos
¿Algún problema? Por favor, actualice la página o contacte a nuestro gerente de soporte.
Menciones Entrantes y Salientes
---
---
---
---
---
---
Atraer Suscriptores
julio '26
julio '26
+5
en 1 canales
junio '26
+8
en 0 canales
Get PRO
mayo '26
+8
en 0 canales
Get PRO
abril '26
+49
en 0 canales
Get PRO
marzo '26
+8
en 1 canales
Get PRO
febrero '26
+8
en 0 canales
Get PRO
enero '260
en 0 canales
Get PRO
diciembre '25
+2
en 0 canales
Get PRO
noviembre '25
+3
en 0 canales
Get PRO
octubre '25
+1
en 0 canales
Get PRO
septiembre '25
+1
en 0 canales
Get PRO
agosto '250
en 0 canales
Get PRO
julio '250
en 0 canales
Get PRO
junio '25
+1
en 0 canales
Get PRO
mayo '25
+5
en 0 canales
Get PRO
abril '25
+8
en 0 canales
Get PRO
marzo '25
+4
en 0 canales
Get PRO
febrero '25
+5
en 0 canales
Get PRO
enero '25
+10
en 0 canales
Get PRO
diciembre '24
+73
en 0 canales
Fecha
Crecimiento de Suscriptores
Menciones
Canales
31 julio0
30 julio+1
29 julio0
28 julio0
27 julio0
26 julio0
25 julio0
24 julio0
23 julio0
22 julio0
21 julio0
20 julio0
19 julio0
18 julio0
17 julio0
16 julio0
15 julio0
14 julio0
13 julio+3
12 julio0
11 julio0
10 julio0
09 julio0
08 julio+1
07 julio0
06 julio0
05 julio0
04 julio0
03 julio0
02 julio0
01 julio0
Publicaciones del Canal

2
I built Lacon, a huffman coding based text file compression tool. I used Go to build it and it taught me a lot of things and made me see some of the theoretical concepts I knew in practice. Compression is an amazing concept to learn in practice. It made me appreciate the cleverness of the people that come up with algorithms that solve very specific problems in a very efficient way. Huffman coding has a few basic steps. It scans the file, counts the frequency of each character in the file, and assigns shorter binary codes for the most frequent ones and longer codes to the least frequent ones. Compared to giving the same 8-bit length representation for all characters in a file, this results in a significantly lower file size. The significance of the compression totally depends on the distribution of characters in the text file. While building this tool I used: - Min-heaps to efficiently build the Huffman tree which is a special binary tree which has the most frequent characters at a shallower depth than the rarer ones. - Binary trees to generate prefix codes that would be decoded unambiguously. - Bit level I/O to read and write individual bits when compressing and decompressing which was admottedly the most challenging part for me. My code is public on GitHub for anyone who wants to look at it and give me feedback (https://github.com/abeni-al7/lacon). I have also built a CLI and a web interface so that it is easy to access it and try it out (https://lacon-jet.vercel.app/).
683
3
@backendlife
@backendlife
156
4
Sin texto...
135
5
Is the interview process for other roles really just convo and stuff?
Is the interview process for other roles really just convo and stuff?
142
6
Sin texto...
154