Abeni Codes
Kanalga Telegram’da o‘tish
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.
Ko'proq ko'rsatish163
Obunachilar
Ma'lumot yo'q24 soatlar
+17 kunlar
+330 kunlar
Ma'lumot yuklanmoqda...
O'xshash kanallar
Ma'lumot yo'q
Muammo bormi? Iltimos, sahifani yangilang yoki bizning qo'llab-quvvatlash boshqaruvchimizga murojaat qiling>.
Taglar buluti
Kirish va chiqish esdaliklari
---
---
---
---
---
---
Obunachilarni jalb qilish
Iyul '26
Iyul '26
+5
1 kanalda
Iyun '26
+8
0 kanalda
Get PRO
May '26
+8
0 kanalda
Get PRO
Aprel '26
+49
0 kanalda
Get PRO
Mart '26
+8
1 kanalda
Get PRO
Fevral '26
+8
0 kanalda
Get PRO
Yanvar '260
0 kanalda
Get PRO
Dekabr '25
+2
0 kanalda
Get PRO
Noyabr '25
+3
0 kanalda
Get PRO
Oktabr '25
+1
0 kanalda
Get PRO
Sentabr '25
+1
0 kanalda
Get PRO
Avgust '250
0 kanalda
Get PRO
Iyul '250
0 kanalda
Get PRO
Iyun '25
+1
0 kanalda
Get PRO
May '25
+5
0 kanalda
Get PRO
Aprel '25
+8
0 kanalda
Get PRO
Mart '25
+4
0 kanalda
Get PRO
Fevral '25
+5
0 kanalda
Get PRO
Yanvar '25
+10
0 kanalda
Get PRO
Dekabr '24
+73
0 kanalda
| Sana | Obunachilarni jalb qilish | Esdaliklar | Kanallar | |
| 31 Iyul | 0 | |||
| 30 Iyul | +1 | |||
| 29 Iyul | 0 | |||
| 28 Iyul | 0 | |||
| 27 Iyul | 0 | |||
| 26 Iyul | 0 | |||
| 25 Iyul | 0 | |||
| 24 Iyul | 0 | |||
| 23 Iyul | 0 | |||
| 22 Iyul | 0 | |||
| 21 Iyul | 0 | |||
| 20 Iyul | 0 | |||
| 19 Iyul | 0 | |||
| 18 Iyul | 0 | |||
| 17 Iyul | 0 | |||
| 16 Iyul | 0 | |||
| 15 Iyul | 0 | |||
| 14 Iyul | 0 | |||
| 13 Iyul | +3 | |||
| 12 Iyul | 0 | |||
| 11 Iyul | 0 | |||
| 10 Iyul | 0 | |||
| 09 Iyul | 0 | |||
| 08 Iyul | +1 | |||
| 07 Iyul | 0 | |||
| 06 Iyul | 0 | |||
| 05 Iyul | 0 | |||
| 04 Iyul | 0 | |||
| 03 Iyul | 0 | |||
| 02 Iyul | 0 | |||
| 01 Iyul | 0 |
Kanal postlari
| 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 |  Matn yo'q... | 135 |
| 5 |  Is the interview process for other roles really just convo and stuff? | 142 |
| 6 |  Matn yo'q... | 154 |
