Channel
@algochallenges
On this record: Growth · Engagement · What this channel posts · Posts · Polls · Citations · Cite this entry
80subscribers
+0 since we began measuring on 7 August 2026
Risers and fallers across the register · movement among entries of Under 1,000.
| Telegram ID | -1001726256074 |
|---|---|
| Type | Channel |
| Username | @algochallenges |
| Description | Daily algorithm questions with explanations. Prepare for your next coding interview! |
| Created | Between 1 December 2021 and 25 January 2022— estimated from Telegram’s id allocation, not measured. How this range is calculated. |
| First recorded | 9 August 2026 |
| Last confirmed live | 9 August 2026 |
| Measurements held | 2 |
| On Telegram | t.me/algochallenges |
| Measured (UTC) | Subscribers | Change |
|---|---|---|
| 9 Aug 2026, 19:01 | 80 | no change |
| 7 Aug 2026, 00:17 | 80 | first reading |
20 posts held, back to 25 January 2022 — the 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 4 March 2022. An engagement rate over an empty window would be a number about nothing.
Lifetime counters from Telegram’s own channel header, read 9 August 2026 — not the date at the top of this page, which is when the subscriber count was last read. Below Telegram’s rounding threshold, so these counts are exact.
Which of the following ways can be used to represent a graph?
Shares as published, totalling 101%. No per-option vote count is published by Telegram, so none is shown.
A graph with all vertices having equal degree is known as a __________
Shares as published, totalling 101%. No per-option vote count is published by Telegram, so none is shown.
For which of the following combinations of the degrees of vertices would the connected graph be eulerian?
Shares as published. No per-option vote count is published by Telegram, so none is shown.
For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?
Shares as published. No per-option vote count is published by Telegram, so none is shown.
Which of the following is true?
Shares as published, totalling 101%. No per-option vote count is published by Telegram, so none is shown.
What is the maximum number of edges in a bipartite graph having 10 vertices?
Shares as published, totalling 99%. No per-option vote count is published by Telegram, so none is shown.
Which of the following properties does a simple graph not hold?
Shares as published, totalling 101%. No per-option vote count is published by Telegram, so none is shown.
If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is ___________
Shares as published. No per-option vote count is published by Telegram, so none is shown.
A connected planar graph having 6 vertices, 7 edges contains _____________ regions.
Shares as published. No per-option vote count is published by Telegram, so none is shown.
What is the number of edges present in a complete graph having n vertices?
Shares as published. No per-option vote count is published by Telegram, so none is shown.
Which of the following statements for a simple graph is correct?
Shares as published. No per-option vote count is published by Telegram, so none is shown.
In simple uniform hashing, what is the search complexity?
Shares as published, totalling 99%. No per-option vote count is published by Telegram, so none is shown.
Showing the 12 most recent of 20 posts we hold for @algochallenges. 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.
The 6 most recent of 20 polls we hold for this entry, as Telegram rendered them when we read the post. A poll’s figures keep moving after that, so each one is dated.
Which of the following ways can be used to represent a graph?
Shares as published, totalling 101%. No per-option vote count is published by Telegram, so none is shown.
A graph with all vertices having equal degree is known as a __________
Shares as published, totalling 101%. No per-option vote count is published by Telegram, so none is shown.
For which of the following combinations of the degrees of vertices would the connected graph be eulerian?
Shares as published. No per-option vote count is published by Telegram, so none is shown.
For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?
Shares as published. No per-option vote count is published by Telegram, so none is shown.
Which of the following is true?
Shares as published, totalling 101%. No per-option vote count is published by Telegram, so none is shown.
What is the maximum number of edges in a bipartite graph having 10 vertices?
Shares as published, totalling 99%. 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 25 January 2022 to 4 March 2022. 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 — 612,228 of 1,169,250entries 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.
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.
Named by 1 registered channel — every channel on the register whose own posts have named this one, by its current username or any other username it currently holds, merged from two separately captured readings of the same fact so a namer caught by only one of them is not missed and a namer both caught is not counted twice. A username this channel has since dropped is not matched — that handle may belong to someone else now, and crediting today’s namer to yesterday’s owner would misattribute it.
Named by
Channels on the register whose posts name this channel's handle.
A mention is a weaker signal than a forward and is counted separately for that reason — naming a channel is not republishing it, and a handle in a post body is easy to place deliberately. The post counts beside each row below are distinct posts in which the handle appeared, from posts we have read on both sides — the “Named by N registered channels” figure above is a different count, of distinct NAMING CHANNELS rather than posts, and is not the sum of the rows under it.
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 9 August 2026 — this entry's latest reading, not the date you are reading this.
“Algochallenges” (@algochallenges), 80 subscribers as measured 9 August 2026. Telegram Register, tgregister.com/channel/algochallenges.
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.