Week four
Bir pastda to’rtunchi xafta xam o’tib ketibdi. Birinchi kundan marafonda qatnashayotganlar 50 dan ortiq masala ishlashgan. Shundan 25 tasi o’rta qiyinlik darajasida.
Takidlab o’tish kerakki 10 ta masalani bir kunda ishlash oson. Lekin xar kuni 2 maslani ishlash qiyin. Xayotda xamma narsa bo’lishi mumkin. Lekin bardovom ishlash uchun matonat kerak. Siz qila olasiz. Siz oxirigacha bora olasiz. Siz bundan ko’piga xam qodirsiz.
Siz o’zingizni qanday xis qilyapsiz? Qanday muammolarga duch kelyapsiz? Postni tagida o’z fikirlaringiz bilan ulashing.
Ozingizni royxatdan toping.
#SDM
@khamidulla_inoyatov_microblog
Bir pastda to’rtunchi xafta xam o’tib ketibdi. Birinchi kundan marafonda qatnashayotganlar 50 dan ortiq masala ishlashgan. Shundan 25 tasi o’rta qiyinlik darajasida.
Takidlab o’tish kerakki 10 ta masalani bir kunda ishlash oson. Lekin xar kuni 2 maslani ishlash qiyin. Xayotda xamma narsa bo’lishi mumkin. Lekin bardovom ishlash uchun matonat kerak. Siz qila olasiz. Siz oxirigacha bora olasiz. Siz bundan ko’piga xam qodirsiz.
Siz o’zingizni qanday xis qilyapsiz? Qanday muammolarga duch kelyapsiz? Postni tagida o’z fikirlaringiz bilan ulashing.
Ozingizni royxatdan toping.
#SDM
@khamidulla_inoyatov_microblog
🔥10👍3
Day 028
Kun masalalari:
🟢 705. Design HashSet
🟡 24. Swap Nodes in Pairs
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- uname
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring. uname komandasining boshqa option’larini ham tekshirib ko’ring.
Javoblar:
🟢 83. Remove Duplicates from Sorted List
🟡 1472. Design Browser History
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 705. Design HashSet
🟡 24. Swap Nodes in Pairs
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command> orqali tanishing:- uname
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring. uname komandasining boshqa option’larini ham tekshirib ko’ring.
uname -a
uname -v
Javoblar:
🟢 83. Remove Duplicates from Sorted List
🟡 1472. Design Browser History
#SDM
@khamidulla_inoyatov_microblog
👍2
Day 029
Kun masalalari:
🟢 706. Design HashMap
🟡 2326. Spiral Matrix IV
O’qish uchun material:
*inux dagi quyidagi komanda bilan
- hostname
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring. username ni o’rniga o’zingizning username’ingizni qo’yasiz.
Javoblar:
🟢 705. Design HashSet
🟡 24. Swap Nodes in Pairs
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 706. Design HashMap
🟡 2326. Spiral Matrix IV
O’qish uchun material:
*inux dagi quyidagi komanda bilan
man <command> orqali tanishing:- hostname
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring. username ni o’rniga o’zingizning username’ingizni qo’yasiz.
hostname
hostname -s
hostname -d
Javoblar:
🟢 705. Design HashSet
🟡 24. Swap Nodes in Pairs
#SDM
@khamidulla_inoyatov_microblog
❤3⚡2
Day 030
Kun masalalari:
🟢 141. Linked List Cycle
🟡 142. Linked List Cycle II
O’qish uchun material:
*inux dagi quyidagi komanda bilan
- at
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
Javoblar:
🟢 706. Design HashMap
🟡 2326. Spiral Matrix IV
#SDM
@khamidulla_inoyatov_microblog
PS: Javoblarni qoyishga tushuntirib yozishga ulgirmayapman. Iloji boricha tezroq to’g’irlab qoyamiz.
Kun masalalari:
🟢 141. Linked List Cycle
🟡 142. Linked List Cycle II
O’qish uchun material:
*inux dagi quyidagi komanda bilan
man <command> orqali tanishing:- at
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
cd ~
touch my_file.txt
echo "sed -i '1i This is the first line.' my_file.txt" | at 09:00 PM
Javoblar:
🟢 706. Design HashMap
🟡 2326. Spiral Matrix IV
#SDM
@khamidulla_inoyatov_microblog
PS: Javoblarni qoyishga tushuntirib yozishga ulgirmayapman. Iloji boricha tezroq to’g’irlab qoyamiz.
👍4
Day 031
Kun masalalari:
🟢 203. Remove Linked List Elements
🟡 2487. Remove Nodes From Linked List
O’qish uchun material:
*inux dagi quyidagi komanda bilan
- ping
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring va ularni farqini o’rganing.
Javoblar:
🟢 141. Linked List Cycle
🟡 142. Linked List Cycle II
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 203. Remove Linked List Elements
🟡 2487. Remove Nodes From Linked List
O’qish uchun material:
*inux dagi quyidagi komanda bilan
man <command> orqali tanishing:- ping
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring va ularni farqini o’rganing.
ping google.com
ping -c 5 google.com
ping -i 2 google.com
Javoblar:
🟢 141. Linked List Cycle
🟡 142. Linked List Cycle II
#SDM
@khamidulla_inoyatov_microblog
👍5
Day 032
Kun masalalari:
🟢 771. Jewels and Stones
🟡 2391. Minimum Amount of Time to Collect Garbage
O’qish uchun material:
*inux dagi quyidagi komanda bilan
- traceroute
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring va ularni farqini o’rganing.
Javoblar:
🟢 203. Remove Linked List Elements
🟡 2487. Remove Nodes From Linked List
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 771. Jewels and Stones
🟡 2391. Minimum Amount of Time to Collect Garbage
O’qish uchun material:
*inux dagi quyidagi komanda bilan
man <command> orqali tanishing:- traceroute
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring va ularni farqini o’rganing.
traceroute google.com
traceroute -n google.com
traceroute -m 15 example.com
traceroute -f 5 example.com
Javoblar:
🟢 203. Remove Linked List Elements
🟡 2487. Remove Nodes From Linked List
#SDM
@khamidulla_inoyatov_microblog
👍5
Day 033
Kun masalalari:
🟢 94. Binary Tree Inorder Traversal
🟡 98. Validate Binary Search Tree
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- tar
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring va ularni farqini o’rganing.
Javoblar:
🟢 771. Jewels and Stones
🟡 2391. Minimum Amount of Time to Collect Garbage
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 94. Binary Tree Inorder Traversal
🟡 98. Validate Binary Search Tree
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command> orqali tanishing:- tar
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring va ularni farqini o’rganing.
cd ~
mkdir Archive
cd Archive
echo "Text 01" >> file_01.txt
echo "Text 02" >> file_02.txt
echo "Data 01" >> data_01.data
echo "Data 02" >> data_02.data
cd -
tar -cvf archive.tar Archive
rm -rf Archive
tar -xvf archive.tar
rm archive.tar
cd Archvie
tar -xvf txt.tar --wildcards "*.txt"
Javoblar:
🟢 771. Jewels and Stones
🟡 2391. Minimum Amount of Time to Collect Garbage
#SDM
@khamidulla_inoyatov_microblog
👍5
Day 034
Kun masalalari:
🟢 144. Binary Tree Preorder Traversal
🟡 1038. Binary Search Tree to Greater Sum Tree
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- date
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring va ularni farqini o’rganing.
Javoblar:
🟢 94. Binary Tree Inorder Traversal
🟡 98. Validate Binary Search Tree
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 144. Binary Tree Preorder Traversal
🟡 1038. Binary Search Tree to Greater Sum Tree
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command> orqali tanishing:- date
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring va ularni farqini o’rganing.
cd ~
date
date +%Y-%m-%d
date -d "+5 days"
date +%s
date -d "July 2023"
Javoblar:
🟢 94. Binary Tree Inorder Traversal
🟡 98. Validate Binary Search Tree
#SDM
@khamidulla_inoyatov_microblog
👍3
Day 035
Kun masalalari:
🟢 145. Binary Tree Postorder Traversal
🟡 1302. Deepest Leaves Sum
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- top
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring va ularni farqini o’rganing.
Javoblar:
🟢 144. Binary Tree Preorder Traversal
🟡 1038. Binary Search Tree to Greater Sum Tree
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 145. Binary Tree Postorder Traversal
🟡 1302. Deepest Leaves Sum
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command> orqali tanishing:- top
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring va ularni farqini o’rganing.
cd ~
top
sleep 60 && echo "Hello World!" &
top -n 1 -pid $!
sleep 60 && echo "Hello World!" &
top -n -pid $! -o PID -o CPU -o MEM
Javoblar:
🟢 144. Binary Tree Preorder Traversal
🟡 1038. Binary Search Tree to Greater Sum Tree
#SDM
@khamidulla_inoyatov_microblog
👍5
Day 036
Kun masalalari:
🟢 1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree
🟡 1315. Sum of Nodes with Even-Valued Grandparent
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- ps
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring va ularni farqini o’rganing.
Javoblar:
🟢 145. Binary Tree Postorder Traversal
🟡 1302. Deepest Leaves Sum
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree
🟡 1315. Sum of Nodes with Even-Valued Grandparent
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command> orqali tanishing:- ps
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring va ularni farqini o’rganing.
cd ~
ps
ps -x
ps -x | grep chrome
Javoblar:
🟢 145. Binary Tree Postorder Traversal
🟡 1302. Deepest Leaves Sum
#SDM
@khamidulla_inoyatov_microblog
🔥2👍1
Kecha 5 xafta bo’lgan ekan esdan chiqib ketibdi. 🔥🔥🔥
Marafonda qatnashaman deb qancha odam yozildi. Lekin ular yoki toxtab qolishdi yoki umuman qatnashmadi. Da bu xammaga xam emas xamma xam eplay olmaydi. Xamma xam o’z maqsadlari tomon toxtamasdan qadam tashlab bora olmaydi.
Sizchi sizda qanday ketyapti? Siz xam chiqib kettingizmi? Yoki xali xam davom etyapsizmi?
Marafonda qatnashaman deb qancha odam yozildi. Lekin ular yoki toxtab qolishdi yoki umuman qatnashmadi. Da bu xammaga xam emas xamma xam eplay olmaydi. Xamma xam o’z maqsadlari tomon toxtamasdan qadam tashlab bora olmaydi.
Sizchi sizda qanday ketyapti? Siz xam chiqib kettingizmi? Yoki xali xam davom etyapsizmi?
👍11🔥1
Day 037
Kun masalalari:
🟢 700. Search in a Binary Search Tree
🟡 1325. Delete Leaves With a Given Value
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- kill
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring va ularni farqini o’rganing.
ps. Oxirgi komandani ishlatib ko’rmang :)
Javoblar:
🟢 1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree
🟡 1315. Sum of Nodes with Even-Valued Grandparent
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 700. Search in a Binary Search Tree
🟡 1325. Delete Leaves With a Given Value
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command> orqali tanishing:- kill
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring va ularni farqini o’rganing.
cd ~
sleep 60 && echo "Hello World!" &
kill -9 $!
kill -9 1
ps. Oxirgi komandani ishlatib ko’rmang :)
Javoblar:
🟢 1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree
🟡 1315. Sum of Nodes with Even-Valued Grandparent
#SDM
@khamidulla_inoyatov_microblog
🔥3
Day 038
Kun masalalari:
🟢 617. Merge Two Binary Trees
🟡 1026. Maximum Difference Between Node and Ancestor
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- finger
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring. Komandadagi username ni o’rniga o’zingiz foydalanayotgan username ni qo’yishingiz kerak bo’ladi.
Javoblar:
🟢 700. Search in a Binary Search Tree
🟡 1325. Delete Leaves With a Given Value
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 617. Merge Two Binary Trees
🟡 1026. Maximum Difference Between Node and Ancestor
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command> orqali tanishing:- finger
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring. Komandadagi username ni o’rniga o’zingiz foydalanayotgan username ni qo’yishingiz kerak bo’ladi.
cd ~
finger
finger -l username
Javoblar:
🟢 700. Search in a Binary Search Tree
🟡 1325. Delete Leaves With a Given Value
#SDM
@khamidulla_inoyatov_microblog
👍1🔥1
Day 039
Kun masalalari:
🟢 226. Invert Binary Tree
🟡 1305. All Elements in Two Binary Search Trees
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- dmesg
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
Javoblar:
🟢 617. Merge Two Binary Trees
🟡 1026. Maximum Difference Between Node and Ancestor
#SDM
@khamidulla_inoyatov_microblog
PS: Paris ga endi etib keldim.
Kun masalalari:
🟢 226. Invert Binary Tree
🟡 1305. All Elements in Two Binary Search Trees
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command> orqali tanishing:- dmesg
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
cd ~
dmesg -H
dmesg | last 10
Javoblar:
🟢 617. Merge Two Binary Trees
🟡 1026. Maximum Difference Between Node and Ancestor
#SDM
@khamidulla_inoyatov_microblog
PS: Paris ga endi etib keldim.
❤3🔥2
Day 040
Kun masalalari:
🟢 2236. Root Equals Sum of Children
🟡 701. Insert into a Binary Search Tree
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- tee
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
Javoblar:
🟢 226. Invert Binary Tree
🟡 1305. All Elements in Two Binary Search Trees
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 2236. Root Equals Sum of Children
🟡 701. Insert into a Binary Search Tree
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command> orqali tanishing:- tee
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
cd ~
echo "Hello world"
echo "Hello world" | tee output.md
cat output.md
Javoblar:
🟢 226. Invert Binary Tree
🟡 1305. All Elements in Two Binary Search Trees
#SDM
@khamidulla_inoyatov_microblog
👍2❤1🔥1
Arenes de Lutece
O’tgan yili Paris ga kelganimizda Azimjon, Diyorbek va men Pantheon ga borgandik. O’shanda sayohatimizni ikkinchi kuni edi. (O’sha majmua yonida French Onion 🧅 soupni xam tatib ko’rgandik. Harry Potterda French Onion soup xaqida o’qigandim, va piyozdan xam mazali taom tayorlasa bo’larkanda deb oylagandim. Lekin bu xikoya alohida post tabalab qiladi 😉). Sayoxatimizni uchinchi kuni Luver museyiga bo’lgani uchun oxirgi kuni xech qayerga bora olmagandik. Shu bilan sayoxatimiz o’z nixoyasiga yetib men Amsterdamga, va bollar Warshavaga qaytib ketgandik. Amsterdamga borgach, borgan joylarim xaqida to’liqroq malumot qaray boshlagandim. Shunda googledan Paris dagi eng qadimiy inshoat qaysi ekanligi qidirganimda Pantheondan 600-800 metr uzoqlikdagi Arense de Lutece deb nomlagan amphitheater ekanligini bilib o’zimdan Paris tarixini bilmaganimdan biroz xafa bo’lgandim. Ammo kecha vaqti kelib I asrda qurilgan va xozirgacha saqlanib kelgan amphitheater ko’rish nasib etti.
O’tgan yili Paris ga kelganimizda Azimjon, Diyorbek va men Pantheon ga borgandik. O’shanda sayohatimizni ikkinchi kuni edi. (O’sha majmua yonida French Onion 🧅 soupni xam tatib ko’rgandik. Harry Potterda French Onion soup xaqida o’qigandim, va piyozdan xam mazali taom tayorlasa bo’larkanda deb oylagandim. Lekin bu xikoya alohida post tabalab qiladi 😉). Sayoxatimizni uchinchi kuni Luver museyiga bo’lgani uchun oxirgi kuni xech qayerga bora olmagandik. Shu bilan sayoxatimiz o’z nixoyasiga yetib men Amsterdamga, va bollar Warshavaga qaytib ketgandik. Amsterdamga borgach, borgan joylarim xaqida to’liqroq malumot qaray boshlagandim. Shunda googledan Paris dagi eng qadimiy inshoat qaysi ekanligi qidirganimda Pantheondan 600-800 metr uzoqlikdagi Arense de Lutece deb nomlagan amphitheater ekanligini bilib o’zimdan Paris tarixini bilmaganimdan biroz xafa bo’lgandim. Ammo kecha vaqti kelib I asrda qurilgan va xozirgacha saqlanib kelgan amphitheater ko’rish nasib etti.
👍4