Add files via upload

Author: adityajamwal02

BuildAnArrayWithStackOperations.cpp

@@ -0,0 +1,56 @@
+/*
+You are given an integer array target and an integer n.
+You have an empty stack with the two following operations:
+"Push": pushes an integer to the top of the stack.
+"Pop": removes the integer on the top of the stack.
+You also have a stream of the integers in the range [1, n].
+Use the two stack operations to make the numbers in the stack (from the bottom to the top) equal to target. You should follow the following rules:
+If the stream of the integers is not empty, pick the next integer from the stream and push it to the top of the stack.
+If the stack is not empty, pop the integer at the top of the stack.
+If, at any moment, the elements in the stack (from the bottom to the top) are equal to target, do not read new integers from the stream and do not do more operations on the stack.
+Return the stack operations needed to build target following the mentioned rules. If there are multiple valid answers, return any of them.
+
+Example 1:
+Input: target = [1,3], n = 3
+Output: ["Push","Push","Pop","Push"]
+Explanation: Initially the stack s is empty. The last element is the top of the stack.
+Read 1 from the stream and push it to the stack. s = [1].
+Read 2 from the stream and push it to the stack. s = [1,2].
+Pop the integer on the top of the stack. s = [1].
+Read 3 from the stream and push it to the stack. s = [1,3].
+
+Example 2:
+Input: target = [1,2,3], n = 3
+Output: ["Push","Push","Push"]
+Explanation: Initially the stack s is empty. The last element is the top of the stack.
+Read 1 from the stream and push it to the stack. s = [1].
+Read 2 from the stream and push it to the stack. s = [1,2].
+Read 3 from the stream and push it to the stack. s = [1,2,3].
+
+Example 3:
+Input: target = [1,2], n = 4
+Output: ["Push","Push"]
+Explanation: Initially the stack s is empty. The last element is the top of the stack.
+Read 1 from the stream and push it to the stack. s = [1].
+Read 2 from the stream and push it to the stack. s = [1,2].
+Since the stack (from the bottom to the top) is equal to target, we stop the stack operations.
+The answers that read integer 3 from the stream are not accepted.
+*/
+
+class Solution {
+public:
+    vector<string> buildArray(vector<int>& target, int n) {
+        int i=1, j=0, sz=target.size();
+        vector<string> result;
+        while(i<n+1 and j<sz){
+            result.push_back("Push");
+            if(target[j]==i){
+                j++;
+            }else{
+                result.push_back("Pop");
+            }
+        i++;
+        }
+    return result;
+    }
+};

CountNodesEqualToAverageOfSubtree.cpp

@@ -0,0 +1,40 @@
+/*
+Given the root of a binary tree, return the number of nodes where the value of the node is equal to the average of the values in its subtree.
+Note:
+The average of n elements is the sum of the n elements divided by n and rounded down to the nearest integer.
+A subtree of root is a tree consisting of root and all of its descendants.
+
+Example 1:
+Input: root = [4,8,5,0,1,null,6]
+Output: 5
+Explanation:
+For the node with value 4: The average of its subtree is (4 + 8 + 5 + 0 + 1 + 6) / 6 = 24 / 6 = 4.
+For the node with value 5: The average of its subtree is (5 + 6) / 2 = 11 / 2 = 5.
+For the node with value 0: The average of its subtree is 0 / 1 = 0.
+For the node with value 1: The average of its subtree is 1 / 1 = 1.
+For the node with value 6: The average of its subtree is 6 / 1 = 6.
+
+Example 2:
+Input: root = [1]
+Output: 1
+Explanation: For the node with value 1: The average of its subtree is 1 / 1 = 1.
+*/
+
+lass Solution {
+public:
+    int result=0;
+    pair<int,int> helper(TreeNode* root){
+        if(!root) return {0,0};
+        int counter=1, sum=root->val;
+        auto p1=helper(root->left);
+        auto p2=helper(root->right);
+        counter+=(p1.first+p2.first);
+        sum+=(p1.second+p2.second);
+        if(sum/counter == root->val) result++;
+    return {counter,sum};
+    }
+    int averageOfSubtree(TreeNode* root){
+        helper(root);
+    return result;
+    }
+};