TGViewer
JavaScript JavaScript @javascript · 31.1K subscribers
Post #2756 3.75K
CHALLENGE

const numbers = [1, 2, 3, 4, 5];
const result = numbers
.filter(n => n % 2 === 0)
.map(n => n * 2)
.reduce((acc, n) => acc + n, 0);

const original = numbers.slice();
original.reverse();

const flattened = [[1, 2], [3], [4, 5]].flat();
const found = flattened.find(n => n > 3);

console.log(result);
console.log(original.length);
console.log(found);
  • ❤ 3
More from @javascript
  1. Sep 29, 2026Post #3526
  2. Sep 29, 2026CHALLENGE const order = []; order.push('start'); setTimeout(() => { order.push('timeout');…
  3. Sep 28, 2026Post #3524
  4. Sep 28, 2026CHALLENGE let order = []; function a() { try { return 'try'; } finally { order.push('a-fin…
  5. Sep 27, 2026Post #3522
  6. Sep 27, 2026CHALLENGE class Base { value = 10; getValue = () => this.value; constructor() { this.value…
Threads Profile ViewerView any public Threads profile without an account.Open ThreadLook →Writing with AI? Make it sound human.Metric37 rewrites AI drafts so they read naturally. Free AI detector, 1,500 words free.Try Metric37 →