Channels
Top 100TrendingNew
Categories
CryptoGamingNewsEntertainmentMusicSportsTechGamblingBots and mini appsFinanceBusinessEducationLifestyleHealthTravelAutoFashionJobsDatingDeals and shopping
Stickers
StickersEmojiThemesWallpapers
BotsGiftsTools
Currency
$ USDโ‚ฝ RUBโ‚ฌ EURโ‚ด UAHโ‚ธ KZTโ‚บ TRYzล‚ PLNโ‚ช ILSAED AEDR$ BRLRp IDRRM MYRยฅ JPYโ‚ฉ KRWCNยฅ CNY
Theme
Englishะ ัƒััะบะธะนEspaรฑolPortuguรชs (Brasil)ArabicPersianBahasa IndonesiaFranรงaisDeutschTรผrkรงeBahasa MelayuItalianoNederlandsO'zbekPolskiะ‘ะตะปะฐั€ัƒัะบะฐัะฃะบั€ะฐั—ะฝััŒะบะฐาšะฐะทะฐา›ัˆะฐํ•œ๊ตญ์–ดไธญๆ–‡ๆ—ฅๆœฌ่ชžCatalร SuomiHebrew
ChannelsCategoriesStickersBotsGiftsTools
PremiumWikiGlossaryLegal
NotificationsSettingsLog in

An open web layer over public Telegram โ€” search, stats and channel reading right in your browser, no account, no install.

Not affiliated with Telegram FZ-LLC; all data comes from public sources.

Catalog

Top channelsCategoriesCountriesSearch

Content

StickersEmojiGiftsThemesWallpapers

Help

ToolsWikiGlossaryBlockchainSafetyPremiumAdvertisersAdvertising
ยฉ 2026 TG.ME ยท G.Media networkยท Updated 08/23/2026 ยท v0.2.0 ยท ba12f6a
PrivacyTermsDMCA & complaintsReport a violation

< Ace Coding /> ๐Ÿš€

@AceCoding ยท 338 subscribers

Created in 2024

Welcome to Ace Coding! Join us for tips, tutorials, and insights on coding and software engineering. Stay updated with the latest content and elevate your programming skills!Let's learn and grow together in the world of software engineering!

Open in Telegram

Information

Username@AceCoding
CreatedAugust 8, 2024
Linkt.me/AceCoding
Discussion2221969174
Paid reactionsAvailable
338
Subscribers
805
Average reach
โ€”
Engagement (ER)
โ€”
Growth
Full stats โ†’
PostsMediaStatsSimilarReviews
โŒ˜K
Newest first
Newest firstOldest first
Share channel โ€œ< Ace Coding /> ๐Ÿš€โ€

The short link opens the channel straight in the Telegram app โ€” not in a browser tab.

tg.me/go/AceCoding

Is this your channel? Add @tgme as admin โ€” and see how many people click your links. Get the stats โ†’

Channel history

Channel created August 8, 2024per Telegram

We have been tracking it since August 25, 2026

In all that time the channel has changed neither its name, nor its @username, nor its avatar.

We show only what we have seen ourselves.

PostsMediaStatsSimilarReviews
Discussion2221969174
CodeLeague is back!!๐Ÿ”ฅ bringing together Ethiopiaโ€™s strongest problem solvers for an intense competitive programming experience.

Round 2 continues our mission to build a culture of algorithmic excellence, collaboration, and real technical growth.

Team up, compete, and prove your skills on the leaderboard. ๐Ÿง โšก๏ธ

๐Ÿ—“ แ‰…แ‹ณแˆœ, แŒแŠ•แ‰ฆแ‰ต 1 ,2018 (May 9, 2026)
โฐ 3แก00 - 11แก00 แˆฐแŠ แ‰ต (9:00 AM โ€“ 5:00 PM)
๐Ÿ“ CapStone ALX Tech Hub, Lideta
๐Ÿ”— Register now: https://luma.com/qcwohlw5

โ€‹#ALXEthiopia #CodeLeagueEthiopia #ALXEthiopia #ALXAfrica #LifeAtALX #DoHardThings#CodeLeagueEthiopia #CompetitiveProgramming #DSA #ProblemSolving #TechCommunity #DoHardThings
83Apr 30
https://youtu.be/ngqSMML1zJc?si=9vW3_hw7uOJ-ugwL
758 1Feb 28
https://youtu.be/nJOz9qRCdEc?si=9q92jJTrelTphtJR
2K 4Mar 9
https://youtu.be/clJCDHml2cA?si=5uZQInWIluuDrfvi
646Jan 29
How to deploy static websites using GitHub : ๐Ÿ‘‰ Watch This

