uz
Feedback
JavaScript

JavaScript

Kanalga Telegram’da o‘tish

A resourceful newsletter featuring the latest and most important news, articles, books and updates in the world of #javascript 🚀 Don't miss our Quizzes! Let's chat: @nairihar

Ko'proq ko'rsatish

📈 Telegram kanali JavaScript analitikasi

JavaScript (@javascript) Ingliz til segmentidagi kanali faol ishtirokchi. Hozirda hamjamiyat 31 359 obunachidan iborat bo'lib, Texnologiyalar & Aralashmalar toifasida 4 368-o'rinni va Hindiston mintaqasida 13 193-o'rinni egallagan.

📊 Auditoriya ko‘rsatkichlari va dinamika

невідомо sanasidan buyon loyiha tez o‘sib, 31 359 obunachiga ega bo‘ldi.

23 Iyun, 2026 dagi oxirgi ma’lumotlarga ko‘ra kanal barqaror faollikka ega. Oxirgi 30 kunda obunachilar soni -184 ga, so‘nggi 24 soatda esa 8 ga o‘zgardi va umumiy qamrov yuqori darajada qolmoqda.

  • Tasdiqlash holati: Tasdiqlanmagan
  • Jalb etish (ER): Auditoriya o‘rtacha 5.65% darajada jalb etiladi. Nashrdan keyingi dastlabki 24 soatda kontent odatda umumiy obunachilar sonining 1.85% ini tashkil etuvchi reaksiyalarni to‘playdi.
  • Post qamrovi: Har bir post o‘rtacha 1 773 marta ko‘riladi; birinchi sutkada odatda 581 ta ko‘rish yig‘iladi.
  • Reaksiyalar va o‘zaro ta’sir: Auditoriya faol: har bir postga o‘rtacha 6 ta reaksiya keladi.
  • Tematik yo‘nalishlar: Kontent javascript, console.log(gen.next().value, processdata, remix, acc kabi asosiy mavzularga jamlangan.

📝 Tavsif va kontent siyosati

Muallif resursni shaxsiy fikrni ifoda etish maydoni sifatida ta’riflaydi:
A resourceful newsletter featuring the latest and most important news, articles, books and updates in the world of #javascript 🚀 Don't miss our Quizzes! Let's chat: @nairihar

Yuqori yangilanish chastotasi (oxirgi ma’lumot 24 Iyun, 2026 da olingan) sababli kanal doimo dolzarb va katta qamrovli bo‘lib qoladi. Analitika auditoriya kontent bilan faol hamkorlik qilishini, uni Texnologiyalar & Aralashmalar toifasidagi muhim ta’sir nuqtasiga aylantirishini ko‘rsatadi.

31 359
Obunachilar
+824 soatlar
-557 kunlar
-18430 kunlar
Postlar arxiv
What is the output?
Anonymous voting

CHALLENGE

async function complexAsyncFunction() {
  const promise1 = new Promise(resolve => setTimeout(() => resolve(10), 1000));
  const promise2 = new Promise(resolve => setTimeout(() => resolve(20), 500));

  const result = await Promise.race([promise1, promise2]);

  console.log(result);
}

complexAsyncFunction();

Love it!🔥
Love it!🔥

What is the output?
Anonymous voting

CHALLENGE

const array = [1, 2, 3, 4, 5];

const result = array.map(num => Promise.resolve(num * 2));

console.log(result);

🕺 9K Strong! Together, we're creating a community that thrives on knowledge, support, and positive vibes. 🎉 Cheers to 9K an
🕺 9K Strong! Together, we're creating a community that thrives on knowledge, support, and positive vibes. 🎉 Cheers to 9K and beyond! 🌟🙌 ✌️ Check out our emoji pack here. ⚡️ Boost us in Telegram.

What is the output?
Anonymous voting

CHALLENGE

async function asyncSumOfSquares() {
  const numbers = [1, 2, 3, 4, 5];

  const result = await numbers.reduce(async (acc, num) => {
    const currentSquare = await Promise.resolve(num * num);
    return (await acc) + currentSquare;
  }, Promise.resolve(0));

  console.log(result);
}

asyncSumOfSquares();

Why JavaScript is so hard 😂
Why JavaScript is so hard 😂

What is the output?
Anonymous voting

CHALLENGE

const matrix = [
  [1, 2, 3],
  [4, 5, 6],
  [7, 8, 9],
];

async function asyncSumOfEvenNumbers(matrix) {
  const result = await matrix.flat().filter(async num => {
    return await Promise.resolve(num % 2 === 0);
  });

  return result.reduce((acc, num) => acc + num, 0);
}

asyncSumOfEvenNumbers(matrix).then(result => console.log(result));

🌕 ✌️ I built my own Google (sort of...) with Text Transformers and Qdrant Vector Database Building content search functional
🌕 ✌️ I built my own Google (sort of...) with Text Transformers and Qdrant Vector Database Building content search functionality for Next.js project almost always requires deep understanding of how the text similarity search works. Nowadays we have text transformer AI Models from HuggingFace and Vector Databases that easily could be integrated to Next.js giving the powerful similarity search functionality with a blasting speed! This video below explains this in detail. Tigran Tech

What is the output?
Anonymous voting

CHALLENGE

async function asyncArrayOperations() {
  const array1 = [1, 2, 3];
  const array2 = [4, 5, 6];

  const result = await Promise.all([array1, array2].map(async arr => {
    return await arr.reduce(async (acc, num) => {
      return (await acc) + num;
    }, Promise.resolve(0));
  }));

  console.log(result);
}

asyncArrayOperations();

🌲 Tinybench: A Tiny, Simple Benchmarking Library No dependencies, but uses whatever precise timing capabilities are availabl
🌲 Tinybench: A Tiny, Simple Benchmarking Library No dependencies, but uses whatever precise timing capabilities are available (e.g. process.hrtime or `peformance.now`). You can then benchmark whatever functions you want, specify how long or how many times to benchmark for, and get a variety of stats in return. TINYLIBS

What is the output?
Anonymous voting

CHALLENGE

const matrix = [
  [2, 4],
  [6, 8],
];

const result = matrix.reduceRight((acc, row) => acc.concat(row.map(num => num * 2)), []);

console.log(result);

⛽️ npm in Review: A Retrospective in Numbers From Socket comes a look at the past year from the perspective of the npm regist
⛽️ npm in Review: A Retrospective in Numbers From Socket comes a look at the past year from the perspective of the npm registry, focused largely on statistics (2.5 million live packages!), including download numbers, popular packages, as well as some ‘quirky facts’ like the package with the most maintainers (554, if you're wondering.) PHILIPP BURCKHARDT (SOCKET)

What is the output?
Anonymous voting

CHALLENGE

function* fibonacci() {
  let a = 0, b = 1;
  while (true) {
    yield a;
    [a, b] = [b, a + b];
  }
}

const fibSequence = Array.from({ length: 5 }, () => fibonacci().next().value);

console.log(fibSequence);