Js Algorithms

function myFunction(a,b){ return [Math.max(...a), Math.max(...b)] } console.log(myFunction([21,12,-1,34],[16,2,-3,12]))

n ta elementdan tashkil topgan a va b massiv berilgan. c massiv hosil qiling. c[i] = max(a[i], b[i]), ya'ni c massiv elementi a va b massiv elementlaridan kattasini qabul qilsin

function myFunction(arr){ let lastElem=arr[arr.length-1] for (let element of arr){ if(element

function findLongestWord(text){ let arr=text.split(' ') longText=arr[0] for (let i=0; i

function countNotVowelFunction(str){ let count=0 str=str.toLowerCase() vowels=['a','o','e','i','u'] for(let element of str){ if(!vowels.includes(element)){ count++ } } return count } countNotVowelFunction("Samandar") Funksiyaga ixtiyoriy so'z kelganda unda nechta undosh harf bor ekanligini topish algoritmi

function countVowelFunction(str){ let count=0 str=str.toLowerCase() vowels=['a','o','e','i','u'] for(let element of str){ if(vowels.includes(element)){ count++ } } return count }a countVowelFunction("Samandar") Funksiyaga ixtiyoriy so'z kelganda unda nechta unli harf bor ekanligini topish algoritmi

@FurqatMashrabjonov tomonidan kelgan masala yechimi var isPalindrome = function(x) { if (x >= 0){ if (x<=9) return true x = x.toString() let left = x.slice(0, Math.floor(x.length/2)) let right = x.slice(Math.ceil(x.length/2) ) right = right.split('').reverse().join('') return right === left }else return false; }; @IslamovDev tomonidan kelgan masala yechimi var isPalindrome = function(x) { let result = String(x).split("").reverse().join(""); return Number(result) === x }; @iftixarjanovich tomonidan kelgan masala yechimi function polindromNumber(a){ let sum=0; while(a>0){ sum=sum*10+a%10; a=Math.floor(a/10); } return sum; } let a=222; console.log( polindromNumber(a)==a ? 'polindrom number' : 'not polindrom number') @s1mple_web_dev tomonidan kelgan yechim var isPalindrome = function (x) { x = x.toString(); if(x[0]=="-"){ return false; }else{ let f = x.split("").reverse().join(""); if (x == f) { return true; } else { return false; }} };

https://leetcode.com/problems/palindrome-number/ Javascript Leetcode Palindorme number solution Ushbu videoda 2 usulda yechim ko'rsatildi. Kanal @jstutorial

Kanalimiz a'zosi Hikmatulla (@s1mple_web_dev) ning yechimi var twoSum = function(nums, target) { let arr=[] let len = nums.length; for (let i = 0; i < len; i++) { for (let j = i + 1; j < len; j++) { if (nums[i] + nums[j] == target) { arr = []; arr[0] = i; arr[1] = j; break; } } } return arr; }; @IslamovDev dan kelgan yechim 1- yo'li: let arrNumber = [2, 7, 11, 15]; let count = 26; var twoSum = function (numbers, target) { let left = 0; let right = numbers.length - 1; while (left < right) { const cur = numbers[left] + numbers[right]; if (cur === target) { console.log([left, right]); } cur > target ? right-- : left++; } }; twoSum(arrNumber, count); 2- yo'li: const sumOfTwo = (arr, target) => { const result = [] for(let i = 0; i < arr.length; i++) { for(let j = i + 1; j < arr.length; j++) { if(arr[i] + arr[j] === target) { result.push(i) result.push(j) } } } return result; } Kanal @jstutorial

https://leetcode.com/problems/two-sum/solution/ Leetcode Two Sum solution1 Kanal @jstutorial

2-kun masalalari Bilimingizni sinab ko'ring. Kanal tomonidan yechimlar kechga joylanadi Kanal @jsalgorithms Guruhimiz @jsfamily

Yechimlari: Problem1: let number1=10 let result1= number1>0?true:false console.log(result1) let number2=-20 let result2=number2<0?true:false console.log(result2) let number3=25 let result3= number3%5==0?true:false console.log(result3) Problem2: let number=999 let a1=number%10 let a2=(number-a1)/10%10 let a3=(number-a2*10-a1*1)/100 if(a1==a2 && a2==a3){ console.log(true) } else{ console.log(false) } let number=123 let a1=number%10 let a2=(number-a1)/10%10 let a3=(number-a2*10-a1*1)/100 if(a1!==a2 && a1!==a3 && a2!==a3){ console.log(true) } else{ console.log(false) } Problem3: let N=129656 let sum=0 while(N!==0){ let r=N%10 N=Math.floor(N/10) console.log(r) } Problem4: let number=56789123 let str=number.toString() first=str.substring(0,1) last=str.substring(str.length-1) middle=str.substring(1, str.length-1) str=last+middle+first number=parseInt(str) Problem5: // Koordinata Ikkinchi choragida joylashishi uchun x<0 va y>0 shart bajarilishi kerak x=-2 y=6 let result=(x<0 && y>0)?true:false console.log(result) Kanal @jsalgorithms