For Dynamic websites, use other deploying platforms like Netlify, Vercel, or Hostinger alongside bundling tools like vite, parcel, or Webpack. You can use this deploying sites or platforms for statics websites too without bundling tools.

@AceCoding
649Jan 25

[media, no text]

788 5Jan 13
#A2SVG6InPersonEducation

@AceCoding
3.9K 11Jan 13
Check your emails๐Ÿšจ


A2SV is sending acceptance emails for G6 In person Education๐ŸŽ‰๐ŸŽ‰

#A2SVInPersonEducation #G6
@AceCoding
3.2K 3Jan 13
Calling All AASTU Students: Join UniHack 2025!


Are you ready to innovate, solve challenges, and showcase your skills? UniHack 2025 is exclusively for AASTU students, offering you the platform to turn your ideas into impactful projects.

๐Ÿ—“ Event Date: February 19, 2025
๐Ÿ“ Venue: Old graduation hall(AASTU)
๐ŸŒ Apply Now: LINK

Who Can Apply?

This event is exclusively for AASTU students from any department. Whether youโ€™re a coder, designer, or idea generator, thereโ€™s a place for you at UniHack!

Donโ€™t miss this incredible opportunity to represent AASTUโ€™s innovation and talent.

๐Ÿ“Œ Visit our Website LINK for more details and to apply.

Spaces are limited, so apply today and get ready to innovate!
652 2Jan 10
๐Ÿ’ป Call for Registration for Winter Bootcamp


[UNESCO UNITWIN] 2025 Winter Digital Innovation BootCamp
Theme: Artificial Intelligence and K-eGov Open Source Framework in Ethiopia

The Bootcamp registration is now open!

Due Date: January 25 (Saturday)

๐Ÿ‘‰๐Ÿพ Registration Link

You can also access the registration link via the QR Code provided on the poster above.

For inquiries, feel free to contact us via email at [email protected]

แŒฅแ‹ซแ‰„ แŠซแˆ‹แ‰ฝแˆ แŠฅแ‹šแˆ… แˆ‹แ‹ญ แˆ›แ‰…แˆจแ‰ฅ แ‰ตแ‰ฝแˆ‹แˆ‹แ‰ฝแˆ  ๐Ÿƒโ€โ™‚๏ธ๐Ÿ‘‡๐Ÿ‘‡๐Ÿ‘‡๐Ÿ‘‡๐Ÿ‘‡๐Ÿ‘‡๐Ÿ‘‡๐Ÿ‘‡๐Ÿ‘‡๐Ÿ‘‡๐Ÿ‘‡๐Ÿ‘‡๐Ÿ‘‡

โš—๏ธโš—๏ธ@Aastu_poll_and_quiz_botโš—๏ธโš—๏ธ

โ˜๏ธโ˜๏ธโ˜๏ธโ˜๏ธโ˜๏ธโ˜๏ธโ˜๏ธโ˜๏ธโ˜๏ธโ˜๏ธโ˜๏ธโ˜๏ธ

   ๐Ÿ“ค๐Ÿ“ค๐Ÿ“•๐Ÿ“•๐Ÿ“•๐Ÿ“•๐Ÿ“•๐Ÿ“•๐Ÿ“•๐Ÿ“ค๐Ÿ“ค
   ๐Ÿ“Š๐Ÿ“Š๐Ÿ“š  @Aastu_poll   ๐Ÿ“Š๐Ÿ“Š
   ๐Ÿ“Š๐Ÿ“Š๐Ÿ“š  @Aastu_poll   ๐Ÿ“Š๐Ÿ“Š
   ๐Ÿ“Š๐Ÿ“Š๐Ÿ“š  @Aastu_poll  ๐Ÿ“Š๐Ÿ“Š
   ๐Ÿ“Š๐Ÿ“Š ๐Ÿ“’๐Ÿ“’๐Ÿ“’๐Ÿ“’๐Ÿ“’๐Ÿ“’๐Ÿ“Š๐Ÿ“Š
433 1Jan 10
โœ… Mastering Browsers Dev tools with a single video:

๐Ÿ“—Recommendation source ๐Ÿ‘‰ Evangadi Fullstack web dev course.

https://youtu.be/x4q86IjJFag?si=UIQxXYxzXHYcr96Q
636 2Dec 29

[media, no text]

