Biror maqsadga erishish uchun eng asosiy kerak bo’ladigan narsalar:
1. Intention(niyat)
2. Discipline(intizom)
3. Consistency(doimiylik, uzluksizlik)
Majburiy emas, ammo juda katta yordam beradigani esa bu:
Keling birgalikda 14 kunlik Data-Structure study-plan ni o’zimiz uchun challenge qilamiz va har kuni yechimlar bilan bo’lishamiz. Balkim video ko’rinishidagi yechimlar ham ta’minlanar. Birgalikda har kuni taxminan 2 3 ta masala yechish orqali Data Structure ga oid bilimlarimizni oshirib va yangilab olamiz. Ohirida esa badge ga ham ega bo’lamiz.
Telegram: JavaHereBlogs
Youtube: JavaIsHere
Please open Telegram to view this post
VIEW IN TELEGRAM
LeetCode
Study Plan - 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.
Keling ertaga, dushanbadan, 2023-yildan emas
Bugundan boshlaymiz yani 3-dekabrdan.
Shior: Let you start today!
Bugundan boshlaymiz yani 3-dekabrdan.
Shior: Let you start today!
👍14
Please open Telegram to view this post
VIEW IN TELEGRAM
LeetCode
Sort Characters By Frequency - LeetCode
Can you solve this real interview question? Sort Characters By Frequency - Given a string s, sort it in decreasing order based on the frequency of the characters. The frequency of a character is the number of times it appears in the string.
Return the sorted…
Return the sorted…
⚡1
tg_image_3152687319.jpeg
270.2 KB
Please open Telegram to view this post
VIEW IN TELEGRAM
⚡1
Please open Telegram to view this post
VIEW IN TELEGRAM
LeetCode
Contains Duplicate - LeetCode
Can you solve this real interview question? Contains Duplicate - Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct.
Example 1:
Input: nums = [1,2,3,1]
Output: true…
Example 1:
Input: nums = [1,2,3,1]
Output: true…
⚡1
tg_image_1331039773.jpeg
105 KB
Please open Telegram to view this post
VIEW IN TELEGRAM
⚡1
Please open Telegram to view this post
VIEW IN TELEGRAM
LeetCode
Maximum Subarray - LeetCode
Can you solve this real interview question? Maximum Subarray - Given an integer array nums, find the subarray with the largest sum, and return its sum.
Example 1:
Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6
Explanation: The subarray [4,-1,2,1] has…
Example 1:
Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6
Explanation: The subarray [4,-1,2,1] has…
⚡1
tg_image_314182173.jpeg
116.6 KB
Please open Telegram to view this post
VIEW IN TELEGRAM
⚡5
Mana Graflar bo’limini ham boshlab oldik Alhamdulillah. Endi graflar haqida kamchiliklarni to’ldirib o’rniga oshig’i bilan bilimlar olishingiz mumkin, buni hali ancha davom ettiraman qo’limdan kegancha.
Telegram: JavaHereBlogs
Youtube: JavaIsHere
Please open Telegram to view this post
VIEW IN TELEGRAM
YouTube
Graphs theory | Graflar nazariyasi
Bu darsda dasturlashdagi graflar mavsuzini o'rganamiz.
O'zbekcha kontentlar ko'payishiga va tarqalishiga hissa qo'shing.
Asosiy qismlari:
00:00 - Kirish
00:44 - Asosiy qism
02:36 - Konigsberg ko'priklari masalasi
03:10 - Unordered Pair
04:14 - Ordered Pair…
O'zbekcha kontentlar ko'payishiga va tarqalishiga hissa qo'shing.
Asosiy qismlari:
00:00 - Kirish
00:44 - Asosiy qism
02:36 - Konigsberg ko'priklari masalasi
03:10 - Unordered Pair
04:14 - Ordered Pair…
🔥7⚡2
Please open Telegram to view this post
VIEW IN TELEGRAM
LeetCode
Minimum Average Difference - LeetCode
Can you solve this real interview question? Minimum Average Difference - You are given a 0-indexed integer array nums of length n.
The average difference of the index i is the absolute difference between the average of the first i + 1 elements of nums and…
The average difference of the index i is the absolute difference between the average of the first i + 1 elements of nums and…
⚡1👍1
tg_image_223185789.jpeg
200.6 KB
Please open Telegram to view this post
VIEW IN TELEGRAM
⚡1👍1
Please open Telegram to view this post
VIEW IN TELEGRAM
LeetCode
Two Sum - LeetCode
Two Sum - Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
You can return…
You may assume that each input would have exactly one solution, and you may not use the same element twice.
You can return…
⚡1👍1
tg_image_217301420.jpeg
121.2 KB
Please open Telegram to view this post
VIEW IN TELEGRAM
🔥2👍1
Please open Telegram to view this post
VIEW IN TELEGRAM
LeetCode
Merge Sorted Array - LeetCode
Can you solve this real interview question? Merge Sorted Array - You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively.
Merge nums1…
Merge nums1…
⚡1👍1
tg_image_1132433497.jpeg
161.3 KB
Please open Telegram to view this post
VIEW IN TELEGRAM
👍2
JavaHere's Blogs 🚀 pinned «🎞 🎞 🎞 Mana Graflar bo’limini ham boshlab oldik Alhamdulillah. Endi graflar haqida kamchiliklarni to’ldirib o’rniga oshig’i bilan bilimlar olishingiz mumkin, buni hali ancha davom ettiraman qo’limdan kegancha. Telegram: JavaHereBlogs Youtube: JavaIsHere»
Please open Telegram to view this post
VIEW IN TELEGRAM
LeetCode
Middle of the Linked List - LeetCode
Can you solve this real interview question? Middle of the Linked List - Given the head of a singly linked list, return the middle node of the linked list.
If there are two middle nodes, return the second middle node.
Example 1:
[https://assets.leet…
If there are two middle nodes, return the second middle node.
Example 1:
[https://assets.leet…
tg_image_694412014.jpeg
152 KB
Please open Telegram to view this post
VIEW IN TELEGRAM
⚡1