Day 046

Kun masalalari:

🟢 653. Two Sum IV - Input is a BST
🟡 515. Find Largest Value in Each Tree Row

O’qish uchun material:

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

- md5sum

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

cd ~
touch file.md
echo "We are testing md5sum" >> file.md
md5sum file.md
cp file.md file2.md
md5sum file2.md
echo " " >> file.md
md5sum file.md

Javoblar:

🟢 257. Binary Tree Paths
🟡 513. Find Bottom Left Tree Value

#SDM

@khamidulla_inoyatov_microblog

Day 047

Kun masalalari:

🟢 783. Minimum Distance Between BST Nodes
🟡 2265. Count Nodes Equal to Average of Subtree

O’qish uchun material:

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

- shasum

*DIY:*

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

cd ~
touch file.md
echo "We are testing shasum" >> file.md
shasum file.md
shasum -a 256 file.md
cp file.md file2.md
shasum file2.md
echo " " >> file2.md
shasum file2.md

Javoblar:

🟢 653. Two Sum IV - Input is a BST
🟡 515. Find Largest Value in Each Tree Row

#SDM

@khamidulla_inoyatov_microblog

Piazza Del Popolo

Men o’qigan kitob qaxramonlari mana shu Piazza Del Popolo da uchrashishadi. Shu kitob kim tomonidan yozilganligi, kitob nomi va shu erda uchrashgan qaxramonlarni otini komentda yozgan odamga Amsterdamdan kichik esdalik berib yuboraman @khumoyun_codes dan.

Day 048

Kun masalalari:

🟢 100. Same Tree
🟡 865. Smallest Subtree with all the Deepest Nodes

O’qish uchun material:

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

- shutdown

DIY:

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

cd ~
sudo shutdown -h +2 "This is a scheduled reboot"


Javoblar:

🟢 783. Minimum Distance Between BST Nodes
🟡 2265. Count Nodes Equal to Average of Subtree

#SDM

@khamidulla_inoyatov_microblog

Austria 🇦🇹 dagi kamalak 🌈.

Day 049

Kun masalalari:

🟢 530. Minimum Absolute Difference in BST
🟡 103. Binary Tree Zigzag Level Order Traversal

O’qish uchun material:

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

- write

DIY:

*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring. Buning uchun sizga 2 ta Terminal kerak bo’ladi. Terminal 1 dan komandani bajarib, uning natijasini Terminal 2 da ham ko’rishingiz mumkin. Kerakli xabarni qoldirganingizdan so’ng Ctrl+C orqali xabar jo’natishni to’xtatishingiz mumkin

Terminal 1:

cd ~
write $(whoami)
Hello
How are you doing?

Javoblar:

🟢 100. Same Tree
🟡 865. Smallest Subtree with all the Deepest Nodes

#SDM

@khamidulla_inoyatov_microblog

Day 050

Kun masalalari:

🟢 404. Sum of Left Leaves
🟡 623. Add One Row to Tree

O’qish uchun material:

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

- wall

DIY:

*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring. Buning uchun sizga 2 ta Terminal kerak bo’ladi. Terminal 1 dan komandani bajarib, uning natijasini Terminal 2 da ham ko’rishingiz mumkin.

Terminal 1:

cd ~
wall "The system will be restarted in 10 minutes"


Javoblar:

🟢 530. Minimum Absolute Difference in BST
🟡 103. Binary Tree Zigzag Level Order Traversal

#SDM

@khamidulla_inoyatov_microblog

Day 051

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

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 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

Day 053

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

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 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

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 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

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 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

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 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

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 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

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 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

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 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

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 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

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.

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 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