en
Feedback
Abeni Codes

Abeni Codes

Open in 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.

Show more
163
Subscribers
No data24 hours
+17 days
+330 days

Data loading in progress...

Similar Channels
No data
Any problems? Please refresh the page or contact our support manager.
Incoming and Outgoing Mentions
---
---
---
---
---
---
Attracting Subscribers
July '26
July '26
+5
in 1 channels
June '26
+8
in 0 channels
Get PRO
May '26
+8
in 0 channels
Get PRO
April '26
+49
in 0 channels
Get PRO
March '26
+8
in 1 channels
Get PRO
February '26
+8
in 0 channels
Get PRO
January '260
in 0 channels
Get PRO
December '25
+2
in 0 channels
Get PRO
November '25
+3
in 0 channels
Get PRO
October '25
+1
in 0 channels
Get PRO
September '25
+1
in 0 channels
Get PRO
August '250
in 0 channels
Get PRO
July '250
in 0 channels
Get PRO
June '25
+1
in 0 channels
Get PRO
May '25
+5
in 0 channels
Get PRO
April '25
+8
in 0 channels
Get PRO
March '25
+4
in 0 channels
Get PRO
February '25
+5
in 0 channels
Get PRO
January '25
+10
in 0 channels
Get PRO
December '24
+73
in 0 channels
Date
Subscriber Growth
Mentions
Channels
31 July0
30 July+1
29 July0
28 July0
27 July0
26 July0
25 July0
24 July0
23 July0
22 July0
21 July0
20 July0
19 July0
18 July0
17 July0
16 July0
15 July0
14 July0
13 July+3
12 July0
11 July0
10 July0
09 July0
08 July+1
07 July0
06 July0
05 July0
04 July0
03 July0
02 July0
01 July0
Channel Posts

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
No text...
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
No text...
154