JavaScript || DSA
@JavaScriptQuiiz
324 subscribers
10 photos
1 file
67 links
Assalomu Alaykum:
Bu Kanalda Dasturlashga oid turli xil masalalar tashlab boriladi.

Bu Kanalni ochishdan maqsad masala ishlash ko'nikmasini oshirish. Masalalar asosan leetcode.com dan olinadi va tarjima qilinadi.

Takliflar: @abduhamid0v
Download Telegram
About
Blog
Apps
Platform
Join
JavaScript || DSA
324 subscribers
JavaScript || DSA
🟩πŸŸ₯Question #29 : Aksiyalarni sotib olish va sotish
🟦 Sizda narxlar arrayi berilgan, narxlar[i] esa i inchi kundagi berilgan aksiyani narxini bildiradi, Bitta aksiyani sotib olish uchun bir kunni tanlash va kelajakda ushbu aksiyani sotish uchun boshqa kunni tanlash orqali daromadingizni maksimal darajada oshirishni xohlaysiz. Ushbu tranzaksiyadan erishishingiz mumkin bo'lgan maksimal foydani qaytaring. Agar hech qanday foyda keltira olmasangiz, 0 ni qaytaring. avval sotib olib keyin sotish kumkin emas,


Input: narxlar = [7,1,5,3,6,4]
output: 5
Tarif: 2 - unda sotib olasiz [ narx = 1 ] va 5 inchi kunda sotasiz [narx = 6] , foyda 6 -1 = 5

Input: narxlar = [7,6,4,3,1]
Output: 0
tarif : bu yerda sotib olib, keyin sotish orqali hech qanday foyda olmaymiz, shuning uchun bu safar bozorga kirmasdan o'tamiz


Agar mobodo savol qiyinlik qilsa, internetdan izlab ko'rib javobini ko'rib, algorithmni qanday ishlashini tushunishga harakat qiling va shuni o'zingiz takroran ishlab ko'ring!!!

Leetcode dagi shu misol uchun muqobil link : click me

Commentariyada boshqalar bilan muhokama qiling, juda muhim



-> -> -> [ ! ] Javoblar link [ ! ] <- <- <-

O'zbekcha video || [O'qish] O'zbekcha || English video || [Reading] English

-> -> -> [ ! ] Javoblar kodi [ ! ] <- <- <-


javascript
code will be there


@JavaScriptQuiiz
LeetCode
Best Time to Buy and Sell Stock - LeetCode
Can you solve this real interview question? Best Time to Buy and Sell Stock - You are given an array prices where prices[i] is the price of a given stock on the ith day.

You want to maximize your profit by choosing a single day to buy one stock and choosing…
πŸ‘1
697 viewsedited  
JavaScript || DSA
🟩πŸŸ₯Question #30 : Ishoralarni tartiblang
🟦 Bizda Array berilgan va u teng qiymatdagi musbat va manfiy sonlardan tashkil topgan. Musbat va manfiy elementlarning nisbiy tartibini o'zgartirmasdan, siz navbatma-navbat musbat va manfiy qiymatlar qatorini qaytarishingiz kerak.


Input: ARR = [1,2,-4,-5]
output: [1, -4, 2, -5]

Input: ARR = [1,2,-3,-1,-2, 3]
Output: [1, -3, 2, -1, 3, -2]


Agar mobodo savol qiyinlik qilsa, internetdan izlab ko'rib javobini ko'rib, algorithmni qanday ishlashini tushunishga harakat qiling va shuni o'zingiz takroran ishlab ko'ring!!!

Leetcode dagi shu misol uchun muqobil link : click me

Commentariyada boshqalar bilan muhokama qiling, juda muhim



-> -> -> [ ! ] Javoblar link [ ! ] <- <- <-

O'zbekcha video || [O'qish] O'zbekcha || English video || [Reading] English

-> -> -> [ ! ] Javoblar kodi [ ! ] <- <- <-


javascript
code will be there


@JavaScriptQuiiz
LeetCode
Rearrange Array Elements by Sign - LeetCode
Can you solve this real interview question? Rearrange Array Elements by Sign - You are given a 0-indexed integer array nums of even length consisting of an equal number of positive and negative integers.

You should return the array of nums such that the…
833 views
JavaScript || DSA
🟩πŸŸ₯Question #31 : Keyingi leksikografik jihatdan kattaroq almashtirishni toping
🟦 Bizda array berilgan, a u integerlardan tashkil topgan, arrayni keyingi leksikografik kattaroq son ketma-ketligiga almashtiring, agar unday ketma-ketlik mavjud bo'lmasa, shunday keyingi arraydagi son eng kichik bo'lishi kerak,


