let arr = [1, 2, 3];
arr[10] = 42;

console.log(arr.length);
console.log(arr[6]);

let person = {
  name: "Alice",
  greet: () => {
    console.log(`Hello, ${this.name}`);
  },
};

person.greet();

let x = 1;

function outer() {
  let x = 2;

  function inner() {
    console.log(x);
  }

  return inner;
}

const func = outer();
func();

console.log(1);
setTimeout(() => console.log(2), 0);
Promise.resolve().then(() => console.log(3));
console.log(4);

input: let numbers = [3, 0, 2, 7, 0, 1, 0];
output: // [10, 10, 8, 1, null, null, null]

Input: n = 4
Output: [[".Q..","...Q","Q...","..Q."],["..Q.","Q...","...Q",".Q.."]]

Explanation: 4-queens muammosiga ikkita o'ziga xos yechim mavjud, yuqorida ko'rsatilganidek.

Example 2:
Input: n = 1
Output: [["Q"]]

Agar masalalarni ishlashda qiyinchilikka duch kelsangiz yoki DSA ni o'rganmoqchi bo‘lsangiz, yuqorida sanab o'tilgan 5 qadamni qo'llab ko'ring. Bu bosqichlar sizga jarayonni osonlashtiradi va natijada samarali o‘rganishingizga yordam beradi.

[2, 4, 6, 8, 10, 12] – To‘g‘ri
[8, 3, 10, 1, 6] – Noto‘g‘ri (saralash talab qilinadi)

Array: To‘g‘ri
Linked List: Noto‘g‘ri (Tasodifiy kirish imkoni yo‘q)

Binary Searchni to‘g‘ri ishlatish orqali ko‘plab qidiruv muammolarini samarali hal qilishingiz mumkin!

🛑Misol:
Input: N = 5
Output: 120
Tarif: 5! = 5 * 4 * 3 * 2 * 1

Input: N = 3
Output: 6
Tarif: 3! = 3 * 2 * 1

🛑Misol:
input: N = 123
output: 321
Tarif: 123 ning teskarisi 321.

Input: N = 234
output: 432.

Input: N = -123
Output: -321.