Telegram RegisterThe public register of Telegram

Channel

Algorithm By Mustafoev

@algorithm_with_mustafoyev

On this record: Growth · Engagement · Reactions · Posts · Polls · Citations · Cite this entry

78subscribers

+0 since we began measuring on 10 August 2026

Risers and fallers across the register · movement among entries of Under 1,000.

Register entry

Telegram ID-1001618825354
TypeChannel
Username@algorithm_with_mustafoyev
CreatedBetween 1 December 2021 and 30 April 2023— estimated from Telegram’s id allocation, not measured. How this range is calculated.
First recorded10 August 2026
Last confirmed live11 August 2026
Measurements held2
Confirmed unchanged1 time, most recently 11 August 2026
On Telegramt.me/algorithm_with_mustafoyev

Growth

7810 Aug 2026, 13:33 — 78 subscribers11 Aug 2026, 01:51 — 78 subscribers10 Aug 2026, 13:3311 Aug 2026, 01:51
2 measurements taken within a single day. Dots are measurements; the straight line between them is drawn to join them, not to claim we know the path taken in between — snapshots are recorded only when a count changes, so gaps mean “no change observed”, never “interpolated”. The vertical axis spans 77–79 and does not start at zero.
Measurement log — every subscribers count we have recorded
Measured (UTC)SubscribersChange
11 Aug 2026, 01:5178no change
10 Aug 2026, 13:3378first reading

Engagement

20 posts held, back to 10 December 2025the reader has not yet reached the start of this channel’s public history, so older posts may sit further back, unread. Read across 1 pageof Telegram’s post history, 20 posts per page.

Nothing published in the last 30 days. ERR and ER are rolling 30-day measures, so there is nothing to compute — we hold 20 posts for this entry, the most recent from 27 June 2026. An engagement rate over an empty window would be a number about nothing.

Reaction mix

9 reactions across 5 posts, in 3 distinct kinds. The most used accounts for 55.6% of them.

Every reaction kind recorded on the sample, most used first
ReactionCountShareShare, drawn
👍555.6%
🔥333.3%
111.1%

No sentiment is inferred, and none should be read in. This table is ordered by count and by nothing else. Emoji do not carry stable meaning across languages or communities — 🙏 is thanks in one channel and mourning in another — so we publish which ones were pressed and how often, and pass no judgement on what an audience meant by them.

Precision. Telegram publishes reaction counts per emoji and short-forms each one — 4.34K, 1.2M — so any single kind at or above 1,000 reaches us at three significant figures, and only counts below 1,000 are exact. The shares above are ratios of those figures and carry the same error. This is also why the total here can differ slightly from a reaction total printed elsewhere on the page: both are sums of the same rounded parts, taken over samples with different edges.

Coverage. Reactions were read on 5 of the 20 sampled posts in this sample. Summed by Telegram’s own count on each post — not by adding up the per-emoji breakdown above — those same posts carry 9reactions in total: the kind of figure the paragraph above means by “a reaction total printed elsewhere on the page”.

Measured over the 20 most recent posts we hold, published 10 December 2025 to 27 June 2026, using the newest reading held for each. Telegram Stars are excluded: they are a payment, not a reaction, and they have their own section.

Recent posts

27 Jun 2026, 19:46 UTC88 viewsread 10 August 2026

https://leetcode.com/problems/contiguous-array birinchi prefix sumni yo'lini topgan bo'lsangiz O(N) uchun demak bu masalada ozroq o'zgartirish qilsangiz bo'ldi!

26 Jun 2026, 11:45 UTC75 viewsread 10 August 2026

Xo'p endi bu masalaga keladigan bo'lsak, har doim birinchi fikr daavom qilinadi, kamida miyani zavat qilib olish uchun 1. p ni Arrays.sort() dan foydalanib saralab olamiz va s ni p.length da static slide window bilan aylanib chiqamiz va har bir bo'lakni Arrays.sort bilan saralash ham kerak: saralarash n * log n uchun bo'lsa time complexity yana s ni p ni uzunligi bo'ylab aylanish m * n * log n oohhh lekin mana shu j

24 Jun 2026, 06:50 UTC83 viewsread 10 August 2026

buni yechimini hali beraman bugungi uchun masalani yechavering https://leetcode.com/problems/subarray-sum-equals-k/

24 Jun 2026, 06:20 UTC73 viewsread 10 August 2026

Bunda edge points dan biri bu shartida min da chegarasi kattaligi hisobiga 99999 bu son yetmay qoladi, shuning uchun Integer.MAX_VALUE ishlatiladi va natijada ham agar max value bo'lsa 0 qaytarish qilinadi va yo'q bo'lsa o'z qiymati!

22 Jun 2026, 03:46 UTC86 viewsread 10 August 2026

Va bugungi masala https://leetcode.com/problems/find-all-anagrams-in-a-string/

22 Jun 2026, 03:45 UTC68 viewsread 10 August 2026

