Soundex Algoritmini bilaszmi?
Ikkita ingliz tili so'zlarni tovush buyicha bir xil yoki yaqin ekanligini aniqlaydigan algoritm.
Algoritm juda oson.
Albatta real proektlarda qullaniladi. (Ayni paytda whisperdaham qullayapmiz)
albatta o'zbekchada bu ancha murakkab.
Xullas
βSo'zdagi birinchi harf qoldiriladi.
βBarcha unli tovushlar so'zdan uchiriladi.
βKeyin har bitta harf quyidagicha o'zgartirishlar bilan saqlanadi.
b, f, p, v: 1
c, g, j, k, q, s, x, z: 2
d, t: 3
l: 4
m, n: 5
r: 6
keyin esa bir xil ketma ket keladigan raqamlar bittasiga almashadi.
Natijaviy satr esa faqat boshidagi 4 tasi olinadi.
Agar natijadagi satrda 4 tadan ko'p belgi qatnashsa oxiridan 0 lar qushiladi.
masalan
"tamom"->"tmm"->"t55"->t500
"tamon"->"tmn"->"t500"
demak bu so'zlar tovush jihatidan bir xil
Xo'sh siz bu algoritmni implementation qila olaszmi?
Ayni paytda bu algoritm O(N) dan ko'proq yoki O(N) va T(N) xotira egallamoqdi.
Loyihada tezlig juda muhim xo'sh siz bundanda tezroq algoritmda ishlay olaszmi?
Ikkita ingliz tili so'zlarni tovush buyicha bir xil yoki yaqin ekanligini aniqlaydigan algoritm.
Algoritm juda oson.
Albatta real proektlarda qullaniladi. (Ayni paytda whisperdaham qullayapmiz)
albatta o'zbekchada bu ancha murakkab.
Xullas
βSo'zdagi birinchi harf qoldiriladi.
βBarcha unli tovushlar so'zdan uchiriladi.
βKeyin har bitta harf quyidagicha o'zgartirishlar bilan saqlanadi.
b, f, p, v: 1
c, g, j, k, q, s, x, z: 2
d, t: 3
l: 4
m, n: 5
r: 6
keyin esa bir xil ketma ket keladigan raqamlar bittasiga almashadi.
Natijaviy satr esa faqat boshidagi 4 tasi olinadi.
Agar natijadagi satrda 4 tadan ko'p belgi qatnashsa oxiridan 0 lar qushiladi.
masalan
"tamom"->"tmm"->"t55"->t500
"tamon"->"tmn"->"t500"
demak bu so'zlar tovush jihatidan bir xil
Xo'sh siz bu algoritmni implementation qila olaszmi?
Ayni paytda bu algoritm O(N) dan ko'proq yoki O(N) va T(N) xotira egallamoqdi.
Loyihada tezlig juda muhim xo'sh siz bundanda tezroq algoritmda ishlay olaszmi?
π4β‘2π₯2
Forwarded from GDG Tashkent (Dostonkhon Ozodkhujaev)
#devfest #speaker
We start introducing you to our amazing speakers at DevFest Tashkent '23!
β
π¨βπ» Mark McDonald, TensorFlow & PaLM DevRel @ Google
π« Topic: "Getting Hands-on with MakerSuite and the PaLM API"
Mark is an Engineer & Advocate in Google's AI Developer Relations team. He works on making Google's ML software platforms and APIs a smooth experience for all developers, from new to advanced.
He has worked on a range of Google products, including the recent PaLM API launch, TensorFlow and even Santa Tracker.
π Date: November 25, 2023
π Time: 09:00 - 18:00
π Venue: Panorama Cinema Palace
π Get your FREE ticket today:
https://devfest.gdgtashkent.uz/
π See you at DevFest Tashkent '23!
@gdgtashkent
We start introducing you to our amazing speakers at DevFest Tashkent '23!
β
π¨βπ» Mark McDonald, TensorFlow & PaLM DevRel @ Google
π« Topic: "Getting Hands-on with MakerSuite and the PaLM API"
Mark is an Engineer & Advocate in Google's AI Developer Relations team. He works on making Google's ML software platforms and APIs a smooth experience for all developers, from new to advanced.
He has worked on a range of Google products, including the recent PaLM API launch, TensorFlow and even Santa Tracker.
π Date: November 25, 2023
π Time: 09:00 - 18:00
π Venue: Panorama Cinema Palace
π Get your FREE ticket today:
https://devfest.gdgtashkent.uz/
π See you at DevFest Tashkent '23!
@gdgtashkent
β€βπ₯5β‘2
Biror sonning ikkining darajasi ekanligini aniqlash uchun siz ....
Anonymous Poll
30%
sonni bir dan katta qolguncha 2 bulaman.
22%
birorta o'zgaruvchi e'lon qilib uni berilgan songachaga 2 ga ko'paytirib chiqaman
33%
pow tayor funksiyasidan foydalansam bulmaydimi π?
15%
Yuq men umuman boshqa usulda hisoblayman. Uni esa izohda yozaman
β‘4
```
python
from bisect import bisect_left, bisect, bisect_right if __name__ == "__main__": als = [1,8,55,555,690,744] print(bisect_left(als,56)) ``` Dastur qanday natija qaytaradi?
python
from bisect import bisect_left, bisect, bisect_right if __name__ == "__main__": als = [1,8,55,555,690,744] print(bisect_left(als,56)) ``` Dastur qanday natija qaytaradi?
Anonymous Quiz
33%
55
28%
56
33%
3
3%
2
3%
4
π2β‘1
Algo Vision
```
python
from bisect import bisect_left, bisect, bisect_right if __name__ == "__main__": als = [1,8,55,555,690,744] print(bisect_left(als,56)) ``` Dastur qanday natija qaytaradi?
python
from bisect import bisect_left, bisect, bisect_right if __name__ == "__main__": als = [1,8,55,555,690,744] print(bisect_left(als,56)) ``` Dastur qanday natija qaytaradi?
python
from bisect import bisect_left, bisect, bisect_right
if __name__ == "__main__":
als = [1,8,55,555,690,744]
print(bisect_left(als,56))
Dastur qanday natija qaytaradi?
π₯4
cpp
int main()
{
auto s = "Hello World";
return 0;
}
s o'zgaruvchisi qanday toifaga ega?
β‘7
β‘2π2
Qo'yidagilarni qaysi biri C# dasturlash tili uchun o'rinli emas?
Anonymous Quiz
10%
+ operatorini qayta yuklash
29%
+refleksiya
24%
+contract
38%
+new operatorini qayta yuklash
π3β‘2
Sizningcha HTML parserlar yane teglarni sinflari asosida yoki id lari asosida topib beruvchi dasturlar qo'yidagi DS qaysi birida realizatsiya qilinadi?
Anonymous Quiz
24%
Graphlar asosida
31%
Daraxtlar asosida
26%
Stack lar asosida
19%
Queuelar asosida
π1
Hey Haligacha kompyuter ustida utirib ishlayotgan yoki uqiyotganlar bormi?
π¨βπ»6β€βπ₯5
Yuqoridagi dastur qanday natija beradi?
Anonymous Quiz
4%
1\n773955
52%
true\n774955
27%
false\n773955
17%
true\n773955
π3
Yuqoridagi LINQ so'rovini natijasini aniqlang?
Nega? Izohlarda javoblaringizni yozib qoldiring
Nega? Izohlarda javoblaringizni yozib qoldiring
Anonymous Poll
8%
3
47%
red
33%
Exception throws
12%
Compile Time Error
π3
class Node:
def __init__(self, vl:any) -> None:
self.pNext = None
self.pPrev = None
self.data = vl
Real Interview Question: (Buni dasturlash tillariga aloqasi yuq)
Yuqorida ikki yoqlamali Boglangan ruyxat tuguni berilgan.
Qanday qilib?
O(1) Asimptotikada uning o'rtadagi elementini aniqlash mumkin?
π3