☄️✌️ QuickJS: The Small, Embeddable JavaScript Engine

Several years ago, Fabrice Bellard, the genius behind FFMPEG and JSLinux, built a tiny and complete JavaScript engine in C. It now supports ES2023 and its latest release adds top-level await in modules and its REPL, as well as support for some cutting edge JS features (changelog).

FABRICE BELLARD

❓ CHALLENGE

async function asyncQuiz() {
  console.log("Start");

  const promise1 = new Promise((resolve) => {
    setTimeout(() => resolve("Promise 1"), 1000);
  });

  const promise2 = new Promise((resolve) => {
    setTimeout(() => resolve("Promise 2"), 500);
  });

  console.log(await promise1);
  console.log(await promise2);

  console.log("End");
}

asyncQuiz();

✌️🍊 Jint 3.0: A JavaScript Interpreter for .NET

Run JavaScript within a .NET app and expose .NET objects and functions to JavaScript code. v3 arrives after seven years of work and is the most standards-compliant JS engine running entirely within .NET.

SÉBASTIEN ROS

❓ CHALLENGE

const fetchData = async (id) => {
  return new Promise((resolve) => {
    setTimeout(() => resolve(`Data for ID ${id}`), 100);
  });
};

const ids = [1, 2, 3];

async function complexAsyncFetch(ids) {
  const result = await ids.reduce(async (acc, id) => {
    const data = await fetchData(id);
    const currentResult = await acc;
    currentResult.push(data);
    return currentResult;
  }, Promise.resolve([]));

  console.log(result);
}

complexAsyncFetch(ids);

😂 Nice life hack

❓ CHALLENGE

function recursiveFibonacci(n) {
  return n <= 1 ? n : recursiveFibonacci(n - 1) + recursiveFibonacci(n - 2);
}

const result = recursiveFibonacci(6);

console.log(result);

🤣 So true…

❓ CHALLENGE

function recursivePalindromeCheck(str) {
  if (str.length <= 1) {
    return true;
  }

  return str[0] === str[str.length - 1] && recursivePalindromeCheck(str.slice(1, -1));
}

const result = recursivePalindromeCheck("radar");

console.log(result);

❓ CHALLENGE

function recursiveBinarySearch(arr, target, start = 0, end = arr.length - 1) {
  if (start > end) {
    return -1;
  }

  const mid = Math.floor((start + end) / 2);

  if (arr[mid] === target) {
    return mid;
  } else if (arr[mid] < target) {
    return recursiveBinarySearch(arr, target, mid + 1, end);
  } else {
    return recursiveBinarySearch(arr, target, start, mid - 1);
  }
}

const result = recursiveBinarySearch([1, 2, 3, 4, 5, 6, 7, 8, 9], 6);

console.log(result);

👀A Step-by-Step Tutorial on Deploying Node.js Apps on AWS EC2

Taking the manual, 'do it all by hand' approach. A good way to learn about all the pieces involved before automating it, perhaps.

SAM MEECH-WARD

❓ CHALLENGE

function recursiveReverseString(str) {
  return str === "" ? str : recursiveReverseString(str.substr(1)) + str[0];
}

const result = recursiveReverseString("hello");

console.log(result);

❓ CHALLENGE

const obj = {
  0: 'a',
  1: 'b',
  length: 2
};

const result = Array.from(obj);

console.log(result);