27 Leetcode muammolari, bu texnik kodlash intervyularidan oldin o'ziga ishonchni oshiradi
Motivatsiya
Har qanday suhbatdan oldin, iloji boricha Leetcode muammolarini hal qilishga harakat qilish mumkin. Biroq, ushbu tayyorgarlik davrida suhbatdoshingiz o'ziga bo'lgan ishonchga salbiy ta'sir ko'rsatishi va suhbat natijalariga ta'sir qilishi mumkin bo'lgan bir nechta savollarni hal qilish/tushunishda qiynalayotgan vaziyatga duch kelishi mumkin. Ushbu maqolaning maqsadi suhbatdoshlarga keng doiradagi mavzularni o'z ichiga olgan savollar ro'yxatini taqdim etish va suhbatdoshlarga haqiqiy intervyuga kirishda o'zlarini ishonchli his qilishlariga yordam berishdir.
Eslatma: Quyidagi savollar ro'yxati Leetcode hamjamiyatining arizalarni qabul qilish darajasi asosida tanlanadi. Bu savollar direktorga mavzuni/naqshni tushunish/oʻzlashtirish imkonini beradi, bu yangi boshlanuvchilar uchun ham yaxshi. Qabul qilish darajasi yuqori bo'lgan muammolar odatda odamlar sevadigan mashhur fikrlash jarayonini o'z ichiga oladi.
Massiv
- Permutatsiyadan massiv yaratish (https://leetcode.com/problems/build-array-from-permutation/)
- Massivni birlashtirish (“https://leetcode.com/problems/concatenation-of-array/”)
- 1d massivning ishlayotgan summasi (“https://leetcode.com/problems/running-sum-of-1d-array/”)
String
4. Oʻnlik ikkilik raqamlarning minimal soniga boʻlinish (“https://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers/”)
5. Amaliyotlarni bajargandan keyin o'zgaruvchining yakuniy qiymati
(https://leetcode.com/problems/final-value-of-variable-after-performing-operations/)
6. Satrni aralashtirish (https://leetcode.com/problems/shuffle-string/)
Xesh jadvali
7. Yaxshi juftliklar soni (“https://leetcode.com/problems/number-of-good-pairs/”)
8. Javohirlar va toshlar (https://leetcode.com/problems/jewels-and-stones/)
9. Joriy raqamdan nechta raqam kichik (“https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/”)
Dinamik dasturlash
10. Fibonachchi raqami (https://leetcode.com/problems/fibonacci-number/)
11. Paskal uchburchagi (https://leetcode.com/problems/pascals-triangle/)
12. Zinadan ko‘tarilish (“https://leetcode.com/problems/climbing-stairs/”)
Tartiblash
13. Raqamlarni ajratgandan keyin to'rt xonali raqamning minimal yig'indisi (https://leetcode.com/problems/minimum-sum-of-four-digit-number-after-splitting-digits/)
14. Ikki juftlik orasidagi mahsulotning maksimal farqi (https://leetcode.com/problems/maximum-product-difference-between-two-pairs/)
15. Matritsadagi eng zaif K qator (“https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/”)
Chuqurlik-Birinchi qidiruv
16. Eng chuqur barglar summasi (https://leetcode.com/problems/deepest-leaves-sum/)
17. BST diapazoni summasi (https://leetcode.com/problems/range-sum-of-bst/)
18. Ikki ikkilik daraxtni birlashtiring (https://leetcode.com/problems/merge-two-binary-trees/)
Kenglik-Birinchi qidiruv
19. Orollar soni (https://leetcode.com/problems/number-of-islands/)
20. Shu daraxtning klonidagi ikkilik daraxtning mos keladigan tugunini toping (https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone- o'sha daraxtdan/)
21. Manbadan maqsadgacha bo'lgan barcha yo'llar (https://leetcode.com/problems/all-paths-from-source-to-target/)
Bog'langan ro'yxat
22. Nollar orasidagi tugunlarni birlashtirish (“https://leetcode.com/problems/merge-nodes-in-between-zeros/”)
23. Bog‘langan ro‘yxatdagi ikkilik sonni butun songa aylantirish (“https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/”)
24. Bog'langan ro'yxatdagi tugunni o'chirish (https://leetcode.com/problems/delete-node-in-a-linked-list/)
Orqaga qaytish
25. Barcha quyi to‘plam XOR jami yig‘indisi (“https://leetcode.com/problems/sum-of-all-subset-xor-totals/”)
26. Letter Tile Imkoniyatlari (https://leetcode.com/problems/letter-tile-possibilities/)
27. Kombinatsiya uchun iterator (https://leetcode.com/problems/iterator-for-combination/)
Umid qilamanki, savollar ro'yxati intervyu oldidan ishonchingizni sezilarli darajada oshiradi.
