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
Ko'plarni tavsiyasi bilan 42 - dagi kursni sekin boshlab oldik.
Yangi foydali ma'lumotlarini kanalda post qilib boramiz iloji boricha🚀
Yangi foydali ma'lumotlarini kanalda post qilib boramiz iloji boricha
Please open Telegram to view this post
VIEW IN TELEGRAM
👍7⚡1
Data structures and algorithms cheat sheet for interviews
Every interviewer asks about arrays hashmaps and trees and what is O notation access times to the item in those data structures
Every interviewer asks about arrays hashmaps and trees and what is O notation access times to the item in those data structures
⚡3
Forwarded from kamoloff.log
LeetCode VS Code extension
Man yoqtiradigan extensionlardan bittasi LeetCode.
U LeetCodedagi masalarni mani sevimli editorim VSCode da ishlash va submit qilish imkonini beradi.
Qulayliklari:
- O'zingizga qulay/tanish bo'lgan UI/theme
- Masalalarni qiyinlik darajasi, qaysidir tag yoki kompaniya bo'yicha filterlash mumkin.
Premiumsiz ham endi top kompaniyalarda eng ko'p so'raladigan masalalarni topishingiz mumkin.
Requirements:
- Node.js 10+
1. VSCode ni oching
2. Extensions dan LeetCode deb qidiring
3. Install
4. Extension orqali LeetCode accountingizga kiring
@kamoloff_log
Man yoqtiradigan extensionlardan bittasi LeetCode.
U LeetCodedagi masalarni mani sevimli editorim VSCode da ishlash va submit qilish imkonini beradi.
Qulayliklari:
- O'zingizga qulay/tanish bo'lgan UI/theme
- Masalalarni qiyinlik darajasi, qaysidir tag yoki kompaniya bo'yicha filterlash mumkin.
Premiumsiz ham endi top kompaniyalarda eng ko'p so'raladigan masalalarni topishingiz mumkin.
Requirements:
- Node.js 10+
1. VSCode ni oching
2. Extensions dan LeetCode deb qidiring
3. Install
4. Extension orqali LeetCode accountingizga kiring
@kamoloff_log
👍4