This media is not supported in your browser
VIEW IN TELEGRAM
*I'm back ππ
π¬π§ Yesterday a certain number of new people joined the channel. Brief intro:
On this channel I try to explain Algorithms and Data Structures. Also, I solve the problems on LeetCode and analyze the solutions.π§βπ»
πΊπΏ Kecha bir nechta yangi odam qo'shilibdi. Shuning uchun kichkina tanishuv:
Bu blogda Algoritmlar, Ma'lumot Tuzilmalari va LeetCode-da masalalarni yechib, yaxshilab tushuntirishga harakat qilaman.π§βπ»
@leetcodin
On this channel I try to explain Algorithms and Data Structures. Also, I solve the problems on LeetCode and analyze the solutions.
Bu blogda Algoritmlar, Ma'lumot Tuzilmalari va LeetCode-da masalalarni yechib, yaxshilab tushuntirishga harakat qilaman.
@leetcodin
Please open Telegram to view this post
VIEW IN TELEGRAM
π₯11π4π1
π¬π§ Summary
Let me summarize what we covered so far and share the links to the posts one more time, so that it would be easier to navigate. I hope this will be useful for you.
1. 3 types of binary tree traversal.
2. Recursion. Theory.
3. Breaking the [bad] habit. Triggers.
4. Data Structure: Array.
5. Hashtable in Java. Inside out.
6. Data Structure: Linked list.
7. Data Structures: Stack and Queue.
8. Sorting Algorithms.
Thanks for reading this blog!βοΈ π
@leetcodin
Let me summarize what we covered so far and share the links to the posts one more time, so that it would be easier to navigate. I hope this will be useful for you.
1. 3 types of binary tree traversal.
2. Recursion. Theory.
3. Breaking the [bad] habit. Triggers.
4. Data Structure: Array.
5. Hashtable in Java. Inside out.
6. Data Structure: Linked list.
7. Data Structures: Stack and Queue.
8. Sorting Algorithms.
Thanks for reading this blog!
@leetcodin
Please open Telegram to view this post
VIEW IN TELEGRAM
Telegram
LeetCodin
π¬π§Binary Tree: Inorder Traversal
πΊπΏO'zbekchasi pastdaβ¬οΈ
Hi, guys! Thanks for your answers to the poll I shared yesterday. It's obvious that all data structures need to be overviewed and we will start from Binary Tree since it was the top choice.
I hopeβ¦
πΊπΏO'zbekchasi pastdaβ¬οΈ
Hi, guys! Thanks for your answers to the poll I shared yesterday. It's obvious that all data structures need to be overviewed and we will start from Binary Tree since it was the top choice.
I hopeβ¦
π7
πΊπΏ Summary
Bu postda men yozilgan mavzularga havolalarni qoldirmoqchiman. Maqsad - mavzularni tez topa olish. Siz uchun foydali bo'ladi degan umiddaman.
1. Binar daraxtni aylanib o'tishning 3 xili.
2. Rekursiya. Nazariya.
3. Breaking the [bad] habit. Triggerlar.
4. Ma'lumotlar tuzilmasi: Massiv.
5. Java-da Hashtable. To'liq tahlil.
6. Ma'lumotlar tuzilmasi: Linked list.
7. Ma'lumotlar tuzilmasi: Stack va Queue.
8. Saralash algoritmlari.
Shu blogni o'qib borayotganingiz uchun rahmat!βοΈ π
@leetcodin
Bu postda men yozilgan mavzularga havolalarni qoldirmoqchiman. Maqsad - mavzularni tez topa olish. Siz uchun foydali bo'ladi degan umiddaman.
1. Binar daraxtni aylanib o'tishning 3 xili.
2. Rekursiya. Nazariya.
3. Breaking the [bad] habit. Triggerlar.
4. Ma'lumotlar tuzilmasi: Massiv.
5. Java-da Hashtable. To'liq tahlil.
6. Ma'lumotlar tuzilmasi: Linked list.
7. Ma'lumotlar tuzilmasi: Stack va Queue.
8. Saralash algoritmlari.
Shu blogni o'qib borayotganingiz uchun rahmat!
@leetcodin
Please open Telegram to view this post
VIEW IN TELEGRAM
Telegram
LeetCodin
πΊπΏ Binary Tree: Inorder Traversal (Inorder aylanib o'tish usuli)
Hammaga salom! Kecha so'rovnomaga bergan javoblaringiz uchun rahmat. Ko'rinib turibdiki, barcha ma'lumotlar tuzilmalari ko'rib chiqilishi kerak va biz Binary Tree-dan boshlaymiz, chunki buβ¦
Hammaga salom! Kecha so'rovnomaga bergan javoblaringiz uchun rahmat. Ko'rinib turibdiki, barcha ma'lumotlar tuzilmalari ko'rib chiqilishi kerak va biz Binary Tree-dan boshlaymiz, chunki buβ¦
π19π₯3
π¬π§ 669. Trim a Binary Search Tree
π§βπ» Hi, guys! I haven't been posting regularly for about 3 weeks due to some reasons, but I didn't stop solving LeetCode problems. So, let's go and start with interesting Binary Search Tree problem.
π‘ Medium: 669. Trim a Binary Search Tree
π§βπ» My solution: Java 100% Faster | 0ms BFS + DFS Solution
Your task is to trim given tree such a way that only nodes with values between given range are kept.
Good luck!βοΈ π§
@leetcodin
π‘ Medium: 669. Trim a Binary Search Tree
Your task is to trim given tree such a way that only nodes with values between given range are kept.
Good luck!
@leetcodin
Please open Telegram to view this post
VIEW IN TELEGRAM
LeetCode
Trim a Binary Search Tree - LeetCode
Can you solve this real interview question? Trim a Binary Search Tree - Given the root of a binary search tree and the lowest and highest boundaries as low and high, trim the tree so that all its elements lies in [low, high]. Trimming the tree should notβ¦
π6β€1π1
πΊπΏ 669. Trim a Binary Search Tree
π§βπ» Hammaga salom! Regular tarzda post qilmaganimga 3 haftacha bo'libdi. Ammo LeetCode-dagi masalalarni har kuni yechayapman. Keling bugun Binar Qidiruv Daraxtiga oid masalani yechib ko'raylik.
π‘ O'rta daraja: 669. Trim a Binary Search Tree
π§βπ» Mening yechimim: Java 100% Faster | 0ms BFS + DFS Solution
Sizning vazifangiz berilgan diapazonga kiruvchi qiymatlarga ega tugunlarni qoldirish va qolganlarini olib tashlash.
Omad!βοΈ π§
@leetcodin
π‘ O'rta daraja: 669. Trim a Binary Search Tree
Sizning vazifangiz berilgan diapazonga kiruvchi qiymatlarga ega tugunlarni qoldirish va qolganlarini olib tashlash.
Omad!
@leetcodin
Please open Telegram to view this post
VIEW IN TELEGRAM
LeetCode
Trim a Binary Search Tree - LeetCode
Can you solve this real interview question? Trim a Binary Search Tree - Given the root of a binary search tree and the lowest and highest boundaries as low and high, trim the tree so that all its elements lies in [low, high]. Trimming the tree should notβ¦
π8
Forwarded from Sardor og'a | AI bilan rivojlanamiz
Media is too big
VIEW IN TELEGRAM
Asr SIRI ochildi!
PHPni orqasida kim turganligini bilarmidingiz?
Ustoz Qudrat Abdurahimov, bu sirni hammaga e'lon qildiπ
Gulla, yashna PHP!
PHPni orqasida kim turganligini bilarmidingiz?
Ustoz Qudrat Abdurahimov, bu sirni hammaga e'lon qildiπ
Gulla, yashna PHP!
π26π19π―2π2
Solving 1000 LeetCode problems - EASY!
If you read such a statement, don't believe it! π
π Today I'm celebrating 1000 LeetCode problems solved: a journey of dedication and growth! π
I am happy to share a significant milestone in my journey β I have successfully tackled 1000 challenging LeetCode problems! π This accomplishment has been the result of relentless dedication, countless early mornings, and a commitment to continuous growth.
π 400 Days of Consistency: Over the past 400 days, I made it a ritual to rise early and dedicate 1-2 hours daily to solving complex coding problems on LeetCode. This consistent effort has taught me the power of discipline and the incredible outcomes that can be achieved through small, focused actions over an extended period.
π‘ Lessons in Problem Solving: Each LeetCode problem I encountered was a unique puzzle, pushing me to think creatively, strategize meticulously, and embrace diverse problem-solving approaches. These challenges not only honed my technical skills but also enhanced my critical thinking and perseverance.
π What's Next: As I celebrate this achievement, I am excited to leverage the skills and insights gained to take on even greater challenges. My journey in the world of coding is far from over, and I'm eager to continue exploring, learning, and contributing to the ever-evolving tech landscape.
#leetcode #codingJourney #milestoneachieved #neverstoplearning #techgrowth #dsa #java #programming
If you read such a statement, don't believe it! π
π Today I'm celebrating 1000 LeetCode problems solved: a journey of dedication and growth! π
I am happy to share a significant milestone in my journey β I have successfully tackled 1000 challenging LeetCode problems! π This accomplishment has been the result of relentless dedication, countless early mornings, and a commitment to continuous growth.
π 400 Days of Consistency: Over the past 400 days, I made it a ritual to rise early and dedicate 1-2 hours daily to solving complex coding problems on LeetCode. This consistent effort has taught me the power of discipline and the incredible outcomes that can be achieved through small, focused actions over an extended period.
π‘ Lessons in Problem Solving: Each LeetCode problem I encountered was a unique puzzle, pushing me to think creatively, strategize meticulously, and embrace diverse problem-solving approaches. These challenges not only honed my technical skills but also enhanced my critical thinking and perseverance.
π What's Next: As I celebrate this achievement, I am excited to leverage the skills and insights gained to take on even greater challenges. My journey in the world of coding is far from over, and I'm eager to continue exploring, learning, and contributing to the ever-evolving tech landscape.
#leetcode #codingJourney #milestoneachieved #neverstoplearning #techgrowth #dsa #java #programming
π50π₯9β€7π€―6π5β‘3
π Milestone Alert! 1100 Problems Solved on LeetCode! π
π§ Today marks a special day as I've just cracked my 1100th problem on LeetCode! The journey to this point has been both challenging and rewarding.
π Stats Breakdown for the Last 100 Problems:
Easy: 9
Medium: 86
Hard: 5
This translates to 91% of the problems being medium or hard! π€
π My previous best was solving 81% of such questions, so this is a new personal record!
π Change in Strategy:
Starting from 1001th problem I decided to shift from solving 2 problems daily to just 1. The reasons?
1οΈβ£ The problems are getting tougher and need more time.
2οΈβ£ I'm also diving into other learning areas and need to balance my time.
Proud to share that I've been consistently solving problems on LeetCode for almost 500 days straight! ποΈββοΈ
This journey has been about growth, learning, and pushing boundaries. Here's to many more days of coding and problem-solving! π
LeetCode
#java #leetcode #coding #dsa #programming π₯π‘π
π§ Today marks a special day as I've just cracked my 1100th problem on LeetCode! The journey to this point has been both challenging and rewarding.
π Stats Breakdown for the Last 100 Problems:
Easy: 9
Medium: 86
Hard: 5
This translates to 91% of the problems being medium or hard! π€
π My previous best was solving 81% of such questions, so this is a new personal record!
π Change in Strategy:
Starting from 1001th problem I decided to shift from solving 2 problems daily to just 1. The reasons?
1οΈβ£ The problems are getting tougher and need more time.
2οΈβ£ I'm also diving into other learning areas and need to balance my time.
Proud to share that I've been consistently solving problems on LeetCode for almost 500 days straight! ποΈββοΈ
This journey has been about growth, learning, and pushing boundaries. Here's to many more days of coding and problem-solving! π
LeetCode
#java #leetcode #coding #dsa #programming π₯π‘π
π₯24π7β€1
π Yutuq E'loni! π LeetCode'da 1100 Muammo Yechdim! π
π§ Bugun maxsus kun, chunki LeetCode'da 1100-muammoni yechdim! Bu nuqtaga yetib kelishim o'ziga xos qiyinchiliklar va mukofotlar bilan to'la bo'lgan.
π Oxirgi 100 Muammo Bo'yicha Statistika:
Oson: 9
O'rtacha: 86
Qiyin: 5
Bu, muammolarning 91% o'rtacha yoki qiyin darajada ekanligini anglatadi! π€
π Oldingi eng yaxshi natijam bu turdagi savollarni 81% yechish bo'lgan, demak bu yangi shaxsiy rekord!
π Strategiyada O'zgarish:
Kuniga 2 ta muammo yechish o'rniga endi faqat 1 tasini yechishga qaror qildim. Sababi?
1οΈβ£ Muammolar tobora murakkablashmoqda va ko'proq vaqt talab etmoqda.
2οΈβ£ Shuningdek, boshqa o'quv sohalariga sho'ng'iyapman va vaqtimni muvozanatlashim kerak.
Aytib o'tishim lozim bo'lgan shuki, LeetCode'da deyarli 500 kun davomida uzluksiz muammolarni yechib kelmoqdaman! ποΈββοΈ
Bu safar o'sish, o'rganish va chegaralarni kengaytirish haqida bo'ldi. Kodlash va muammolarni yechishda ko'plab kunlarni kutib qolaman! π
LeetCode
#java #leetcode #coding #dsa #programming π₯π‘π
NB: Tarjimani ChatGPT4 bajardi ;)
π§ Bugun maxsus kun, chunki LeetCode'da 1100-muammoni yechdim! Bu nuqtaga yetib kelishim o'ziga xos qiyinchiliklar va mukofotlar bilan to'la bo'lgan.
π Oxirgi 100 Muammo Bo'yicha Statistika:
Oson: 9
O'rtacha: 86
Qiyin: 5
Bu, muammolarning 91% o'rtacha yoki qiyin darajada ekanligini anglatadi! π€
π Oldingi eng yaxshi natijam bu turdagi savollarni 81% yechish bo'lgan, demak bu yangi shaxsiy rekord!
π Strategiyada O'zgarish:
Kuniga 2 ta muammo yechish o'rniga endi faqat 1 tasini yechishga qaror qildim. Sababi?
1οΈβ£ Muammolar tobora murakkablashmoqda va ko'proq vaqt talab etmoqda.
2οΈβ£ Shuningdek, boshqa o'quv sohalariga sho'ng'iyapman va vaqtimni muvozanatlashim kerak.
Aytib o'tishim lozim bo'lgan shuki, LeetCode'da deyarli 500 kun davomida uzluksiz muammolarni yechib kelmoqdaman! ποΈββοΈ
Bu safar o'sish, o'rganish va chegaralarni kengaytirish haqida bo'ldi. Kodlash va muammolarni yechishda ko'plab kunlarni kutib qolaman! π
LeetCode
#java #leetcode #coding #dsa #programming π₯π‘π
NB: Tarjimani ChatGPT4 bajardi ;)
π26π24π₯11β€2
Please open Telegram to view this post
VIEW IN TELEGRAM
π25β€3π₯3
π‘ Medium: 1145. Binary Tree Coloring Game
π¨βπ» My solution: Java O(N) | 100% Faster Solution
π¨βπ» Task
In this LeetCode problem, you're playing a turn-based game on a binary tree:
- Players alternate coloring connected nodes, starting with Player 1 (red) and then Player 2 (blue).
- The game ends when neither player can color any more nodes.
- Your task is to determine if you, as Player 2, can choose a starting node that ensures you color more nodes than Player 1. Return true if possible, otherwise false.
π¨βπ» Solution
The idea of the solution is to count the number of all existing nodes, the number of nodes in the left subtree, and the number of nodes in the right subtree. These values will be stored in
n, l, and r respectively.And then, you have 3 cases when you can win:
- When the number of nodes in the left subtree is more than the rest:
l > n - l.- When the number of nodes in the right subtree is more than the rest:
r > n - r.- When the number of the chosen node and its children is less than the rest:
l + r + 1 < n - l - r - 1.To find the given node, you use the Depth First Search (DFS) method.
To find the number of nodes in the subtrees, you can also use DFS.
Good! Keep cracking the problems!
Cheers!
@leetcodin
Please open Telegram to view this post
VIEW IN TELEGRAM
LeetCode
Binary Tree Coloring Game - LeetCode
Can you solve this real interview question? Binary Tree Coloring Game - Two players play a turn based game on a binary tree. We are given the root of this binary tree, and the number of nodes n in the tree. n is odd, and each node has a distinct value fromβ¦
π2
π‘ O'rta daraja: 1145. Binary Tree Coloring Game
π¨βπ» Mening yechimim: Java O(N) | 100% Faster Solution
π¨βπ» Vazifa
Bu LeetCode masalasida, siz binar daraxtga asoslangan navbatma-navbat o'yin o'ynaysiz:
- O'yinchilar ulangan tugunlarni ranglashda navbatma-navbat ishtirok etishadi, avval 1-o'yinchi (qizil), so'ngra 2-o'yinchi (ko'k).
- Hech bir o'yinchi ko'proq tugunlarni ranglay olmaganda o'yin tugaydi.
- Sizning vazifangiz, 2-o'yinchi sifatida, 1-o'yinchidan ko'proq tugunlarni ranglaydigan boshlang'ich tugunni tanlash imkoniyatini aniqlash. Agar bu mumkin bo'lsa,
true qaytaring, aks holda false.π¨βπ» Yechim
Yechim g'oyasi barcha mavjud tugunlar sonini, chap pastki daraxtning tugunlari sonini va o'ng pastki daraxtning tugunlari sonini hisoblashdan iborat. Bu qiymatlar mos ravishda n, l va r da saqlanadi.
Va keyin, siz yutishingiz mumkin bo'lgan 3 ta holat mavjud:
- Chap pastki daraxtdagi tugunlar soni qolgandan ko'p bo'lganda:
l > n - l.- O'ng pastki daraxtdagi tugunlar soni qolgandan ko'p bo'lganda:
r > n - r.- Tanlangan tugun va uning bolalarining soni qolgandan kam bo'lganda:
l + r + 1 < n - l - r - 1.Berilgan tugunni topish uchun siz Chuqurlikka Birinchi Izlash [
findNode()] (DFS) usulidan foydalanishingiz mumkin.Pastki daraxtlardagi tugunlar sonini topish uchun ham [
countNodes()] DFS dan foydalanishingiz mumkin.Yaxshi! Masalalarni yechishda davom eting!
Omad!
@leetcodin
Please open Telegram to view this post
VIEW IN TELEGRAM
LeetCode
Binary Tree Coloring Game - LeetCode
Can you solve this real interview question? Binary Tree Coloring Game - Two players play a turn based game on a binary tree. We are given the root of this binary tree, and the number of nodes n in the tree. n is odd, and each node has a distinct value fromβ¦
π8β€1
Hammaga salom!
Blogda yangi misolni tanlash, tahlil qilish va post yozish mendan ko'p vaqt talab etayapti. Shuning uchun tajriba o'tkazib ko'rmoqchiman - yangi format kiritmoqchiman. Bu formatda regular tarzda nimalar o'rganganimni qisqacha yozib o'taman.
Bu formatni #progress deb atasam degan fikrdaman. Agar nomlash bo'yicha original fikrlaringiz bo'lsa - postning tagidagi izohlarga marhamat!
#progress
1. System design:
-
-
-
-
2. LeetCode
- https://leetcode.com/problems/reach-a-number - done β
@LeetCodin
Blogda yangi misolni tanlash, tahlil qilish va post yozish mendan ko'p vaqt talab etayapti. Shuning uchun tajriba o'tkazib ko'rmoqchiman - yangi format kiritmoqchiman. Bu formatda regular tarzda nimalar o'rganganimni qisqacha yozib o'taman.
Bu formatni #progress deb atasam degan fikrdaman. Agar nomlash bo'yicha original fikrlaringiz bo'lsa - postning tagidagi izohlarga marhamat!
#progress
1. System design:
-
Sharding qanday ishlashini high-level nazaridan o'rganib chiqdim;-
Caching strategy'lar qanday bo'lishini o'qidim;-
CQRS - bu nima savoliga javob topdim;-
Pull based va push based architecture'larning farqi nimada.2. LeetCode
- https://leetcode.com/problems/reach-a-number - done β
@LeetCodin
LeetCode
Reach a Number - LeetCode
Can you solve this real interview question? Reach a Number - You are standing at position 0 on an infinite number line. There is a destination at position target.
You can make some number of moves numMoves so that:
* On each move, you can either go leftβ¦
You can make some number of moves numMoves so that:
* On each move, you can either go leftβ¦
π25β€2
Hammaga salom!
#progress
1. System Design:
-
-
-
2. LeetCode:
- Weekly Contest'da birinchi marta qatnashdim va 4ta masaladan 3ta (1ta oson va 2ta o'rta qiyinlikdagi) masalani yechishga ulgurdim.
π Kirib kelayotgan Yangi 2024-yil muborak bo'lsin! π
P.S. Siz bugun qanday progress qildingiz?π€
@LeetCodin
#progress
1. System Design:
-
Cassandra va MongoDB'ning farqi va qaysi holatlarda ishlatilishi o'qib chiqdim - link-
Google Analytics kabi tizimini qanday qilib design qilish mumkin - link-
API Gateway va Load Balancer'ning farqi nimada? - link2. LeetCode:
- Weekly Contest'da birinchi marta qatnashdim va 4ta masaladan 3ta (1ta oson va 2ta o'rta qiyinlikdagi) masalani yechishga ulgurdim.
π Kirib kelayotgan Yangi 2024-yil muborak bo'lsin! π
P.S. Siz bugun qanday progress qildingiz?
@LeetCodin
Please open Telegram to view this post
VIEW IN TELEGRAM
MongoDB
Cassandra Vs MongoDB Comparison
Learn how Cassandra, a wide-column NoSQL database compares to MongoDB, the leading NoSQL database built on the document model.
π29β‘5π₯4
normuradov πΊπΏπ§βπ»π©πͺπ΅π±
Do you want to become my mentee?
For this year i want to bring one more person closer to me.
For this year i want to bring one more person closer to me.
Hammaga salom!
Mening ustozlarimdan biri, Farruh, o'ziga o'quvchi olmoqchi ekan! Tavsiya etaman - ko'p narsalar o'rganasiz!
https://t.me/fnormuradov
@LeetCodin
Mening ustozlarimdan biri, Farruh, o'ziga o'quvchi olmoqchi ekan! Tavsiya etaman - ko'p narsalar o'rganasiz!
https://t.me/fnormuradov
@LeetCodin
Telegram
normuradov πΊπΏπ§βπ»π©πͺπ΅π±
Software Engineer at Google β write about mindfulness for engineers, opinions my own
π13β€1
Hammaga salom! π
#progress
1. System Design:
- Youtube'da bitta zo'r System Design mock interview'ni topib oldim. Bu videoning zo'r tomoni shuki, interview olayotgan odam videoning oxirida o'zining feedback'ini beradi. Feedback'ning tuzilishi, qanday darajadan nimalar bilish va tushuntira olish kerakligini aytib o'tadi. Shu tarafdan juda ham foydali deb topdim. Havola -> Design Live Comments Feature: System Design Interview with a Meta Engineer
- Redis va Memcached cache'larning orasida nima farqlari bor. Va Google orqali topgan boshqa sahifalar.
2. LeetCode:
- Har kuni bittadan medium masalalarni yechishni davom etayapman.
P.S. Siz bugun qanday progress qildingiz?π€
@LeetCodin
#progress
1. System Design:
- Youtube'da bitta zo'r System Design mock interview'ni topib oldim. Bu videoning zo'r tomoni shuki, interview olayotgan odam videoning oxirida o'zining feedback'ini beradi. Feedback'ning tuzilishi, qanday darajadan nimalar bilish va tushuntira olish kerakligini aytib o'tadi. Shu tarafdan juda ham foydali deb topdim. Havola -> Design Live Comments Feature: System Design Interview with a Meta Engineer
- Redis va Memcached cache'larning orasida nima farqlari bor. Va Google orqali topgan boshqa sahifalar.
2. LeetCode:
- Har kuni bittadan medium masalalarni yechishni davom etayapman.
P.S. Siz bugun qanday progress qildingiz?
@LeetCodin
Please open Telegram to view this post
VIEW IN TELEGRAM
YouTube
Design Live Comments Feature: System Design Interview with a Meta Engineer
In this systems design mock interview, a Meta engineer asks the interviewee to design a live comments feature that displays new comments as they're posted without the need for refreshing or reloading the media content. This question is roughly on par withβ¦
β‘16π8π₯3β€1