Bu amphitheater da gladiator bir biri bilan yoki yertqich xayvonlar bilan olishib yeg’ilgan odamlarni entertain(zavqlantirgan?) qilgan. Xozirda amphitheaterni pastgi qismi yer ostida va yertqich xayvonlar chiqadigan eshiklarni yarminigina ko’rsa bo’ladi. Bu majmuaga o’sha davirlarda 1500 ga yaqin odam sig’gan ekan. Xozir juda ko’p qismi buzilib majmuani qisimlari Paris devollariga ishlatilib ketilgan ekan.
Arenani o’rtasida turib bir zumga ko’zlarimni yumib bu joyda bo’lgan xodisalarni tasavur qilib xozir nima o’zgardi deb oylab qoldim. Xozirda bu erda gladiatorlari emas Paris keksalari ikki guruxga bo’linib Boules o’ynashyotgan edi. Qiziq tarafi ular orasida osiyoliklar xam bor edi.

O’zingizni men kabi ko’zingizni yumib bir daqiqaga bo’lib o’tgan xodisalarni tasavur qilib ko’ring. 2000 yil o’tib nima o’zgardi deb o’ylab ko’ring.

Biz safarimizni bugun Paris da yakunlab 🛣️ Geneva tomon yo’l oldik. Stay tuned.

@khamidulla_inoyatov_microblog

Day 041

Kun masalalari:

🟢 637. Average of Levels in Binary Tree
🟡 1448. Count Good Nodes in Binary Tree

O’qish uchun material:

*nix dagi quyidagi komanda bilan man <command> orqali tanishing:

- netstat

DIY:

*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.

cd ~
netstat -at
netstat -au
netstat -l


Javoblar:

🟢 2236. Root Equals Sum of Children
🟡 701. Insert into a Binary Search Tree

#SDM

@khamidulla_inoyatov_microblog

Geneva, Switzerland🇨🇭

Day 042

Kun masalalari:

🟢 108. Convert Sorted Array to Binary Search Tree
🟡 814. Binary Tree Pruning

O’qish uchun material:

*nix dagi quyidagi komanda bilan man <command> orqali tanishing:

- df

DIY:

*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.

cd ~
df
df -h
df /dev


Javoblar:

🟢 637. Average of Levels in Binary Tree
🟡 1448. Count Good Nodes in Binary Tree

#SDM

@khamidulla_inoyatov_microblog

Lac Leman

Genevadan ko’ringan ko’l France ning Evian-Les-Bains shaxridan ko’rinishi. Bu shaxar Evian suvi bilan mashxur. Ko’lning u tarafi Switzerland.

Day 043

Kun masalalari:

🟢 872. Leaf-Similar Trees
🟡 2196. Create Binary Tree From Descriptions

O’qish uchun material:

*nix dagi quyidagi komanda bilan man <command> orqali tanishing:

- dd

DIY:

*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.

cd ~
touch input.md
echo "we are testing dd command" >> input.md
cat input.md
dd if=input.md of=output.md conv=ucase
cat output.md



Javoblar:

🟢 108. Convert Sorted Array to Binary Search Tree
🟡 814. Binary Tree Pruning

#SDM

@khamidulla_inoyatov_microblog

Day 044

Kun masalalari:

🟢 606. Construct String from Binary Tree
🟡 230. Kth Smallest Element in a BST

O’qish uchun material:

*nix dagi quyidagi komanda bilan man <command> orqali tanishing:

- diff

DIY:

*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.

cd ~
touch file1.md
echo "Apple\nBanana\nCherry\nDurian" >> file1.md
touch file2.md
echo "Apple\nBanana\nCherry\ndurian" >> file2.md
diff file1.md file2.md
diff -i file1.md file2.md



Javoblar:

🟢 872. Leaf-Similar Trees
🟡 2196. Create Binary Tree From Descriptions

#SDM

@khamidulla_inoyatov_microblog

PS: Uzur kundlik masalalar o’z vaqtida yuborishga vaqt bo’lmayapti.

Ciao dall' Italia!!! 🇮🇹