leetcode 1372

Author: Pankajcoder1

Codeforces/After Placement/140C-New Year Snowmen.cpp

@@ -0,0 +1,48 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main()
+{
+    int n;
+    map<int, int> mp;
+    cin>>n;
+    
+    vector<int> arr(n);
+    vector<vector<int>> ans;
+    for (int i = 0; i < n; ++i)
+    {
+        cin>>arr[i];
+        mp[arr[i]]++;
+    }
+    priority_queue<pair<int, int>> q;
+    for (auto it : mp)
+    {
+        q.push({it.second, it.first});
+    }
+    
+    while (q.size() > 2)
+    {
+        vector<pair<int, int>> v(3);
+        for (int i = 0; i < 3; ++i)
+        {
+            v[i] = q.top();
+            q.pop();
+        }
+        vector<int> pos;
+        for (int k = 0; k < 3; ++k)
+        {
+            pos.push_back(v[k].second);
+            v[k].first--;
+            if (v[k].first){
+                q.push(v[k]);
+            }
+        }
+        sort(pos.rbegin(),pos.rend());
+        ans.push_back(pos);
+    }
+    cout << ans.size() << endl;
+    for (int i = 0; i < ans.size(); ++i)
+    {
+        cout << ans[i][0] << " " << ans[i][1] << " " << ans[i][2] << endl;
+    }
+    return 0;
+}

LeetCode/1372.Longest ZigZag Path in a Binary Tree.cpp

@@ -0,0 +1,53 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+typedef long long ll ;
+const ll INF=1e18;
+const ll mod1=1e9+7;
+const ll mod2=998244353;
+//Add main code here
+
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+ * };
+ */
+class Solution
+{
+public:
+    int longestZigZag(TreeNode *root)
+    {
+        // first -> right, second -> left
+        queue<pair<TreeNode *, pair<int, int>>> q;
+        q.push(make_pair(root, make_pair(0, 0))); // push root node with left and right directions as 0
+
+        int maxLen = 0;
+        while (!q.empty())
+        {
+            TreeNode *node = q.front().first;
+            int lenRight = q.front().second.first;
+            int lenLeft = q.front().second.second;
+            q.pop();
+
+            maxLen = max(maxLen, max(lenRight, lenLeft));
+
+            if (node->left)
+            {
+                q.push(make_pair(node->left, make_pair(0, lenRight + 1))); // push left child with left direction as 0 and right direction incremented by 1
+            }
+            if (node->right)
+            {
+                q.push(make_pair(node->right, make_pair(lenLeft + 1, 0))); // push right child with left direction incremented by 1 and right direction as 0
+            }
+        }
+
+        return maxLen;
+    }
+};

LeetCode/1431.Kids With the Greatest Number of Candies.cpp

@@ -0,0 +1,31 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+typedef long long ll ;
+const ll INF=1e18;
+const ll mod1=1e9+7;
+const ll mod2=998244353;
+//Add main code here
+
+class Solution
+{
+public:
+    vector<bool> kidsWithCandies(vector<int> &candies, int extraCandies)
+    {
+        vector<bool> ans;
+        int maxo=0;
+        for(auto x:candies){
+            maxo=max(maxo,x);
+        }
+        for(auto x:candies){
+            if(x+extraCandies>=maxo){
+                ans.push_back(true);
+            }
+            else{
+                ans.push_back(false);
+            }
+        }
+        return ans;
+    }
+};