Algorithm By Mustafoev

https://leetcode.com/problems/contiguous-array birinchi prefix sumni yo'lini topgan bo'lsangiz O(N) uchun demak bu masalada ozroq o'zgartirish qilsangiz bo'ldi!

buni yechimini hali beraman bugungi uchun masalani yechavering https://leetcode.com/problems/subarray-sum-equals-k/

qoyil bir marotaba kodimni tanqid qilmadi!

Va bugungi masala https://leetcode.com/problems/find-all-anagrams-in-a-string/

Va bugungi masala https://leetcode.com/problems/find-all-anagrams-in-a-string/

Tepadagisini qanday yechgan bo'lsam bunisi ham shuni shabloni bilan faqat ozroq ishlov bersa bo'ldi! left, right degan o'zgaruvchilar va endi bitta sum o'sha windowni tutib turish uchun! public int minSubArrayLen(int target, int[] nums) { int left…

Va bugungi masala https://leetcode.com/problems/find-all-anagrams-in-a-string/

Uzr o'rtada uzilish bo'ldi to'g'riroq aytganda, yechimni fikrlatadigan qadamlar bilan post chiqarishga biroz erindim! buni ham ishlash yo'li tepadagi bilan bir xil shablonda ishlanadi! ikklasini birga yechimini beraman! bugungiga mana shu masala! https:/…

if

Va bugungi masala ham slide windowdan https://leetcode.com/problems/longest-substring-without-repeating-characters/

left++;

Uzr o'rtada uzilish bo'ldi to'g'riroq aytganda, yechimni fikrlatadigan qadamlar bilan post chiqarishga biroz erindim! buni ham ishlash yo'li tepadagi bilan bir xil shablonda ishlanadi! ikklasini birga yechimini beraman! bugungiga mana shu masala! https://leetcode.com/problems/minimum-size-subarray-sum/description/

Va bugungi masala ham slide windowdan https://leetcode.com/problems/longest-substring-without-repeating-characters/

Birinchi Slide Windowni ishlatishim uchun bir tomondan 2 ta left va right ga ketma-ket indexlarni saqladim! va sekinlik bilan chap tomondagi va o'ng tomondagini tekshirishni boshladim va agar o'ng tomondagi katta bo'ladigan bo'lsam profitni hisoblab oldingi bilan taqqoslab kattasini maxProfitga o'zlashtirdim va kichik bo'lsa demak chap tomondagini 1 tadan oshirib bordim va bu juda yaxshi Time O(N) demak yechim zo'r hammasini aylanishi uchun right < prices.length yetardi! va yechim int left = 0, right = 1; int maxProfit = 0; while (right < prices.length) { if(prices[left] < prices[right]) maxProfit = Math.max(maxProfit, prices[right] - prices[left]); else left++; right++; } return maxProfit; va right leftni kutib turmaydi left agar boshida qolib ketgan bo'lsa demak left boshida qolib ketdi va har safar right 1 tadan chegaraga yaqinlashib bormoqda! left ortda qolib ketsachi va right yetib oldi while ishini tugatdi! va [1,2,4,2,5,7,2,4,9,0,9] mana bu holatda sizni kodingiz 8 qaytardi va javob esa 9 edi xo'p kodni bir joyini to'g'irlasangiz va yechim 100%

Sliding Window mavzusida oson masala https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/

class Solution { public int maxArea(int[] height) { int left = 0, right = height.length - 1; int maxArea = 0; while (left < right) { int v1 = (right - left) * Math.min(height[left], height[right]); if(maxArea < v1) maxArea = v1; if (height[left] < height[right]) left++; else right--; } return maxArea; } }

Two Pointers bo'yicha ishlayapman! bugungi o'zimni masalam: https://leetcode.com/problems/container-with-most-water/description/

Men aslida LeetCode'da yoki shunga o'xshash platformalarda masala ishlashni dasturlashim uchun deb o'ylarkanman! Aslida, u hayotimdagi har qanday muammoga yechimni olib kirishim uchun analiz qilishni o'rgatarkan! Proyekt qurishimiz ham shunaqa-ku, ha, to'g'ri, lekin biz ko'pincha oldin ishlatgan narsamizni qaytarib qo'yishimiz ko'proq va bu kunlik miyaga davomli bosim bermasligi mumkin. Masala ishlash esa — doim kunlik, yangicha yo'llarni o'rganish orqali miyaga beriladigan davomli chiniqtirishdir!

HashMap — bu Java intervyusining "qiroli". Uni tushunmaslik — intervyudan yiqilish bilan teng. link