Abeni Codes
前往频道在 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.
显示更多163
订阅者
无数据24 小时
+17 天
+330 天
数据加载中...
吸引订阅者
七月 '26
七月 '26
+5
在1个频道中
六月 '26
+8
在0个频道中
Get PRO
五月 '26
+8
在0个频道中
Get PRO
四月 '26
+49
在0个频道中
Get PRO
三月 '26
+8
在1个频道中
Get PRO
二月 '26
+8
在0个频道中
Get PRO
一月 '260
在0个频道中
Get PRO
十二月 '25
+2
在0个频道中
Get PRO
十一月 '25
+3
在0个频道中
Get PRO
十月 '25
+1
在0个频道中
Get PRO
九月 '25
+1
在0个频道中
Get PRO
八月 '250
在0个频道中
Get PRO
七月 '250
在0个频道中
Get PRO
六月 '25
+1
在0个频道中
Get PRO
五月 '25
+5
在0个频道中
Get PRO
四月 '25
+8
在0个频道中
Get PRO
三月 '25
+4
在0个频道中
Get PRO
二月 '25
+5
在0个频道中
Get PRO
一月 '25
+10
在0个频道中
Get PRO
十二月 '24
+73
在0个频道中
| 日期 | 订阅者增长 | 提及 | 频道 | |
| 31 七月 | 0 | |||
| 30 七月 | +1 | |||
| 29 七月 | 0 | |||
| 28 七月 | 0 | |||
| 27 七月 | 0 | |||
| 26 七月 | 0 | |||
| 25 七月 | 0 | |||
| 24 七月 | 0 | |||
| 23 七月 | 0 | |||
| 22 七月 | 0 | |||
| 21 七月 | 0 | |||
| 20 七月 | 0 | |||
| 19 七月 | 0 | |||
| 18 七月 | 0 | |||
| 17 七月 | 0 | |||
| 16 七月 | 0 | |||
| 15 七月 | 0 | |||
| 14 七月 | 0 | |||
| 13 七月 | +3 | |||
| 12 七月 | 0 | |||
| 11 七月 | 0 | |||
| 10 七月 | 0 | |||
| 09 七月 | 0 | |||
| 08 七月 | +1 | |||
| 07 七月 | 0 | |||
| 06 七月 | 0 | |||
| 05 七月 | 0 | |||
| 04 七月 | 0 | |||
| 03 七月 | 0 | |||
| 02 七月 | 0 | |||
| 01 七月 | 0 |
频道帖子
| 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 | 156 |
| 4 |  没有文字... | 135 |
| 5 |  Is the interview process for other roles really just convo and stuff? | 142 |
| 6 |  没有文字... | 154 |
