Leetcode: Solving Leetcode Problems in Hindi podcast

Breadth first search and depth first search

5/11/2020

Leetcode: Solving Leetcode Problems in Hindi

0:00

3:19

Traverse a tree or a graph using DFS and BFS

Otros episodios de "Leetcode: Solving Leetcode Problems in Hindi"

Rotting oranges
10/11/2020
6:29
Given a gif, each cell can have one of the three values. 0 for empty, 1 for fresh Orange and 2 for rotten. Return minimum number of minutes that must elapse until no cell has a fresh Orange
Number of islands
5/11/2020
4:14
Given a grid, find number of islands. We use depth first search.
No te pierdas ningún episodio de “Leetcode: Solving Leetcode Problems in Hindi”. Síguelo en la aplicación gratuita de GetPodcast.
Breadth first search and depth first search
5/11/2020
3:19
Traverse a tree or a graph using DFS and BFS
Merge K Sorted Lists
5/11/2020
7:58
Given a an array of Sorted K linked lists, merge all K lists in one Sorted linked-list and return it.
Two sum, Two Sum - II, Three sum
5/11/2020
5:35
Find two numbers that add up to a Target. Find two numbers in a sorted array that add up to a number. Find three numbers in an array that add up to a Target.
Simplify Path
15/10/2020
5:32
Given a Unix style absolute path, simplify it and return the shortest canonical path
Design In-Memory file system
14/10/2020
9:54
Design In-Memory file system to simulate following functions. LS, mkdir, addcontentstofile, rewdcontentsfromfile
Minimum window Substring AND longest Substring with at most K distinct characters
12/10/2020
5:36
Give a string S and a String T, find the minimum window in S which will contain all characters in T.
Employee Free Time or Free intervals.
11/10/2020
5:09
Given a list of scheduled for employees in a company, return free time where no employee is working.
Find the celebrity
7/10/2020
3:22
Find a celebrity in a room where everyone knows the celebrity and celebrity doesn’t know anyone.

Más episodios

Descubre los mejores podcast en la aplicación gratuita de GetPodcast.

Suscríbete a tus podcast favoritos, escucha episodios cuando estés sin conexión y déjate sorprender por las recomendaciones personalizadas.

Una empresa de

Breadth first search and depth first search

Leetcode: Solving Leetcode Problems in Hindi

Otros episodios de "Leetcode: Solving Leetcode Problems in Hindi"

Rotting oranges

Number of islands

Breadth first search and depth first search

Merge K Sorted Lists

Two sum, Two Sum - II, Three sum

Simplify Path

Design In-Memory file system

Minimum window Substring AND longest Substring with at most K distinct characters

Employee Free Time or Free intervals.

Find the celebrity