Day 146
Kun masalalari:
🟢 2540. Minimum Common Value
🟡 347. Top K Frequent Elements
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- git log
DIY:
Javoblar:
🟢 2248. Intersection of Multiple Arrays
🟡 2517. Maximum Tastiness of Candy Basket
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 2540. Minimum Common Value
🟡 347. Top K Frequent Elements
O’qish uchun material:
*nix dagi quyidagi komanda bilan
<command> --help
orqali tanishing:- git log
DIY:
git log
komandasini ishlatib, oxirgi commit’lar ro’yxatini ko’rishingiz mumkin: commit’ning hash kodi, kim tomonidan commit qilingan (user & e-mail address), qachon commit qilingan va commit xabari.Javoblar:
🟢 2248. Intersection of Multiple Arrays
🟡 2517. Maximum Tastiness of Candy Basket
#SDM
@khamidulla_inoyatov_microblog
👍2
Day 147
Kun masalalari:
🟢 441. Arranging Coins
🟡 105. Construct Binary Tree from Preorder and Inorder Traversal
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- git branch
DIY:
Qilayotgan gir proektingizdan
Javoblar:
🟢 2540. Minimum Common Value
🟡 347. Top K Frequent Elements
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 441. Arranging Coins
🟡 105. Construct Binary Tree from Preorder and Inorder Traversal
O’qish uchun material:
*nix dagi quyidagi komanda bilan
<command> --help
orqali tanishing:- git branch
DIY:
Qilayotgan gir proektingizdan
git branch
ni ishlatib, yangi branch ishga tushiring. Yangi branch da ekanligingizni git status
komandasi orqali tekshiring.Javoblar:
🟢 2540. Minimum Common Value
🟡 347. Top K Frequent Elements
#SDM
@khamidulla_inoyatov_microblog
👍1
Day 148
Kun masalalari:
🟢 1636. Sort Array by Increasing Frequency
🟡 648. Replace Words
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- git switch
DIY:
Proektingizda 2 ta yangi branch ishga tushirib, biridan ikkinchisiga
Javoblar:
🟢 441. Arranging Coins
🟡 105. Construct Binary Tree from Preorder and Inorder Traversal
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 1636. Sort Array by Increasing Frequency
🟡 648. Replace Words
O’qish uchun material:
*nix dagi quyidagi komanda bilan
<command> --help
orqali tanishing:- git switch
DIY:
Proektingizda 2 ta yangi branch ishga tushirib, biridan ikkinchisiga
git switch
komandasi orqali o’tib ko’ring.Javoblar:
🟢 441. Arranging Coins
🟡 105. Construct Binary Tree from Preorder and Inorder Traversal
#SDM
@khamidulla_inoyatov_microblog
👍2
Day 149
Kun masalalari:
🟢 2206. Divide Array Into Equal Pairs
🟡 208. Implement Trie (Prefix Tree)
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- git cat-file
DIY:
Proektingizdagi oxirgi commit’larni
Javoblar:
🟢 1636. Sort Array by Increasing Frequency
🟡 648. Replace Words
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 2206. Divide Array Into Equal Pairs
🟡 208. Implement Trie (Prefix Tree)
O’qish uchun material:
*nix dagi quyidagi komanda bilan
<command> --help
orqali tanishing:- git cat-file
DIY:
Proektingizdagi oxirgi commit’larni
git log
orqali o’rganib chiqing. Va eng oxirgi commit’ning hash’ini olib, uni git cat-file
bilan tekshirib ko’ring. Javoblar:
🟢 1636. Sort Array by Increasing Frequency
🟡 648. Replace Words
#SDM
@khamidulla_inoyatov_microblog
👍3
Day 150
Kun masalalari:
🟢 2570. Merge Two 2D Arrays by Summing Values
🟡 211. Design Add and Search Words Data Structure
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- git merge
DIY:
Git ni boshlaganimizdan beri, bir nechta branch’larni ishga tushirgan bo’lishingiz kerak 🙂. Bugun usha branchlardan oxirgisini main’ (asosiy) branch bilan ‘git merge’ komandasi yordamida birlashtirib ko’ring. (Ertaga git haqida qisqacha maqola tayyorlashga harakat qilaman)
Javoblar:
🟢 2206. Divide Array Into Equal Pairs
🟡 208. Implement Trie (Prefix Tree)
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 2570. Merge Two 2D Arrays by Summing Values
🟡 211. Design Add and Search Words Data Structure
O’qish uchun material:
*nix dagi quyidagi komanda bilan
<command> --help
orqali tanishing:- git merge
DIY:
Git ni boshlaganimizdan beri, bir nechta branch’larni ishga tushirgan bo’lishingiz kerak 🙂. Bugun usha branchlardan oxirgisini main’ (asosiy) branch bilan ‘git merge’ komandasi yordamida birlashtirib ko’ring. (Ertaga git haqida qisqacha maqola tayyorlashga harakat qilaman)
Javoblar:
🟢 2206. Divide Array Into Equal Pairs
🟡 208. Implement Trie (Prefix Tree)
#SDM
@khamidulla_inoyatov_microblog
👍1
Day 151
Kun masalalari:
🟢 2418. Sort the People
🟡 2374. Node With Highest Edge Score
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- git push
DIY:
Javoblar:
🟢 2570. Merge Two 2D Arrays by Summing Values
🟡 211. Design Add and Search Words Data Structure
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 2418. Sort the People
🟡 2374. Node With Highest Edge Score
O’qish uchun material:
*nix dagi quyidagi komanda bilan
<command> --help
orqali tanishing:- git push
DIY:
git push
komandasini ishlatib local repository’dagi barcha content’ni remote repository’ga yuklang. Javoblar:
🟢 2570. Merge Two 2D Arrays by Summing Values
🟡 211. Design Add and Search Words Data Structure
#SDM
@khamidulla_inoyatov_microblog
👍2
Day 152
Kun masalalari:
🟢 2255. Count Prefixes of a Given String
🟡 676. Implement Magic Dictionary
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- git checkout
DIY:
Javoblar:
🟢 2418. Sort the People
🟡 2374. Node With Highest Edge Score
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 2255. Count Prefixes of a Given String
🟡 676. Implement Magic Dictionary
O’qish uchun material:
*nix dagi quyidagi komanda bilan
<command> --help
orqali tanishing:- git checkout
DIY:
git checkout
komandasini bir qancha maqsadlar uchun ishlatsa bo’ladi. Shulardan biri - yangi branch ishga tushirib, unga o’tish. Yoki, ma’lum bir fayl’dagi o’zgarishlarni hammasini bekor qilib, asliga qaytarish. Siz yangi branch ishga tushib, unga o’tishni, va yana oldingi branch ga qaytishni tekshirib ko’ring: git checkout -b new_branch
va git checkout -
Javoblar:
🟢 2418. Sort the People
🟡 2374. Node With Highest Edge Score
#SDM
@khamidulla_inoyatov_microblog
👍1
Day 154
Kun masalalari:
🟢 1961. Check If String Is a Prefix of Array
🟡 739. Daily Temperatures
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- git remote
DIY:
Javoblar:
🟢 2255. Count Prefixes of a Given String
🟡 676. Implement Magic Dictionary
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 1961. Check If String Is a Prefix of Array
🟡 739. Daily Temperatures
O’qish uchun material:
*nix dagi quyidagi komanda bilan
<command> --help
orqali tanishing:- git remote
DIY:
git remote
komandasi yordamida sizning local repository’ingizga ulangan remote repository’larning ro’yxatini oling. Yangi remote repository’ qo’shing. Va uni nomini o’zgartirib ko’ring. Javoblar:
🟢 2255. Count Prefixes of a Given String
🟡 676. Implement Magic Dictionary
#SDM
@khamidulla_inoyatov_microblog
👍1🔥1
Day 154
Kun masalalari:
🟢 1779. Find Nearest Point That Has the Same X or Y Coordinate
🟡 973. K Closest Points to Origin
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- git clone
DIY:
Javoblar:
🟢 1961. Check If String Is a Prefix of Array
🟡 739. Daily Temperatures
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 1779. Find Nearest Point That Has the Same X or Y Coordinate
🟡 973. K Closest Points to Origin
O’qish uchun material:
*nix dagi quyidagi komanda bilan
<command> --help
orqali tanishing:- git clone
DIY:
git clone
komandasi yordamida remote repository’ni local directory’ga ko’chirib oling.Javoblar:
🟢 1961. Check If String Is a Prefix of Array
🟡 739. Daily Temperatures
#SDM
@khamidulla_inoyatov_microblog
👍2
Day 155
Kun masalalari:
🟢 35. Search Insert Position
🟡 1233. Remove Sub-Folders from the Filesystem
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- git fetch
DIY:
Javoblar:
🟢 1779. Find Nearest Point That Has the Same X or Y Coordinate
🟡 973. K Closest Points to Origin
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 35. Search Insert Position
🟡 1233. Remove Sub-Folders from the Filesystem
O’qish uchun material:
*nix dagi quyidagi komanda bilan
<command> --help
orqali tanishing:- git fetch
DIY:
get fetch
komandasini ishlatib, remote repository’dagi o’zgarishlarni o’zingizga ko’chirib oling. Javoblar:
🟢 1779. Find Nearest Point That Has the Same X or Y Coordinate
🟡 973. K Closest Points to Origin
#SDM
@khamidulla_inoyatov_microblog
👍1
Day 156
Kun masalalari:
🟢 2239. Find Closest Number to Zero
🟡 658. Find K Closest Elements
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- git pull
DIY:
Kechagi berilgan
Javoblar:
🟢 35. Search Insert Position
🟡 1233. Remove Sub-Folders from the Filesystem
#SDM
@khamidulla_inoyatov_microblog
PS. Kasal bo’lish mavsumi ochilgan ekan, bebaxra qolmadik. Sal sog’lig’imni tiklab olay, site’ni ham ishlatamiz. ‘Daily task’lar ham kechikib chiqdi… uzr.
Kun masalalari:
🟢 2239. Find Closest Number to Zero
🟡 658. Find K Closest Elements
O’qish uchun material:
*nix dagi quyidagi komanda bilan
<command> --help
orqali tanishing:- git pull
DIY:
Kechagi berilgan
git fetch
komandasi yordamida remote repository’ni o’zingizga ko’chirganingizdan so’ng, o’zgarishlarni manual, ya’ni qo’lda local repositoy’ga birlashtirishingiz kerak bo’ladi - git merge
komandasi yordamida. Bu 2 ta komandani o’rniga bitta - git pull
komandasini ishlatib, remote repository’dagi o’zgarishlarni ko’chirib, merge qilishingiz mumkin.Javoblar:
🟢 35. Search Insert Position
🟡 1233. Remove Sub-Folders from the Filesystem
#SDM
@khamidulla_inoyatov_microblog
PS. Kasal bo’lish mavsumi ochilgan ekan, bebaxra qolmadik. Sal sog’lig’imni tiklab olay, site’ni ham ishlatamiz. ‘Daily task’lar ham kechikib chiqdi… uzr.
👍2
Day 157
Kun masalalari:
🟢 66. Plus One
🟡 43. Multiply Strings
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- git rebase
DIY:
Javoblar:
🟢 2239. Find Closest Number to Zero
🟡 658. Find K Closest Elements
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 66. Plus One
🟡 43. Multiply Strings
O’qish uchun material:
*nix dagi quyidagi komanda bilan
<command> --help
orqali tanishing:- git rebase
DIY:
A←B←main
siz va do’stingiz shu repository’ni oldingiz. Do’stingiz sizdan oldin C
ni commit qildi. Siz esa sal keyinroq D
ni qo’shishingiz kerak. Buning uchun oldin A←B←C←main
ni qaytadan fetch qilib, C bilan D ni merge qilib A←B←(C+D)←M←main
qilishni o’rniga, git rebase
komandasini ishlatib, A←B←C←D’←main
ko’rinishiga keltiring.Javoblar:
🟢 2239. Find Closest Number to Zero
🟡 658. Find K Closest Elements
#SDM
@khamidulla_inoyatov_microblog
👍2
Day 158
Kun masalalari:
🟢 1. Two Sum
🟡 15. 3Sum
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- git rm
DIY:
Faylni remote repository’ va siz ishlayotgan local working directory’dan
Javoblar:
🟢 66. Plus One
🟡 43. Multiply Strings
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 1. Two Sum
🟡 15. 3Sum
O’qish uchun material:
*nix dagi quyidagi komanda bilan
<command> --help
orqali tanishing:- git rm
DIY:
Faylni remote repository’ va siz ishlayotgan local working directory’dan
git rm
komandasi yordamida o’chiring. git rm --chashed
yo’li bilan esa, faqat staging directory’dan o’chirish mumkin - buni ham o’zingizning sistemangizda tekshirib ko’ring. Javoblar:
🟢 66. Plus One
🟡 43. Multiply Strings
#SDM
@khamidulla_inoyatov_microblog
👍1
Day 159
Kun masalalari:
🟢 2006. Count Number of Pairs With Absolute Difference K
🟡 532. K-diff Pairs in an Array
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- git mv
DIY:
Agar proektdagi faylning nomini o’zgartirmoqchi bo’lsangiz, uni nomini linux ning
Javoblar:
🟢 1. Two Sum
🟡 15. 3Sum
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 2006. Count Number of Pairs With Absolute Difference K
🟡 532. K-diff Pairs in an Array
O’qish uchun material:
*nix dagi quyidagi komanda bilan
<command> --help
orqali tanishing:- git mv
DIY:
Agar proektdagi faylning nomini o’zgartirmoqchi bo’lsangiz, uni nomini linux ning
mv
komandasi yordamida o’zgartirib, keyin git add
qaytadan yangi fileni proektga qo’shishingiz kerak bo’ladi. Uni o’rniga git mv
ni ishlatib ko’ring!Javoblar:
🟢 1. Two Sum
🟡 15. 3Sum
#SDM
@khamidulla_inoyatov_microblog
👍2
Day 160
Kun masalalari:
🟢 2351. First Letter to Appear Twice
🟡 2023. Number of Pairs of Strings With Concatenation Equal to Target
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- git diff
DIY:
Remote repository’ga commit qilishdan avval o’zgarishlarni qaytadan ko’rib chiqish juda muhim ahamiyatga ega.
Javoblar:
🟢 2006. Count Number of Pairs With Absolute Difference K
🟡 532. K-diff Pairs in an Array
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 2351. First Letter to Appear Twice
🟡 2023. Number of Pairs of Strings With Concatenation Equal to Target
O’qish uchun material:
*nix dagi quyidagi komanda bilan
<command> --help
orqali tanishing:- git diff
DIY:
Remote repository’ga commit qilishdan avval o’zgarishlarni qaytadan ko’rib chiqish juda muhim ahamiyatga ega.
git diff
komandasi yordamida joriy directory’da/faylda qilingan o’zgarishlarni tekshirib ko’ring.Javoblar:
🟢 2006. Count Number of Pairs With Absolute Difference K
🟡 532. K-diff Pairs in an Array
#SDM
@khamidulla_inoyatov_microblog
👍1
Day 161
Kun masalalari:
🟢 2399. Check Distances Between Same Letters
🟡 877. Stone Game
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- git show
DIY:
Javoblar:
🟢 2351. First Letter to Appear Twice
🟡 2023. Number of Pairs of Strings With Concatenation Equal to Target
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 2399. Check Distances Between Same Letters
🟡 877. Stone Game
O’qish uchun material:
*nix dagi quyidagi komanda bilan
<command> --help
orqali tanishing:- git show
DIY:
git show
komandasidan foydalanib, oxirgi commit’ning yoki hash kodi bilan berilgan commit haqida batafsil ma’lumotni oling. Javoblar:
🟢 2351. First Letter to Appear Twice
🟡 2023. Number of Pairs of Strings With Concatenation Equal to Target
#SDM
@khamidulla_inoyatov_microblog
👍2
Day 162
Kun masalalari:
🟢 136. Single Number
🟡 137. Single Number II
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- git reset
DIY:
Local git repository da bir nechta yangi fayl xosil qilib, ularga o’zgarish kiriting. Endi esa
Javoblar:
🟢 2399. Check Distances Between Same Letters
🟡 877. Stone Game
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 136. Single Number
🟡 137. Single Number II
O’qish uchun material:
*nix dagi quyidagi komanda bilan
<command> --help
orqali tanishing:- git reset
DIY:
Local git repository da bir nechta yangi fayl xosil qilib, ularga o’zgarish kiriting. Endi esa
git reset
komandasi yordamida bu o’zgarishlarni bekor qiling. Hard va soft reset haqida o’rganing. Javoblar:
🟢 2399. Check Distances Between Same Letters
🟡 877. Stone Game
#SDM
@khamidulla_inoyatov_microblog
👍3
Day 163
Kun masalalari:
🟢 2293. Min Max Game
🟡 985. Sum of Even Numbers After Queries
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- git tag
DIY:
Tag’lar repository’ tarixini ko’rib chiqishda juda muhim ahamiyatga ega. Ko’p xollarda versiyani belgilash uchun, va usha versiya bo’yicha commit larni ko’rish uchun ishlatiladi. O’zingizning proektingiz uchun bir necha tag’larni yasab (masalan,
Javoblar:
🟢 136. Single Number
🟡 137. Single Number II
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 2293. Min Max Game
🟡 985. Sum of Even Numbers After Queries
O’qish uchun material:
*nix dagi quyidagi komanda bilan
<command> --help
orqali tanishing:- git tag
DIY:
Tag’lar repository’ tarixini ko’rib chiqishda juda muhim ahamiyatga ega. Ko’p xollarda versiyani belgilash uchun, va usha versiya bo’yicha commit larni ko’rish uchun ishlatiladi. O’zingizning proektingiz uchun bir necha tag’larni yasab (masalan,
git tag -a v1.0 -m “Version 1.0”
), ularni remote repository’ga qo’shib (git push origin tag_name
), usha tag lar orqali kerakli commit larni qidirib ko’ring (git show tag_name
). Javoblar:
🟢 136. Single Number
🟡 137. Single Number II
#SDM
@khamidulla_inoyatov_microblog
👍1
Day 164
Kun masalalari:
🟢 2706. Buy Two Chocolates
🟡 1130. Minimum Cost Tree From Leaf Values
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- git grep
DIY:
O’z proektingizda
Javoblar:
🟢 2293. Min Max Game
🟡 985. Sum of Even Numbers After Queries
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 2706. Buy Two Chocolates
🟡 1130. Minimum Cost Tree From Leaf Values
O’qish uchun material:
*nix dagi quyidagi komanda bilan
<command> --help
orqali tanishing:- git grep
DIY:
O’z proektingizda
git grep
komandasi yordamida, ma’lum bir so’zni qidirib ko’ring. Javoblar:
🟢 2293. Min Max Game
🟡 985. Sum of Even Numbers After Queries
#SDM
@khamidulla_inoyatov_microblog
👍1
Day 165
Kun masalalari:
🟢 566. Reshape the Matrix
🟡 2279. Maximum Bags With Full Capacity of Rocks
O’qish uchun material:
*nix dagi quyidagi komanda bilan
- git archive
DIY:
Ishlayotgan proektingizni zip yoki tar arxivini yasang:
Javoblar:
🟢 2706. Buy Two Chocolates
🟡 1130. Minimum Cost Tree From Leaf Values
#SDM
@khamidulla_inoyatov_microblog
Kun masalalari:
🟢 566. Reshape the Matrix
🟡 2279. Maximum Bags With Full Capacity of Rocks
O’qish uchun material:
*nix dagi quyidagi komanda bilan
<command> --help
orqali tanishing:- git archive
DIY:
Ishlayotgan proektingizni zip yoki tar arxivini yasang:
git archive --format=zip —output=archive.zip branch_name
Javoblar:
🟢 2706. Buy Two Chocolates
🟡 1130. Minimum Cost Tree From Leaf Values
#SDM
@khamidulla_inoyatov_microblog
👍1