Yaxshi 👍 mana LeetCode’dagi ENG OSON hisoblanadigan 10 ta “Math” yo‘nalishidagi MEDIUM masalalar. Bular *medium* bo‘lsa ham, mantiqi yengil, formulaga tayangan.

---

## 🔢 ENG OSON 10 TA MEDIUM (Math) MASALA

### 1️⃣ 12. Integer to Roman

👉 Sonni Rim raqamiga aylantirish
🔹 Faqat mapping + ayirish
🔹 Murakkab algoritm yo‘q

---

### 2️⃣ 43. Multiply Strings

👉 Ikkita katta sonni string ko‘rinishida ko‘paytirish
🔹 Oddiy ustunlab ko‘paytirish
🔹 BigInteger ishlatmasdan

---

### 3️⃣ 50. Pow(x, n)

👉 xⁿ ni hisoblash
🔹 Fast Power (bo‘lish orqali)
🔹 Klassik math masala

---

### 4️⃣ 7. Reverse Integer

👉 Sonni teskarisiga o‘girish
🔹 Overflow’ga e’tibor
🔹 Toza arifmetika

---

### 5️⃣ 29. Divide Two Integers

👉 / va * ishlatmasdan bo‘lish
🔹 Bit shift
🔹 Math + logic

---

### 6️⃣ 166. Fraction to Recurring Decimal

👉 Kasrni o‘nlik songa aylantirish
🔹 Qoldiqni kuzatish
🔹 Map bilan oson

---

### 7️⃣ 633. Sum of Square Numbers

👉 a² + b² = c bo‘ladimi
🔹 Two pointers
🔹 Math + sqrt

---

### 8️⃣ 858. Mirror Reflection

👉 LCM (eng kichik umumiy karrali)
🔹 Sof matematik formula
🔹 Kod qisqa

---

### 9️⃣ 365. Water and Jug Problem

👉 Suv o‘lchash masalasi
🔹 GCD asosida
🔹 Juda klassik math

---

### 🔟 869. Reordered Power of 2

👉 Raqamlarni joyini almashtirib 2 ning darajasi bo‘ladimi
🔹 Digit count
🔹 Math + string

---

## 🎯 Tavsiya

Agar eng-eng osonidan boshlamoqchi bo‘lsang, shu tartibda qil:

1. 7 → Reverse Integer
2. 50 → Pow(x,n)
3. 633 → Sum of Square Numbers
4. 365 → Water and Jug Problem

Agar xohlasang:

* 📌 faqat 1–2 qator formulali masalalar
* 📌 yoki Kotlin / Java uchun eng mos 5 tasi

Qaysi yo‘nalishda davom etamiz?

binding root

Albatta, Ahmadali 👍
Mana array (massiv) bo‘yicha LeetCode va oddiy masalalardan eng oson 10 ta keltiraman. Bular yangi boshlovchilar uchun juda mos.

---

## 🟢 Array — OSON 10 MASALA

### 1️⃣ 1. Two Sum

* Arrayda ikkita elementni topish, ularning yig‘indisi target ga teng bo‘lsin.

---

### 2️⃣ 27. Remove Element

* Arraydan ma’lum bir elementni olib tashlash.

---

### 3️⃣ 35. Search Insert Position

* Sorted arrayda element qayerga tushishi kerakligini topish.

---

### 4️⃣ 66. Plus One

* Arraydagi raqamlar sonini 1 ga oshirish (digits[]).

---

### 5️⃣ 169. Majority Element

* Arrayda eng ko‘p uchraydigan elementni topish.

---

### 6️⃣ 1480. Running Sum of 1d Array

* Array elementlarining running sum’ini hisoblash.

---

### 7️⃣ 118. Pascal's Triangle

* Array yordamida Pascal uchburchagini yaratish.

---

### 8️⃣ 704. Binary Search

* Sorted arrayda berilgan elementni binary search yordamida topish.

---

### 9️⃣ 1351. Count Negative Numbers in a Sorted Matrix

* Sorted 2D arrayda manfiy sonlarni sanash.

---

### 🔟 1342. Number of Steps to Reduce a Number to Zero

* Arrayda emas, lekin sonni 0 ga tushirish uchun steps hisoblash (o‘xshash array bilan mashq qilish mumkin).

---

Agar xohlasang, men:

* 🧑‍💻 shu 10 ta masalani tartib bilan Java kodi bilan yechib berish
* 🧪 test-case bilan tushuntirish
* 📈 boshlang‘ich → o‘rtacha reja tuzish

Qaysi usulni qilamiz?

📼 1920p, 💾 10.8MB, @Gozilla_bot

📼 1080p, 💾 255.7MB, @Gozilla_bot

📼 1080p, 💾 255.7MB, @Gozilla_bot

📼 360p, 💾 46.9MB, @Gozilla_bot

📼 1280p, 💾 1.5MB, @Gozilla_bot

📼 640p, 💾 914.7KB, @Gozilla_bot

📥 @AudioSavedBot orqali yuklab olindi

📥 @AudioSavedBot orqali yuklab olindi

📥 @AudioSavedBot orqali yuklab olindi

🟢 Easy Array LeetCode (TOP 20)

1 – Two Sum

26 – Remove Duplicates from Sorted Array

27 – Remove Element

35 – Search Insert Position

66 – Plus One

88 – Merge Sorted Array

121 – Best Time to Buy and Sell Stock

136 – Single Number

169 – Majority Element

189 – Rotate Array

217 – Contains Duplicate

283 – Move Zeroes

414 – Third Maximum Number

448 – Find All Numbers Disappeared in an Array

485 – Max Consecutive Ones

561 – Array Partition

724 – Find Pivot Index

977 – Squares of a Sorted Array

1480 – Running Sum of 1d Array

1929 – Concatenation of Array