Input: Arr = [1,3,2]
output: [2, 1, 3]
Tarif: [1,2,3] ning barcha almashtirishlari {{1,2,3} , {1,3,2}, {2,1,3} , {2,3,1} , {3,1,2} , {3,2,1}}. Shunday qilib, [1,3,2}]dan keyin keyingi almashtirish [2,1,3] dir.

Input: ARR = [3, 2, 1]
Output: [1, 2, 3]
Tarif: [1,2,3] ning barcha almashtirishlarini ko'rib turganimizdek, oxirgi turgan [3,2,1] ni topamiz. Shunday qilib, biz undan keyingi yani birinchi eng kichik almashtirishni qaytaramiz


Agar mobodo savol qiyinlik qilsa, internetdan izlab ko'rib javobini ko'rib, algorithmni qanday ishlashini tushunishga harakat qiling va shuni o'zingiz takroran ishlab ko'ring!!!

Leetcode dagi shu misol uchun muqobil link : click me

Commentariyada boshqalar bilan muhokama qiling, juda muhim



-> -> -> [ ! ] Javoblar link [ ! ] <- <- <-

O'zbekcha video [O'qish] O'zbekcha English video || [Reading] English

-> -> -> [ ! ] Javoblar kodi [ ! ] <- <- <-


javascript
code will be there


@JavaScriptQuiiz
LeetCode
Next Permutation - LeetCode
Can you solve this real interview question? Next Permutation - A permutation of an array of integers is an arrangement of its members into a sequence or linear order.

* For example, for arr = [1,2,3], the following are all the permutations of arr: [1,2…
558 viewsedited  
JavaScript || DSA
🟩πŸŸ₯Question #32 : Arraydagi yetakchilar
🟦 Array berilgan, yetakchi[leader] bo'lgan barcha elementlarni qaytaring, Lider - o'zining o'ng tomonidagi barcha elementlardan katta bo'lgan element hisoblanadi.


Input: Arr = [4, 7, 1, 0]
output: [7, 1, 0]
Tarif: shu uchta element o'ng tomonidagi barcha elementlarda katta

Input: ARR = [10, 22, 12, 3, 0, 6]
Output: [22, 12, 6]


Agar mobodo savol qiyinlik qilsa, internetdan izlab ko'rib javobini ko'rib, algorithmni qanday ishlashini tushunishga harakat qiling va shuni o'zingiz takroran ishlab ko'ring!!!

Leetcode dagi shu misol uchun shunga o'xshash link : click me

Commentariyada boshqalar bilan muhokama qiling, juda muhim



-> -> -> [ ! ] Javoblar link [ ! ] <- <- <-

O'zbekcha video [O'qish] O'zbekcha English video || [Reading] English

-> -> -> [ ! ] Javoblar kodi [ ! ] <- <- <-


javascript
code will be there


@JavaScriptQuiiz
LeetCode
Replace Elements with Greatest Element on Right Side - LeetCode
Can you solve this real interview question? Replace Elements with Greatest Element on Right Side - Given an array arr, replace every element in that array with the greatest element among the elements to its right, and replace the last element with -1.

After…
πŸ”₯3πŸ‘2πŸ‘1πŸ‘Ž1
578 viewsedited  
JavaScript || DSA
🟩πŸŸ₯Question #33 : Arraydagi eng uzun ketma-ketlik
🟦 Array berilgan, Siz ketma-ket elementlarni o'z ichiga olgan eng uzun ketma-ketlikning uzunligini topishingiz kerak.


Input: Arr =[100, 200, 1, 3, 2, 4]

output: 4
Tarif: Eng uzun ketma-ket ketma-ketlik 1, 2, 3 va 4.

Input: ARR = [3, 8, 5, 7, 6]
Output: 4
Tarif: Eng uzun ketma-ketlik 5, 6, 7, va 8.


Agar mobodo savol qiyinlik qilsa, internetdan izlab ko'rib javobini ko'rib, algorithmni qanday ishlashini tushunishga harakat qiling va shuni o'zingiz takroran ishlab ko'ring!!!

Leetcode dagi shu misol uchun shunga o'xshash link : click me

Commentariyada boshqalar bilan muhokama qiling, juda muhim



-> -> -> [ ! ] Javoblar link [ ! ] <- <- <-

O'zbekcha video [O'qish] O'zbekcha English video || [Reading] English

->
-> -> [ ! ] Javoblar kodi [ ! ] <- <- <-


