leetcode-potd

You are given an undirected weighted connected graph containing n nodes labeled from 0 to n – 1, and an integer array edges where edges[i] = [ai, bi, wi] indicates that there […]

On a 2D plane, we place n stones at some integer coordinate points. Each coordinate point may have at most one stone.

You are given two m x n binary matrices grid1 and grid2 containing only 0‘s (representing water) and 1‘s (representing land). An island is a group of 1‘s connected 4-directionally (horizontal or vertical).

You are given an undirected weighted graph of n nodes (0-indexed), represented by an edge list where edges[i] = [a, b] is an undirected

Given the root of an n-ary tree, return the postorder traversal of its nodes’ values. Nary-Tree input serialization is represented in their level

Given the root of a binary tree, return the postorder traversal of its nodes’ values. Example 1: Input: root = [1,null,2,3] Output: [3,2,1] Example

Given a string n representing an integer, return the closest integer (not including itself), which is a palindrome. If there is a tie,

Given a string expression representing an expression of fraction addition and subtraction, return the calculation result in string format. The final result

Given a Binary Tree, return Left view of it. Left view of a Binary Tree is set of nodes visible

The complement of an integer is the integer you get when you flip all the 0‘s to 1‘s and all the 1‘s to 0‘s in its

There is a strange printer with the following two special properties: The printer can only print a sequence of the same

Alice and Bob continue their games with piles of stones. There are a number of piles arranged in a row, and each pile