#leetcode
Read more stories on Hashnode
Articles with this tag
You are given an array of integers stones where stones[i] is the weight of the i<sup>th</sup> stone. We are playing a game with the stones. On each...
Given a binary tree root, a node X in the tree is named good if in the path from root to X there are no nodes with a value greater than X. Return the...
Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to...
Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level). Example 1: Input:...
Given a binary search tree (BST), find the lowest common ancestor (LCA) node of two given nodes in the BST. According to the definition of LCA on...
Given the roots of two binary trees root and subRoot, return true if there is a subtree of root with the same structure and node values of subRoot and...
