🇺🇿
Menga yordamingiz kerak bo’lmoqda:

Qaysi mavzular haqida postlar yozishimni xohlaysiz?

🇺🇸
I need your help:

What topics do you want me to cover in future posts?

Agar narsalarni tartiblashda qiynalayotgan bo'lsangiz, bu 6 ta tartiblash algoritmidan foydalanib ko'ring:

1. Bubble tartiblash usuli. O(N ^ 2).

2. Selection tartiblash usuli. O(N ^ 2).

3. Kiritish orqali tartiblash usuli. O(N ^ 2).

4. Birlashtirish orqali tartiblash usuli. O(N * logN).

5. Tez tartiblash usuli. O(N * logN) dan O(N ^ 2) gacha.

6. Shell tartiblash usuli. O'rtacha - O(N ^ (3/2)).

@LeetCodin

Shell saralash algoritmi.Salom! Bugun yangi Shell saralash algoritmini ko'rib chiqaman.

😇 Github: ShellSort⏰ Time complexity:
O'rtacha - O(N ^ (3/2)),
Eng yomon holatda - O(N ^ 2)
🔎 Space complexity: O(1)

*🧑‍💻 *G'oya 🧑‍💻

Shell sort, uni 1959-yilda kashf etgan, Donald L. Shell-dan nomini olgan. Shell sort Kiritish orqali saralash usulining asosida ishlaydi. Kiritish orqali saralash algoritmida siz elementlarni faqat bir pozitsiyaga sura olasiz. Agar element massivning oxiridan boshiga joylashtirilishi kerak bo'lsa, siz ko'p swap operatsiyasini bajarasiz.

Shell sort algoritmining g'oyasi - bu uzoq masofada joylashgan elementlarni saralash. Bu algoritm orqali siz elementlarni h uzoqlikda saralangan qilasiz. Shu h-ning qiymati 1ga teng bo'lmagunicha uni kamaytiraverasiz. h uzoqlikda saralangan degani bir biridan h uzoqlikda joylashgan elementlarning har bir ro'yxatda saralangan holatda bo'lishi.

*🧑‍💻 *Algoritm 🧑‍💻

h = h * 3 + 1 -> bu Knuth-ning Interval ketma-ketliklar uchun formulasi.

1. Birinchi while loop berilgan massiv hajmi uchun to'g'ri h-ni topish uchun ishlatasiz.

2. Keyin esa nested loop ishlatasiz.
   - Birinchi tashqi while loop-ni h-ning qiymatini formula bo'yicha kamaytirish uchun ishlatasiz.
   - Ichki for loop-da esa Kiritish orqali saralash [Insertion sort] algoritmini h uzoqlikda joylashgan elementlar uchun ishlatasiz.
   - Ichki while loop Kiritish orqali saralashga o'xshab, h uzoqlikda joylashgan elementlar uchun katta elementlarni o'nga suradi va tanlangan elementni o'z joyiga qo'yadi.

Manbalar:
1. Data Structures and Algorithms in Java. R. Lafore.
2. Geeksforgeeks3. GIFRahmat!
Omad! ✌️😎

@LeetCodin

#Interview #Meta #Facebook

Hammaga salom!

Bugun Meta bilan bo'lgan interview tajribamni sizlar bilan ulashishni davom etmoqchiman.

Q&A:
Q: Shu savolga qanday javob berganingizni yozsangiz yaxshi boʻlar edi.
A: Shu payt bergan javobim so'zma-so'z esimda yo'q, ammo asosiy fikr ikkita:
1. Hozirgi ishlayotgan kompaniya menga juda yoqadi va kompaniya ichidagi muhit juda ham yaxshi degan edim.
2. Ammo Meta'dagi bo'lgan scale, challenge'lar, oxirgi texnologiyalar bilan ishlash meni professional sifatida rivojlanishimga va katta impact qila olishimga zo'r imkoniyat beradi deb aytganman.

Q: Davomi qani, Behzodbek?
A: :writes continuation: ?

Rekruter bilan gaplashgandan so'ng, ular ikkinchi bosqich, 1ta sessiya davomida 2ta masala yechiladigan technical interview, uchun menga qulay bo'lgan 3-5gacha 45 daqiqalik "oyna"larni yuborishimni so'rashdi. Men 5tasini email orqali yubordim.

Siz interview jarayonini boshlaganingizda sizda o'zingizning shaxsiy sahifangiz bo'ladi va shu sahifada kerak bo'lgan ma'lumotlar bor:
- Jarayonning qaysi bosqichida ekanligingiz.
- Keyingi interview qaysi kuni va soat nechada bo'lishi. Interview qiluvchi odamning ismlari ham bo'ladi.
- Tayyorlanish uchun kerak bo'lgan materiallar va boshqa sahifa va saytlarga havolalar ham bo'ladi.
- Xattoki, technical interview'da sizga uchrashi mumkin bo'lgan mavzular va masalalarning namunalari ham beriladi.

Men shularni ishlatgan holda va, albatta, LeetCode'dagi masalalarni ham olib tayyorlandim.

Esdan chiqarmang: Sizning asosiy maqsadingiz berilgan masalani faqatgina yecha olish emas, balki yechayotganingizda nima haqida o'ylayotganingizni ham to'g'ri muloqot qila olishdir. Boshqa so'zlar bilan aytganda, tayyorlanayotganingizda masalani xuddi kimdirga tushuntirmoqchi bo'lganingizdek yechishingiz kerak. Buning uchun LeetCode'dan masalani yechish paytida, qanday qilib yechmoqchisiz, qanday chek holatlar borligini va boshqa tafsilotlarni og'zaki aytib o'tishni o'rganishingiz lozim.

Davomi bor!

Omad! ?

@LeetCodin

#Storytime

I do remember times when I commited to solving LeetCode problems regularly.

Even if I was a developer with some experience, cracking LeetCode questions was really challenging.
When I just started I was sorting the list of the questions and taking easiest easy problems.
It took me more than 2 hours to find a solution for such questions.

Man, when I tried medium questions in the beginning, it was awful, catastrophe!
Some problems took one day or several days to crack! I was angry at myself!
I thought "Am I so helpless?" How on Earth other people a cracking these questions during interviews?!

During an interview one has a lot of stress, no IDE, someone is watching, you should verbally explain each step, and you have to tackle a medium problem (which was taking several hours at least) - all of this is overwhelmingly complicated.

But there was one thing I believed: one was able to do this and I can.
I was stubborn. I didn't want to admit that I can't do what other person can do.

And, as a result, still some questions take several hours to solve :D, but these are mostly hard problems.
Just kidding! Yes, it is much easier right now, I feel much more comfortable writing in browser, talking as I code, and, the most importantly, feeling more confident.

Peace!?✌️

@LeetCodin