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!
Natijalarga qarab bilish mumkinki, @Jaloliddin_Abdurahmonov aka g'olib bo'ldilar. Sovg'a bitta lavash puli edi. Keyingi sovg'ali quizlarga befarq qaramang π. Jaloliddin akani esa yana bir bor tabriklaymiz.
Please open Telegram to view this post
VIEW IN TELEGRAM
π7π₯3π3π1
13-kun
Masala: 700. Search in a Binary Search Tree
Qiyinlik darajasi: Oson
Bizni kuzatishda davom eting
Telegram | Youtube
Masala: 700. Search in a Binary Search Tree
Qiyinlik darajasi: Oson
Bizni kuzatishda davom eting
Telegram | Youtube
Leetcode
Search in a Binary Search 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.
Please open Telegram to view this post
VIEW IN TELEGRAM
13-kun
Masala: 701. Insert into a Binary Search Tree
Qiyinlik darajasi: O'rta
Bizni kuzatishda davom eting
Telegram | Youtube
Masala: 701. Insert into a Binary Search Tree
Qiyinlik darajasi: O'rta
Bizni kuzatishda davom eting
Telegram | Youtube
Leetcode
Insert into a Binary Search 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.
Please open Telegram to view this post
VIEW IN TELEGRAM
Kun masalasi: 232. Implement Queue using Stacks
Qiyinlik darajasi: Oson
Bizni kuzatishda davom eting
Telegram | Youtube
Please open Telegram to view this post
VIEW IN TELEGRAM
LeetCode
Implement Queue using Stacks - LeetCode
Can you solve this real interview question? Implement Queue using Stacks - Implement a first in first out (FIFO) queue using only two stacks. The implemented queue should support all the functions of a normal queue (push, peek, pop, and empty).
Implementβ¦
Implementβ¦
14-kun
Masala: 98. Validate Binary Search Tree
Qiyinlik darajasi: O'rta
Bizni kuzatishda davom eting
Telegram | Youtube
Masala: 98. Validate Binary Search Tree
Qiyinlik darajasi: O'rta
Bizni kuzatishda davom eting
Telegram | Youtube
LeetCode
Validate Binary Search Tree - LeetCode
Validate Binary Search Tree - Given the root of a binary tree, determine if it is a valid binary search tree (BST).
A valid BST is defined as follows:
* The left subtree of a node contains only nodes with keys less than the node's key.
* The right subtreeβ¦
A valid BST is defined as follows:
* The left subtree of a node contains only nodes with keys less than the node's key.
* The right subtreeβ¦
Please open Telegram to view this post
VIEW IN TELEGRAM
14-kun
Masala: 653. Two Sum IV - Input is a BST
Qiyinlik darajasi: Oson
Bizni kuzatishda davom eting
Telegram | Youtube
Masala: 653. Two Sum IV - Input is a BST
Qiyinlik darajasi: Oson
Bizni kuzatishda davom eting
Telegram | Youtube
Leetcode
Two Sum IV - Input is a BST - 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.
Please open Telegram to view this post
VIEW IN TELEGRAM
14-kun
Masala: 235. Lowest Common Ancestor of a Binary Search Tree
Qiyinlik darajasi: O'rta
Bizni kuzatishda davom eting
Telegram | Youtube
Masala: 235. Lowest Common Ancestor of a Binary Search Tree
Qiyinlik darajasi: O'rta
Bizni kuzatishda davom eting
Telegram | Youtube
Leetcode
Lowest Common Ancestor of a Binary Search 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.