Initial commit

Author: phoenixx1

.vscode/launch.json

@@ -5,7 +5,7 @@
     "version": "0.2.0",
     "configurations": [
         {
-            "name": "g++ - Build and debug active file",
+            "name": "g++-9 - Build and debug active file",
             "type": "cppdbg",
             "request": "launch",
             "program": "${fileDirname}/${fileBasenameNoExtension}",
@@ -22,7 +22,7 @@
                     "ignoreFailures": true
                 }
             ],
-            "preLaunchTask": "g++ build active file",
+            "preLaunchTask": "C/C++: g++-9 build active file",
             "miDebuggerPath": "/usr/bin/gdb"
         }
     ]

.vscode/settings.json

@@ -1,5 +1,7 @@
 {
     "files.associations": {
-        "iostream": "cpp"
+        "cmath": "cpp",
+        "complex": "cpp",
+        "array": "cpp"
     }
 }

.vscode/tasks.json

@@ -0,0 +1,5 @@
+# This is my solution for AlgoDaily problem Is An Anagram
+# Located at https://algodaily.com/challenges/is-an-anagram
+
+def is_anagram(s, t):
+    return sorted(s.lower()) == sorted(t.lower())

AlgoDaily/is-an-anagram.py

@@ -0,0 +1,27 @@
+// author @Nishant
+
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int t;
+    cin >> t;
+    while(t--){
+        int n;
+        cin >> n;
+        vector<int> cars(n);
+        for(int i = 0; i < n; i++){
+            cin >> cars[i];
+        }
+        int count = 1;
+        int temp = cars[0];
+        for(int i = 1; i < n; i++){
+            if(cars[i] < temp){
+                count++;
+                temp = cars[i];
+            }
+        }
+        cout << count << endl;
+    }
+    return 0;
+}

CodeChef/DSALearningSeries/ComplexityAnalysis&BasicsWarmUp/CARVANS.cpp

@@ -0,0 +1,21 @@
+//author @Nishant
+
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int t;
+    cin >> t;
+    while(t--){
+        int n;
+        cin >> n;
+        int temp, newN = 0;
+        while(n){
+            temp = n % 10;
+            newN = newN * 10 + temp;
+            n /= 10;
+        }
+        cout << newN << endl;
+    }
+    return 0;   
+}

CodeChef/DSALearningSeries/ComplexityAnalysis&BasicsWarmUp/FLOW007.cpp

@@ -0,0 +1,42 @@
+//auhtor @Nishant
+
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int t;
+    cin >> t;
+    while(t--){
+        string s;
+        cin >> s;
+        int n = s.size();
+        string frnt = "", lst = "";
+        for(int i = 0; i < n / 2; i++){
+            frnt += s[i];
+        }
+        if(n % 2){
+            frnt += s[n/2];
+        }
+        for(int i = n / 2; i < n; i++){
+            lst += s[i];
+        }
+        map<char, int> mp;
+        bool flag = true;
+        for(char x : frnt){
+            mp[x]++;
+        }
+        for(char x : lst){
+            mp[x]--;
+            if(mp[x] < 0){
+                flag = false;
+                break;
+            }
+        }
+        if(flag){
+            cout << "YES" << endl;
+        }else{
+            cout << "NO" << endl;
+        }
+    }
+    return 0;
+}

CodeChef/DSALearningSeries/ComplexityAnalysis&BasicsWarmUp/LAPIN.cpp

@@ -0,0 +1,16 @@
+//author @Nishant
+
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int n;
+    while(cin >> n){
+        if(n == 42){
+            return 0;
+        }else{
+            cout << n << endl;
+        }
+    }
+    return 0;
+}

CodeChef/DSALearningSeries/ComplexityAnalysis&BasicsWarmUp/TEST.cpp

@@ -0,0 +1,24 @@
+// author @Nishant
+
+#include<bits/stdc++.h>
+using namespace std;
+#define ll long long int
+
+int main(){
+    ll n;
+    cin >> n;
+    vector<ll> budget(n);
+    for(ll i = 0; i < n; i++){
+        cin >> budget[i];
+    }
+    sort(budget.begin(),  budget.end());
+    ll maxProfit = 0;
+    for(ll i = 0; i < n; i++){
+        ll temp = budget[i];
+        if(maxProfit < temp * (n - i)){
+            maxProfit = temp * (n - i);
+        }
+    }
+    cout << maxProfit;
+    return 0;
+}