Question Link : https://leetcode.com/problems/path-sum/

Difficulty: Easy

Question

Given the root of a binary tree and an integer targetSum, return true if the tree has a root-to-leaf path such that adding up all the values along the path equals targetSum. A leaf is a node with no children …

Continue reading

Question Link : https://leetcode.com/problems/min-max-game/

Difficulty: Easy

Question

You are given a 0-indexed integer array nums whose length is a power of 2. Apply the following algorithm on nums:

Let n be the length of nums. If n == 1, end the process. Otherwise, create a new 0-indexed integer …

Continue reading

Question Link : https://leetcode.com/problems/copy-list-with-random-pointer/

Difficulty: Medium

Question

A linked list of length n is given such that each node contains an additional random pointer, which could point to any node in the list, or null. Construct a deep copy of the list. The deep copy should consist …

Continue reading

Question Link : https://leetcode.com/problems/fibonacci-number/

Difficulty: Easy

Question

The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That is,

F(0) = 0, F(1) = 1 F …

Continue reading

Question Link : https://leetcode.com/problems/construct-string-from-binary-tree/

Difficulty: Easy

Question

Given the root of a binary tree, construct a string consisting of parenthesis and integers from a binary tree with the preorder traversal way, and return it. Omit all the empty parenthesis pairs that do not affect the one-to-one mapping …

Continue reading