Day 051
Kun masalalari:
🟢 101. Symmetric Tree
🟡 655. Print Binary Tree
O’qish uchun material:
*nix dagi quyidagi komanda bilan
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
🟢 404. Sum of Left Leaves
🟡 623. Add One Row to Tree
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 101. Symmetric Tree
🟡 655. Print Binary Tree
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- expr
DIY:*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
cd ~
expr 3 + 5
expr length ABCdef
Javoblar:🟢 404. Sum of Left Leaves
🟡 623. Add One Row to Tree
#SDM
@khamidulla_inoyatov_microblog
👍3
Day 052
Kun masalalari:
🟢 993. Cousins in Binary Tree
🟡 107. Binary Tree Level Order Traversal II
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- nslookup
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
Javoblar:
🟢 101. Symmetric Tree
🟡 655. Print Binary Tree
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 993. Cousins in Binary Tree
🟡 107. Binary Tree Level Order Traversal II
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- nslookup
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
cd ~
nslookup
Javoblar:
🟢 101. Symmetric Tree
🟡 655. Print Binary Tree
#SDM
@khamidulla_inoyatov_microblog
👍3
Day 053
Kun masalalari:
🟢 112. Path Sum
🟡 129. Sum Root to Leaf Numbers
O’qish uchun material:
*nix dagi quyidagi komanda bilan
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
🟢 993. Cousins in Binary Tree
🟡 107. Binary Tree Level Order Traversal II
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 112. Path Sum
🟡 129. Sum Root to Leaf Numbers
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- dig
DIY:*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
cd ~
dig
Javoblar:🟢 993. Cousins in Binary Tree
🟡 107. Binary Tree Level Order Traversal II
#SDM
@khamidulla_inoyatov_microblog
👍2
Day 054
Kun masalalari:
🟢 572. Subtree of Another Tree
🟡 106. Construct Binary Tree from Inorder and Postorder Traversal
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- ifconfig
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
Javoblar:
🟢 112. Path Sum
🟡 129. Sum Root to Leaf Numbers
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 572. Subtree of Another Tree
🟡 106. Construct Binary Tree from Inorder and Postorder Traversal
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- ifconfig
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
cd ~
ifconfig -a
Javoblar:
🟢 112. Path Sum
🟡 129. Sum Root to Leaf Numbers
#SDM
@khamidulla_inoyatov_microblog
👍4
Day 055
Kun masalalari:
🟢 111. Minimum Depth of Binary Tree
🟡 109. Convert Sorted List to Binary Search Tree
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- iftop
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
Javoblar:
🟢 572. Subtree of Another Tree
🟡 106. Construct Binary Tree from Inorder and Postorder Traversal
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 111. Minimum Depth of Binary Tree
🟡 109. Convert Sorted List to Binary Search Tree
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- iftop
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
cd ~
iftop
iftop -i eth0
iftop -t
Javoblar:
🟢 572. Subtree of Another Tree
🟡 106. Construct Binary Tree from Inorder and Postorder Traversal
#SDM
@khamidulla_inoyatov_microblog
🔥2👍1
Day 056
Kun masalalari:
🟢 671. Second Minimum Node In a Binary Tree
🟡 113. Path Sum II
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- bzip2
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
Javoblar:
🟢 111. Minimum Depth of Binary Tree
🟡 109. Convert Sorted List to Binary Search Tree
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 671. Second Minimum Node In a Binary Tree
🟡 113. Path Sum II
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- bzip2
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
cd ~
dd if=/dev/urandom of=bigfile.txt bs=1M count=100
bzip2 bigfile.txt
ls -lh bigfile.txt*
Javoblar:
🟢 111. Minimum Depth of Binary Tree
🟡 109. Convert Sorted List to Binary Search Tree
#SDM
@khamidulla_inoyatov_microblog
👍2
Day 057
Kun masalalari:
🟢 222. Count Complete Tree Nodes
🟡 958. Check Completeness of a Binary Tree
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- bunzip2
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
Javoblar:
🟢 671. Second Minimum Node In a Binary Tree
🟡 113. Path Sum II
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 222. Count Complete Tree Nodes
🟡 958. Check Completeness of a Binary Tree
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- bunzip2
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
cd ~
dd if=/dev/urandom of=bigfile.txt bs=1M count=100
bzip2 bigfile.txt
ls -lh bigfile.txt*
mkdir zip_files
mv bigfile.txt.bz2 zip_files/
cd zip_files
bunzip2 bigfile.txt.bz2
Javoblar:
🟢 671. Second Minimum Node In a Binary Tree
🟡 113. Path Sum II
#SDM
@khamidulla_inoyatov_microblog
👍3
Day 058
Kun masalalari:
🟢 1464. Maximum Product of Two Elements in an Array
🟡 2336. Smallest Number in Infinite Set
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- route
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
Javoblar:
🟢 222. Count Complete Tree Nodes
🟡 958. Check Completeness of a Binary Tree
PS. Bugundan heap (priority queue) ga bog’liq bo’lgan masalalarni ishlashni boshlaymiz. Agar savollaringiz bo’lsa, tushuncha berib o’tishimiz mumkin.
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 1464. Maximum Product of Two Elements in an Array
🟡 2336. Smallest Number in Infinite Set
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- route
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
cd ~
route -n
sudo route add default gw 192.168.1.1
route -n
sudo route del default gw 192.168.1.1
Javoblar:
🟢 222. Count Complete Tree Nodes
🟡 958. Check Completeness of a Binary Tree
PS. Bugundan heap (priority queue) ga bog’liq bo’lgan masalalarni ishlashni boshlaymiz. Agar savollaringiz bo’lsa, tushuncha berib o’tishimiz mumkin.
#SDM
@khamidulla_inoyatov_microblog
👍4
Day 059
Kun masalalari:
🟢 2500. Delete Greatest Value in Each Row
🟡 451. Sort Characters By Frequency
O’qish uchun material:
*nix dagi quyidagi komanda bilan
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
Javoblar:
🟢 1464. Maximum Product of Two Elements in an Array
🟡 2336. Smallest Number in Infinite Set
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 2500. Delete Greatest Value in Each Row
🟡 451. Sort Characters By Frequency
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- tcpdump
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
cd ~
sudo tcpdump -i eth0
sudo tcpdump port 80
Javoblar:
🟢 1464. Maximum Product of Two Elements in an Array
🟡 2336. Smallest Number in Infinite Set
#SDM
@khamidulla_inoyatov_microblog
🔥2
Day 060
Kun masalalari:
🟢 2357. Make Array Zero by Subtracting Equal Amounts
🟡 1338. Reduce Array Size to The Half
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- arp
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
Javoblar:
🟢 2500. Delete Greatest Value in Each Row
🟡 451. Sort Characters By Frequency
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 2357. Make Array Zero by Subtracting Equal Amounts
🟡 1338. Reduce Array Size to The Half
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- arp
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
cd ~
arp -n
Javoblar:
🟢 2500. Delete Greatest Value in Each Row
🟡 451. Sort Characters By Frequency
#SDM
@khamidulla_inoyatov_microblog
👍2
Day 061
Kun masalalari:
🟢 1337. The K Weakest Rows in a Matrix
🟡 1753. Maximum Score From Removing Stones
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- ndp
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
Javoblar:
🟢 2357. Make Array Zero by Subtracting Equal Amounts
🟡 1338. Reduce Array Size to The Half
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 1337. The K Weakest Rows in a Matrix
🟡 1753. Maximum Score From Removing Stones
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- ndp
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
cd ~
sudo ndp -n
Javoblar:
🟢 2357. Make Array Zero by Subtracting Equal Amounts
🟡 1338. Reduce Array Size to The Half
#SDM
@khamidulla_inoyatov_microblog
👍1
This media is not supported in your browser
VIEW IN TELEGRAM
Tatil tugadi
Mana tatil xam tugadi 🏖️. Yil oxirigacha boshqa oylab qoygan maqsadlar tamon xarakat qilishda davom etamiz. Sizda qanday ketyapti?
Video credits: Durdona
P.S: Borgan joylarimni birma post shaklida yozib boraman.
Mana tatil xam tugadi 🏖️. Yil oxirigacha boshqa oylab qoygan maqsadlar tamon xarakat qilishda davom etamiz. Sizda qanday ketyapti?
Video credits: Durdona
P.S: Borgan joylarimni birma post shaklida yozib boraman.
❤2👍1🔥1😁1
Day 062
Kun masalalari:
🟢 2558. Take Gifts From the Richest Pile
🟡 215. Kth Largest Element in an Array
O’qish uchun material:
*nix dagi quyidagi komanda bilan
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
3-komandadigi <rule_number> ni 2-komandaning natijasidan olasiz 🙂
Javoblar:
🟢 1337. The K Weakest Rows in a Matrix
🟡 1753. Maximum Score From Removing Stones
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 2558. Take Gifts From the Richest Pile
🟡 215. Kth Largest Element in an Array
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- iptables
DIY:*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
cd ~
sudo iptables -A INPUT -s 140.82.121.3 -j DROP
<Try to open www.github.com on your browser>sudo iptables -L --line-numbers
sudo iptables -D INPUT <rule_number>
NOTE: iptables komandasi bilan ishlayotganda extiyotkor bo’ling 🙂 3-komandadigi <rule_number> ni 2-komandaning natijasidan olasiz 🙂
Javoblar:
🟢 1337. The K Weakest Rows in a Matrix
🟡 1753. Maximum Score From Removing Stones
#SDM
@khamidulla_inoyatov_microblog
👍1
Day 063
Kun masalalari:
🟢 1046. Last Stone Weight
🟡 1845. Seat Reservation Manager
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- lsmod
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
Javoblar:
🟢 2558. Take Gifts From the Richest Pile
🟡 215. Kth Largest Element in an Array
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 1046. Last Stone Weight
🟡 1845. Seat Reservation Manager
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- lsmod
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
cd ~
lsmod
Javoblar:
🟢 2558. Take Gifts From the Richest Pile
🟡 215. Kth Largest Element in an Array
#SDM
@khamidulla_inoyatov_microblog
👍3
Siz ishlaydigan IT companiyalarida staging server bormi? Staging server nima uchun keragligini bilasizmi? 🤔
Day 064
Kun masalalari:
🟢 506. Relative Ranks
🟡 378. Kth Smallest Element in a Sorted Matrix
O’qish uchun material:
*nix dagi quyidagi komanda bilan
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
🟢 1046. Last Stone Weight
🟡 1845. Seat Reservation Manager
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 506. Relative Ranks
🟡 378. Kth Smallest Element in a Sorted Matrix
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- strace
DIY:*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
cd ~
strace -o output.md ls -l
Javoblar:🟢 1046. Last Stone Weight
🟡 1845. Seat Reservation Manager
#SDM
@khamidulla_inoyatov_microblog
👍2
Day 065
Kun masalalari:
🟢 2231. Largest Number After Digit Swaps by Parity
🟡 2679. Sum in a Matrix
O’qish uchun material:
*nix dagi quyidagi komanda bilan
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
Javoblar:
🟢 506. Relative Ranks
🟡 378. Kth Smallest Element in a Sorted Matrix
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 2231. Largest Number After Digit Swaps by Parity
🟡 2679. Sum in a Matrix
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- ltrace
DIY:*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
cd ~
ltrace ls -l
PS. Kechagi komandaning natijasini - output.md file ni tekshirib ko’rdingizmi? 🙂Javoblar:
🟢 506. Relative Ranks
🟡 378. Kth Smallest Element in a Sorted Matrix
#SDM
@khamidulla_inoyatov_microblog
👍2
Day 066
Kun masalalari:
🟢 2335. Minimum Amount of Time to Fill Cups
🟡 912. Sort an Array
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- time
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
🟢 2231. Largest Number After Digit Swaps by Parity
🟡 2679. Sum in a Matrix
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 2335. Minimum Amount of Time to Fill Cups
🟡 912. Sort an Array
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- time
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
cd ~
time ls -l
Javoblar:🟢 2231. Largest Number After Digit Swaps by Parity
🟡 2679. Sum in a Matrix
#SDM
@khamidulla_inoyatov_microblog
👍3
Day 067
Kun masalalari:
🟢 703. Kth Largest Element in a Stream
🟡 692. Top K Frequent Words
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- nohup
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
🟢 2335. Minimum Amount of Time to Fill Cups
🟡 912. Sort an Array
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 703. Kth Largest Element in a Stream
🟡 692. Top K Frequent Words
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- nohup
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
kill -9 <pid>
dagi pid - bundan oldin bajarilgan pgrep -a ping
ning natijasidan olingan. cd ~
mkdir day067
cd day067
touch hello.sh
echo "#\!/bin/bash" > hello.sh
echo printf \"Hello, world\" >> hello.sh
chmod +x hello.sh
./hello.sh
nohup ./hello.sh
cat nohup.out
nohup ping google.com &
pgrep -a ping
kill -9 <pid>
cat nohup.out
Javoblar:🟢 2335. Minimum Amount of Time to Fill Cups
🟡 912. Sort an Array
#SDM
@khamidulla_inoyatov_microblog
👍2
Ukam Khumoyun Inoyatov ni Amsterdam xaqida quyidagilarni yozgan.
Gollandiya - kanallar, velosipedlar va piyodalar yurti
Eng uzoq vaqt qolib eng bemalol aylangan shaharimiz aynan Amsterdam bo’ldi. Ob-havosi, tabiati, arxitekturasi, piyoda va velosipedchilarga bo’lgan munosbati bilan meni rom etgan bu shaharga qayta qayta tashrif buyurgan yoki yashagan bo’lardim. Shahar, ba’zi nuqtalarini hisobga olmasa juda tinch, huddi ertakka o’xshaydi, kanal bo’yiga qurilgan uy va binolar sizni qandaydir hikoya qahromanidek his qilishga undaydi.
Transport 🚋
Ko’chalarda mashinalar juda kam, shunga yarasha tiqilinchlik va signal ovozlari ham yo’q, avtomobillarning asosiy qismi elektromobillar va kam yoqilg'i sarflovchi gibrid avtomobillari, shaharda shuncha vaqt yashab, umuman tutagan va yoqimsiz hid qoldirgan avtomobillarni uchratganim yo’q. Velosipedda har qanday A nuqtadan B nuqtaga yetib olishingiz mumkin, deyarli 90% ko’chalarda alohida piyodalar va velosipedchilar uchun harakatlanish yo’llari mavjud. Velosipedlar huddi avtomobillardek yo’lning o’ng tomonidan o’ng qo’l qoidasiga asosan harakatlanishadi, burilish kerak bo’lganda har bir haydovchi qo’l ishoralari bilan qayerga burilmoqchiligini ko’rsatadi. Men ham velosipedda umumiy 60-80km masofani bosib o’tgan bo’lsam, tezgina qonun qoidalarga tushunib olib, shahar bilan uyg’unlashdim. Shahar kanallar bilan to’lgan, shunga yarasha ko’priklarning har qanday turini va qayiqlarda harakatlanayotgan mahalliy aholini ko’rishingiz mumkin, kimdur yumush bilan, kimdur shunchaki sayrga chiqgan. Jamoat transportining har qanday ko’rinishi bor, eng qulayi esa albatta tramvay. Nega shaharsozlik haqida blog yuritadigan Ilya Varlamov kabi bloggerlarni post-sovet davlatlarida tramvayni qaytarish kerakligi haqida bong urishini endi tushundim.
Mahalliy aholi 👫🏻
Menga eng yoqgan taraflaridan biri 99% aholi ingliz tilini biladi va sizga yordam kerak bo’lsa, hushmuomilalik bilan barchasini tushuntirib beradi. Ubu narsani tushuntirish va muloqatda bo’lish bilan umuman muammo bo’lmadi. Undan tashqari, agar liftga kirayotgan yoki chiqayotgan bo’lsangiz, begona insonlar siz bilan salomlashib, chiqib ketayotganda hayrli kun tilab ketishadi, bundan keyin albatta kunni yaxshi kayfiyatda o’tkazishingiz tabiiy.
Tabiat 🌳
Instagramga bir story qo’ygandim, “Butun shahar ekobog’dek” deb nomlangan, rostdan ham, shaharni har bir qismida bog’lar, o’rmonlar va ko’ngil ochar yashil maydonlar mavjud. U yerda shunchaki sayr qilsangiz ham bag’ri dilingiz yayraydi. Ayniqsa yomg’ir paytida va undan keyingi sayrda, o’pkangiz sizga rahmat aytib yuboradigan darajada havo toza va yoqimli hid keladi. Bepoyon dalalarda o’zi o’tlab yurgan golland sigirlari balki shuning uchun ham kuniga 40 litr sut berishar.
To’liqroq o’zini kanalida o’qishingiz mumkin.
Gollandiya - kanallar, velosipedlar va piyodalar yurti
Eng uzoq vaqt qolib eng bemalol aylangan shaharimiz aynan Amsterdam bo’ldi. Ob-havosi, tabiati, arxitekturasi, piyoda va velosipedchilarga bo’lgan munosbati bilan meni rom etgan bu shaharga qayta qayta tashrif buyurgan yoki yashagan bo’lardim. Shahar, ba’zi nuqtalarini hisobga olmasa juda tinch, huddi ertakka o’xshaydi, kanal bo’yiga qurilgan uy va binolar sizni qandaydir hikoya qahromanidek his qilishga undaydi.
Transport 🚋
Ko’chalarda mashinalar juda kam, shunga yarasha tiqilinchlik va signal ovozlari ham yo’q, avtomobillarning asosiy qismi elektromobillar va kam yoqilg'i sarflovchi gibrid avtomobillari, shaharda shuncha vaqt yashab, umuman tutagan va yoqimsiz hid qoldirgan avtomobillarni uchratganim yo’q. Velosipedda har qanday A nuqtadan B nuqtaga yetib olishingiz mumkin, deyarli 90% ko’chalarda alohida piyodalar va velosipedchilar uchun harakatlanish yo’llari mavjud. Velosipedlar huddi avtomobillardek yo’lning o’ng tomonidan o’ng qo’l qoidasiga asosan harakatlanishadi, burilish kerak bo’lganda har bir haydovchi qo’l ishoralari bilan qayerga burilmoqchiligini ko’rsatadi. Men ham velosipedda umumiy 60-80km masofani bosib o’tgan bo’lsam, tezgina qonun qoidalarga tushunib olib, shahar bilan uyg’unlashdim. Shahar kanallar bilan to’lgan, shunga yarasha ko’priklarning har qanday turini va qayiqlarda harakatlanayotgan mahalliy aholini ko’rishingiz mumkin, kimdur yumush bilan, kimdur shunchaki sayrga chiqgan. Jamoat transportining har qanday ko’rinishi bor, eng qulayi esa albatta tramvay. Nega shaharsozlik haqida blog yuritadigan Ilya Varlamov kabi bloggerlarni post-sovet davlatlarida tramvayni qaytarish kerakligi haqida bong urishini endi tushundim.
Mahalliy aholi 👫🏻
Menga eng yoqgan taraflaridan biri 99% aholi ingliz tilini biladi va sizga yordam kerak bo’lsa, hushmuomilalik bilan barchasini tushuntirib beradi. Ubu narsani tushuntirish va muloqatda bo’lish bilan umuman muammo bo’lmadi. Undan tashqari, agar liftga kirayotgan yoki chiqayotgan bo’lsangiz, begona insonlar siz bilan salomlashib, chiqib ketayotganda hayrli kun tilab ketishadi, bundan keyin albatta kunni yaxshi kayfiyatda o’tkazishingiz tabiiy.
Tabiat 🌳
Instagramga bir story qo’ygandim, “Butun shahar ekobog’dek” deb nomlangan, rostdan ham, shaharni har bir qismida bog’lar, o’rmonlar va ko’ngil ochar yashil maydonlar mavjud. U yerda shunchaki sayr qilsangiz ham bag’ri dilingiz yayraydi. Ayniqsa yomg’ir paytida va undan keyingi sayrda, o’pkangiz sizga rahmat aytib yuboradigan darajada havo toza va yoqimli hid keladi. Bepoyon dalalarda o’zi o’tlab yurgan golland sigirlari balki shuning uchun ham kuniga 40 litr sut berishar.
To’liqroq o’zini kanalida o’qishingiz mumkin.
Telegram
Khumoyun Writes
Gollandiya - kanallar, velosipedlar va piyodalar yurti
Eng uzoq vaqt qolib eng bemalol aylangan shaharimiz aynan Amsterdam bo’ldi. Ob-havosi, tabiati, arxitekturasi, piyoda va velosipedchilarga bo’lgan munosbati bilan meni rom etgan bu shaharga qayta qayta…
Eng uzoq vaqt qolib eng bemalol aylangan shaharimiz aynan Amsterdam bo’ldi. Ob-havosi, tabiati, arxitekturasi, piyoda va velosipedchilarga bo’lgan munosbati bilan meni rom etgan bu shaharga qayta qayta…
👍5