7-kun
Masala: 141. Linked List Cycle
Qiyinlik darajasi: Oson
Bizni kuzatishda davom eting
Telegram | Youtube
Masala: 141. Linked List Cycle
Qiyinlik darajasi: Oson
Bizni kuzatishda davom eting
Telegram | Youtube
Please open Telegram to view this post
VIEW IN TELEGRAM
7-kun
Masala: 21. Merge Two Sorted Lists
Qiyinlik darajasi: Oson
Bizni kuzatishda davom eting
Telegram | Youtube
Masala: 21. Merge Two Sorted Lists
Qiyinlik darajasi: Oson
Bizni kuzatishda davom eting
Telegram | Youtube
LeetCode
Merge Two Sorted Lists - LeetCode
Can you solve this real interview question? Merge Two Sorted Lists - You are given the heads of two sorted linked lists list1 and list2.
Merge the two lists into one sorted list. The list should be made by splicing together the nodes of the first two lists.…
Merge the two lists into one sorted list. The list should be made by splicing together the nodes of the first two lists.…
Please open Telegram to view this post
VIEW IN TELEGRAM
7-kun
Masala: 203. Remove Linked List Elements
Qiyinlik darajasi: Oson
Bizni kuzatishda davom eting
Telegram | Youtube
Masala: 203. Remove Linked List Elements
Qiyinlik darajasi: Oson
Bizni kuzatishda davom eting
Telegram | Youtube
LeetCode
Remove Linked List Elements - LeetCode
Can you solve this real interview question? Remove Linked List Elements - Given the head of a linked list and an integer val, remove all the nodes of the linked list that has Node.val == val, and return the new head.
Example 1:
[https://assets.leetc…
Example 1:
[https://assets.leetc…
Please open Telegram to view this post
VIEW IN TELEGRAM
Nega ba'zi ishlarga ulgurmayabman degan savol qiynayabdimi?
Sizlarga o'zim ishlatadigan bir zo'r intizom haqida aytmoqchiman. Kuningizda muhimlilik darajasi eng past narsalarni iloji boricha eng birinchi tugatishga harakat qiling. Chunki kech kirib qolsa, biror joyga mehmonga borib qolishingiz mumkin, yoki siznikiga mehmonlar kelib qolishi mumkin, yoki biror boshqa ishlaringiz chiqib qolishi mumkin, charchab qolishingiz mumkin va hokazo. Mana shu holatda muhim emas ishlarni qilish shartmi??? degan savol miyyaga bir zumda keladi va ertaga qilaman deyiladi. Ammo muhim ish bo'lsa, uhlamasdan bo'lsa ham u ish qilinadi. Shuning uchun o'zim ham shu intizomga amal qilaman. Hozir ham soat tungi 2:41 bo'libdi. Leetcode uchun yangi kun soat 1 da boshlanadi. Qancha erta tugatib qo'ysangiz keyin u haqida hecham qayg'urmaysiz. Yana biri esa o'zingizni shu ishni qilishga majbur emas mas'ul deb qarang. Chunki mas'uliyat majburiyatdan ancha samaraliroq. Hammaga hayrli kun tilab qolaman.
Bizni kuzatishda davom eting
Telegram | Youtube
Sizlarga o'zim ishlatadigan bir zo'r intizom haqida aytmoqchiman. Kuningizda muhimlilik darajasi eng past narsalarni iloji boricha eng birinchi tugatishga harakat qiling. Chunki kech kirib qolsa, biror joyga mehmonga borib qolishingiz mumkin, yoki siznikiga mehmonlar kelib qolishi mumkin, yoki biror boshqa ishlaringiz chiqib qolishi mumkin, charchab qolishingiz mumkin va hokazo. Mana shu holatda muhim emas ishlarni qilish shartmi??? degan savol miyyaga bir zumda keladi va ertaga qilaman deyiladi. Ammo muhim ish bo'lsa, uhlamasdan bo'lsa ham u ish qilinadi. Shuning uchun o'zim ham shu intizomga amal qilaman. Hozir ham soat tungi 2:41 bo'libdi. Leetcode uchun yangi kun soat 1 da boshlanadi. Qancha erta tugatib qo'ysangiz keyin u haqida hecham qayg'urmaysiz. Yana biri esa o'zingizni shu ishni qilishga majbur emas mas'ul deb qarang. Chunki mas'uliyat majburiyatdan ancha samaraliroq. Hammaga hayrli kun tilab qolaman.
Bizni kuzatishda davom eting
Telegram | Youtube
⚡9👍9🔥1🏆1🍾1
Kun masalasi: 1339. Maximum Product of Splitted Binary Tree
Qiyinlik darajasi: O'rta
Bizni kuzatishda davom eting
Telegram | Youtube
Please open Telegram to view this post
VIEW IN TELEGRAM
LeetCode
Maximum Product of Splitted Binary Tree - LeetCode
Can you solve this real interview question? Maximum Product of Splitted Binary Tree - Given the root of a binary tree, split the binary tree into two subtrees by removing one edge such that the product of the sums of the subtrees is maximized.
Return the…
Return the…
🌚1
Please open Telegram to view this post
VIEW IN TELEGRAM
8-kun
Masala: 206. Reverse Linked List
Qiyinlik darajasi: Oson
Bizni kuzatishda davom eting
Telegram | Youtube
Masala: 206. Reverse Linked List
Qiyinlik darajasi: Oson
Bizni kuzatishda davom eting
Telegram | Youtube
LeetCode
Reverse Linked List - LeetCode
Can you solve this real interview question? Reverse Linked List - Given the head of a singly linked list, reverse the list, and return the reversed list.
Example 1:
[https://assets.leetcode.com/uploads/2021/02/19/rev1ex1.jpg]
Input: head = [1,2,3,4…
Example 1:
[https://assets.leetcode.com/uploads/2021/02/19/rev1ex1.jpg]
Input: head = [1,2,3,4…
Please open Telegram to view this post
VIEW IN TELEGRAM
8-kun
Masala: 83. Remove Duplicates from Sorted List
Qiyinlik darajasi: Oson
Bizni kuzatishda davom eting
Telegram | Youtube
Masala: 83. Remove Duplicates from Sorted List
Qiyinlik darajasi: Oson
Bizni kuzatishda davom eting
Telegram | Youtube
LeetCode
Remove Duplicates from Sorted List - LeetCode
Can you solve this real interview question? Remove Duplicates from Sorted List - Given the head of a sorted linked list, delete all duplicates such that each element appears only once. Return the linked list sorted as well.
Example 1:
[https://asset…
Example 1:
[https://asset…
Please open Telegram to view this post
VIEW IN TELEGRAM
Mana 8-kun uchun challenge ham tugadi. Sizda-chi?
Anonymous Poll
17%
albatta
14%
endi kechgacha tugatib qo'yarman
14%
qilmasam kerak, kuchim yetmayabdi
34%
menga qiziqmas
21%
Kechroqqa birga jonli ravishda yechimi ko'rsatilsa yaxshi bo'lardi(sharti - record mumkinmas)
Kun masalasi: 124. Binary Tree Maximum Path Sum
Qiyinlik darajasi: Qiyin
Bizni kuzatishda davom eting
Telegram | Youtube
Please open Telegram to view this post
VIEW IN TELEGRAM
LeetCode
Binary Tree Maximum Path Sum - LeetCode
Can you solve this real interview question? Binary Tree Maximum Path Sum - A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence at most once. Note…