Tepadagisini qanday yechgan bo'lsam bunisi ham shuni shabloni bilan faqat ozroq ishlov bersa bo'ldi! left, right degan o'zgaruvchilar va endi bitta sum o'sha windowni tutib turish uchun! public int minSubArrayLen(int target, int[] nums) { int left = 0, right, sumt = 0, min = 99999; for(right = 0; right < nums.length; right++) { sumt += nums[right]; while (sumt >= target) {

22 Jun 2026, 03:43 UTC62 viewsread 10 August 2026

Mana shuni while qilib olsak bo'ldi duplikatini birinchisigacha o'chiradi.

21 Jun 2026, 07:46 UTC78 views1 reactionsread 10 August 2026

Birinchi kelgan fikr: HashSet da add qilib turib set.contains(...) bo'lsa uni uzunligini yuqorida ochib olgan maxL dan katta bo'lsa unga berib, yana qolgan joyimizdan set ochib yoki uni to'liq o'chirib chiqib keyingilarni add qilish davom etadi qachonki contains() true qaytarmagunicha! Boshida qanchalik ahmoqona bo'lmasin kelgan fikrni analiz qilish va uni yaxshilab borish kerak menimcha! Endi agar har safar HashSet

1

19 Jun 2026, 11:38 UTC82 viewsread 10 August 2026

bu masalada aytilgan muamoni ya'ni oxirgi qadamni ham yetkazib olib tekshirish uchun left ga rightni qiymatini berish kifoya left = right;

19 Jun 2026, 11:33 UTC91 viewsread 10 August 2026

Uzr o'rtada uzilish bo'ldi to'g'riroq aytganda, yechimni fikrlatadigan qadamlar bilan post chiqarishga biroz erindim! buni ham ishlash yo'li tepadagi bilan bir xil shablonda ishlanadi! ikklasini birga yechimini beraman! bugungiga mana shu masala! https://leetcode.com/problems/minimum-size-subarray-sum/description/

Showing the 12 most recent of 20 posts we hold for @algorithm_with_mustafoyev. View and reaction counts are the latest single reading for each post, not a live figure, and a recent post is still accumulating both. A view count marked was rounded by Telegram before we ever saw it — t.me prints views in full below 1,000 and to three significant figures above, so ≈1,200,000 means somewhere between 1,150,000 and 1,249,999. Unmarked counts are exact. Text is reproduced from the public post preview and truncated for length.

Polls

The poll we hold for this entry, as Telegram rendered it when we read the post. A poll’s figures keep moving after that, so each one is dated.

15 Jun 2026, 15:04 UTCAnonymous Poll10 voters

Iloji bo'lsa, yana yozma tushuntirib ketishimni istagan bo'larmidingiz?

  1. Ha, Albatta90%
  2. Yo'q, Shart emas10%

Shares as published. No per-option vote count is published by Telegram, so none is shown.

Percentages only — there are no per-option vote counts here, because Telegram publishes none.The public post preview gives each option’s share and a single voter total, and nothing else. Multiplying one by the other would produce a per-option tally that looks measured and is not: the shares are rounded to whole numbers before we ever see them. We print what was published and leave the column that does not exist empty.

The shares need not add up to 100.Rounding alone puts many polls at 99 or 101. A poll that allows more than one answer per voter runs well past 100 by design, and several here do. The bars are drawn against a fixed 100% track at each option’s own percentage rather than normalised to the total, so a poll that exceeds it shows that it does instead of being quietly rescaled.

Read from the 20 most recent posts we hold, published 10 December 2025 to 27 June 2026. Telegram labels each poll by kind — an anonymous poll, a quiz, a closed set of final results — and that label is reproduced rather than paraphrased.

Citation-graph rank

Citation-graph rank — 763,865 of 1,480,688entries in the measured graph. A weighted position computed from the forward and mention edges below — republished posts weigh more than named mentions — and recomputed periodically, over the whole graph. Published only as this ordinal position, never as a score: a position is a fact, and a score printed beside one channel’s name would read as a verdict this register does not make. The two counts beneath stay separate for the same reason mentions are never summed with forwards anywhere else on this page — a named-by count costs nothing to manufacture. The top 100 by this measure, or how it is computed.

Forward network

Republished by

Channels on the register that have forwarded this channel's posts into their own feed.

Built only from forwarded posts we have actually read, on both sides. Coverage is early and deliberately incomplete: a missing link means we have not read the post that would prove it, never that the relationship does not exist. Counts are distinct forwarded posts observed, so they only ever go up as we read more.

Cite this entry

A live page changes as we take new readings, so a citation should name the measurement it is based on, not just the URL. The line below cites the subscriber count as measured 11 August 2026 — this entry's latest reading, not the date you are reading this.

“Algorithm By Mustafoev” (@algorithm_with_mustafoyev), 78 subscribers as measured 11 August 2026. Telegram Register, tgregister.com/channel/algorithm_with_mustafoyev.

Full measurement history, CC BY 4.0. Every reading this register holds for this entry, not just the latest one, as a dated, downloadable record: CSV · JSON. Free to use with attribution to tgregister.com. Each file carries its own generation timestamp, which is the figure to cite for exactly when the data was retrieved.