javascript
code will be there


@JavaScriptQuiiz
LeetCode
Longest Consecutive Sequence - LeetCode
Can you solve this real interview question? Longest Consecutive Sequence - Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence.

You must write an algorithm that runs in O(n) time.

 

Example 1:


Input:…
πŸ”₯2
1.14K viewsedited  
JavaScript || DSA
Bugundan boshlab kunlik savollar ikkitani tashkil qiladi
πŸ‘Œ7πŸ‘1
624 viewsedited  
JavaScript || DSA
🟩πŸŸ₯Question #34 : Matritsani nollashtiring
🟦 Matritsa berilgan, agar har qanday elementi 0 ga teng bo'lsa, siz shu elementning ustun va qatorini barcha elementlarini 0 ga o'zgartiring va shu matritsani qaytaring.


Input: matrix=[[1,1,1],[1,0,1],[1,1,1]]
output: [[1,0,1],[0,0,0],[1,0,1]]
Tarif: Matritsa[2][2]=0 boΚ»lgani uchun. Shuning uchun 2-ustun va 2-qator 0 ga oΚ»rnatiladi.

Input: matrix=[[0,1,2,0],[3,4,5,2],[1,3,1,5]]
Output: [[0,0,0,0],[0,4,5,0],[0,3,1,0]]
Tarif: Matritsa[0][0]=0 va matritsa[0][3]=0. Shuning uchun 1-qator, 1-ustun va 4-ustun 0 ga o'rnatiladi.


Agar mobodo savol qiyinlik qilsa, internetdan izlab ko'rib javobini ko'rib, algorithmni qanday ishlashini tushunishga harakat qiling va shuni o'zingiz takroran ishlab ko'ring!!!

Leetcode dagi shu misol uchun shunga o'xshash link : click me

Commentariyada boshqalar bilan muhokama qiling, juda muhim



-> -> -> [ ! ] Javoblar link [ ! ] <- <- <-

O'zbekcha video || [O'qish] O'zbekcha || English video || [Reading] English

->
-> -> [ ! ] Javoblar kodi [ ! ] <- <- <-


javascript
code will be there


@JavaScriptQuiiz
LeetCode
Set Matrix Zeroes - LeetCode
Can you solve this real interview question? Set Matrix Zeroes - Given an m x n integer matrix matrix, if an element is 0, set its entire row and column to 0's.

You must do it in place [https://en.wikipedia.org/wiki/In-place_algorithm].

 

Example 1:

[…
πŸ”₯3😒1
1.24K viewsedited  
JavaScript || DSA
Faollikni oshiramiz bolalar!!!!
πŸ‘3⚑1πŸ‘Œ1
577 views
JavaScript || DSA
🟩πŸŸ₯Question #35 : Matritsani 90 gradusga aylantiring
🟦 Matritsa berilgan, shu matritsani 90 gradusga , qaysi yo'nalishda alyantirishi sizga bog'liq..


Input: matrix=[[1,2,3],[4,5,6],[7,8,9]]
output: [[7,4,1],[8,5,2],[9,6,3]]


Input: matrix=[[5,1,9,11],[2,4,8,10],[13,3,6,7],[15,14,12,16]]
Output: [[15,13,2,5],[14,3,4,1],[12,6,8,9],[16,7,10,11]]


Agar mobodo savol qiyinlik qilsa, internetdan izlab ko'rib javobini ko'rib, algorithmni qanday ishlashini tushunishga harakat qiling va shuni o'zingiz takroran ishlab ko'ring!!!

Leetcode dagi shu misol uchun shunga o'xshash link : click me

Commentariyada boshqalar bilan muhokama qiling, juda muhim



-> -> -> [ ! ] Javoblar link [ ! ] <- <- <-

O'zbekcha video || [O'qish] O'zbekcha || English video || [Reading] English

->
-> -> [ ! ] Javoblar kodi [ ! ] <- <- <-


javascript
code will be there


@JavaScriptQuiiz
LeetCode
Rotate Image - LeetCode
Can you solve this real interview question? Rotate Image - You are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise).

