Solve daily problem and add explanation

Author: SartHak-0-Sach

.vscode/c_cpp_properties.json

@@ -0,0 +1,18 @@
+{
+  "configurations": [
+    {
+      "name": "windows-gcc-x86",
+      "includePath": [
+        "${workspaceFolder}/**"
+      ],
+      "compilerPath": "C:/MinGW64/bin/gcc.exe",
+      "cStandard": "${default}",
+      "cppStandard": "${default}",
+      "intelliSenseMode": "windows-gcc-x86",
+      "compilerArgs": [
+        ""
+      ]
+    }
+  ],
+  "version": 4
+}

.vscode/launch.json

@@ -0,0 +1,24 @@
+{
+  "version": "0.2.0",
+  "configurations": [
+    {
+      "name": "C/C++ Runner: Debug Session",
+      "type": "cppdbg",
+      "request": "launch",
+      "args": [],
+      "stopAtEntry": false,
+      "externalConsole": true,
+      "cwd": "c:/Users/saksh/OneDrive/Desktop/github/Daily-leetcode-problem_with_detailed_solutions",
+      "program": "c:/Users/saksh/OneDrive/Desktop/github/Daily-leetcode-problem_with_detailed_solutions/build/Debug/outDebug",
+      "MIMode": "gdb",
+      "miDebuggerPath": "gdb",
+      "setupCommands": [
+        {
+          "description": "Enable pretty-printing for gdb",
+          "text": "-enable-pretty-printing",
+          "ignoreFailures": true
+        }
+      ]
+    }
+  ]
+}

.vscode/settings.json

@@ -0,0 +1,59 @@
+{
+  "C_Cpp_Runner.cCompilerPath": "gcc",
+  "C_Cpp_Runner.cppCompilerPath": "g++",
+  "C_Cpp_Runner.debuggerPath": "gdb",
+  "C_Cpp_Runner.cStandard": "",
+  "C_Cpp_Runner.cppStandard": "",
+  "C_Cpp_Runner.msvcBatchPath": "C:/Program Files/Microsoft Visual Studio/VR_NR/Community/VC/Auxiliary/Build/vcvarsall.bat",
+  "C_Cpp_Runner.useMsvc": false,
+  "C_Cpp_Runner.warnings": [
+    "-Wall",
+    "-Wextra",
+    "-Wpedantic",
+    "-Wshadow",
+    "-Wformat=2",
+    "-Wcast-align",
+    "-Wconversion",
+    "-Wsign-conversion",
+    "-Wnull-dereference"
+  ],
+  "C_Cpp_Runner.msvcWarnings": [
+    "/W4",
+    "/permissive-",
+    "/w14242",
+    "/w14287",
+    "/w14296",
+    "/w14311",
+    "/w14826",
+    "/w44062",
+    "/w44242",
+    "/w14905",
+    "/w14906",
+    "/w14263",
+    "/w44265",
+    "/w14928"
+  ],
+  "C_Cpp_Runner.enableWarnings": true,
+  "C_Cpp_Runner.warningsAsError": false,
+  "C_Cpp_Runner.compilerArgs": [],
+  "C_Cpp_Runner.linkerArgs": [],
+  "C_Cpp_Runner.includePaths": [],
+  "C_Cpp_Runner.includeSearch": [
+    "*",
+    "**/*"
+  ],
+  "C_Cpp_Runner.excludeSearch": [
+    "**/build",
+    "**/build/**",
+    "**/.*",
+    "**/.*/**",
+    "**/.vscode",
+    "**/.vscode/**"
+  ],
+  "C_Cpp_Runner.useAddressSanitizer": false,
+  "C_Cpp_Runner.useUndefinedSanitizer": false,
+  "C_Cpp_Runner.useLeakSanitizer": false,
+  "C_Cpp_Runner.showCompilationTime": false,
+  "C_Cpp_Runner.useLinkTimeOptimization": false,
+  "C_Cpp_Runner.msvcSecureNoWarnings": false
+}

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

@@ -1,2 +1,16 @@
-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.
+Approach
+Given an integer array arr, return true if there are three consecutive odd numbers in the array. Otherwise, return false.
+
+Use len to count the the length for consecutive odd numbers
+If x in nums is even reset len=0, otherwise len++
+if len==3 return true
+When the loop is through, there are no three consecutive odds, return false
+2nd C++ uses std::find_if with lambda which return the index if the first odd from index=i on is found in arr
+i=find_if(arr.begin()+i, arr.end(), 
+[](int x){return (x&1);})-arr.begin();
+Complexity
+Time complexity:
+O(n)
+
+Space complexity:
+O(1)

183-1st_July-Three_consecutive_odds/code.cpp

@@ -1,70 +1,20 @@
 #include <iostream>
-#include <queue>
-#include <climits>
+#include <vector>
 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)
+    static bool threeConsecutiveOdds(vector<int> &arr)
     {
-        int level = -1;
-        deque<TreeNode *> q;
-        q.push_back(root);
-        while (!q.empty())
+        int len = 0;
+        for (int x : arr)
         {
-            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);
-            }
+            len = (x & 1) ? len + 1 : 0;
+            if (len == 3)
+                return 1;
         }
-        return 1;
+        return 0;
     }
 };