Search for a command to run...
Series
This series of post will have the solutions discussed for LeetCode 2020 December.
Problem Statement : We have to find the maximum depth of the Binary Tree. Maximum depth can be defined at the maximum number of nodes at the longest path to the deepest leaf node. Consider the Input as : [3,9,20,null,null,15,7] In the above input,...
Question: We are given a list of nodes, we have to return a random node. We should make sure each node have same probability. Meaning any number in that list can be returned at any time; we should not constantly return same number. The Question in Le...
Question: We have to make the tree in-order traversal such that it only have right side node. All the left nodes will be null (no left nodes). The Question in Leetcode Pseudo Code First step is we have to check whether the node came is null or no...
Problem : We have to find the Kth factor for the Number n. The Question in Leetcode Approach 1 : Iterating each Number This is very simple approach where we have to find the nth factor by iterating each and every number from 1 till ((n/2) +1). Pseud...
Problem: We have to check whether the given number of flowers can be placed in the flowser bed. The flowers can be placed when the value in the array is 0; and also it cannot be placed next to another flower. The question is Leetcode Inputs n = Num...
Problem Statement: We have to assign next value of each node. The next value should be the node which is in the right side of the current node at the same level. The question is Leetcode Input will be Single Root Node. Pre-checks whether root is nu...