LeetCode Solutions

Savol & Javob - Live Stream Manba: youtube.com/watch?v=xNUmFg94ZHY

“Let’s Crack It!” challengening 2-qismi 16-oktabr (dushanba) kunidan boshlanadi. Ungacha challengening 1-qismida register qilmagan bo’lsangiz @helpPeopleToGrow ga quyidagi ko’rinishda xabar yuboring: Let’s Crack It! Ism Familiya google pochtangiz To’rt haftalik problem solvingda haftasiga oltitadan masala ishlab boramiz va bu masalalar quyidagi mavzularga tegishli bo’ladi: - Graph theory - Bit manipulation - Arrays & Implementation - Strings - Two pointers - Greedy Note: 1-qismda register qilib biron marta qatnashmaganlar standingsdan chiqarib yuboriladi. Agar bu safar qatnashishni xohlasangiz avvalroqdan bu haqida yozib qo’ying. Have a nice weekend! 😉

GitHub repos for software engineering job interviews. Covers: — Algorithms — System design — Data structures, and more. 1. System-design-primer 2. Coding-interview-university 3. Interview 4. Tech-interview-handbook 5. Awesome-interview-questions original source

https://youtu.be/i53Gi_K3o7I?feature=shared #system_design

Coding tip by Alex Nguyen 0. Start with the naive solution. It shows you understand the problem. 1. Think out loud, even if it's quiet. It lets the interviewer help out if you get stuck. 2. Write your own test cases. Write at least 3 test cases to show you understand the problem. 3. Outline your algorithm on the IDE. It makes it easier for everyone to follow along. 4. Refer back to each step of your algorithm as you're coding. This shows you can walk the walk. 5. Dry run your code line by line against your test cases. Dont wait for the interviewer to ask you to do it. 6. Offer to optimize the algorithm. Point out the bottleneck first then explain what you need to do differently. 7. Solve for the running time. Solve it throughout your code then explain your nested for loop makes it O(n^2) 8. Use good variable names. Thing1 and thing2 aren't good things to write. 9. Abstract functions away. Don't spend the entire interview on a parsing function that isn't important to the algorithm 10. Do it for the interviewer. Keep checking in with the interviewer if they understand what's going on or if you need to walk them through your ideas. Doing 300+ leetcode questions will get you half way there The other half is presenting how much you know.

Bir dasturchi foydali deb topgan yo’l va resurslar har doim ham boshqalarga birdek ma’qul kelmasligi mumkin. Shuning uchun sizlarda ko'proq option paydo bo'lishi uchun “Let's Crack It!" challengening I, II haftalarida o’z hissasini qo'shgan Davlatbek Mirakilov ning DP ni o'rganish bo'yicha foydali deb topgan resurslarini share qilaman. Ulardan tashqari albatta “Introduction to algorithms” (ko’cha tilida CLRS) kitobiga ko'z yugurtishni maslahat beraman. Kitobning elektron versiyasini topishga qiynalsangiz @helpPeopleToGrow ga yozing, tashlab beriladi 😉 DP learning resources: 1) Cses fi book chapter 7 2) Usaco guide 3) Pavel Mavrin lectures (semester 1, lectures 10-13) DP practice for everyone: 1) Cses fi problemset - DP section 2) AtCoder DP contest 3) CF DP GYM (easier) 4) CF DP GYM (harder) 5) ACMP DP secton Leetcode and Interviewbit also have a bunch of DP tasks.

Yevropa bo’ylab Googlening ochiq Software Engineer ish o'rinlari: 🇩🇪Germany: 3ta 🇵🇱Poland: 52ta 🔥 🇬🇧United Kingdom (UK): 18ta 🇨🇭Switzerland (Zurich): 11ta 🇷🇴Romania: 13ta 🇮🇪Ireland, Dublin: 14ta 🇫🇷France: 4ta 🇳🇱Netherlands: 1ta Aynan hozirda Poland va Romaniaga topshirishni maslahat beraman 😉

“Lets Crack It!” bir oylik challengining summarysi: Har bir haftada bitta mavzu tanlanib, shu mavzuga doir 6 tadan masala ishlandi va live video editorial ko'rinishida tushuntirib berildi. Week 1 - Dynamic Programming I -> Edit Distance -> Best Time to But and Sell Stocks II -> Potions -> Min Jumps Array -> Rod Cutting -> Word Break Week 2 - Graph Theory -> Largest Distance Between Nodes of a Tree -> Clone Graph -> Water Flow -> Convert Sorted Tree to a Binary Search Tree -> Capture Regions on a Board -> Word Ladder Week 3 - Binary Search -> Search for a Range -> Painter’s Partition Problem -> Median of Array -> Allocate Books -> Implement Power Function -> Find a Peak Element Week 4 - Dynamic Programming II -> Intersecting Chords in a Circle -> Distinct Subsequences -> Longest Valid Parentheses -> Repeating Subsequence -> Submatrices With Sum Zero -> Increasing Path in Matrix Foydali deb topsangiz, do’stlaringiz va yaqinlaringizga ulashing! 😉 👉 @Code_With_Ulugbek 👈