You have to rotate the image in-place [https://en.wikipedia.org/wiki/In-place_algorithm], which…
πŸ”₯2
980 viewsedited  
JavaScript || DSA
Savollar sonini yanada qisqartiramizmi, qiyinlik qilyaptimi ? βž• yoki βž–
Please open Telegram to view this post
VIEW IN TELEGRAM
πŸ”₯3😁2
670 views
JavaScript || DSA
🟩πŸŸ₯Question #36 : Matritsada spiral shaklda yuring
🟦 Matritsa berilgan, shu matritsani spiral tartib bilan qaytaring


Input: matrix=[
[1, 2, 3, 4],
[5, 6, 7, 8],
[9, 10, 11, 12],
[13, 14, 15, 16]
];
output: [1, 2, 3, 4, 8, 12, 16, 15, 14, 13, 9, 5, 6, 7, 11, 10]


Input: matrix=[
[1, 2, 3],
[4, 5, 6],
[7, 8, 9]
];
Output: [1, 2, 3, 6, 9, 8, 7, 4, 5]


Agar mobodo savol qiyinlik qilsa, internetdan izlab ko'rib javobini ko'rib, algorithmni qanday ishlashini tushunishga harakat qiling va shuni o'zingiz takroran ishlab ko'ring!!!

Leetcode dagi shu misol uchun shunga o'xshash link : click me

Commentariyada boshqalar bilan muhokama qiling, juda muhim



-> -> -> [ ! ] Javoblar link [ ! ] <- <- <-

O'zbekcha video || [O'qish] O'zbekcha || English video || [Reading] English

->
-> -> [ ! ] Javoblar kodi [ ! ] <- <- <-


javascript
code will be there


@JavaScriptQuiiz
LeetCode
Spiral Matrix - LeetCode
Can you solve this real interview question? Spiral Matrix - Given an m x n matrix, return all elements of the matrix in spiral order.

 

Example 1:

[https://assets.leetcode.com/uploads/2020/11/13/spiral1.jpg]


Input: matrix = [[1,2,3],[4,5,6],[7,8,9]]…
πŸ”₯1πŸ‘1
1.44K viewsedited  
JavaScript || DSA
Assalomu alaykum hammaga. So'ngi kunlarda obunachilar taklifiga binoan kunlik savollar soni 1 donaga qisqartirildi, shu haqida fikringiz qanday, o'zim o'ylashimcha juda sekin ketamiz, kamida ikkitadan savol ko'rish kerak har bir kun uchun, fikr va mulohazalaringizni shu post 'comment' bo'limiga yozishingiz yoki shaxsiyatingizni sir saqlagan holda ushbu bot orqali javob yo'llashingiz mumkin: botga link

Hurmat bilan admin!!!
πŸ‘4πŸ‘Œ2πŸ”₯1πŸ‘1
911 views
JavaScript || DSA
Hammaga Assalomu Alaykum, kanalda aktiv pasayib ketmoqda biz sababini bilmoqchimiz shuning uchun savollarni poll shaklida tashlaymiz, qo'limizdan kelguncha sizning muamollaringizni bartaraf etishga va sizga qulaylik yaratishga harakat qilamiz. Pollda aktiv bo'lishingizni so'rab qolamiz.
πŸ‘Œ3🀣1
961 views
JavaScript || DSA
Masalalar qiyinlik qilyabdimi ?

To'liqroq fikringizni bildirmoqchi bo'lsangiz comment bo'limi ochiq.
Anonymous Poll
71%
Ha
29%
Yo'q
52 voters1.34K views
JavaScript || DSA
Tajribangiz/Bilimingiz kamlik qilyabdimi ?
Anonymous Poll
69%
Ha
31%
Yo'q
πŸ‘1πŸ”₯1
67 voters1.49K views
JavaScript || DSA
Poll da javob berganlarga kattakon raxmat, ertaga hamma uchun optimal yechim o'ylab topishga harakat qilamiz!!!
πŸ‘2
1.37K views
JavaScript || DSA
🟩πŸŸ₯Question #37: Yig'indisi k ga teng bo'lag sub arraylar yig'indisini toping.
🟦Integer array va Integer k soni berilgan boβ€˜lsa, yigβ€˜indisi k ga teng boβ€˜lgan sub arraylar sonini qaytaring.

Example 1:
Input: N = 4, array[] = {3, 1, 2, 4}, k = 6
Output: 2

Example 2:
Input: N = 3, array[] = {1,2,3}, k = 3
Output: 2

-> -> -> [ ! ] Javoblar kodi [ ! ] <- <- <-


Masala qiyinlik qilsa "eee bu masala qiyin, ishlolmayman" demasdan google qilib ko'ring, qanday ishlash yo'llarini qidiring, bu sizning o'sishingizga ancha foyda beradi.

Leetcode dagi shu misol uchun shunga o'xshash link : click me

@JavaScriptQuiiz
LeetCode
Subarray Sum Equals K - LeetCode
Can you solve this real interview question? Subarray Sum Equals K - Given an array of integers nums and an integer k, return the total number of subarrays whose sum equals to k.

A subarray is a contiguous non-empty sequence of elements within an array.
…
πŸ”₯4
1.19K viewsedited  
JavaScript || DSA
🟩πŸŸ₯Pascal uchburchagini yaratish
🟦 Pascal uchburchagining 3 ta turiga oid muammolar mavjud. Ulari quyidagicha:

1-) Berilgan qator raqami r va ustun raqami c. Pascal uchburchagidagi (r, c) pozitsiyasidagi elementni chop eting.

