Kun masalasi: 974. Subarray Sums Divisible by K
Qiyinlik darajasi: O'rta
Sizda bu masalani yechish uchun qanday fikr bor? Agar biror idea bo'lsa kommentda qoldiring. Masala yechim topishi uchun sizning ideangiz yordam berishi mumkin...
😎😎😎
Bizni kuzatishda davom eting
Telegram | Youtube
Please open Telegram to view this post
VIEW IN TELEGRAM
LeetCode
Subarray Sums Divisible by K - LeetCode
Can you solve this real interview question? Subarray Sums Divisible by K - Given an integer array nums and an integer k, return the number of non-empty subarrays that have a sum divisible by k.
A subarray is a contiguous part of an array.
Example 1:…
A subarray is a contiguous part of an array.
Example 1:…
O'zim Android developer bo'lganim uchun, android haqida postlar qo'yishni boshlamoqchiman. Nima deb o'ylaysiz shu yerda LeetCode+Android+Algo qilamizmi yoki Androidni alohida kanal qilgan ma'qulmi?
Anonymous Poll
51%
Leetcode+Android
47%
Android alohida
1%
Boshqa fikr bor commentda qoldiraman
👍1
Forwarded from Daily Shakhriyor
Assalomu Alaykum kanal obunachilari, siz bilan bugun yaxshi imkoniyatni bo'lishgim keldi, yandex praktikumning Java Dasturchisi kursi boshlanmoqda ekan, agar noldan boshlab o'rganmoqchi bo'lganlar, yoki bilimlarini tizimli mustahkamlamoqchi bo'lganlar bo'lsa marhamat
bu yerda
bu yerda
Яндекс Практикум
Онлайн-курс «Java-разработчик» с нуля: обучение языку программирования Java для начинающих
Обучение на онлайн-курсе «Java-разработчик» с нуля от сервиса Яндекс Практикум. За 10 месяцев обучения программированию на языке Java для начинающих. Обучаем специалистов на базовом курсе по программированию на языке Java (Ява) с нуля.
👍3
Kun masalasi: 491. Non-decreasing Subsequences
Qiyinlik darajasi: O'rta
Sizda bu masalani yechish uchun qanday fikr bor? Agar biror idea bo'lsa kommentda qoldiring. Masala yechim topishi uchun sizning ideangiz yordam berishi mumkin...
😎😎😎
Bizni kuzatishda davom eting
Telegram | Youtube
Please open Telegram to view this post
VIEW IN TELEGRAM
LeetCode
Non-decreasing Subsequences - LeetCode
Can you solve this real interview question? Non-decreasing Subsequences - Given an integer array nums, return all the different possible non-decreasing subsequences of the given array with at least two elements. You may return the answer in any order.
…
…
👍2
Kun masalasi: 93. Restore IP Addresses
Qiyinlik darajasi: O'rta
Sizda bu masalani yechish uchun qanday fikr bor? Agar biror idea bo'lsa kommentda qoldiring. Masala yechim topishi uchun sizning ideangiz yordam berishi mumkin...
😎😎😎
Bizni kuzatishda davom eting
Telegram | Youtube
Please open Telegram to view this post
VIEW IN TELEGRAM
LeetCode
Restore IP Addresses - LeetCode
Can you solve this real interview question? Restore IP Addresses - A valid IP address consists of exactly four integers separated by single dots. Each integer is between 0 and 255 (inclusive) and cannot have leading zeros.
* For example, "0.1.2.201" and…
* For example, "0.1.2.201" and…
👍1
Kun masalasi: 131. Palindrome Partitioning
Qiyinlik darajasi: O'rta
Sizda bu masalani yechish uchun qanday fikr bor? Agar biror idea bo'lsa kommentda qoldiring. Masala yechim topishi uchun sizning ideangiz yordam berishi mumkin...
😎😎😎
Bizni kuzatishda davom eting
Telegram | Youtube
Please open Telegram to view this post
VIEW IN TELEGRAM
LeetCode
Palindrome Partitioning - LeetCode
Can you solve this real interview question? Palindrome Partitioning - Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s.
Example 1:
Input: s = "aab"
Output: [["a"…
Example 1:
Input: s = "aab"
Output: [["a"…
👍1
Please open Telegram to view this post
VIEW IN TELEGRAM
YouTube
Dijkstra | Graphs
Bugun Graflar bo'limining Dijkstra mavzusini o'rganamiz
Shiorimiz: Ertaga, Dushanbadan, Yanagi yildan, 18 kirsangiz emas, Bugundan boshlang.
O'zbekcha kontentlar ko'payishiga va tarqalishiga hissa qo'shing.
Asosiy qismlar:
00:00 - Dijkstra algoritmi haqida…
Shiorimiz: Ertaga, Dushanbadan, Yanagi yildan, 18 kirsangiz emas, Bugundan boshlang.
O'zbekcha kontentlar ko'payishiga va tarqalishiga hissa qo'shing.
Asosiy qismlar:
00:00 - Dijkstra algoritmi haqida…
👍10🔥1
Kun masalasi: 997. Find the Town Judge
Qiyinlik darajasi: O'rta
Sizda bu masalani yechish uchun qanday fikr bor? Agar biror idea bo'lsa kommentda qoldiring. Masala yechim topishi uchun sizning ideangiz yordam berishi mumkin...
😎😎😎
Bizni kuzatishda davom eting
Telegram | Youtube
Please open Telegram to view this post
VIEW IN TELEGRAM
LeetCode
Find the Town Judge - LeetCode
Can you solve this real interview question? Find the Town Judge - In a town, there are n people labeled from 1 to n. There is a rumor that one of these people is secretly the town judge.
If the town judge exists, then:
1. The town judge trusts nobody.…
If the town judge exists, then:
1. The town judge trusts nobody.…
👍1
Kun masalasi: 909. Snakes and Ladders
Qiyinlik darajasi: O'rta
Sizda bu masalani yechish uchun qanday fikr bor? Agar biror idea bo'lsa kommentda qoldiring. Masala yechim topishi uchun sizning ideangiz yordam berishi mumkin...
😎😎😎
Bizni kuzatishda davom eting
Telegram | Youtube
Please open Telegram to view this post
VIEW IN TELEGRAM
LeetCode
Snakes and Ladders - LeetCode
Can you solve this real interview question? Snakes and Ladders - You are given an n x n integer matrix board where the cells are labeled from 1 to n2 in a Boustrophedon style [https://en.wikipedia.org/wiki/Boustrophedon] starting from the bottom left of the…
👍3
Please open Telegram to view this post
VIEW IN TELEGRAM
Please open Telegram to view this post
VIEW IN TELEGRAM
Kun masalasi: 2359. Find Closest Node to Given Two Nodes
Qiyinlik darajasi: O'rta
Sizda bu masalani yechish uchun qanday fikr bor? Agar biror idea bo'lsa kommentda qoldiring. Masala yechim topishi uchun sizning ideangiz yordam berishi mumkin...
😎😎😎
Bizni kuzatishda davom eting
Telegram | Youtube
Please open Telegram to view this post
VIEW IN TELEGRAM
LeetCode
Find Closest Node to Given Two Nodes - LeetCode
Can you solve this real interview question? Find Closest Node to Given Two Nodes - You are given a directed graph of n nodes numbered from 0 to n - 1, where each node has at most one outgoing edge.
The graph is represented with a given 0-indexed array edges…
The graph is represented with a given 0-indexed array edges…
Kun masalasi: 787. Cheapest Flights Within K Stops
Qiyinlik darajasi: O'rta
Sizda bu masalani yechish uchun qanday fikr bor? Agar biror idea bo'lsa kommentda qoldiring. Masala yechim topishi uchun sizning ideangiz yordam berishi mumkin...
😎😎😎
Bizni kuzatishda davom eting
Telegram | Youtube
Please open Telegram to view this post
VIEW IN TELEGRAM
LeetCode
Cheapest Flights Within K Stops - LeetCode
Can you solve this real interview question? Cheapest Flights Within K Stops - There are n cities connected by some number of flights. You are given an array flights where flights[i] = [fromi, toi, pricei] indicates that there is a flight from city fromi to…