11-kun
Masala: 104. Maximum Depth of Binary Tree
Qiyinlik darajasi: Oson
Bizni kuzatishda davom eting
Telegram | Youtube
Masala: 104. Maximum Depth of Binary Tree
Qiyinlik darajasi: Oson
Bizni kuzatishda davom eting
Telegram | Youtube
Leetcode
Maximum Depth of Binary Tree - LeetCode
Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.
11-kun
Masala: 101. Symmetric Tree
Qiyinlik darajasi: Oson
Bizni kuzatishda davom eting
Telegram | Youtube
Masala: 101. Symmetric Tree
Qiyinlik darajasi: Oson
Bizni kuzatishda davom eting
Telegram | Youtube
LeetCode
Symmetric Tree - LeetCode
Symmetric Tree - Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).
Example 1:
[https://assets.leetcode.com/uploads/2021/02/19/symtree1.jpg]
Input: root = [1,2,2,3,4,4,3]
Output: true
Example…
Example 1:
[https://assets.leetcode.com/uploads/2021/02/19/symtree1.jpg]
Input: root = [1,2,2,3,4,4,3]
Output: true
Example…
Rekursiv funksiyalarni space complexity sini hisoblashga qiynalayabsizmi? Unda ushbu maqolani o'qib chiqishni maslahat beraman
Bizni kuzatishda davom eting
Telegram | Youtube
Bizni kuzatishda davom eting
Telegram | Youtube
⚡3👍1
Kun masalasi: 198. House Robber
Qiyinlik darajasi: O'rta
Bizni kuzatishda davom eting
Telegram | Youtube
Please open Telegram to view this post
VIEW IN TELEGRAM
LeetCode
House Robber - LeetCode
Can you solve this real interview question? House Robber - You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses…
12-kun
Masala: 226. Invert Binary Tree
Qiyinlik darajasi: Oson
Bizni kuzatishda davom eting
Telegram | Youtube
Masala: 226. Invert Binary Tree
Qiyinlik darajasi: Oson
Bizni kuzatishda davom eting
Telegram | Youtube
LeetCode
Invert Binary Tree - LeetCode
Can you solve this real interview question? Invert Binary Tree - Given the root of a binary tree, invert the tree, and return its root.
Example 1:
[https://assets.leetcode.com/uploads/2021/03/14/invert1-tree.jpg]
Input: root = [4,2,7,1,3,6,9]
Output:…
Example 1:
[https://assets.leetcode.com/uploads/2021/03/14/invert1-tree.jpg]
Input: root = [4,2,7,1,3,6,9]
Output:…
Please open Telegram to view this post
VIEW IN TELEGRAM
Masala yechimlarini qanday holatda yuklagan ma'qulroq?
Anonymous Poll
78%
Sifatliroq, rasmni fayl holatda
22%
Sifati ozgina past, lekin hajmi kichik, oddiy rasm holatida
👍1
Please open Telegram to view this post
VIEW IN TELEGRAM
Mana 12-kun uchun challenge ham tugadi. Sizda-chi? Yana 2 kun va biz bardavomlik bilan oz-ozdan har kuni qilgan mehnatimiz evaziga 1 ta nishon va 28 ta muammoga yechimni o'rgangan bo'lamiz. Umid qilamanki mana shu 28 ta yechimlardan foydalanib hali 100 lab boshqa muammolar uchun idealar keladi...
👍3
Kun masalasi: 1143. Longest Common Subsequence
Qiyinlik darajasi: O'rta
Bizni kuzatishda davom eting
Telegram | Youtube
Please open Telegram to view this post
VIEW IN TELEGRAM
LeetCode
Longest Common Subsequence - LeetCode
Can you solve this real interview question? Longest Common Subsequence - Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0.
A subsequence of a string is a new string generated…
A subsequence of a string is a new string generated…
Please open Telegram to view this post
VIEW IN TELEGRAM
O'zini sinab ko'rmoqchi bo'lganlar bormi?
Yuqoridagi dasturning:
1. Time complexity (Vaqt asimtotikasi)
2. Space complexity (Xotira murakkabligi)
larini kim birinchi to'g'ri topsasovg'a bor. Faqat iloji boricha to'liq javob berishga harakat qiling. 1 soat ichida bu musobaqa tugaydi. Sovg'a esa sir. (Lekin moshina emas 😂)
Yuqoridagi dasturning:
1. Time complexity (Vaqt asimtotikasi)
2. Space complexity (Xotira murakkabligi)
larini kim birinchi to'g'ri topsa
Javob quyidagi ko'rinishda bo'lishi kerak
1. O(N)
2. O(N + M)
Albatta bu javob emas!
1. O(N)
2. O(N + M)
Albatta bu javob emas!