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…

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.…

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…

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…

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…

😎😎😎
Leetcode #400
Here is my account: https://lnkd.in/d4ykiC5J
I am very happy to say that I solved 400 problems on Leetcode.com
Let you improve your…

Can you solve this real interview question? Concatenated Words - Given an array of strings words (without duplicates), return all the concatenated words in the given list of words.

A concatenated word is defined as a string that is comprised entirely of…

Can you solve this real interview question? Data Stream as Disjoint Intervals - Given a data stream input of non-negative integers a1, a2, ..., an, summarize the numbers seen so far as a list of disjoint intervals.

Implement the SummaryRanges class:

*…

Can you solve this real interview question? LFU Cache - Design and implement a data structure for a Least Frequently Used (LFU) [https://en.wikipedia.org/wiki/Least_frequently_used] cache.

Implement the LFUCache class:

* LFUCache(int capacity) Initializes…

Can you solve this real interview question? N-th Tribonacci Number - The Tribonacci sequence Tn is defined as follows: 

T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n >= 0.

Given n, return the value of Tn.

 

Example 1:


Input: n = 4
Output:…