513Dec 27
https://www.youtube.com/live/guQcJa9pNCM?si=rV290TrwvWgahJil
592Dec 27
๐ŸŽ‰ G6 A2SV In-Person Education Program results ๐Ÿš€๐ŸŽ“

The G6 A2SV In-Person Education Program results will be revealed by the end of next week! ๐Ÿ—“โœจ

Source: A2SV - Weekly Wins and Demos - December 27
๐Ÿ‘‰ See the updates on the Remote Education too.


Stay tuned, and get ready to celebrate your hard work and achievements! ๐Ÿง‘โ€๐Ÿ’ป๐ŸŒŸ

#A2SVResults ๐ŸŽŠ

@AceCoding presents
3.5K 1Dec 27
แ‹ญแˆ… แ‰ แˆแˆตแˆ‰ แ‹จแˆแ‰ณแ‹ฉแ‰ต แˆแŒ…: แ‹ซแ‰คแ… แˆฐแˆˆแˆžแŠ• แ‹ญแ‰ฃแˆ‹แˆแข แ‹จ8แŠ› แŠญแแˆ แ‰ฐแˆ›แˆช แАแ‹แข แ‹จแˆšแŠ–แˆจแ‹ แ‹จแŠซ แŠ แ‰ฃแ‹ถ แˆฒแˆ†แŠ• แŠซแŒ‹แŒ แˆ˜แ‹ แ‹จแŠฉแˆ‹แˆŠแ‰ต แ‰ แˆฝแ‰ณ แ‹จแˆ˜แŒจแˆจแˆป แ‹ฐแˆจแŒƒ แˆ‹แ‹ญ แˆตแˆˆแ‹ฐแˆจแˆฐ แ‹ˆแ‹ฐ แ‹แŒช แˆ€แŒˆแˆญ แˆ„แ‹ถ transplant แˆ›แ‹ตแˆจแŒ แŠฅแŠ•แ‹ณแˆˆแ‰ แ‰ต แˆˆแ‰คแ‰ฐแˆฐแ‰ฆแ‰น แ‰ฐแАแŒแˆฏแˆแข แˆˆแˆ…แŠญแˆแŠ“แ‹แˆ แ‹ˆแ‹ฐ 5 แˆšแˆŠแ‹จแŠ• แ‰ฅแˆญ แ‹ซแˆตแˆแˆแŒˆแ‹‹แˆแข แŠ แ‰ฃแ‰ฑ แ‹จแŠ แ‰ฃแ‹ถ แˆ˜แˆฐแˆจแ‰ฐ แŠญแˆญแˆตแ‰ถแˆต แ‰ค/แŠญ แŠ แŒˆแˆแŒ‹แ‹ญ แˆฒแˆ†แŠ• แˆŒแˆ‹ แ‹จแŒˆแ‰ข แˆแŠ•แŒญ แˆตแˆˆแˆŒแˆˆแ‹ แˆแŒ แŠฅแŠ•แ‹ฒแ‰ณแŠจแˆ แŠฅแˆญแ‹ณแ‰ณ แŒ แ‹ญแ‰‹แˆแข
แˆตแˆˆแ‹šแˆ… แ‹จแ‹šแˆ… แ‰ฅแˆ‹แ‰ดแŠ“ แˆ…แ‹ญแ‹ˆแ‰ต แ‰ฃแˆˆแŠ• แŠ แ‰…แˆ แ‰ แˆ˜แ‹ฐแŒˆแ แŠฅแŠ•แ‰ณแ‹ฐแŒแค แŠฅแŠ•แ€แˆแ‹ญแˆˆแ‰ต!

แˆˆแˆ˜แ‹ฐแŒˆแ แ‹จแˆแ‰ตแˆแˆแŒ‰: Account holder: Solomon Alemayehu (Yabetsโ€™ Father)
CBE: 1000057164143
Awash: 01320037587500
Abyssinia: 102845781
Cooperative : 1000072492677
Go fund me: https://gofund.me/698c8f50
Phone: 0911670476/ 0962157832
622 4Dec 27
#Registration


Register Here


Requirement:

A student of AASTU
(Any department)

Interest for puzzles, games, problem solving


Join us @aastucpc
368 4Dec 25
https://youtu.be/-Wjw37IAdIE?si=l4ywFVbfnigNN7el
396Dec 25
Given an array of integer arrays arrays where each arrays[i] is sorted in strictly increasing order,
return an integer array representing the longest common subsequence among all the arrays.
A subsequence is a sequence that can be derived from another sequence by deleting some elements (possibly none)
without changing the order of the remaining elements.

