Sharpen your coding skills with daily LeetCode challenges and algorithm lessons. 📚
* From beginners to advanced coders, join us for practical tips, tricks, and problem-solving strategies that will boost your programming journey✈️
#challenge🔥
* From beginners to advanced coders, join us for practical tips, tricks, and problem-solving strategies that will boost your programming journey
#challenge
Please open Telegram to view this post
VIEW IN TELEGRAM
⚡1👍1
Kunlik vazifalar nimalarda iborat?:
- 4 Leetcode problems (easy)
- Read Grokking Algorithms
- Study Plan 75
- Daily DSA
- Data structures
- Algoexpert algorithms
- dsalgo.uz
- NeoAlgo
- etc... (bunday ma'lumotlar ko'p)
- 4 Leetcode problems (easy)
- Read Grokking Algorithms
- Study Plan 75
- Daily DSA
- Data structures
- Algoexpert algorithms
- dsalgo.uz
- NeoAlgo
- etc... (bunday ma'lumotlar ko'p)
Google Docs
Crack The Coding Interview
⚡1👍1
Forwarded from Mustafoyev M.I🇺🇿💻
#leetcode
Leetcode.com saytida ma'lumot tuzilmalarini o'rganish uchun bir nechta card'lar
1. Array
2. Queue & Stack
3. Tree
4. Recursion & Memoization
5. D&C(Divide and Conquer) & Backtracking
6. Binary search
7. N-ary tree
8. Trie
9. Hash table
bepul va yaxshi tushuntirilgan. O'rgatilganlarni amaliyotda qo'llash uchun masalalar ham berilgan.
Leetcode.com saytida ma'lumot tuzilmalarini o'rganish uchun bir nechta card'lar
1. Array
2. Queue & Stack
3. Tree
4. Recursion & Memoization
5. D&C(Divide and Conquer) & Backtracking
6. Binary search
7. N-ary tree
8. Trie
9. Hash table
bepul va yaxshi tushuntirilgan. O'rgatilganlarni amaliyotda qo'llash uchun masalalar ham berilgan.
Leetcode
Account Login - LeetCode
Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.
Shu kitob asosida o'rganib boramiz.
Leetcode yechish boshlashdan oldin Data Structures haqida bilimlarimizni takrorlab olish zarar qilmaydi.
🇺🇿 : - https://youtu.be/WqrbIUggEXQ?si=Meor-uyGkHO0RuMo
#learn #resource
Leetcode yechish boshlashdan oldin Data Structures haqida bilimlarimizni takrorlab olish zarar qilmaydi.
#learn #resource
Please open Telegram to view this post
VIEW IN TELEGRAM
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 Shuhrat's blog
Big O notation
Big O notation - bu algoritm qanchalik tez ekanligini ko'rsatuvchi maxsus belgi. Big O Notation ni birnecha xil turlari bor. Bular:
1. O(1) - Constant time complexity
2. O(log n) - Logarithmic time complexity
3. O(n) - Linear time complexity
4. O(n log n) - Log-linear time complexity
5. O(n^2) - Quadratic time complexity
6. O(n^3) - Cubic time complexity
7. O(2^n) - Exponential time complexity
8. O(n!) - Factorial time complexity
Yuqoridagi belgilar algoritmga kiritilgan ma'lumotlarning hajmi bilan algoritm qancha vaqtda bajarilishini taxmin qilishga imkon beradi.
Ko'proq ma'lumot olish uchun: link
@shuhratbeks_blog
Big O notation - bu algoritm qanchalik tez ekanligini ko'rsatuvchi maxsus belgi. Big O Notation ni birnecha xil turlari bor. Bular:
1. O(1) - Constant time complexity
2. O(log n) - Logarithmic time complexity
3. O(n) - Linear time complexity
4. O(n log n) - Log-linear time complexity
5. O(n^2) - Quadratic time complexity
6. O(n^3) - Cubic time complexity
7. O(2^n) - Exponential time complexity
8. O(n!) - Factorial time complexity
Yuqoridagi belgilar algoritmga kiritilgan ma'lumotlarning hajmi bilan algoritm qancha vaqtda bajarilishini taxmin qilishga imkon beradi.
Ko'proq ma'lumot olish uchun: link
@shuhratbeks_blog
👍4⚡1
Daily Algo Boost | Challenge 🔥
How to use LeetCode effectively for Coding Interviews_.pdf
Kitobda yaxshi tip’lar keltirilgan ekan. Shulardan bazi muhumlari.
P.s) hzoirgina 20 masalaga 30 minut umrim ketdi va chotki yechim bulmadi😭
P.s) hzoirgina 20 masalaga 30 minut umrim ketdi va chotki yechim bulmadi
Please open Telegram to view this post
VIEW IN TELEGRAM
👍2⚡1
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/50 - Data structure (class, linked_list) - Misol yechish oldin bu kitobni tushunib, o'qib chiqish…
Tasklar haqiqatda biroz ko’payib ketibdi shekili🥲
O’lgurmanlar uchun ertaga 9 gacha yechib kurishga harakat qiling, va keyin o’z varyantlarimizda izohlarda musokara qilamiza 😉
O’lgurmanlar uchun ertaga 9 gacha yechib kurishga harakat qiling, va keyin o’z varyantlarimizda izohlarda musokara qilamiza 😉
👍3⚡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
Masalalarimizda kimda qanday yechimlar bo'lsa shu post izohida g'iybatlashamiz ) ⬇️
Please open Telegram to view this post
VIEW IN TELEGRAM
👍2🗿1