Channel
@full_stack_developers
On this record: Growth · Engagement · Posts · Polls · Citations · Cite this entry
448subscribers
+0 since we began measuring on 7 August 2026
Risers and fallers across the register · movement among entries of Under 1,000.
| Telegram ID | -1001482652487 |
|---|---|
| Type | Channel |
| Username | @full_stack_developers |
| Created | Between 1 April 2019 and 11 May 2021— estimated from Telegram’s id allocation, not measured. How this range is calculated. |
| First recorded | 7 August 2026 |
| Last confirmed live | 7 August 2026 |
| Measurements held | 2 |
| Confirmed unchanged | 1 time, most recently 7 August 2026 |
| On Telegram | t.me/full_stack_developers |
| Measured (UTC) | Subscribers | Change |
|---|---|---|
| 7 Aug 2026, 01:11 | 448 | no change |
| 7 Aug 2026, 00:17 | 448 | first reading |
18 posts held, back to 11 May 2021 — 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 18 posts for this entry, the most recent from 13 January 2022. An engagement rate over an empty window would be a number about nothing.
Two balanced binary trees are given with m and n elements respectively. They can be merged into a balanced binary search tree in x time.
Shares as published. No per-option vote count is published by Telegram, so none is shown.
Balanced binary tree with n items allows the lookup of an item in ____ worst-case time.
Shares as published, totalling 101%. No per-option vote count is published by Telegram, so none is shown.
What are the worst case and average case complexities of a binary search tree?
Shares as published. No per-option vote count is published by Telegram, so none is shown.
Join algochallenges for coding interview preparation!
https://t.me/algochallenges
If binary trees are represented in arrays, what formula can be used to locate a left child, if the node has an index i?
Shares as published. No per-option vote count is published by Telegram, so none is shown.
Ever thought of vscode entirely in Web? vscode.dev
When client asks to make loading animation a bit more interesting 😂
https://blog.bitsrc.io/how-we-build-micro-front-ends-d3eeeac0acfc
How to prevent an SQL injection 🧐
Photo, posted without a caption
Interesting way how spotify makes their texts on images readable. Try it yourself!
Showing the 12 most recent of 18 posts we hold for @full_stack_developers. 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 5 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.
Two balanced binary trees are given with m and n elements respectively. They can be merged into a balanced binary search tree in x time.
Shares as published. No per-option vote count is published by Telegram, so none is shown.
Balanced binary tree with n items allows the lookup of an item in ____ worst-case time.
Shares as published, totalling 101%. No per-option vote count is published by Telegram, so none is shown.
What are the worst case and average case complexities of a binary search tree?
Shares as published. No per-option vote count is published by Telegram, so none is shown.
If binary trees are represented in arrays, what formula can be used to locate a left child, if the node has an index i?
Shares as published. No per-option vote count is published by Telegram, so none is shown.
Current situation as a developer?
The shares total 126%, above 100: this poll accepts more than one answer per voter. No per-option vote count is published, so the number of voters who chose each option is not derivable and is not 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 18 most recent posts we hold, published 11 May 2021 to 13 January 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 — 690,262 of 1,160,990entries 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.
Republishes
Channels on the register whose posts this channel has forwarded.
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.
Names
Channels on the register whose handles appear in this channel's posts.
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 7 August 2026 — this entry's latest reading, not the date you are reading this.
“Full-stack Developers” (@full_stack_developers), 448 subscribers as measured 7 August 2026. Telegram Register, tgregister.com/channel/full_stack_developers.
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.