2-) Berilgan qator raqami n. Pascal uchburchagining n-chi qatorini chop eting.

3-) Berilgan qatorlar soni n. Pascal uchburchagining birinchi n qatorini chop eting.

Pascal uchburchagida, har bir son o'zining ustida to'g'ri tomonidan o'rnalgan ikkita sonning yig'indisidan iborat.

Example 1:
Input: numRows = 5
Output: [[1],[1,1],[1,2,1],[1,3,3,1],[1,4,6,4,1]]

Example 2:
Input: numRows = 1
Output: [[1]]

-> -> -> [ ! ] Javoblar kodi [ ! ] <- <- <-


O'zbekcha manba: (To'ldiriladi.)
Englishcha manba: (To'ldiriladi.)

Masala qiyinlik "eee bu masala qiyin, ishlolmayman" demasdan google qilib ko'ring, qanday ishlash yo'llarini qidiring, bu sizning o'sishingizga ancha foyda beradi.(ramsda ko'rsatilgan)

Leetcode dagi shu misol uchun shunga o'xshash link : click me

@JavaScriptQuiiz
πŸ”₯3
1.17K viewsedited  
JavaScript || DSA
🟩πŸŸ₯Question #39: Ko'p sonlar(>N/3 times)
🟦 N o'lchamdagi butun sonlar massivi berilgan. N/3 dan ko'p marta paydo bo'lgan barcha elementlarni toping.

Example 1:
Input: nums = [3,2,3]
Output: [3]

Example 2:
Input: nums = [1]
Output: [1]

Example 3:

Input: nums = [1,2]
Output: [1,2]

-> -> -> [ ! ] Javoblar kodi [ ! ] <- <- <-


O'zbekcha manba: (To'ldiriladi.)
Englishcha manba: (To'ldiriladi.)

Masala qiyinlik "eee bu masala qiyin, ishlolmayman" demasdan google qilib ko'ring, qanday ishlash yo'llarini qidiring, bu sizning o'sishingizga ancha foyda beradi.(ramsda ko'rsatilgan)

Leetcode dagi shu misol uchun shunga o'xshash link: click me

@JavaScriptQuiiz
LeetCode
Majority Element II - LeetCode
Can you solve this real interview question? Majority Element II - Given an integer array of size n, find all elements that appear more than ⌊ n/3 βŒ‹ times.

 

Example 1:


Input: nums = [3,2,3]
Output: [3]


Example 2:


Input: nums = [1]
Output: [1]


Example…
⚑2πŸ”₯2
1.58K viewsedited  
JavaScript || DSA
🟩πŸŸ₯Question #40: 3Sum
🟦 Berilgan butun sonlar arrayi nums, i != j, i != k, va j != k shartlari bo'yicha nums[i] + nums[j] + nums[k] == 0 tengligiga ega bo'lgan barcha uchta tartibli juftliklar [nums[i], nums[j], nums[k]] qaytaring.

E'tiborga oling, yechim to'plami dublikatlarini o'z ichiga olmasligi kerak.

Example 1:
Input: nums = [-1,0,1,2,-1,-4]
Output: [[-1,-1,2],[-1,0,1]]

Example 2:
Input: nums = [0,1,1]
Output: []

Example 3:
Input: nums = [0,0,0]
Output: [[0,0,0]]

-> -> -> [ ! ] Javoblar kodi [ ! ] <- <- <-


O'zbekcha manba: (To'ldiriladi.)
Englishcha manba: (To'ldiriladi.)

Masala qiyinlik "eee bu masala qiyin, ishlolmayman" demasdan google qilib ko'ring, qanday ishlash yo'llarini qidiring, bu sizning o'sishingizga ancha foyda beradi.(ramsda ko'rsatilgan)

Leetcode dagi shu misol uchun shunga o'xshash link: click me

@JavaScriptQuiiz
LeetCode
3Sum - LeetCode
Can you solve this real interview question? 3Sum - Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.

Notice that the solution set must not contain…
⚑5πŸ‘1
1.74K viewsedited