my js tasks

Array ichidan dublikatlarni o'chirish function removeDuplicates(arr) { return [...new Set(arr)]; }

ci/cd for next js 15

name: Deploy to cPanel on: push: branches: - main jobs: deploy: runs-on: ubuntu-latest strategy: matrix: node-version: [18.x, 20.x] steps: # Step 1: Checkout the code - name: Checkout Code 🚚 uses: actions/checkout@v3 # Step 2: Set up Node.js - name: Set up Node.js uses: actions/setup-node@v3 with: node-version: ${{ …

Arifmetik progressiya function sum(n) { return n * (n+1) / 2; } console.log(sum(5)); @javohirbek_frontend

kanalga username qo'yishda adashibman ) endi @javohirbeks_blog bo'ldi )

function SeriesSum(n) { if(n === 0) { return '0.00' } let sum = 0 for(let i = 0; i <n; i++) { sum += 1 / (1 + i * 3) } return sum.toFixed(2) } https://www.codewars.com/kata/555eded1ad94b00403000071/train/javascript

function areYouPlayingBanjo(name) { // Implement me if(name.startsWith('R') || name.startsWith('r')) { return name + " plays banjo" } return name + " does not play banjo"; } https://www.codewars.com/kata/53af2b8861023f1d88000832/train/javascript

function isLeapYear(year) { // TODO if(year % 4 === 0 ) { if(year % 100 === 0 ) { return year % 400 === 0 } else { return true } } else { return false } } https://www.codewars.com/kata/526c7363236867513f0005ca/train/javascript

function getCount(str) { return (str.match(/[aeiou]/gi) || []).length; } https://www.codewars.com/kata/54ff3102c1bad923760001f3/train/javascript

tub sonlarni topish javascriptda , Bu yerda birinchi yangi array yaratib olinayapti , sieve nomli array yozilayapti , va u qachon qiymatlar true bo'lsagina arrayga to'ladi yani push bo'ladi so'ng primes degan bo'sh array yaratiladi Har bir raqam 2 dan berilgan limitgacha loop bo'ladi Current number "sieve" arrayda asosiy sifatida belgilangan yoki yo'qligini tekshiriladi Agar son tub bo'lsa, uni "primes" array…

// find Prime numbers const findPrimeNumbers = (limit) => { const sieve = new Array(limit + 1).fill(true); const primes = []; for (let num = 2; num <= limit; num++) { if (sieve[num]) { primes.push(num); for (let i = num * num; i <= limit; i += num) { sieve[i] = false; } } } return primes; }; console.log(findPrimeNumbers(50));

bu esa kodni optimize bo'lgani const isOdd = (number: number) => { return Array.from({ length: Math.floor(number / 2) + 1 }, (_, index) => index * 2 + 1); };