Example 1:
Input: arrays = [[1,3,4],
                 [1,4,7,9]]
Output: [1,4]
Explanation: The longest common subsequence in the two arrays is [1,4].
Example 2:
Input: arrays = [[2,3,6,8],
                 [1,2,3,5,6,7,10],
                 [2,3,4,6,9]]
Output: [2,3,6]
Explanation: The longest common subsequence in all three arrays is [2,3,6].

Example 3:
Input: arrays = [[1,2,3,4,5],
                 [6,7,8]]
Output: []
Explanation: There is no common subsequence between the two arrays.


Constraints:
2 <= arrays.length <= 100
1 <= arrays[i].length <= 100
1 <= arrays[i][j] <= 100
arrays[i] is sorted in strictly increasing order.

'''
524Dec 21
"""
You are given a string s consisting only of the letters 'a' and 'b', and an integer k.
What is the minimum number of characters you need to change to obtain a substring of length โ‰ฅ k where all characters are the same?

Example 1:
s = โ€œaabaabaaโ€, k = 3
Output: 1
Explanation: s can be transformed to โ€œaaaaabaaโ€

Example 2:
s = โ€œbbabbabaโ€, k = 8
Output: 3
Explanation: s can be transformed to โ€œbbbbbbbbโ€

Constraints:
1 <= s.length <= 10^5
1 <= k <= s.length

aaab, k = 4
aaaa
abs(3 - 1) = 2
"""
387 3Dec 21
โœ… Hello everyone, today was my interview date, and I was asked the following question: At first, I thought I could use the two pointers technique to solve it, but then I realized that that would make the algorithm inefficient. Then I noticed that the number of 1s will be the length of the subarray with grouped 1s. This changed my approach to a fixed sliding window, and then the rest was easy. My interviewer was very nice and guided me the whole way.

'''
Given a binary array data, return the minimum number of swaps required to group all 1โ€™s
present in the array together in any place in the array.


Example 1:

Input: data = [1,0,1,0,1]
Output: 1
Explanation: There are 3 ways to group all 1's together:
[1,1,1,0,0] using 1 swap.
[0,1,1,1,0] using 2 swaps.
[0,0,1,1,1] using 1 swap.
The minimum is 1.

Example 2:
Input: data = [0,0,0,1,0]
Output: 0
Explanation: Since there is only one 1 in the array, no swaps are needed.

Example 3:
Input: data = [1,0,1,0,1,0,0,1,1,0,1] count_ones = 6 count_zeros = 3 curr_zeros = 3 min of count_zeros and curr_zeros
l
r
time comp = O(n)
space comp = O(1)

Output: 3
Explanation: One possible solution that uses 3 swaps is [0,0,0,0,0,1,1,1,1,1,1].


Constraints:

1 <= data.length <= 10**5
data[i] is either 0 or 1.
'''

"""
1. count 1's store one count_ones
2. assign count_zeros = inf curr_zeros = 0
3. l, r = 0
4. check for a valid window
5. update curr_zeros
6. take the min of the count_zeros and curr_zeros
7. check if the values at the indexes are zeros if so decrement curr_zeros
8. update pointers
9. return count_zeros
"""
# my code
def minNumberOfSwaps(arr):
count_ones = arr.count(1)
count_zeros, curr_zeros = float('inf'), 0
l = 0

for r in range(len(arr)):
if arr[r] == 0:
curr_zeros += 1
# check for a valid window
if r - l + 1 == count_ones:
count_zeros = min(count_zeros, curr_zeros)
if arr[l] == 0:
curr_zeros -= 1
l += 1

return count_zeros if count_zeros != float('inf') else 0


"""
1= 6
curr_zeros = 3
count_zeros = 3
1,0,1,0,1,0,0,1,1,0,1
l
r
"""


#A2SV #a2sv #a2sv2024
A2SV a2sv 2024 In person

๐Ÿš€ @AceCoding Presents! ๐Ÿš€
393 9Dec 20

Where to next

HAHamster Kombat Announcement21.7M subscribers
Open
BLBlum: All Crypto โ€“ One App15.2M subscribers
Open
PRProxy MTProto11.9M subscribers
Open
MAMajor Community11.7M subscribers
Open
TETelegram Tips11.1M subscribers
Open
PAPavel Durov11.1M subscribers
Open
TAtapswap community10.7M subscribers
Open
TETelegram News9.7M subscribers
Open