Day 069
Kun masalalari:
🟢 933. Number of Recent Calls
🟡 1823. Find the Winner of the Circular Game
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- poweroff
DIY:
\nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
🟢 2099. Find Subsequence of Length K With the Largest Sum
🟡 1405. Longest Happy String
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 933. Number of Recent Calls
🟡 1823. Find the Winner of the Circular Game
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- poweroff
DIY:
\nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
cd ~
sudo poweroff
Javoblar:🟢 2099. Find Subsequence of Length K With the Largest Sum
🟡 1405. Longest Happy String
#SDM
@khamidulla_inoyatov_microblog
👍1🔥1
Day 070
Kun masalalari:
🟢 1700. Number of Students Unable to Eat Lunch
🟡 641. Design Circular Deque
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- init
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
🟢 933. Number of Recent Calls
🟡 1823. Find the Winner of the Circular Game
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 1700. Number of Students Unable to Eat Lunch
🟡 641. Design Circular Deque
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- init
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
cd ~
sudo init 6
Javoblar:🟢 933. Number of Recent Calls
🟡 1823. Find the Winner of the Circular Game
#SDM
@khamidulla_inoyatov_microblog
👍1🔥1🤨1👻1
Kecha Universitetga kirish imtihonlariga taluqli bir necha odamni maqolalarini o’qidim (Xammasini Jaxongir boshladilar :)). Lekin nimagadir meni tushimga kirish imtixonlari emas balkim Universitetdagi so’ngi davlat imtixonlardan yeqilayotganim kirdi. Oliy Mathematikadan imtixonda javob berolmay o’tirganimni ko’rdim. Xamma narsa esimdan chiqib ketibdi. Endi Universitetni bitira olmayman deb qo’rqib uyg’ondim. Aslida to’rtinchi kursda Oliy Matrmatikadan imtixon bo’lmagan. Bilmadim nega bu tushni ko’rdim lekin umuman olganda Matematikadagi ko’p narsa yoddan ko’tarilgan. Albatta formulalar kitobchasi bilan xali xam masalalarni ishloy olsam kerak lekin oldingidek emas. O’z vaqtida juda ko’p vaqt sariflagan bilimlar xayotda as qotmadi. Xarakat qilib yuqori bal olganim xam vaqt o’tib esdan chiqdi. ChatGPT uxlashdan oldin bo’lmag’ur narsalarni o’qiyverma telefonda deyapti. Sizda xam shunday bo’lganmi?
PS: Quora da xam bu xaqida yozilgan ekan bitta mendamas ekan.
@khamidulla_inoyatov_microblog
PS: Quora da xam bu xaqida yozilgan ekan bitta mendamas ekan.
@khamidulla_inoyatov_microblog
🤓4👍1
Day 071
Kun masalalari:
🟢 232. Implement Queue using Stacks
🟡 1670. Design Front Middle Back Queue
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- systemctl
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring 😎
🟢 1700. Number of Students Unable to Eat Lunch
🟡 641. Design Circular Deque
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 232. Implement Queue using Stacks
🟡 1670. Design Front Middle Back Queue
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- systemctl
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring 😎
cd ~
systemctl list-unit-files --type=service
sudo systemctl reboot
Javoblar:🟢 1700. Number of Students Unable to Eat Lunch
🟡 641. Design Circular Deque
#SDM
@khamidulla_inoyatov_microblog
👍2🔥1
Day 072
Kun masalalari:
🟢 2073. Time Needed to Buy Tickets
🟡 1352. Product of the Last K Numbers
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- halt
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring
Javoblar:
🟢 232. Implement Queue using Stacks
🟡 1670. Design Front Middle Back Queue
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 2073. Time Needed to Buy Tickets
🟡 1352. Product of the Last K Numbers
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- halt
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring
cd ~
sudo halt
Javoblar:
🟢 232. Implement Queue using Stacks
🟡 1670. Design Front Middle Back Queue
#SDM
@khamidulla_inoyatov_microblog
Day 073
Kun masalalari:
🟢 387. First Unique Character in a String
🟡 918. Maximum Sum Circular Subarray
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- vi
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring
🟢 2073. Time Needed to Buy Tickets
🟡 1352. Product of the Last K Numbers
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 387. First Unique Character in a String
🟡 918. Maximum Sum Circular Subarray
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- vi
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring
cd ~
vi test.md
Javoblar:🟢 2073. Time Needed to Buy Tickets
🟡 1352. Product of the Last K Numbers
#SDM
@khamidulla_inoyatov_microblog
🔥1
Day 074
Kun masalalari:
🟢 2535. Difference Between Element Sum and Digit Sum of an Array
🟡 2807. Insert Greatest Common Divisors in Linked List
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- env
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring
🟢 387. First Unique Character in a String
🟡 918. Maximum Sum Circular Subarray
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 2535. Difference Between Element Sum and Digit Sum of an Array
🟡 2807. Insert Greatest Common Divisors in Linked List
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- env
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring
cd ~
env PATH
env MY_VARIABLE="my_value"
Javoblar:🟢 387. First Unique Character in a String
🟡 918. Maximum Sum Circular Subarray
#SDM
@khamidulla_inoyatov_microblog
❤1👍1🔥1
Day 075
Kun masalalari:
🟢 2824. Count Pairs Whose Sum is Less than Target
🟡 919. Complete Binary Tree Inserter
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- printenv
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring
🟢 2535. Difference Between Element Sum and Digit Sum of an Array
🟡 2807. Insert Greatest Common Divisors in Linked List
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 2824. Count Pairs Whose Sum is Less than Target
🟡 919. Complete Binary Tree Inserter
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- printenv
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring
cd ~
env MY_VARIABLE="my_value"
printenv
Javoblar:🟢 2535. Difference Between Element Sum and Digit Sum of an Array
🟡 2807. Insert Greatest Common Divisors in Linked List
#SDM
@khamidulla_inoyatov_microblog
👍3
Day 076
Kun masalalari:
🟢 1662. Check If Two String Arrays are Equivalent
🟡 1877. Minimize Maximum Pair Sum in Array
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- screen
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring
🟢 2824. Count Pairs Whose Sum is Less than Target
🟡 919. Complete Binary Tree Inserter
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 1662. Check If Two String Arrays are Equivalent
🟡 1877. Minimize Maximum Pair Sum in Array
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- screen
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring
cd ~
screen
Javoblar:🟢 2824. Count Pairs Whose Sum is Less than Target
🟡 919. Complete Binary Tree Inserter
#SDM
@khamidulla_inoyatov_microblog
👍1
Day 077
Kun masalalari:
🟢 1021. Remove Outermost Parentheses
🟡 921. Minimum Add to Make Parentheses Valid
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- tmux
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring
🟢 1662. Check If Two String Arrays are Equivalent
🟡 1877. Minimize Maximum Pair Sum in Array
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 1021. Remove Outermost Parentheses
🟡 921. Minimum Add to Make Parentheses Valid
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- tmux
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring
cd ~
tmux
Javoblar:🟢 1662. Check If Two String Arrays are Equivalent
🟡 1877. Minimize Maximum Pair Sum in Array
#SDM
@khamidulla_inoyatov_microblog
👍1
Day 078
Kun masalalari:
🟢 1475. Final Prices With a Special Discount in a Shop
🟡 2390. Removing Stars From a String
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- mktemp
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring
🟢 1021. Remove Outermost Parentheses
🟡 921. Minimum Add to Make Parentheses Valid
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 1475. Final Prices With a Special Discount in a Shop
🟡 2390. Removing Stars From a String
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- mktemp
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring
cd ~
tempdir=$(mktemp -d)
echo "Created temporary directory: $tempdir"
cd $tempdir
touch day078.md
ls
cd -
Javoblar:🟢 1021. Remove Outermost Parentheses
🟡 921. Minimum Add to Make Parentheses Valid
#SDM
@khamidulla_inoyatov_microblog
👍4🔥1
Day 079
Kun masalalari:
🟢 589. N-ary Tree Preorder Traversal
🟡 173. Binary Search Tree Iterator
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- alias
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring
🟢 1475. Final Prices With a Special Discount in a Shop
🟡 2390. Removing Stars From a String
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 589. N-ary Tree Preorder Traversal
🟡 173. Binary Search Tree Iterator
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- alias
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring
cd ~
alias
alias ..='cd ..'
alias ...='cd ../../'
alias ll='ls -alF'
alias ls='echo Hello'
ls
\ls
Javoblar:🟢 1475. Final Prices With a Special Discount in a Shop
🟡 2390. Removing Stars From a String
#SDM
@khamidulla_inoyatov_microblog
🔥4👍1
Day 080
Kun masalalari:
🟢 682. Baseball Game
🟡 1381. Design a Stack With Increment Operation
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- unalias
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring
🟢 589. N-ary Tree Preorder Traversal
🟡 173. Binary Search Tree Iterator
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 682. Baseball Game
🟡 1381. Design a Stack With Increment Operation
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- unalias
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring
cd ~
alias ls='echo Hello'
ls
unalias ls
ls
Javoblar:🟢 589. N-ary Tree Preorder Traversal
🟡 173. Binary Search Tree Iterator
#SDM
@khamidulla_inoyatov_microblog
🔥2😁1
Day 081
Kun masalalari:
🟢 496. Next Greater Element I
🟡 503. Next Greater Element II
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- awk
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring
🟢 682. Baseball Game
🟡 1381. Design a Stack With Increment Operation
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 496. Next Greater Element I
🟡 503. Next Greater Element II
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- awk
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring
mktempd
echo "Magnus Carlson 2830" > players.txt
echo "
Fabiano Caruana 2780" >> players.txt
echo "Hikaru Nakamura 2780" >> players.txt
awk '{ print $1 }' players.txt
awk '/2780/' players.txt
Javoblar:🟢 682. Baseball Game
🟡 1381. Design a Stack With Increment Operation
#SDM
@khamidulla_inoyatov_microblog
👍1
Day 082
Kun masalalari:
🟢 1047. Remove All Adjacent Duplicates In String
🟡 1209. Remove All Adjacent Duplicates in String II
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- uniq
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring
🟢 496. Next Greater Element I
🟡 503. Next Greater Element II
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 1047. Remove All Adjacent Duplicates In String
🟡 1209. Remove All Adjacent Duplicates in String II
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- uniq
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring
mktempd
touch some.txt
echo "I am coding" >> some.txt
echo "I am coding" >> some.txt
echo "I am coding" >> some.txt
echo "I am coding" >> some.txt
echo "I am coding on Python" >> some.txt
uniq -c some.txt
uniq -d some.txt
Javoblar:🟢 496. Next Greater Element I
🟡 503. Next Greater Element II
#SDM
@khamidulla_inoyatov_microblog
Day 083
Kun masalalari:
🟢 2696. Minimum String Length After Removing Substrings
🟡 1963. Minimum Number of Swaps to Make the String Balanced
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- sort
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring
🟢 1047. Remove All Adjacent Duplicates In String
🟡 1209. Remove All Adjacent Duplicates in String II
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 2696. Minimum String Length After Removing Substrings
🟡 1963. Minimum Number of Swaps to Make the String Balanced
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- sort
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring
mktempd
touch fruits.txt
echo "apple" >> fruits.txt
echo "banana" >> fruits.txt
echo "apple" >> fruits.txt
echo "orange" >> fruits.txt
echo "banana" >> fruits.txt
echo "grape" >> fruits.txt
sort fruits.txt
sort fruits.txt | uniq
Javoblar:🟢 1047. Remove All Adjacent Duplicates In String
🟡 1209. Remove All Adjacent Duplicates in String II
#SDM
@khamidulla_inoyatov_microblog
👍2
Day 084
Kun masalalari:
🟢 1598. Crawler Log Folder
🟡 725. Split Linked List in Parts
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- pidof
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring
🟢 2696. Minimum String Length After Removing Substrings
🟡 1963. Minimum Number of Swaps to Make the String Balanced
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 1598. Crawler Log Folder
🟡 725. Split Linked List in Parts
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- pidof
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring
cd ~/
pidof Chrome
pidof bash
sudo kill -9 $(pidof Chrome)
Javoblar:🟢 2696. Minimum String Length After Removing Substrings
🟡 1963. Minimum Number of Swaps to Make the String Balanced
#SDM
@khamidulla_inoyatov_microblog
👍2
Day 085
Kun masalalari:
🟢 1544. Make The String Great
🟡 2. Add Two Numbers
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- flock
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring. Buning uchun
🟢 1598. Crawler Log Folder
🟡 725. Split Linked List in Parts
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 1544. Make The String Great
🟡 2. Add Two Numbers
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- flock
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring. Buning uchun
flock
komandasini ikkita terminalda ketma-ket ishga tushirin. Ikkinchi terminaldagi komanda ishlamasdan (ya’ni sleep bo’lmasdan) darrov tugatiladi. Birinchi terminaldagi sleep
tugaganidan keyin esa, ikkinchisini ishga tushirish mumkin bo’ladi. Agar boshqa file’ga (masalan, 1-terminalda /tmp/mylock
2-terminalda esa /tmp/another
) lock qilinsa, ikkalasini ham ishga tushirish mumkin.cd ~/
flock -n /tmp/mylock sleep 20
Javoblar:🟢 1598. Crawler Log Folder
🟡 725. Split Linked List in Parts
#SDM
@khamidulla_inoyatov_microblog
👍2
Day 086
Kun masalalari:
🟢 844. Backspace String Compare
🟡 445. Add Two Numbers II
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- watch
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
PS.
Javoblar:
🟢 1544. Make The String Great
🟡 2. Add Two Numbers
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 844. Backspace String Compare
🟡 445. Add Two Numbers II
O’qish uchun material:
*nix dagi quyidagi komanda bilan
man <command>
orqali tanishing:- watch
DIY:
*nix systemasda quyidagi komandalarni ketma-ket bajarib ko’ring.
cd ~/
watch -n 2 top
watch -n 2 'tail -n 10 /var/log/syslog'
PS.
watch
komandasidan chiqish uchun Ctrl+C
ishlatiladi.Javoblar:
🟢 1544. Make The String Great
🟡 2. Add Two Numbers
#SDM
@khamidulla_inoyatov_microblog
👍3