Task #day_1
Bugungi vazifalarimiz:
- BigO (yozayotgan kodimiz tezligi aniqlash haqida aniq tushuncha hosil qilish)β
- Grokking Algorithms kitobini o'qish. 50/50
- Data structure (class, linked_list)
- Misol yechish oldin bu kitobni tushunib, o'qib chiqishβ
- Leetcode'da easy levelda 14, 20, 21 raqamdagi masalalarni yechish.
Bu tasklar vaqtida bugun kechgi 24:00 ga qadar bajarilishi zarur, shart, kerak akalar. (biroz challange'da uzimizni qiynab grow qilish zarur endi)βοΈ βοΈ βοΈ
p.s) Mavzular haqida biror foydali resurse bo'lsa izohda share qiling.
Bugungi vazifalarimiz:
- BigO (yozayotgan kodimiz tezligi aniqlash haqida aniq tushuncha hosil qilish)
- Grokking Algorithms kitobini o'qish. 50/50
- Data structure (class, linked_list)
- Misol yechish oldin bu kitobni tushunib, o'qib chiqish
- Leetcode'da easy levelda 14, 20, 21 raqamdagi masalalarni yechish.
Bu tasklar vaqtida bugun kechgi 24:00 ga qadar bajarilishi zarur, shart, kerak akalar. (biroz challange'da uzimizni qiynab grow qilish zarur endi)
p.s) Mavzular haqida biror foydali resurse bo'lsa izohda share qiling.
Please open Telegram to view this post
VIEW IN TELEGRAM
YouTube
Algoritmlar va Ma'lumot Tuzilmalari (To'liq Kurs)
Mundarija:
1. Kirish: Sonlar 00:00:00
2. Murakkablik 00:44:57
3. Array va String 01:11:46
4. Linked List 01:42:35
5. Hash Table 02:06:26
6. Queue va Stack 02:56:46
7. Rekursiya 03:31:22
8. Binary Search 04:02:38
9. Binary Tree 04:49:36
1. Kirish: Sonlar 00:00:00
2. Murakkablik 00:44:57
3. Array va String 01:11:46
4. Linked List 01:42:35
5. Hash Table 02:06:26
6. Queue va Stack 02:56:46
7. Rekursiya 03:31:22
8. Binary Search 04:02:38
9. Binary Tree 04:49:36
Daily Algo Boost | Challenge π₯
Grokking Algorithms
Please open Telegram to view this post
VIEW IN TELEGRAM
π3β‘1
Shu tartibda Leetcode problems list'ni sortβlab olib birma bir yechishni boshlaymiza. π₯
#day_1 uchun masalalar:
* 14. Longest Common Prefix
* 20. Valid Parentheses
* 21. Merge Two Sorted Lists
p.s) Bazida Leetcode'dan boshlab ketish qiyin bo'lishi mumkin, bu holatda CodeSignal ko'ring. Unda savolar biroz oson va yaxshi tushintirib berilgan (with animation)
#day_1 uchun masalalar:
* 14. Longest Common Prefix
* 20. Valid Parentheses
* 21. Merge Two Sorted Lists
p.s) Bazida Leetcode'dan boshlab ketish qiyin bo'lishi mumkin, bu holatda CodeSignal ko'ring. Unda savolar biroz oson va yaxshi tushintirib berilgan (with animation)
Please open Telegram to view this post
VIEW IN TELEGRAM
π5β‘1
Forwarded from Daily Algo Boost | Challenge π₯
Task #day_1
Bugungi vazifalarimiz:
- BigO (yozayotgan kodimiz tezligi aniqlash haqida aniq tushuncha hosil qilish)β
- Grokking Algorithms kitobini o'qish. 50/5
- Data structure (class, linked_list)
- Misol yechish oldin bu kitobni tushunib, o'qib chiqishβ
- Leetcode'da easy levelda 14, 20, 21 raqamdagi masalalarni yechish.
Bu tasklar vaqtida bugun kechgi 24:00 ga qadar bajarilishi zarur, shart, kerak akalar. (biroz challange'da uzimizni qiynab grow qilish zarur endi)βοΈ βοΈ βοΈ
p.s) Mavzular haqida biror foydali resurse bo'lsa izohda share qiling.
Bugungi vazifalarimiz:
- BigO (yozayotgan kodimiz tezligi aniqlash haqida aniq tushuncha hosil qilish)
- Grokking Algorithms kitobini o'qish. 50/5
- Data structure (class, linked_list)
- Misol yechish oldin bu kitobni tushunib, o'qib chiqish
- Leetcode'da easy levelda 14, 20, 21 raqamdagi masalalarni yechish.
Bu tasklar vaqtida bugun kechgi 24:00 ga qadar bajarilishi zarur, shart, kerak akalar. (biroz challange'da uzimizni qiynab grow qilish zarur endi)
p.s) Mavzular haqida biror foydali resurse bo'lsa izohda share qiling.
Please open Telegram to view this post
VIEW IN TELEGRAM
YouTube
Algoritmlar va Ma'lumot Tuzilmalari (To'liq Kurs)
Mundarija:
1. Kirish: Sonlar 00:00:00
2. Murakkablik 00:44:57
3. Array va String 01:11:46
4. Linked List 01:42:35
5. Hash Table 02:06:26
6. Queue va Stack 02:56:46
7. Rekursiya 03:31:22
8. Binary Search 04:02:38
9. Binary Tree 04:49:36
1. Kirish: Sonlar 00:00:00
2. Murakkablik 00:44:57
3. Array va String 01:11:46
4. Linked List 01:42:35
5. Hash Table 02:06:26
6. Queue va Stack 02:56:46
7. Rekursiya 03:31:22
8. Binary Search 04:02:38
9. Binary Tree 04:49:36
π4