1000 amaliy dasturlash masalasi — JS / PHP / Python yechimlari¶
Oddiylikdan murakkablikgacha. Har bir masala uchta tilda — JavaScript, PHP, Python — bir xil yondashuv, lekin har tilning idiomatik uslubida yechilgan. Maqsad: bir g'oya turli tillarda qanday ko'rinishini ko'rsatish.
Kelishuvlar (conventions)¶
- Misollar funksiya ko'rinishida berilgan — qayta ishlatish va taqqoslash oson bo'lishi uchun. To'liq I/O dasturi emas.
- PHP misollarida qisqalik uchun
<?phpochuvchi tegi tushirib qoldirilgan; kerakliimport/uselar ko'rsatilgan. - Python va JS da kerakli
importlar masala ichida ko'rsatiladi. - Kod universal — izoh va sarlavhalar o'zbekcha, texnik atamalar inglizcha.
- Tillar qamrovi: yadro masalalari (1–216) har uchala tilda; kengaytma (217–1000) har masala uchun eng idiomatik 1–3 tilda beriladi (tilga xos mavzular — masalan async — kamroq tilda).
Mundarija va yo'l xaritasi¶
📑 Barcha 1000 masala — to'liq ko'rsatkich (bosib oching)
1-bo'lim — Asoslar: 1. Hello World · 2. Ikki sonni qo'shish · 3. O'zgaruvchilarni almashtirish (swap) · 4. Aylana yuzasi · 5. Salomlashish · 6. Selsiy → Farengeyt · 7. Juft yoki toq · 8. Ikki sondan kattasi · 9. Uch sondan kattasi · 10. Sonning ishorasi · 11. Kabisa yil (leap year) · 12. Sekundlarni HH:MM:SS formatiga · 13. Oddiy kalkulyator · 14. BMI (tana massasi indeksi) · 15. Chegirma narxi
2-bo'lim — Sikllar: 16. 1 dan N gacha yig'indi · 17. N tagacha juft sonlar · 18. Ko'paytirish jadvali (n × 1..10) · 19. Faktorial · 20. Raqamlar yig'indisi · 21. Raqamlar soni · 22. Sonni teskari ag'darish · 23. Daraja (qo'lda hisoblash) · 24. To'g'ri burchakli uchburchak (yulduzcha) · 25. Fibonachchi (birinchi n ta)
3-bo'lim — Sonlar va matematika: 26. Tub son tekshirish · 27. N tagacha tub sonlar · 28. EKUB — eng katta umumiy bo'luvchi (GCD) · 29. EKUK — eng kichik umumiy karrali (LCM) · 30. Mukammal son (perfect number) · 31. Armstrong soni · 32. Palindrom son · 33. O'nlikdan ikkilikka (decimal → binary) · 34. Ikkilikdan o'nlikka (binary → decimal) · 35. O'rta arifmetik (average) · 36. Sonning bo'luvchilari (divisors) · 37. Tub ko'paytuvchilarga ajratish (prime factorization) · 38. Ikki son orasidagi tub sonlar · 39. Kvadrat tenglama yechimi · 40. Foiz hisoblash
4-bo'lim — Satrlar: 41. Satrni teskari ag'darish · 42. Palindrom satr · 43. Unli harflar soni (vowels) · 44. So'zlar soni · 45. Katta-kichik harf almashtirish (swapcase) · 46. Belgi chastotasi (character frequency) · 47. Anagramma tekshirish · 48. Eng uzun so'z · 49. Barcha bo'sh joylarni olib tashlash · 50. Birinchi takrorlanmas belgi · 51. Qism-satr indeksini topish · 52. Akronim (bosh harflar) · 53. Faqat harflarni qoldirish · 54. Har bir so'zni teskari ag'darish · 55. camelCase → snake_case
5-bo'lim — Massivlar / ro'yxatlar: 56. Massiv yig'indisi · 57. Eng katta element · 58. Eng kichik element · 59. Elementni qidirish (indeks) · 60. Element bormi (contains) · 61. Massivni teskari ag'darish · 62. Takrorlarni olib tashlash (unique) · 63. Juft sonlarni filtrlash · 64. Har bir elementni 2 ga ko'paytirish (map) · 65. Massiv o'rtachasi · 66. Manfiy sonlar sonini sanash · 67. Ikkinchi eng katta element · 68. Massivni saralash (o'sish bo'yicha) · 69. Ikki massivni birlashtirish (concat) · 70. Ikki massiv kesishmasi (intersection) · 71. Ikki massiv ayirmasi (a − b) · 72. Massivni n ta qismga bo'lish (chunk) · 73. Massivni tekislash (flatten — 1 daraja) · 74. Element chastotasi (count occurrences) · 75. Massivni k qadam aylantirish (rotate left) · 76. Yo'qolgan sonni topish (1..n) · 77. Juft indeksdagi elementlar · 78. Massiv saralanganmi (is sorted, o'sish)
6-bo'lim — Hash map / obyekt / lug'at: 79. Kalit bormi (has key) · 80. Kalit-qiymat qo'shish / yangilash · 81. Kalitlar ro'yxati · 82. Qiymatlar ro'yxati · 83. Kalit bo'yicha o'chirish · 84. Ikki obyektni birlashtirish (merge) · 85. Qiymatlar yig'indisi · 86. Eng katta qiymatli kalit · 87. Obyektni qiymat bo'yicha saralash · 88. So'z chastotasi (word frequency) · 89. Ikki ro'yxatdan obyekt yasash (zip → map) · 90. Obyektni teskari aylantirish (invert: key↔value) · 91. Guruhlash (group by — juft/toq misolida)
7-bo'lim — Rekursiya: 92. Yig'indi 1..n (rekursiv) · 93. Massiv yig'indisi (rekursiv) · 94. Daraja (rekursiv power) base^exp · 95. Fibonachchi (rekursiv, n-element) · 96. Satrni teskari (rekursiv) · 97. Raqamlar yig'indisi (rekursiv) · 98. Palindrom (rekursiv tekshirish) · 99. Massivda chiziqli qidiruv (rekursiv) · 100. Massivdagi eng katta (rekursiv) · 101. Hanoy minorasi (Tower of Hanoi) · 102. Barcha permutatsiyalar (permutations) · 103. Quvvat to'plami (power set — barcha kichik to'plamlar) · 104. O'nlikni ikkilikka (rekursiv)
8-bo'lim — Saralash algoritmlari: 105. Bubble sort · 106. Selection sort · 107. Insertion sort · 108. Shell sort · 109. Merge sort · 110. Quick sort · 111. Counting sort · 112. Heap sort
9-bo'lim — Qidiruv: 113. Chiziqli qidiruv (linear search) · 114. Ikkilik qidiruv — iterativ · 115. Ikkilik qidiruv — rekursiv · 116. Birinchi uchrashi (leftmost) · 117. Oxirgi uchrashi (rightmost) · 118. Kiritish nuqtasi (lower bound) · 119. Aylantirilgan saralangan massivda qidiruv · 120. Butun kvadrat ildiz (integer sqrt)
10-bo'lim — Stack / Queue: 121. Stack (class) · 122. Qavslar balansi (balanced parentheses) · 123. Min Stack · 124. Postfiks (RPN) ifodani hisoblash · 125. Queue (class) · 126. Ikki stack yordamida Queue · 127. Circular Queue (aylanma navbat)
11-bo'lim — Linked List: 128. Singly Linked List (class) · 129. Qiymat bo'yicha o'chirish (delete by value) · 130. Listni teskari ag'darish (reverse) · 131. O'rtadagi elementni topish (fast/slow) · 132. Siklni aniqlash (cycle detection — Floyd) · 133. Ikki saralangan listni birlashtirish · 134. Oxiridan n-elementni o'chirish (remove nth from end)
12-bo'lim — Daraxtlar (Binary Tree / BST): 135. TreeNode (class) + BST'ga qo'shish · 136. BST'da qidirish · 137. Inorder traversal (chap → root → o'ng) · 138. Preorder traversal (root → chap → o'ng) · 139. Postorder traversal (chap → o'ng → root) · 140. Level-order traversal (BFS) · 141. Daraxt balandligi (height / max depth) · 142. Tugunlar sonini sanash · 143. BST'ni tekshirish (validate BST) · 144. Daraxtni aks ettirish (invert / mirror) · 145. Eng kichik umumiy ajdod (LCA, BST)
13-bo'lim — Graflar (BFS / DFS): 146. Graf (class, adjacency list) · 147. BFS (kenglik bo'yicha o'tish) · 148. DFS — rekursiv (chuqurlik bo'yicha) · 149. DFS — iterativ (stack bilan) · 150. Eng qisqa yo'l (vaznsiz graf, BFS) · 151. Bog'langan komponentlar soni (connected components) · 152. Siklni aniqlash (yo'naltirilmagan graf, DFS) · 153. Topologik saralash (Kahn algoritmi, DAG)
14-bo'lim — Dinamik dasturlash (DP): 154. Fibonachchi — memoizatsiya (top-down) · 155. Fibonachchi — tabulatsiya (bottom-up) · 156. Zinapoyaga chiqish (climbing stairs) · 157. Tanga maydalash — minimal tangalar (coin change) · 158. Tanga maydalash — usullar soni (coin change ways) · 159. 0/1 Knapsack (ryukzak) · 160. Eng uzun umumiy qism-ketma-ketlik (LCS) · 161. Eng uzun o'suvchi qism-ketma-ketlik (LIS) · 162. Tahrirlash masofasi (edit distance / Levenshtein) · 163. Maksimal qism-massiv yig'indisi (Kadane) · 164. House robber (qo'shni bo'lmagan maksimal yig'indi) · 165. To'r bo'yicha noyob yo'llar (unique paths) · 166. Dijkstra — vaznli eng qisqa yo'l (bonus)
15-bo'lim — Two pointers / Sliding window: 167. Two sum (saralangan massiv) · 168. Massivni joyida teskari ag'darish · 169. Valid palindrome (alfanumerik) · 170. Saralangan massivdan takrorlarni olib tashlash (in-place) · 171. Container with most water · 172. 3Sum (yig'indisi nolga teng uchliklar) · 173. Sliding window (sobit): k uzunlikdagi maksimal yig'indi · 174. Sliding window (o'zgaruvchan): takrorsiz eng uzun qism-satr · 175. Sliding window (o'zgaruvchan): minimal oyna, yig'indi ≥ target · 176. Sliding window + chastota: barcha anagrammalar indekslari
16-bo'lim — Greedy (ochko'z algoritmlar): 177. Tanga maydalash — greedy (kanonik tizim) · 178. Activity selection (intervallarni rejalashtirish) · 179. Fractional knapsack (kasrli ryukzak) · 180. Jump game (oxiriga yetib bo'ladimi) · 181. Merge intervals (intervallarni birlashtirish) · 182. Gas station (aylana bo'ylab boshlanish nuqtasi)
17-bo'lim — Bit operatsiyalari: 183. Juft/toq — bit bilan · 184. k-bitni olish (get bit) · 185. k-bitni o'rnatish (set bit → 1) · 186. k-bitni tozalash (clear bit → 0) · 187. k-bitni almashtirish (toggle bit) · 188. 2 ning darajasimi (power of two) · 189. O'rnatilgan bitlar soni (Brian Kernighan) · 190. Eng past o'rnatilgan bitni ajratish (n & −n) · 191. XOR bilan swap (temp'siz) · 192. Yagona sonni topish (single number) · 193. Bitlarni teskari ag'darish (32-bit)
18-bo'lim — Sana / vaqt: 194. Joriy vaqt va Unix timestamp · 195. Sanani formatlash (YYYY-MM-DD HH:MM:SS) · 196. Satrdan sanani parse qilish · 197. Ikki sana orasidagi kunlar farqi · 198. Sanaga kun qo'shish · 199. Hafta kuni (nomi) · 200. Oydagi kunlar soni · 201. Yosh hisoblash (tug'ilgan sanadan)
19-bo'lim — Validatsiya (email, telefon, parol): 202. Email validatsiya · 203. Parol kuchi (kriteriylar) · 204. URL validatsiya · 205. Username validatsiya · 206. Telefon validatsiya · 207. Luhn algoritmi (kredit karta checksum) · 208. IPv4 validatsiya
20-bo'lim — Amaliy masalalar (parsing, formatting): 209. Minglik ajratuvchi bilan formatlash · 210. Slugify (matn → URL slug) · 211. Query string'ni parse qilish · 212. Baytlarni o'qishli formatga (human-readable) · 213. Integer → Roman raqam · 214. Title case (har so'z bosh harfi katta) · 215. Matnni qisqartirish (truncate + "…") · 216. Tasodifiy parol generatsiya
21-bo'lim — Backtracking: 217. N-Queens — yechimlar soni (N-Queens count) · 218. N-Queens — bitta yechim (N-Queens one solution) · 219. Sudoku yechuvchi (Sudoku solver) · 220. Sudoku validatsiya (valid Sudoku) · 221. Qavslar generatsiyasi (generate parentheses) · 222. Barcha kichik to'plamlar (subsets) · 223. Kichik to'plamlar takror bilan (subsets II) · 224. Permutatsiyalar (permutations) · 225. Permutatsiyalar takror bilan (permutations II) · 226. Kombinatsiyalar — nCk (combinations) · 227. Combination Sum · 228. Combination Sum II · 229. Combination Sum III · 230. Telefon raqami harf kombinatsiyalari (letter combinations) · 231. Palindromga bo'lish (palindrome partitioning) · 232. So'z qidirish gridda (word search) · 233. Sichqon labirintda (rat in a maze) · 234. Ot yurishi (knight's tour) · 235. Graf bo'yash — m ranglar (m-coloring) · 236. Hamilton yo'li (Hamiltonian path) · 237. IP manzillarni tiklash (restore IP addresses) · 238. Gray kod (Gray code) · 239. Chiroyli joylashuv (beautiful arrangement) · 240. k teng yig'indili qismlarga bo'lish (partition to k equal sum subsets) · 241. Gugurt cho'plaridan kvadrat (matchsticks to square) · 242. Manba-maqsad barcha yo'llar (all paths source to target) · 243. Binar soat (binary watch) · 244. Harf registri permutatsiyasi (letter case permutation) · 245. Kombinatsion qulf (combination lock — barcha kodlar) · 246. Additsiya operatorlarini joylash (add operators) · 247. So'zlar buzilishi (word break II) · 248. N juft qavs — yopilish soni (count valid parentheses) · 249. Sehrli kvadrat (magic square) · 250. Target Sum (DFS bilan) · 251. Tetromino joylash (place a tetromino) · 252. Ifoda operatorlari — qiymatlar to'plami (expression operators values) · 253. Teng yig'indili ikkiga bo'lish (partition equal subset — backtracking) · 254. O'suvchi qism ketma-ketliklar (increasing subsequences) · 255. Qisqartmalar generatsiyasi (generate abbreviations) · 256. Kamayuvchi ketma-ket qiymatlarga bo'lish (split into descending consecutive values)
22-bo'lim — Trie va string algoritmlari: 257. Trie — insert / search / startsWith (prefix tree) · 258. Trie'dan so'z o'chirish (delete) · 259. So'z lug'ati — . wildcard qidiruv (WordDictionary) · 260. Avtoto'ldirish takliflari (autocomplete) · 261. Eng uzun umumiy prefiks — Trie bilan (longest common prefix) · 262. So'zlarni ildizga almashtirish (replace words / root) · 263. KMP pattern qidirish (Knuth-Morris-Pratt) · 264. LPS (failure) massivini hisoblash (prefix function) · 265. Rabin-Karp (rolling hash) · 266. Z-algoritm (Z-function) · 267. Eng uzun palindrom qism-satr — markazdan kengaytirish (longest palindromic substring) · 268. Manacher algoritmi (eng uzun palindrom O(n)) · 269. Noyob (distinct) qism-satrlar soni · 270. Eng uzun takrorlanuvchi qism-satr (longest repeated substring) · 271. Polinomial string hashing (prefix hash) · 272. Boyer-Moore — soddalashtirilgan bad-char qoidasi · 273. Suffix massivi — oddiy qurish (suffix array) · 274. Eng uzun umumiy qism-satr — DP (longest common substring) · 275. Repeated string match · 276. Eng qisqa palindrom — KMP (shortest palindrome) · 277. Anagrammalar guruhi (group anagrams) · 278. Isomorphic strings · 279. Word pattern · 280. Minimal oyna qism-satr (minimum window substring) · 281. String ko'paytirish (multiply strings) · 282. atoi (string -> int) · 283. Integer to english words · 284. Count and say · 285. Decode ways · 286. Basic calculator (+, -, qavslar) · 287. Valid number · 288. Text justification · 289. Zigzag conversion · 290. Reverse words in a string · 291. Suffix massivi bilan eng uzun takrorlanuvchi qism-satr (LCP)
23-bo'lim — Ilg'or graflar: 292. Union-Find / DSU (rank + path compression) · 293. Provinsiyalar soni (number of provinces) · 294. Ortiqcha qirra (redundant connection) · 295. Akkauntlarni birlashtirish (accounts merge) · 296. Bellman-Ford (eng qisqa yo'l, manfiy vaznlar) · 297. Manfiy sikl aniqlash (negative cycle detection) · 298. Floyd-Warshall (barcha juftliklar eng qisqa yo'l) · 299. Dijkstra (yo'lni qayta tiklash bilan) · 300. Kruskal MST (minimal qoplovchi daraxt) · 301. Prim MST (minimal qoplovchi daraxt) · 302. Tarmoq kechikishi (network delay time) · 303. K to'xtash bilan eng arzon parvoz (cheapest flights within K stops) · 304. Tarjan SCC (kuchli bog'liq komponentalar) · 305. Kosaraju SCC (ikki o'tishli) · 306. Kesim tugunlari (articulation points) · 307. Ko'priklar (bridges) · 308. Ikki bo'lakli graf tekshirish — BFS (bipartite) · 309. Ikki bo'lakli graf — DFS rang berish (bipartite) · 310. Kurs jadvali — sikl bormi (course schedule) · 311. Kurs jadvali II — topologik tartib (course schedule II) · 312. Begona lug'at (alien dictionary) · 313. So'zlar zinapoyasi — BFS (word ladder) · 314. So'zlar zinapoyasi II — barcha eng qisqa yo'llar (word ladder II) · 315. Minimal balandlikdagi daraxtlar (min height trees) · 316. Grafni klonlash (clone graph) · 317. Bo'lishni hisoblash (evaluate division) · 318. Ikkilik matritsada eng qisqa yo'l — BFS (shortest path in binary matrix) · 319. 01 matritsa — ko'p manbali BFS (01 matrix) · 320. Chirigan apelsinlar (rotting oranges) · 321. Devorlar va darvozalar (walls and gates) · 322. Tinch va Atlantika okeanlari (pacific atlantic water flow) · 323. O'rab olingan hududlar (surrounded regions) · 324. Orollar soni II — DSU (number of islands II) · 325. Eng katta orol yaratish (making a large island) · 326. Ko'tarilayotgan suvda suzish (swim in rising water) · 327. Minimal kuch sarflanadigan yo'l (path with minimum effort) · 328. Pirovard xavfsiz holatlar (find eventual safe states) · 329. Barcha tugunlarga yetish uchun minimal tugunlar (minimum vertices to reach all nodes) · 330. Marshrutni qayta tiklash — Euler yo'li (reconstruct itinerary) · 331. Graf bog'liqmi (is graph connected) · 332. Kuchli bog'liq komponentalar sonini hisoblash — kondensatsiya (count SCC) · 333. Graf to'g'ri daraxtmi (graph valid tree) · 334. Tenglik tenglamalarining bajariluvchanligi — DSU (satisfiability of equality equations) · 335. Zararli dasturning tarqalishini kamaytirish (minimize malware spread) · 336. Muhim bog'lanishlar — ko'priklar (critical connections)
24-bo'lim — Segment tree, Fenwick tree va range so'rovlar: 337. Prefiks yig'indi (prefix sum) · 338. 2D prefiks yig'indi · 339. Range Sum Query — Immutable · 340. Difference array (range update) · 341. Range Sum Query — Mutable (BIT) · 342. Fenwick (BIT) tree klass · 343. BIT bilan range update + point query · 344. Segment tree (build / query / update — yig'indi) · 345. Segment tree (min) · 346. Segment tree (max) · 347. Lazy propagation (range update + range query) · 348. Range Minimum Query (RMQ) · 349. Sparse table (RMQ, statik) · 350. Inversiyalar soni (BIT) · 351. Inversiyalar soni (merge sort) · 352. Count of Smaller Numbers After Self · 353. Kth smallest (BIT bilan frequency) · 354. Range GCD query · 355. Range XOR query · 356. 2D BIT (range update / point query) · 357. My Calendar I · 358. My Calendar II · 359. Range Module · 360. Count Range Sum · 361. Longest Increasing Subsequence (BIT bilan) · 362. Maximum Sum of 3 Non-Overlapping Subarrays · 363. Number of Longest Increasing Subsequence · 364. Range Frequency Query · 365. Segment tree (assignment + sum) · 366. Persistent segment tree (oddiy g'oya)
25-bo'lim — Heap va Priority Queue: 367. MinHeap klass (push / pop / peek) · 368. MaxHeap klass · 369. Massivni heapga aylantirish (heapify) · 370. K-eng katta element (kth largest) · 371. K-eng kichik element (kth smallest) · 372. Top K tez-tez uchraydigan elementlar (top K frequent) · 373. Top K so'zlar (chastota + alifbo tartibi) · 374. K ta saralangan listni birlashtirish (merge k sorted lists) · 375. K ta saralangan massivni birlashtirish (merge k sorted arrays) · 376. Oqimdan median (two heaps) · 377. Sliding window median · 378. Belgilarni chastota bo'yicha saralash (sort characters by frequency) · 379. Task scheduler (jadval rejalashtirish) · 380. Reorganize string · 381. Oxirgi tosh og'irligi (last stone weight) · 382. K eng yaqin nuqta (k closest points to origin) · 383. Ugly number II · 384. Super ugly number · 385. K ta eng yaqin son (find K closest elements) · 386. Smallest range covering K lists · 387. IPO (maximize capital) · 388. Furthest building you can reach · 389. Single-threaded CPU · 390. Minimum cost to connect sticks · 391. Kth largest in a stream (klass) · 392. Connect ropes — minimal narx · 393. Meeting rooms II (min heap) · 394. Car pooling · 395. Minimum number of refueling stops · 396. Hand of straights · 397. Take gifts (sovg'alarni olish) · 398. Maximum performance of a team · 399. Two heaps medianasi (klass) · 400. Trapping rain water II (heap) · 401. The skyline problem · 402. Process tasks using servers · 403. Seat reservation manager · 404. Maximum average pass ratio · 405. Minimum cost to hire K workers · 406. Total cost to hire K workers
26-bo'lim — Ilg'or dinamik dasturlash (DP): 407. Cheksiz ryukzak (unbounded knapsack) · 408. Tayoqni kesish (rod cutting) · 409. Matritsalar ko'paytmasi tartibi (matrix chain multiplication) · 410. Palindrom bo'laklash II — minimal kesishlar (palindrome partitioning II) · 411. So'zga bo'lish (word break) · 412. Eng uzun palindrom ketma-ketlik (longest palindromic subsequence) · 413. Palindrom qism-satrlar soni (palindromic substrings count) · 414. Turli ketma-ketliklar soni (distinct subsequences) · 415. Muntazam ifoda moslashtirish (regular expression matching) · 416. Wildcard moslashtirish (wildcard matching) · 417. Aralashtirilgan satr (interleaving string) · 418. Grid bo'ylab minimal yo'l (minimum path sum) · 419. Uchburchakda minimal yo'l (triangle minimum path) · 420. Eng katta kvadrat (maximal square) · 421. Eng katta to'rtburchak (maximal rectangle) · 422. Zindon o'yini (dungeon game) · 423. Aksiya — sovish davri bilan (stock with cooldown) · 424. Aksiya — tranzaksiya haqi bilan (stock with transaction fee) · 425. Aksiya — ko'pi bilan k tranzaksiya (stock at most k transactions) · 426. Uylarni bo'yash (paint house) · 427. Panjarani bo'yash (paint fence) · 428. Xabarni dekodlash II (decode ways II) · 429. Eng uzun arifmetik ketma-ketlik (longest arithmetic subsequence) · 430. Eng uzun so'z zanjiri (longest string chain) · 431. Birlar va nollar (ones and zeroes) · 432. Kombinatsiyalar yig'indisi IV (combination sum IV) · 433. Mukammal kvadratlar (perfect squares) · 434. Sonni bo'lish (integer break) · 435. Maqsadli yig'indili soqqa tashlashlar (dice rolls with target sum) · 436. Otning ehtimoli shaxmat taxtasida (knight probability on chessboard) · 437. Chegaradan chiqish yo'llari (out of boundary paths) · 438. Yagona yo'llar II — to'siqlar bilan (unique paths II) · 439. Minimal tushuvchi yo'l yig'indisi (minimum falling path sum) · 440. Unli tovushli satrlar soni (count vowels permutation) · 441. Domino va tromino qoplash (domino and tromino tiling) · 442. Tosh o'yini (stone game) · 443. G'olibni bashorat qilish (predict the winner) · 444. Sharlarni yorish (burst balloons) · 445. Tuxum tashlash (super egg drop) · 446. Qurbaqa sakrashi (frog jump) · 447. Sakrash o'yini II — minimal sakrashlar (jump game II) · 448. Rus matryoshka konvertlari (russian doll envelopes) · 449. Juftliklar zanjirining maksimal uzunligi (maximum length of pair chain) · 450. Bog'ni sug'orish uchun minimal jo'mraklar (minimum taps to water garden) · 451. Foydali rejalar (profitable schemes) · 452. Maksimal yig'indi uchun massivni bo'lish (partition array for maximum sum) · 453. Javon tokchalarini to'ldirish (filling bookcase shelves) · 454. Barg qiymatlaridan minimal narxli daraxt (minimum cost tree from leaf values) · 455. Eng uzun umumiy qism-satr (longest common substring) · 456. Kvadrat qism-matritsalar soni (count square submatrices)
27-bo'lim — Matematika va sonlar nazariyasi: 457. Tez daraja — modular exponentiation · 458. Modular invers — Fermat kichik teoremasi · 459. Kengaytirilgan Evklid (extended GCD) · 460. Modular invers — kengaytirilgan Evklid orqali · 461. Eratosfen elagi (sieve of Eratosthenes) · 462. Segmentli elak (segmented sieve) · 463. Eng kichik tub bo'luvchi elagi (smallest prime factor) · 464. Euler funksiyasi φ(n) · 465. Euler funksiyasi — elak bilan (1..n hammasi) · 466. nCr — Paskal uchburchagi · 467. nCr mod p — faktorial va invers · 468. Katalan sonlari · 469. Fibonacci — matritsa darajasi orqali · 470. Fibonacci — fast doubling · 471. Xitoy qoldiqlar teoremasi (CRT) · 472. Butun kvadrat ildiz (Nyuton usuli) · 473. n-darajali butun ildiz · 474. Ixtiyoriy asosga o'tkazish (base conversion) · 475. Rim raqamidan butunga (roman to integer) · 476. Excel ustun raqami ↔ harf · 477. Baxtli son (happy number) · 478. Uch yoki to'rt darajasimi (power of three / four) · 479. Faktorialdagi nollar soni (trailing zeroes) · 480. Faktorialdagi raqamlar soni · 481. Bo'luvchilar yig'indisi (sum of divisors) · 482. Bo'luvchilar soni (count of divisors) · 483. Kaprekar soni (Kaprekar number) · 484. Avtomorf son (automorphic number) · 485. Harshad (Niven) soni · 486. Collatz qadamlari · 487. Butun sonni teskari (reverse integer, overflow xavfsiz) · 488. Katta sonlarni qo'shish (string sifatida) · 489. Katta sonlarni ko'paytirish (string sifatida) · 490. Satrlarning GCD si (greatest common divisor of strings) · 491. Kasrni davriy o'nlik kasrga (fraction to recurring decimal) · 492. Josephus muammosi · 493. Nim o'yini (Nim game) · 494. Lampochkalar (bulb switcher) · 495. Suv va idish muammosi (water and jug) · 496. pow(x, n) — manfiy darajali · 497. Ko'paytma massivi (o'zidan tashqari, bo'linishsiz) · 498. Maksimal ko'paytma uchligi (maximum product of three) · 499. Ikkilik qo'shish (add binary strings) · 500. Ikki sonni qo'shish — bitlar bilan (sum without +) · 501. Ikki sonni bo'lish — bo'linishsiz (divide two integers) · 502. Mukammal son (perfect number) · 503. Xunuk son tekshiruvi (ugly number) · 504. Super daraja (super pow) · 505. Tublar sonini sanash (count primes, elak bilan) · 506. Tub son tekshiruvi — Miller–Rabin (deterministik 64-bit)
28-bo'lim — Matritsa masalalari: 507. Matritsani 90° aylantirish — joyida (rotate image) · 508. Matritsani 180° aylantirish · 509. Transpozitsiya (transpose) · 510. Spiral tartibda o'qish (spiral order) · 511. Spiral matritsa generatsiya (spiral matrix II) · 512. Nol qatorlar va ustunlar (set matrix zeroes) · 513. Saralangan 2D matritsada qidiruv (search a 2D matrix) · 514. Saralangan 2D matritsa II — zinapoya qidiruv (search a 2D matrix II) · 515. Diagonal o'tish (diagonal traverse) · 516. Matritsa diagonal yig'indisi (matrix diagonal sum) · 517. Eng ko'p 1 li qator (row with maximum ones) · 518. Saralangan matritsada kth eng kichik element (kth smallest in sorted matrix) · 519. Qator-saralangan matritsa median (median in row-sorted matrix) · 520. Maksimal yig'indili to'rtburchak (max sum rectangle — Kadane 2D) · 521. Flood fill (rang to'ldirish) · 522. Game of life (hayot o'yini) · 523. Matritsalar ko'paytmasi (matrix multiplication) · 524. Birlik matritsa (identity matrix) · 525. Matritsa darajasi (matrix power) · 526. Chegara o'tish (boundary traversal) · 527. Reshape matrix (matritsa shaklini o'zgartirish) · 528. Toeplitz matritsa tekshirish · 529. Sehrli kvadrat tekshirish (magic square) · 530. Saralangan matritsada manfiylar soni (count negatives) · 531. Matritsadagi lucky raqamlar (lucky numbers) · 532. Flip and invert image · 533. Range sum query 2D — immutable (2D prefix sum) · 534. Barcha birli kvadrat submatritsalar soni (count square submatrices with all ones) · 535. Maksimal kvadrat tomoni (maximal square — DP) · 536. 2D gridni siljitish (shift 2D grid) · 537. Diagonallarni almashtirish (matrix transpose via diagonals) · 538. Snake (ilon) tartibi · 539. Eng yaqin 0 gacha masofa (01 matrix — BFS) · 540. Island perimeter (orol perimetri) · 541. Max area of island (eng katta orol maydoni) · 542. Surrounded regions (o'ralgan hududlar — X/O) · 543. Pacific Atlantic water flow · 544. Count negative numbers (manfiy raqamlar — to'liq sanash) · 545. Transpose + reverse trick (90° aylantirishni tushuntirish) · 546. Rotate image — soat va teskari soat (clockwise / counter-clockwise)
29-bo'lim — Ilg'or stringlar: 547. Satrni siqish — RLE (run-length encoding) · 548. RLE dekodlash (run-length decode) · 549. Siqilgan satrni ochish — k[encoded] (decode string) · 550. Yulduzli qavslar to'g'riligi (valid parenthesis string with *) · 551. Yaroqsiz qavslarni o'chirish (remove invalid parentheses) · 552. Eng uzun to'g'ri qavslar ketma-ketligi (longest valid parentheses) · 553. Qavslarni to'g'rilash uchun minimal o'chirish (minimum remove to make valid) · 554. Backspace bilan satr taqqoslash (backspace string compare) · 555. Litsenziya kalitini formatlash (license key formatting) · 556. Log fayllarni qayta tartiblash (reorder data in log files) · 557. Maxsus tartibda satr (custom sort string) · 558. Eng qisqa to'ldiruvchi so'z (shortest completing word) · 559. Tovlamachi xati (ransom note) · 560. Takrorlanuvchi qism-satr namunasi (repeated substring pattern) · 561. Ikkilik qism-satrlarni sanash (count binary substrings) · 562. Eng uzun baxtli satr (longest happy string) · 563. Takror harflarni o'chirish — eng kichik leksikografik (remove duplicate letters) · 564. Bo'laklarga ajratish (partition labels) · 565. Bitta tahrir masofasi (one edit distance) · 566. Palindromni bittasini o'chirib tekshirish (valid palindrome II) · 567. Palindromni buzish (break a palindrome) · 568. Namunani topish va almashtirish (find and replace pattern) · 569. Siljitilgan satrlarni guruhlash (group shifted strings) · 570. Satrlarni kodlash/dekodlash — uzunlik prefiksi (encode and decode strings) · 571. Noyob email manzillar (unique email addresses) · 572. IP manzilni zararsizlantirish (defanging an IP address) · 573. Satrni aylantirish (rotate string) · 574. Takrorlanuvchi DNA ketma-ketliklari (repeated DNA sequences) · 575. Bitta almashtirish bilan tenglashtirish (buddy strings) · 576. Qavslarning maksimal ichma-ichlik chuqurligi (maximum nesting depth) · 577. Satrni balansli bo'laklarga ajratish (split balanced strings) · 578. Ko'pi bilan K xil belgili eng uzun qism-satr (longest substring with at most K distinct) · 579. Ko'pi bilan 2 xil belgili eng uzun qism-satr (at most two distinct) · 580. Minimal qoplovchi oyna (minimum window substring) · 581. 3 ta bir xil ketma-ket belgisiz satr (string without 3 identical consecutive) · 582. DI satr mosligi (DI string match) · 583. Qavslar bahosi (score of parentheses) · 584. Barcha qo'shni takrorlarni o'chirish (remove all adjacent duplicates) · 585. K ta qo'shni takrorni o'chirish (remove adjacent duplicates II) · 586. Satrni "yaxshi" qilish (make string great)
30-bo'lim — Dizayn patternlar (OOP): 587. Singleton · 588. Factory Method · 589. Abstract Factory · 590. Builder · 591. Prototype · 592. Adapter · 593. Bridge · 594. Composite · 595. Decorator · 596. Facade · 597. Flyweight · 598. Proxy · 599. Chain of Responsibility · 600. Command · 601. Iterator · 602. Mediator · 603. Memento · 604. Observer · 605. State · 606. Strategy · 607. Template Method · 608. Visitor · 609. Null Object · 610. Object Pool · 611. Dependency Injection · 612. Repository pattern · 613. Event Emitter (Pub/Sub) · 614. Lazy initialization · 615. Multiton · 616. Registry · 617. Fluent interface (method chaining) · 618. Specification pattern · 619. Service Locator · 620. Data Mapper · 621. Value Object
31-bo'lim — Real-world komponentlar: 622. LRU kesh (LRU cache) · 623. LFU kesh (LFU cache) · 624. Rate limiter — token bucket · 625. Rate limiter — sliding window log · 626. Rate limiter — fixed window · 627. Eksponensial backoff bilan qayta urinish (retry) · 628. Circuit breaker · 629. Offset paginatsiya (offset pagination) · 630. Cursor paginatsiya (cursor pagination) · 631. TTL kalit-qiymat ombor (TTL key-value store) · 632. Event emitter (on/off/emit) · 633. Pub-sub broker (mavzular bo'yicha) · 634. Observer (unsubscribe bilan) · 635. Async navbat (concurrency limit) · 636. Ustuvor vazifa navbati (priority task queue) · 637. Obyekt pool (object pool) · 638. Connection pool (oddiy) · 639. Bloom filtri (bloom filter) · 640. Konsistent xeshlash (consistent hashing, hash ring) · 641. Snowflake ID generator · 642. UUID v4 generator · 643. Base62 kodlash/dekodlash (base62 encode/decode) · 644. URL qisqartiruvchi (URL shortener) · 645. Avtoto'ldirish xizmati (autocomplete, trie asosida) · 646. Write-through kesh (write-through cache) · 647. Deduplikatsiya (oxirgi N) · 648. Idempotentlik kaliti ombori (idempotency key store) · 649. Feature flag baholovchi (feature flag evaluator) · 650. A/B test guruhlash (A/B bucketing, hash bilan) · 651. Reyting jadvali (leaderboard, saralangan) · 652. Sessiya ombori (session store, TTL) · 653. JWT kodlash/dekodlash (JWT, HMAC-SHA256) · 654. CSV parser · 655. INI/config parser · 656. Oddiy shablon dvigateli (template engine) · 657. Xotiradagi navbat (in-memory queue, FIFO) · 658. Siljuvchi oyna hisoblagichi (sliding window counter) · 659. Debounce (klass/closure) · 660. Throttle (closure) · 661. Memoize (TTL bilan) · 662. Oddiy holatlar mashinasi (state machine) · 663. Command bus · 664. Middleware pipeline (chain) · 665. DI konteyner (dependency injection, oddiy) · 666. Middleware pipeline bilan oddiy router (mini-app)
32-bo'lim — Konkurensiya va async: 667. Promise.all (qo'lda implement) · 668. Promise.race · 669. Promise.allSettled · 670. Promise.any · 671. Ketma-ket vs parallel bajarish · 672. async map (concurrency limit bilan) · 673. async pool · 674. sleep/delay (Promise) · 675. timeout wrapper (Promise.race) · 676. retry (backoff bilan) · 677. debounce (async) · 678. throttle (async) · 679. async queue (navbat) · 680. semaphore · 681. mutex/lock · 682. producer-consumer · 683. async generator (oqim) · 684. chunked async processing · 685. cancellation (AbortController/flag) · 686. promisify (callback -> Promise) · 687. async reduce (ketma-ket) · 688. parallel with limit · 689. batch processor · 690. rate-limited async ishlov · 691. microtask vs macrotask (demo) · 692. async memoize (in-flight dedup) · 693. fan-out/fan-in · 694. waitGroup (barcha tugaguncha) · 695. debounce + leading/trailing · 696. deadlock'dan qochish (lock tartibi)
33-bo'lim — Funksional dasturlash: 697. compose (funksiyalarni o'ngdan birlashtirish) · 698. pipe (funksiyalarni chapdan birlashtirish) · 699. curry (argumentlarni bo'lib uzatish) · 700. partial application (qisman qo'llash) · 701. memoize (natijalarni keshlash) · 702. once (faqat bir marta ishlaydigan funksiya) · 703. map (qo'lda) · 704. filter (qo'lda) · 705. reduce (qo'lda) · 706. flatMap (map + bitta darajaga yassilash) · 707. zip (ikki ro'yxatni juftlash) · 708. unzip (juftliklarni ikki ro'yxatga ajratish) · 709. groupBy (kalit bo'yicha guruhlash) · 710. partition (shartga ko'ra ikkiga bo'lish) · 711. chunk (bo'laklarga bo'lish) · 712. deep flatten (chuqur yassilash) · 713. pluck (xossani ajratish) · 714. path getter (yo'l bo'yicha qiymat olish) · 715. negate / complement (predikatni teskarilash) · 716. tap (oraliq nazorat) · 717. identity / constant · 718. take / drop (boshidan olish / tashlash) · 719. range (sonlar ketma-ketligi) · 720. repeat (qiymatni takrorlash) · 721. uniqBy (kalit bo'yicha noyoblash) · 722. sortBy (kalit bo'yicha saralash) · 723. maxBy / minBy (kalit bo'yicha eng katta/kichik) · 724. fold / scan (yig'ish va oraliq natijalar) · 725. lazy sequence (generator orqali dangasa ketma-ketlik) · 726. frequency / countBy (chastotani sanash)
34-bo'lim — Qo'shimcha ma'lumotlar tuzilmalari: 727. Ikki tomonlama bog'langan ro'yxat (doubly linked list) · 728. Halqasimon ikki tomonlama bog'langan ro'yxat (circular doubly linked list) · 729. Deque noldan (double-ended queue) · 730. Halqasimon bufer (ring buffer / circular buffer) · 731. Dinamik massiv (dynamic array — resizing) · 732. Hash map — separate chaining · 733. Hash map — open addressing (linear probing) · 734. Hash set noldan (hash set) · 735. AVL daraxt — rotatsiyalar bilan (self-balancing BST) · 736. Treap (randomized BST) · 737. Monoton stek (monotonic stack) · 738. Monoton navbat (monotonic queue) · 739. Keyingi katta element (next greater element) · 740. Kunlik haroratlar (daily temperatures) · 741. Gistogrammadagi eng katta to'rtburchak (largest rectangle in histogram) · 742. Siljuvchi oyna maksimumi (sliding window maximum) · 743. Max stack (push/pop/top/peekMax/popMax) · 744. LinkedHashMap (insertion order) · 745. N-ar daraxtni aylanib chiqish (n-ary tree traversal) · 746. N-ar daraxt sathlar bo'yicha (n-ary tree level order) · 747. d-ar uyum (d-ary heap) · 748. Interval to'plami — insertda birlashtirish (interval set / merge on insert) · 749. Design HashMap (LC 706) · 750. Design HashSet (LC 705) · 751. Design Linked List (LC 707) · 752. My Circular Deque (LC 641) · 753. Tekislovchi ichma-ich ro'yxat iteratori (flatten nested list iterator, LC 341) · 754. Peeking Iterator (LC 284) · 755. Brauzer tarixi dizayni (design browser history, LC 1472) · 756. Insert Delete GetRandom O(1) (LC 380) · 757. Insert Delete GetRandom — dublikatlar bilan (LC 381) · 758. Randomized set (qisqa versiya) · 759. Vaqtga asoslangan kalit-qiymat saqlash (time-based key-value store, LC 981) · 760. Snapshot massivi (snapshot array, LC 1146) · 761. Twitter dizayni (design Twitter, LC 355) · 762. All O(1) Data Structure (LFU asosi, LC 432) · 763. Telefon kataloglari dizayni (design phone directory, LC 379) · 764. Metro tizimi dizayni (design underground system, LC 1396) · 765. Avtoturargoh tizimi dizayni (design parking system, LC 1603) · 766. Hit hisoblagich dizayni (design hit counter, LC 362)
35-bo'lim — Ilg'or saralash va qidiruv: 767. Radix sort (LSD, manfiy bo'lmagan butun sonlar) · 768. Bucket sort (taqsimot bo'yicha saralash) · 769. Pigeonhole sort · 770. Cocktail shaker sort (ikki tomonlama bubble) · 771. Comb sort · 772. Gnome sort · 773. Cycle sort · 774. Pancake sort · 775. Quickselect — k-chi eng kichik element · 776. Median of medians (kafolatlangan O(n) tanlash) · 777. Dutch national flag (ranglarni saralash) · 778. Wiggle sort · 779. Custom comparator sort (ko'p maydon bo'yicha) · 780. Search insert position · 781. Find peak element · 782. Find minimum in rotated sorted array · 783. Search in rotated sorted array II (dublikatlar bilan) · 784. Nth root (javob ustida binary search) · 785. Koko eating bananas (javob ustida binary search) · 786. Capacity to ship packages in D days (BS) · 787. Split array largest sum (BS) · 788. Minimum days to make m bouquets (BS) · 789. Kth smallest pair distance (BS) · 790. Median of two sorted arrays (BS) · 791. Aggressive cows / minimaks masofa (BS) · 792. Allocate minimum pages (BS) · 793. Peak index in mountain array · 794. Single element in a sorted array (BS) · 795. Find the duplicate number (Floyd tsikl usuli) · 796. H-index (saralash)
36-bo'lim — Geometriya: 797. Ikki nuqta orasidagi masofa (Euclidean distance) · 798. Manhattan masofa (taxi geometriyasi) · 799. Nuqta to'rtburchak ichidami · 800. Nuqta aylana ichidami · 801. Nuqta ko'pburchak ichidami (ray casting) · 802. Ko'pburchak yuzasi (shoelace formula) · 803. Uchburchak yuzasi (3 nuqta bo'yicha) · 804. Uch nuqta orientatsiyasi (cross product) · 805. Ikki kesma kesishadimi · 806. Ikki to'g'ri chiziq kesishish nuqtasi · 807. Eng yaqin juftlik (brute force) · 808. Eng yaqin juftlik (divide & conquer) · 809. Convex hull (Graham scan) · 810. Convex hull (Andrew monotone chain) · 811. Ko'pburchak perimetri · 812. Nuqta kesmada yotadimi · 813. Nuqtani aylantirish (origin atrofida) · 814. Nuqtani aks ettirish · 815. Ko'pburchak markazi (centroid) · 816. Ko'pburchak qavariqmi (convex) · 817. Ikki to'rtburchak kesishadimi · 818. Ikki to'rtburchak kesishma yuzasi · 819. To'rtburchaklar union yuzasi (inclusion-exclusion) · 820. Bir chiziqdagi maksimal nuqtalar · 821. Nuqtalardan minimal yuzali to'rtburchak (axis-aligned)
37-bo'lim — Greedy (qo'shimcha): 822. Bolalarga pechene ulashish (assign cookies) · 823. Limonad pulini qaytarish (lemonade change) · 824. Aksiyani sotib olish/sotish II (best time to buy and sell stock II) · 825. Bolalarga konfet ulashish (candy) · 826. Kesishmaydigan intervallar — minimal o'chirish (non-overlapping intervals) · 827. Sharlarni yorish uchun minimal o'qlar (minimum arrows to burst balloons) · 828. Barcha uchrashuvlarga ulgurish mumkinmi (can attend meetings) · 829. Bo'y bo'yicha navbatni qayta tiklash (queue reconstruction by height) · 830. Odamlarni qutqarish uchun qayiqlar (boats to save people) · 831. Ikki shaharga jo'natish (two city scheduling) · 832. Tebranuvchi ketma-ketlik (wiggle subsequence) · 833. Monoton o'suvchi raqamlar (monotone increasing digits) · 834. K ta raqamni o'chirib eng kichik son (remove k digits) · 835. Yuk mashinasidagi maksimal qutilar (maximum units on a truck) · 836. Ustunlik aralashtirish (advantage shuffle) · 837. Chastotalarni noyob qilish uchun minimal o'chirish (minimum deletions to make frequencies unique) · 838. Qatnashilgan maksimal tadbirlar (maximum events attended) · 839. Eng katta son (largest number) · 840. Minimal platformalar (minimum platforms) · 841. Huffman kodlash (huffman coding) · 842. K ta inkordan keyin maksimal yig'indi (maximize sum after k negations) · 843. Satrni balanslash uchun minimal almashtirishlar (minimum swaps to make string balanced) · 844. Minimal o'suvchi ketma-ketliklarga ajratish (partition into minimum increasing subsequences) · 845. Chiplarni ko'chirishning minimal narxi (minimum cost to move chips) · 846. Matritsani ag'darishdan keyingi maksimal ball (score after flipping matrix)
38-bo'lim — Bit operatsiyalari (ilg'or): 847. Bitlarni sanash 0..n (counting bits, DP) · 848. Single number II (har biri 3 marta, biri 1 marta) · 849. Single number III (ikkita noyob son) · 850. Oraliqdagi sonlar bitli AND (bitwise AND of numbers range) · 851. Ikki sonning maksimal XOR'i (maximum XOR, Trie) · 852. Barcha kichik to'plamlar (subsets via bitmask) · 853. Hamming masofasi (Hamming distance) · 854. Umumiy Hamming masofasi (total Hamming distance) · 855. Sonning to'ldiruvchisi (number complement) · 856. UTF-8 tekshiruvi (UTF-8 validation) · 857. Toq va juft bitlarni almashtirish (swap odd and even bits) · 858. Bitlar navbatma-navbatligini tekshirish (alternating bits) · 859. Birlarning eng uzun ketma-ketligi (longest run of 1s) · 860. a OR b == c qilish uchun minimal flip (minimum flips) · 861. Qism-massiv XOR so'rovlari (XOR queries, prefix XOR) · 862. XOR'langan massivni tiklash (decode XORed array) · 863. XOR'langan o'rin almashtirishni tiklash (decode XORed permutation) · 864. Ikki sonni qo'shish (sum without +, bitwise) · 865. Ikki sonni bo'lish (divide two integers, bit shift) · 866. Bitmask DP — sayohatchi (TSP, eng qisqa Hamilton yo'li) · 867. Bitmask DP — taqsimlash masalasi (assignment problem) · 868. Gosper's hack (k-elementli kichik to'plamlarni sanash) · 869. Juft/toq sonli bitli sonlar (even/odd set bits) · 870. Gray kodi <-> ikkilik o'tkazish (gray code conversion)
39-bo'lim — Amaliy va kundalik masalalar: 871. Chuqur nusxa (deep clone) · 872. Chuqur tenglik (deep equal) · 873. Chuqur birlashtirish (deep merge) · 874. Obyektni tekislash (flatten — dot kalitlar) · 875. Dot kalitlardan obyekt qurish (unflatten) · 876. Yo'l bo'yicha olish (get by path) · 877. Yo'l bo'yicha o'rnatish (set by path) · 878. Kalitlarni tanlash (pick) · 879. Kalitlarni chiqarib tashlash (omit) · 880. Obyekt kalitlarini camelCase qilish · 881. Obyekt kalitlarini snake_case qilish · 882. Obyektni teskari aylantirish (invert) · 883. JSON stringify (oddiy) · 884. JSON parse (oddiy) · 885. Query string qurish (build) · 886. Satrni niqoblash (mask — karta raqami) · 887. Satrni to'ldirish (pad left/right) · 888. Word wrap (matnni o'rash) · 889. HTML escape · 890. HTML unescape · 891. Regex escape · 892. HTML teglarni olib tashlash (strip tags) · 893. Pluralize (ko'plik) · 894. Ordinal (1st/2nd/3rd) · 895. Ismdan bosh harflar (initials) · 896. Sonni qisqartirish (1200 -> 1.2k) · 897. Qidiruv so'zini ajratib ko'rsatish (highlight) · 898. Sentence case · 899. Fayl nomini tozalash (sanitize filename) · 900. Parse boolean ("true"/"1"/"yes") · 901. Sana farqini "insoniy" ko'rsatish (date diff humanize) · 902. Nisbiy vaqt formati (relative time format) · 903. Davomiylikni parse qilish ("1h30m" -> sekund) · 904. Davomiylikni formatlash (sekund -> "1s 30d") · 905. Ikki sana orasidagi ish kunlari soni (business days) · 906. Ish kunlarini qo'shish (add business days) · 907. Dam olish kunimi (is weekend) · 908. ISO hafta raqami (ISO week number) · 909. Sananing choragi (quarter) · 910. Yildagi kunlar soni (days in year) · 911. HEX rangni RGB ga aylantirish (hex -> rgb) · 912. RGB rangni HEX ga aylantirish (rgb -> hex) · 913. RGB rangni HSL ga aylantirish (rgb -> hsl) · 914. HSL rangni RGB ga aylantirish (hsl -> rgb) · 915. Valyutani formatlash (1234.5 -> "$1,234.50") · 916. Valyutani parse qilish ("$1,234.50" -> 1234.5) · 917. Harorat konvertori (C / F / K) · 918. Uzunlik o'lchov konvertori (m / km / mile) · 919. Og'irlik konvertori (kg / lb / oz) · 920. Sonni tartib so'zga aylantirish (ordinal) · 921. Nisbatni soddalashtirish (simplify ratio, gcd bilan) · 922. Chegaralash (clamp) · 923. O'nlik kasrgacha yaxlitlash (round to decimals) · 924. Diapazonda tasodifiy butun son (random int) · 925. Og'irlikli tasodifiy tanlov (weighted random) · 926. OTP generatsiya (6 raqamli) · 927. Fayl hajmini formatlash (human-readable bytes) · 928. Fayl kengaytmasini ajratish (file extension) · 929. Kengaytmadan MIME turi (mime from extension) · 930. O'qish vaqtini baholash (reading time)
40-bo'lim — Klassik intervyu masalalari: 931. Takror bor-yo'qligi (contains duplicate) · 932. Takror bor-yo'qligi II (contains duplicate II) · 933. Eng katta ko'paytmali qism-massiv (maximum product subarray) · 934. Massivdagi barcha takrorlarni topish (find all duplicates) · 935. Yo'qolgan sonlarni topish (find all disappeared numbers) · 936. Birinchi yo'qolgan musbat son (first missing positive) · 937. Mos kelmaslik to'plami (set mismatch) · 938. Ko'pchilik elementi (majority element, Boyer-Moore) · 939. Ko'pchilik elementi II (majority element II, n/3) · 940. Nollarni ohirga surish (move zeroes) · 941. Birga oshirish (plus one) · 942. Paskal uchburchagi (Pascal's triangle) · 943. Paskal uchburchagi II (Pascal's triangle II) · 944. Eng katta tafovut (maximum gap) · 945. Oraliqlar xulosasi (summary ranges) · 946. Ikki massiv kesishmasi (intersection of two arrays) · 947. Ikki massiv kesishmasi II (intersection of two arrays II) · 948. Saralangan massivlarni birlashtirish (merge sorted array) · 949. To'liq kvadrat tekshiruvi (valid perfect square) · 950. Raqamlar yig'indisi (add digits, digital root) · 951. Palindrom bog'langan ro'yxat (palindrome linked list) · 952. Ikki ro'yxat kesishmasi (intersection of two linked lists) · 953. Ro'yxat elementlarini o'chirish (remove linked list elements) · 954. Toq-juft bog'langan ro'yxat (odd-even linked list) · 955. Ikki sonni qo'shish (add two numbers, linked list) · 956. Ro'yxatni qayta tartiblash (reorder list) · 957. Tasodifiy ko'rsatkichli ro'yxat nusxasi (copy list with random pointer) · 958. Ro'yxatni aylantirish (rotate list) · 959. Ro'yxatni bo'lish (partition list) · 960. Ro'yxatni saralash (sort list, merge sort) · 961. k-li guruhlarda teskarilash (reverse nodes in k-group) · 962. Juftlab almashtirish (swap nodes in pairs) · 963. Keyingi katta element II (next greater element II, aylanma) · 964. Yomg'ir suvini yig'ish (trapping rain water) · 965. O'zidan boshqa hammasining ko'paytmasi (product of array except self) · 966. Simmetrik daraxt (symmetric tree) · 967. Yo'l yig'indisi (path sum) · 968. Yo'l yig'indisi II — barcha yo'llar (path sum II) · 969. Ildizdan bargga sonlar yig'indisi (sum root to leaf numbers) · 970. Daraxtning o'ng tomondan ko'rinishi (binary tree right side view) · 971. Eng yaqin umumiy ajdod (lowest common ancestor — oddiy binary tree) · 972. Daraxt diametri (diameter of binary tree) · 973. Balanslangan daraxtmi (balanced binary tree) · 974. Minimal chuqurlik (minimum depth) · 975. Daraxtni bog'langan ro'yxatga yoyish (flatten binary tree to linked list) · 976. Keyingi o'ng ko'rsatkichlarni to'ldirish (populating next right pointers) · 977. Preorder va inorder'dan daraxt qurish (construct from preorder + inorder) · 978. Inorder va postorder'dan daraxt qurish (construct from inorder + postorder) · 979. Daraxtni serializatsiya va deserializatsiya qilish (serialize / deserialize) · 980. BST'dagi k-chi eng kichik element (kth smallest in BST) · 981. BST iterator (klass) · 982. BST'dan tugunni o'chirish (delete node in BST) · 983. Saralangan massivdan balanslangan BST (convert sorted array to BST) · 984. BST'ni tiklash (recover BST — ikki tugun almashgan) · 985. Daraxtdagi maksimal yo'l yig'indisi (binary tree maximum path sum) · 986. Zigzag sath tartibida aylanish (zigzag level order traversal) · 987. BST'dagi modani topish (find mode in BST) · 988. BST oraliq yig'indisi (range sum of BST) · 989. BST'ni kesish (trim a BST — low..high) · 990. Berilgan tugundan k masofadagi barcha tugunlar (all nodes distance k) · 991. Yaxshi tugunlarni sanash (count good nodes) · 992. Uy o'g'risi III (house robber III — daraxt DP) · 993. Boshqa daraxtning pastdaraxti (subtree of another tree) · 994. Ikki daraxtni birlashtirish (merge two binary trees) · 995. Sathlar o'rtacha qiymati (average of levels) · 996. Chap barglar yig'indisi (sum of left leaves) · 997. Eng pastki chap qiymat (find bottom left value) · 998. Daraxtning maksimal kengligi (maximum width of binary tree) · 999. Vertikal tartibda aylanish (vertical order traversal) · 1000. Daraxt yo'llari — satr ko'rinishida (binary tree paths)
✅ 1000 masala — yakunlandi¶
1000 ta masala · 40 bo'lim — oddiy "Hello World"dan dinamik dasturlash, ilg'or graflar, segment tree, dizayn patternlar va intervyu klassiklarigacha. Har biri JavaScript / PHP / Python'da (tilga xos mavzularda 1–2 tilda), murakkablik (Big-O) izohlari bilan.
- Yadro (1–216): eng ko'p uchraydigan asosiy masalalar — har biri 3 tilda, idiomatik.
- Kengaytma (217–1000): backtracking, Trie/string algoritmlari, ilg'or graflar (DSU, Bellman-Ford, MST, SCC), segment/Fenwick tree, heap/PQ, ilg'or DP, sonlar nazariyasi, matritsa, dizayn patternlar (OOP), real-world komponentlar (LRU, rate limiter, JWT...), konkurensiya/async, funksional dasturlash, geometriya, bit operatsiyalari va klassik intervyu masalalari.
Barcha kod bloklari sintaktik tekshirildi (
node/php/python) va ishlashi namunaviy kirishlar bilan tasdiqlandi.
Yana qo'shish yoki chuqurlashtirish kerak bo'lsa — ayting.