function asyncQuiz() {
  return new Promise((resolve) => {
    setTimeout(() => resolve('Hello'), 1000);
  });
}

async function runAsyncQuiz() {
  const result = await asyncQuiz();
  console.log(result);
}

runAsyncQuiz();
console.log('World');

console.log(018 == '018')
console.log(018 === '018')


console.log(017 == '017')
console.log(017 === '017')

Savol :
SLL berilgan va n berilgan , sizdan so'raladi, linked listni oxirgi n-nodeni qaytaring.

!!! Linked List size: 0 <= M <= 10**n
!!! 0 <= n <= M

Time Complexity: O(n)
Space Complexity: O(1)

input: N = 5
output: 15
Tarif: 1+2+3+4+5=15

Input: N = 6
output: 21
Tarif: 1+2+3+4+5+6=21

Agar savol qiyinlik qilsa, internetdan izlab ko'rib javobini ko'rib, misolni qanday ishlashini tushunishga harakat qiling va shuni o'zingiz takroran ishlab ko'ring!!!

-> -> -> [ Javob uchun linklar kun oxirigacha Shu yerga biriktiriladi! ] <- <- <-

input: [1,2,4,7,7,5]
output: Ikkinchi eng katta element: 5
Ikkinchi eng kichik element: 2

Input: [1]
output: Ikkinchi eng katta element: -1
Ikkinchi eng kichik element: -1
Tarif: array bitta elementdan tashkil topgani uchun, u eng katta va eng kichik elemment bo'la oladi, shuning uchun bizda ikkinchi eng katta va eng kichik element mavjud emas.

So'raladi: Time Complexity: O(n)
Space complexity: O(1)

-> -> -> [ Javob uchun linklar kun oxirigacha Shu yerga biriktiriladi! ] <- <- <-

const Details = {
    Name: 'Ali',
    Level: 25,
    Age: 20
}
const JsonDetails = JSON.stringify(Details, ['Name', 'Age']) 
console.log(JsonDetails);

console.log(Math.round(4.5)); // 5

console.log(Math.round(4.4)); // 4

console.log(Math.floor(4.9)); // 4

console.log(Math.floor(-4.1)); // -5

console.log(Math.ceil(4.1)); //5

console.log(Math.ceil(-4.9)); // -4

console.log(Math.trunc(4.9)); // 4

console.log(Math.trunc(-4.9)); // -4

console.log([..."salom"]);

Commentariyada boshqalar bilan muhokama qiling, juda muhim!