Dynamic programming has two terms: "memoization" and "tabulation." These are techniques used to optimize recursive algorithms by storing and reusing computed results to avoid redundant calculations. 1. Memoization: — Memoization is an optimization technique used in dynamic programming to reduce redundant computations in recursive algorithms. — In a memoized algorithm, you store the results of expensive function calls and return the cached result when the same inputs occur again. Typically, a data structure like an array or dictionary (often called a "memoization table") is used to store computed results for specific inputs. — Memoization is particularly useful when solving problems using recursive algorithms with overlapping subproblems. 2. Tabulation: — Tabulation is another optimization technique in dynamic programming that involves solving a problem bottom-up by filling in a table or array iteratively. — In tabulation, you start with the simplest subproblems and gradually build up to the final problem by storing intermediate results in a table. — Tabulation is often used when you can define a clear order in which subproblems should be solved, and it doesn't require recursive function calls. — This technique is useful for problems where the recursive approach may lead to a large number of function calls and result in inefficient time or space complexity.

- Dynamic Programming FreeCodecamp course, Abdul Bari courses and Jenny's Lectures - DP patterns for Coding Interviews list - DP pattern for Coding Interviews video #dp #Interview #pattern

IOI links Official site: ioinformatics.org Former site: ioi.te.lv/index.shtml Statistics: stats.ioinformatics.org IOI regulations: ioinformatics.org/page/regulations/9 Future IOIs: - ioi2024.eg - ioi2025.bo - ioi2026.uz All tasks (with translations & editorials): 1. ioi.te.lv/contest/prev.shtml 2. ioinformatics.org/page/contests/10 3. acm.math.spbu.ru/trains/ioi (russian translations till 2014) Where to submit: 1. oj.uz/problems/source/22 2. ioi.contest.codeforces.com 3. dmoj.ca/problems/?category=5 Other useful links: oichecklist.pythonanywhere.com t.me/solvemprobler ioi syllabus - which topics&algorithms you should learn, and what you shouldn't: ioinformatics.org/files/ioi-syllabus-2023.pdf by Dilshodbek

Good News! Algo&DS bo'yicha nazariy bilimlarni ulashuvchi bir oylik “First Step" dasturi hozirda amalda. Endi esa coding qismiga qo’ldan kelgancha yordam berish maqsadida “Let's Crack It" dasturini e'lon qilaman. Dushanba (14-avgust) dan boshlab har kuni bittadan yangi misol linki google sheetsga qo’shib boriladi (faylni registratsiya qilgach ko’rasiz) va u faylda siz uchun maxsus row ajratiladi, shu rowda siz ishlagan kunlik misollaringizni belgilab natijangizni kuzatib borasiz. Har yakshanba kuni (20-avgustdan boshlab) live ko’rinishda bir haftalik masalalar uchun master class va Q&A bo’lib o’tadi, unda siz qiynalgan masalalarga yo’nalish beriladi va yechimlar tushuntirib beriladi. Bu dastur boshlanishiga 4 hafta davom etadi. Keyin esa natija va talablarga qarab uzaytirilishi mumkin. Dasturda qatnashish narxi: TEKIN Masalalar qiyinchiligi: Medium&Hard Qatnashmoqchi bo’lganlar @helpPeopleToGrow ga quyidagi ko’rinishda ma’lumot jo’nating: 1) gmail pochtangiz, aynan gmail kerak 2) ism va familiya

AWS is launching All Builders Welcome Grant to all technologists from underrepresented groups. The grant covers all your financial expenses related to AWS re:Invent conference in Las Vegas, US. Applications for the grant will close on September 1, 2023, so, hurry up! For more details, please visit https://reinvent.awsevents.com/community/all-builders-welcome

This is STEM program free to participate, organized by the Muslim Students Association at MIT.

👋 Hello, world! This is CS50's Telegram сhannel! 🚀 Here we'll explore the exciting world of computer science, programming, and technology. Stay up-to-date with CS50's latest news and events as well as connect with fellow classmates. We hope you'll make the most of this community by diving into CS50 and making a friend (or two!) along the way. See you around! 💻🔎🌐

Yaxshi yangilik: “First Step” nomli kichik dasturni boshlashga qaror qildim. U dasturda 4 hafta davomida algoritmlar va ma’lumotlar tuzilmalari (Algorithms & data structures) bilan tanishib ularga doir masalalar ishlashni o’rganamiz. Dasturni maqsadi: Dasturlashga endi kirib kelganlarni eng asosiy algoritmlar va ma’lumotlar tuzilmalari bilan tanishtirish, va bu qadamni tezlashtirishda yordam berish. Narxi: TEKIN 🙂 Qatnashishga talablar: 1) Biror dasturlash tilini o’rgangan bo’lish 2) Biror dasturlashga qiziqqan do’stingizni shu kanalga taklif qiling (ko’proq odam foyda olsin) Talablarni bajarganlar @helpPeopleToGrow ga qo’shgan odamingizni usernamei va resume (yoki o’zingiz to’g’risida info) bilan “First Step” titleda xabar jo’nating. Dasturga to’g’ri keladiganlar suxbat orqali tanlab olinadi. Deadline: July 31, 2023 Darslar August 2, 2023 da boshlanadi va zoom orqali olib boriladi.