Google researching buyicha dunyoda birinchi urinda turadi. Butun dunyodagi barcha AI lar google kutubxonalari asosida ishlaydi lekin oxirgi vaqtlarda Gemìni ning natijalari Google taqdim etilgan vediorolikdan ancha pastroq?
Siz nima deb uylasz?
Nega Google pozitsiyasini boy bermoqda.

Turning Your Hands Into a Virtual Calculator: A Project in MediaPipe and OpenCV
Ever dreamed of turning your hands into a calculator? I recently tackled this project using MediaPipe and OpenCV, and it's been a blast!
I built a small virtual calculator that recognizes hand gestures. MediaPipe's hand tracking capabilities provided the foundation for detecting hand movements and positions. OpenCV, in turn, enabled me to visualize the hand tracking and overlay the virtual calculator interface.
This project is just the beginning. I'm excited to explore integrating Ultralytics models with virtual elements into Qt Group widgets, creating a more interactive and intuitive user experience. Imagine, for example, controlling your music player with hand gestures, or editing photos using virtual tools! The possibilities are truly endless.
What cool projects are you working on with gesture recognition technology? I'd love to hear your thoughts and connect with other developers!

Github Link

Bugun hammangizdan shunchaki support qilishningizni
surab qolaman.
Shogirdmiz MLSA’ga topshirmoqchi
Shunchaki Link ka kirib. bir ikki bulimni uqib chiqing!
O'tkazib yuborsizham mayli.

Yaxshiyam Linuxda ekanman. Ishlab turibdi.
😂😂

ChatGPT kod yozishda adashib NULL xotiraga murojaat qilgandek.
Shunday katta kompaniya nahotki testlash tizimlari mavjud bulmasa .

PS:Ertagayoq America Qo'shma Shtatlari ....si chiqib C/C++ voz kechishimizni surab qoladi 😄
#CrowdStrike

Yandex aynan Toshkentda Backend dasturchilar uchun stajirovka ochgani haqida xabariz bormi?
Stajirovkaga istalgan dasturlash tili bn kirish mumkin.

🇺🇿 Happy Independence Day, Uzbekistan!

Today, on September 1st, we celebrate the 33rd anniversary of our country's independence! This day reminds us of the importance of freedom, unity, and the pursuit of prosperity. We take pride in our rich cultural heritage, hardworking people, and the progress Uzbekistan continues to make as it secures its rightful place on the global stage.

Wishing all my fellow citizens peace, prosperity, and continued success! May our nation thrive, and may each of us contribute to its bright future.

Happy Independence Day, Uzbekistan! 🇺🇿

Keep pushing boundaries, debugging, and building the future one line of code at a time.

Loyihada arxitektura juda ko'pgina narsani hal qilishi mumkin.
Yomon tuzilgan arxitektura keyinchalik muammolar keltirib chiqaradi.
Jamoa productivligini tushurishi mumkin.
Imkon qadar code yozishdan oldin loyihani qay darajada kengayishini oldindan bilib ushanga mos arxitektura tanlash kerak.

Yandex O'zbekiston uchun ish amaliyotini e'lon qilgan.
Tezroq shu loyihadan kirib ruyxatdan o'ting.

Завтра жду вас

А где вы ?

Graflar nazariyasi asosida tuzilgan.
Yandex Go dagi avtomobilni biriktirish tizimi

Super puper kod deb shunga aytishadi.

What is a Priority Queue?

Prioritetga ega bulgan navbat.
Navbat - bu oddiy hayotdagi navbat . Dasturlashdagi navbat xuddi
hayotdagi navbatga asoslanib ishlaydi.
Masalan kim birinchi kelsa unga birinchi xizmat kursatilishi kerak.
Bu prinsip FIFO (First In First Out) deyiladi.

Endi esa prioritet tushunchasini tushuntirishga harakat qilaman.

Aytaylik navbatda ko'pchilik turishibdi. Lekin navbat endi oldingidek birinchi kelganga birinchi xizmat kursatish qoidasi ishlamaydi.
Masalan yoshi kattalarga oldin xizmat kursatiladi.
Yoki aytaylik nogironligi bor odamlarga.
Yoki qupolroq bulsada o'zini qarindoshlariga mansabdor shaxslarga ....
Ana shunda odamning yoshi, nogironligi, mansabi ... prioritet hisoblanadi.

Bu maxsus Malumotlar strukturasi hisoblanadi. Demak deyarli barcha dasturlash tillarida uning shablon(Generic) kurinishi mavjud.

Xo'sh bu malumotlar strukturasi o'zi nimasi buyicha effectiv bulishi kerak?
Bu oddiy massivlar asosida tuzilmaydi. shu sabab oddiy navbatdan farq qiladi.

Demak prioritet buyicha malumot qushish (push) O(logN)
Prioritet buyicha malumot olish (top) O(1)
va Prioritet buyicha malumotni o'chirish ham O(logN)

Bugun leetcode ga qarab bular esimga tushdi shunchaki bulishdm.

You are given a 0-indexed integer array nums and an integer k. You have a starting score of 0.

In one operation:

choose an index i such that 0 <= i < nums.length,
increase your score by nums[i], and
replace nums[i] with ceil(nums[i] / 3).

Return the maximum possible score you can attain after applying exactly k operations.

The ceiling function ceil(val) is the least integer greater than or equal to val.

Agar yaxshiroq etibor bersak biz maksimal summa yigishimiz uchun har doim eng maksimal elementni olib keyin uni
ceil(a/3) qismiga o'zgartirishimiz kerak.
Lekin chegaraga qarasak n,k<=10^5
demak k = 10^5 bulsa va massivda ham shuncha element bulsa
biz har bir marta eng katta elementni topishimiz kerak O(n)
agar bu ishni k marta amalga oshirsak k*n=n^2 bu esa 10^10 buladi.
Urtacha SHK zamonaviy protsessori sekundiga 10^6~10^7 amal bajaradi.
10^10/10^7=10^3 sekund vaqt kerak buncha amalni bajarish uchun.

Ana shunda bizga (Heap yokin Binary Heapga asoslangan) Priority Queue yordamga keladi.
Biz maksimal elementni prioritet deb olsak demak K marta maksimal elementni olish uchun O(K*LOGN) amal kerak.
Bu maksimum 10^5*LOG10^5 =~10^6 amal

class Solution {
public:
    long long maxKelements(vector<int>& nums, int k) {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
        
        std::priority_queue<int> queue;
        for(const auto& num: nums){
            queue.push(num);
        }
        
        long long sum = 0;
        while(k--){
            sum += static_cast<long long> (queue.top());
            auto cur = std::ceil(queue.top() / 3.0);
            queue.pop();
            queue.push(cur);
        }
        return sum;
    }
};

Qolgan dasturlash tillaridaham xuddi shu tarzda buladi (Deyarli barchasida Priority_Queue bor)