Salom! SamCoding platformasida algoritmlarni o‘rganishni boshlayotganlar uchun masalalarni mavzu va qiyinchilik darajasiga qarab tartiblab chiqdim. Maqsad — oson masalalardan boshlab, asta-sekin murakkabroq algoritm va g‘oyalarga o‘tish. Har bir bo‘limda masalalar Easy → Medium → Hard tartibida joylashtirilgan. O‘zingizga qulayidan boshlashingiz mumkin.
| Masala | Mavzu | Qiyinchiligi |
|---|---|---|
| D. Ikkilik qidiruv | Binary Search | Easy |
| F. Alkimyogar yordamchilari | Binary Search | Medium |
| G. Yuk tashish jadvali | Binary Search | Medium |
| C. Dam olish bekatlari | Binary Search | Medium |
| I. Shaxmat: ♞ Otning yurishi | Arrays (Implementation) | Easy |
| B. Maxfiy baza: lazer himoyasi | Arrays (Implementation) | Easy |
| B. Raqamli parol shifrlari | Arrays (Implementation) | Easy |
| A. Takroriy elementlar | Arrays (Implementation) | Easy |
| A. Do'kondagi chegirma | Arrays (Implementation) | Easy |
| G. Avtoturargoh | Arrays (Implementation) | Easy |
| E. Feruz Ustaning Munchoqlari | Sorting + Greedy | Easy |
| F. Kage Bunshin va dushman ninjalar | Sorting + Greedy | Medium |
| C. Kirito | Sorting + Greedy | Medium |
| F. Xavfsiz parol | Sorting + Greedy | Medium |
| F. Uch Hunar | Sorting + Greedy | Medium |
| E. Mandat | Sorting + Greedy | Medium |
| B. Kutilgan fragging | Sorting + Greedy | Hard |
| D. Eng uzun segment | Two Pointers / Sliding Window | Easy |
| F. Takrorlanmas belgilar | Two Pointers / Sliding Window | Medium |
| C. Energiya minorasi | Two Pointers / Sliding Window | Medium |
| C. Sehrli juftliklar | Prefix Sum / Array Processing | Easy |
| D. Kristallar va portal siri | Prefix Sum / Array Processing | Medium |
| H. Eng uzun segment #2 | Prefix Sum / Array Processing | Hard |
| E. Minimal enirgiya | Dynamic Programming | Medium |
| G. Chakra rezonansi | Dynamic Programming | Hard |
| C. Labirint | Graphs / BFS / Shortest Path | Easy |
| E. Devorbuzar | Graphs / BFS / Shortest Path | Medium |
| E. CS2: T-spawn'ni to'sish | Graphs / BFS / Shortest Path | Medium |
| D. Token o'yini | Graphs / BFS / Shortest Path | Hard |
| B. Chorsu Bozori Maydoni | Geometry | Easy |
| D. CS2: Tutun bilan to'sish | Geometry | Hard |
| H. O'rgimchak odam Erangelda | Geometry | Hard |
| A. Qadimiy soat | Math / Number Theory | Easy |
| A. Maxfiy bunker | Math / Number Theory | Easy |
| B. Goldbach juftligi | Math / Number Theory | Medium |
| G. Beshtosh o'yini | Game Theory | Easy |
| A. Halqa o'yini | Game Theory | Medium |
| H. Shaxmat | Simulation / Ad-hoc | Hard |
Qanday tartibda ishlash tavsiya etiladi?
- Easy — mavzuni tushunish va asosiy patternlarni o‘rganish uchun.
- Medium — o‘rgangan algoritmni kombinatsiya qilib ishlatish uchun.
- Hard — murakkab fikrlash, bir nechta g‘oya yoki advanced data structure talab qiladigan masalalar.
Tavsiya: avval Easy masalalarning ko‘p qismini mustaqil yechib chiqing. Keyin Medium'ga, undan so‘ng Hard'ga o‘ting.