Commit daily problem's solution

Author: SartHak-0-Sach

183-1st_July-Three_consecutive_odds/approach-explanation.txt

@@ -0,0 +1,2 @@
+Intuition
+The intuition for the threeConsecutiveOdds function involves iterating through the array and checking groups of three consecutive elements at each step. The function uses a for loop to traverse the array, and at each iteration, it applies a bitwise AND operation (& 1) to determine if the current element and the next two elements are all odd. If a triplet of consecutive odd numbers is found, it returns true; otherwise, it continues the search until the end of the array and returns false if no such triplet is found.

183-1st_July-Three_consecutive_odds/code.cpp

@@ -0,0 +1,77 @@
+#include <iostream>
+#include <queue>
+#include <climits>
+using namespace std;
+
+class TreeNode
+{
+public:
+    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) {}
+};
+
+#pragma GCC optimize("O3", "unroll-loops")
+class Solution
+{
+public:
+    using info = pair<TreeNode *, int>;
+    void print(auto &c)
+    {
+        for (auto node : c)
+            cout << node->val << ", ";
+        cout << endl;
+    }
+    bool isLess(auto &q, int qz)
+    {
+        for (int i = 1; i < qz; i++)
+            if (q[i - 1]->val >= q[i]->val)
+                return 0;
+        return 1;
+    }
+    bool isGreater(auto &q, int qz)
+    {
+        for (int i = 1; i < qz; i++)
+            if (q[i - 1]->val <= q[i]->val)
+                return 0;
+        return 1;
+    }
+    bool isEvenOddTree(TreeNode *root)
+    {
+        int level = -1;
+        deque<TreeNode *> q;
+        q.push_back(root);
+        while (!q.empty())
+        {
+            level++;
+            int qz = q.size();
+            bool isOdd = level & 1;
+            //    print(q);
+            if ((isOdd && !isGreater(q, qz)) || (!isOdd && !isLess(q, qz)))
+                return 0;
+            for (int i = 0; i < qz; i++)
+            {
+                auto node = q.front();
+                q.pop_front();
+                if ((node->val & 1) == isOdd)
+                    return 0;
+                if (node->left)
+                    q.push_back(node->left);
+                if (node->right)
+                    q.push_back(node->right);
+            }
+        }
+        return 1;
+    }
+};
+
+auto init = []()
+{
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    cout.tie(0);
+    return 'c';
+}();